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.r575-smll-171734919700150.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 greatspnxred
Input is MedleyA-PT-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919700150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 184K Jun 2 16:33 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 MedleyA-PT-19-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717375034054

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 00:37:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-03 00:37:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:37:16] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-06-03 00:37:16] [INFO ] Transformed 272 places.
[2024-06-03 00:37:16] [INFO ] Transformed 586 transitions.
[2024-06-03 00:37:16] [INFO ] Found NUPN structural information;
[2024-06-03 00:37:16] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 357 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 3 transitions.
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (12 resets) in 3228 ms. (12 steps per ms) remains 12/14 properties
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (16 resets) in 1309 ms. (30 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (9 resets) in 634 ms. (62 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (22 resets) in 260 ms. (153 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (10 resets) in 536 ms. (74 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (15 resets) in 652 ms. (61 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (16 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (17 resets) in 378 ms. (105 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (12 resets) in 265 ms. (150 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (19 resets) in 236 ms. (168 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (13 resets) in 145 ms. (273 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (20 resets) in 289 ms. (137 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (20 resets) in 174 ms. (228 steps per ms) remains 12/12 properties
// Phase 1: matrix 583 rows 269 cols
[2024-06-03 00:37:19] [INFO ] Computed 24 invariants in 32 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 59/209 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 59/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 60/269 variables, 14/233 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 60/293 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 583/852 variables, 269/562 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/852 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/852 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/852 variables, and 562 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2120 ms.
Refiners :[Domain max(s): 269/269 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 59/209 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 59/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-03 00:37:22] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 36 ms to minimize.
[2024-06-03 00:37:23] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 4 ms to minimize.
[2024-06-03 00:37:23] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 3 ms to minimize.
[2024-06-03 00:37:23] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 2 ms to minimize.
[2024-06-03 00:37:23] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-06-03 00:37:23] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2024-06-03 00:37:23] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-06-03 00:37:24] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 2 ms to minimize.
Problem MedleyA-PT-19-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 8/227 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-03 00:37:24] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 1/228 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 60/269 variables, 14/242 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 60/302 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-03 00:37:24] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-06-03 00:37:25] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 2 ms to minimize.
[2024-06-03 00:37:25] [INFO ] Deduced a trap composed of 61 places in 196 ms of which 3 ms to minimize.
[2024-06-03 00:37:25] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 2 ms to minimize.
[2024-06-03 00:37:25] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 2 ms to minimize.
[2024-06-03 00:37:25] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 2 ms to minimize.
[2024-06-03 00:37:26] [INFO ] Deduced a trap composed of 56 places in 289 ms of which 3 ms to minimize.
[2024-06-03 00:37:26] [INFO ] Deduced a trap composed of 27 places in 336 ms of which 5 ms to minimize.
Problem MedleyA-PT-19-ReachabilityCardinality-2024-08 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-03 00:37:26] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:37:26] [INFO ] Deduced a trap composed of 73 places in 192 ms of which 2 ms to minimize.
[2024-06-03 00:37:27] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 3 ms to minimize.
[2024-06-03 00:37:27] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 3 ms to minimize.
SMT process timed out in 7639ms, After SMT, problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 139 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 583/583 transitions.
Graph (complete) has 909 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 268 transition count 576
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 16 rules applied. Total rules applied 24 place count 261 transition count 567
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 33 place count 253 transition count 566
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 33 place count 253 transition count 561
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 43 place count 248 transition count 561
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 63 place count 228 transition count 538
Iterating global reduction 3 with 20 rules applied. Total rules applied 83 place count 228 transition count 538
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 99 place count 220 transition count 530
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 107 place count 216 transition count 564
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 119 place count 216 transition count 552
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 135 place count 216 transition count 536
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 138 place count 216 transition count 533
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 141 place count 213 transition count 533
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 147 place count 213 transition count 533
Applied a total of 147 rules in 259 ms. Remains 213 /269 variables (removed 56) and now considering 533/583 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278 ms. Remains : 213/269 places, 533/583 transitions.
RANDOM walk for 40000 steps (14 resets) in 687 ms. (58 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (19 resets) in 374 ms. (106 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (15 resets) in 369 ms. (108 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (16 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (19 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (10 resets) in 225 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (35 resets) in 227 ms. (175 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (18 resets) in 185 ms. (215 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (13 resets) in 222 ms. (179 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (15 resets) in 301 ms. (132 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 310943 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :1 out of 10
Probabilistic random walk after 310943 steps, saw 63323 distinct states, run finished after 3008 ms. (steps per millisecond=103 ) properties seen :1
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 533 rows 213 cols
[2024-06-03 00:37:31] [INFO ] Computed 23 invariants in 5 ms
[2024-06-03 00:37:31] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 55/165 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 45/210 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 531/741 variables, 210/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 78/311 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 5/746 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/746 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/746 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 746/746 variables, and 314 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1683 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 213/213 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 55/165 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 00:37:33] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-03 00:37:33] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 45/210 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 00:37:34] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 4 ms to minimize.
[2024-06-03 00:37:34] [INFO ] Deduced a trap composed of 24 places in 327 ms of which 4 ms to minimize.
[2024-06-03 00:37:35] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 5 ms to minimize.
[2024-06-03 00:37:35] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-06-03 00:37:35] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 3 ms to minimize.
[2024-06-03 00:37:35] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 4 ms to minimize.
[2024-06-03 00:37:35] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 3 ms to minimize.
[2024-06-03 00:37:35] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 2 ms to minimize.
[2024-06-03 00:37:36] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 00:37:36] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 00:37:36] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 3 ms to minimize.
[2024-06-03 00:37:36] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 8 ms to minimize.
[2024-06-03 00:37:36] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:37:36] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:37:37] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 531/741 variables, 210/250 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/741 variables, 78/328 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/741 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 00:37:37] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/741 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 00:37:38] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/741 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 00:37:38] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/741 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 00:37:39] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 3 ms to minimize.
[2024-06-03 00:37:39] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/741 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/741 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 5/746 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/746 variables, 7/345 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 00:37:41] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/746 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 00:37:42] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 3 ms to minimize.
[2024-06-03 00:37:42] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 3 ms to minimize.
[2024-06-03 00:37:43] [INFO ] Deduced a trap composed of 27 places in 285 ms of which 3 ms to minimize.
[2024-06-03 00:37:43] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/746 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 00:37:44] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/746 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 00:37:45] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/746 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/746 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 00:37:47] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
[2024-06-03 00:37:48] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:37:48] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 3 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/746 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/746 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 0/746 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 746/746 variables, and 355 constraints, problems are : Problem set: 0 solved, 9 unsolved in 17936 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 213/213 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 32/32 constraints]
After SMT, in 19743ms problems are : Problem set: 0 solved, 9 unsolved
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 13967 ms.
Support contains 67 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 533/533 transitions.
Graph (complete) has 780 edges and 213 vertex of which 209 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 209 transition count 516
Reduce places removed 13 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 17 rules applied. Total rules applied 31 place count 196 transition count 512
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 35 place count 192 transition count 512
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 35 place count 192 transition count 510
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 190 transition count 510
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 53 place count 176 transition count 493
Iterating global reduction 3 with 14 rules applied. Total rules applied 67 place count 176 transition count 493
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 103 place count 158 transition count 475
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 109 place count 155 transition count 491
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 124 place count 155 transition count 476
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 130 place count 155 transition count 470
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 136 place count 149 transition count 470
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 149 transition count 468
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 140 place count 147 transition count 468
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 147 transition count 468
Applied a total of 141 rules in 112 ms. Remains 147 /213 variables (removed 66) and now considering 468/533 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 147/213 places, 468/533 transitions.
RANDOM walk for 40000 steps (20 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (15 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (67 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (26 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (22 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 484527 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :1 out of 4
Probabilistic random walk after 484527 steps, saw 97251 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :1
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-03 00:38:08] [INFO ] Flow matrix only has 456 transitions (discarded 12 similar events)
// Phase 1: matrix 456 rows 147 cols
[2024-06-03 00:38:08] [INFO ] Computed 23 invariants in 5 ms
[2024-06-03 00:38:08] [INFO ] State equation strengthened by 143 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/106 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/146 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 456/602 variables, 146/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 143/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/603 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/603 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 313 constraints, problems are : Problem set: 0 solved, 3 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/106 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:38:09] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:38:09] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 40/146 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:38:09] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 2 ms to minimize.
[2024-06-03 00:38:10] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 3 ms to minimize.
[2024-06-03 00:38:10] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:38:10] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 2 ms to minimize.
[2024-06-03 00:38:10] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-06-03 00:38:10] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 2 ms to minimize.
[2024-06-03 00:38:10] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 456/602 variables, 146/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 143/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:38:11] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-06-03 00:38:11] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:38:11] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-06-03 00:38:11] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 1 ms to minimize.
[2024-06-03 00:38:11] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 2 ms to minimize.
[2024-06-03 00:38:12] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2024-06-03 00:38:12] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 7/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/603 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/603 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:38:12] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/603 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/603 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/603 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 603/603 variables, and 333 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4004 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 17/17 constraints]
After SMT, in 4501ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1750 ms.
Support contains 64 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 468/468 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 146 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 146 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 145 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 144 transition count 474
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 18 place count 144 transition count 462
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 144 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 143 transition count 461
Applied a total of 20 rules in 53 ms. Remains 143 /147 variables (removed 4) and now considering 461/468 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 143/147 places, 461/468 transitions.
RANDOM walk for 40000 steps (15 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (15 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (28 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (18 resets) in 254 ms. (156 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 459507 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :1 out of 3
Probabilistic random walk after 459507 steps, saw 94656 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :1
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-03 00:38:18] [INFO ] Flow matrix only has 449 transitions (discarded 12 similar events)
// Phase 1: matrix 449 rows 143 cols
[2024-06-03 00:38:18] [INFO ] Computed 23 invariants in 3 ms
[2024-06-03 00:38:18] [INFO ] State equation strengthened by 143 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/83 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/137 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/142 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 449/591 variables, 142/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/591 variables, 143/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/591 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/592 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/592 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/592 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 592/592 variables, and 309 constraints, problems are : Problem set: 0 solved, 2 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 143/143 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/83 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:38:19] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-03 00:38:19] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:38:19] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 54/137 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:38:19] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 3 ms to minimize.
[2024-06-03 00:38:19] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 2 ms to minimize.
[2024-06-03 00:38:19] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:38:19] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:38:20] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 2 ms to minimize.
[2024-06-03 00:38:20] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:38:20] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 2 ms to minimize.
[2024-06-03 00:38:20] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 3 ms to minimize.
[2024-06-03 00:38:20] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:38:20] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 2 ms to minimize.
[2024-06-03 00:38:21] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 3 ms to minimize.
[2024-06-03 00:38:21] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 2 ms to minimize.
[2024-06-03 00:38:21] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:38:21] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/142 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/142 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 449/591 variables, 142/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 143/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:38:22] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/591 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/592 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/592 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:38:22] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/592 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:38:22] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/592 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:38:23] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/592 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/592 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:38:23] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:38:23] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/592 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/592 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/592 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 592/592 variables, and 334 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5071 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 143/143 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 23/23 constraints]
After SMT, in 5505ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 530 ms.
Support contains 32 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 461/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 459
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 141 transition count 459
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 141 transition count 457
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 139 transition count 457
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 17 place count 130 transition count 445
Iterating global reduction 2 with 9 rules applied. Total rules applied 26 place count 130 transition count 445
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 50 place count 118 transition count 433
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 117 transition count 435
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 117 transition count 433
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 115 transition count 433
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 62 place count 115 transition count 471
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 76 place count 109 transition count 463
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 80 place count 109 transition count 463
Applied a total of 80 rules in 113 ms. Remains 109 /143 variables (removed 34) and now considering 463/461 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 109/143 places, 463/461 transitions.
RANDOM walk for 40000 steps (14 resets) in 504 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (11 resets) in 243 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (18 resets) in 277 ms. (143 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 503904 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 2
Probabilistic random walk after 503904 steps, saw 93769 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2024-06-03 00:38:28] [INFO ] Flow matrix only has 420 transitions (discarded 43 similar events)
// Phase 1: matrix 420 rows 109 cols
[2024-06-03 00:38:28] [INFO ] Computed 23 invariants in 3 ms
[2024-06-03 00:38:28] [INFO ] State equation strengthened by 188 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/104 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/108 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 420/528 variables, 108/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 188/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/529 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/529 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 320 constraints, problems are : Problem set: 0 solved, 2 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 109/109 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:38:28] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-06-03 00:38:28] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 35/104 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:38:28] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-06-03 00:38:28] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 1 ms to minimize.
[2024-06-03 00:38:29] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2024-06-03 00:38:29] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2024-06-03 00:38:29] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/108 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:38:29] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 420/528 variables, 108/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 188/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/528 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/529 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/529 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/529 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 529/529 variables, and 330 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1819 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 109/109 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 2206ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 179 ms.
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 463/463 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 109 transition count 458
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 104 transition count 458
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 104 transition count 457
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 103 transition count 457
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 101 transition count 455
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 101 transition count 455
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 38 place count 90 transition count 444
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 90 transition count 441
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 88 transition count 454
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 53 place count 88 transition count 446
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 88 transition count 555
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 86 place count 82 transition count 534
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 82 transition count 533
Applied a total of 87 rules in 100 ms. Remains 82 /109 variables (removed 27) and now considering 533/463 (removed -70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 82/109 places, 533/463 transitions.
RANDOM walk for 40000 steps (2906 resets) in 452 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (429 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 755394 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 1
Probabilistic random walk after 755394 steps, saw 131360 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
[2024-06-03 00:38:33] [INFO ] Flow matrix only has 455 transitions (discarded 78 similar events)
// Phase 1: matrix 455 rows 82 cols
[2024-06-03 00:38:33] [INFO ] Computed 23 invariants in 3 ms
[2024-06-03 00:38:33] [INFO ] State equation strengthened by 192 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/43 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/77 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/81 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 455/536 variables, 81/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 192/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/537 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/537 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/537 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 82/82 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/43 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/77 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:38:34] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-03 00:38:34] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/81 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:38:34] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
Problem MedleyA-PT-19-ReachabilityCardinality-2024-02 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 81/537 variables, and 26 constraints, problems are : Problem set: 1 solved, 0 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/82 constraints, ReadFeed: 0/192 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 642ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 78434 ms.
ITS solved all properties within timeout

BK_STOP 1717375114543

--------------------
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 ReachabilityCardinality -timeout 360 -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="MedleyA-PT-19"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-19, 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 r575-smll-171734919700150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-19.tgz
mv MedleyA-PT-19 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 ;