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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K 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.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 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 340K 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-020-ReachabilityCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-2024-06
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-2024-07
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-2023-08
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-2023-09
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-2024-12
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-2024-13
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-2023-14
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716381283269

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 12:34:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 12:34:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:34:44] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-22 12:34:44] [INFO ] Transformed 1064 places.
[2024-05-22 12:34:44] [INFO ] Transformed 998 transitions.
[2024-05-22 12:34:44] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1310 resets) in 1735 ms. (23 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (114 resets) in 109 ms. (36 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (112 resets) in 235 ms. (16 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 58 ms. (67 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (109 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (115 resets) in 72 ms. (54 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (120 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (107 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (115 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (108 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (119 resets) in 30 ms. (129 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 (114 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (115 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (112 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (111 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 127154 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 16
Probabilistic random walk after 127154 steps, saw 63591 distinct states, run finished after 3005 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 998 rows 1064 cols
[2024-05-22 12:34:48] [INFO ] Invariants computation overflowed in 130 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 543/802 variables, 259/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/802 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 987/1789 variables, 573/832 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1789 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem DoubleExponent-PT-020-ReachabilityCardinality-2024-12 is UNSAT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 265/2054 variables, 225/1057 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2054/2062 variables, and 1057 constraints, problems are : Problem set: 1 solved, 15 unsolved in 5056 ms.
Refiners :[State Equation: 1057/1064 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 482/709 variables, 227/227 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/709 variables, 1/228 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/709 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 975/1684 variables, 531/759 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1684 variables, 14/773 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1684 variables, 0/773 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2042/2062 variables, and 1060 constraints, problems are : Problem set: 1 solved, 15 unsolved in 5023 ms.
Refiners :[State Equation: 1045/1064 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 10323ms problems are : Problem set: 1 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 227 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1058 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 1057 transition count 906
Reduce places removed 90 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 131 rules applied. Total rules applied 225 place count 967 transition count 865
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 266 place count 926 transition count 865
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 266 place count 926 transition count 831
Deduced a syphon composed of 34 places in 9 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 334 place count 892 transition count 831
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 20 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 508 place count 805 transition count 744
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 20 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 528 place count 795 transition count 744
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 535 place count 795 transition count 737
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 542 place count 788 transition count 737
Free-agglomeration rule (complex) applied 71 times.
Iterating global reduction 4 with 71 rules applied. Total rules applied 613 place count 788 transition count 666
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 684 place count 717 transition count 666
Partial Free-agglomeration rule applied 48 times.
Drop transitions (Partial Free agglomeration) removed 48 transitions
Iterating global reduction 5 with 48 rules applied. Total rules applied 732 place count 717 transition count 666
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 733 place count 717 transition count 666
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 734 place count 716 transition count 665
Applied a total of 734 rules in 500 ms. Remains 716 /1064 variables (removed 348) and now considering 665/998 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 510 ms. Remains : 716/1064 places, 665/998 transitions.
RANDOM walk for 40000 steps (1742 resets) in 895 ms. (44 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (140 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (136 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (139 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (144 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (135 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (139 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (141 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (141 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (142 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (130 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (136 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (136 resets) in 28 ms. (137 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (142 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (150 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (126 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 155873 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 15
Probabilistic random walk after 155873 steps, saw 77978 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
// Phase 1: matrix 665 rows 716 cols
[2024-05-22 12:35:03] [INFO ] Invariants computation overflowed in 56 ms
[2024-05-22 12:35:03] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 532/759 variables, 227/227 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/759 variables, 9/236 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/759 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 594/1353 variables, 461/697 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1353 variables, 25/722 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1353 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem DoubleExponent-PT-020-ReachabilityCardinality-2024-02 is UNSAT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-020-ReachabilityCardinality-2024-04 is UNSAT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-020-ReachabilityCardinality-2024-11 is UNSAT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 28/1381 variables, 28/750 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1381 variables, 0/750 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/1381 variables, 0/750 constraints. Problems are: Problem set: 3 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1381/1381 variables, and 750 constraints, problems are : Problem set: 3 solved, 12 unsolved in 14516 ms.
Refiners :[State Equation: 716/716 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 382/534 variables, 152/152 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 5/157 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 707/1241 variables, 442/599 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 26/625 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1241 variables, 12/637 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1241 variables, 0/637 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 139/1380 variables, 121/758 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1380 variables, 3/761 constraints. Problems are: Problem set: 3 solved, 12 unsolved
[2024-05-22 12:35:38] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 22 ms to minimize.
[2024-05-22 12:35:39] [INFO ] Deduced a trap composed of 105 places in 235 ms of which 3 ms to minimize.
[2024-05-22 12:35:39] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 5 ms to minimize.
[2024-05-22 12:35:39] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 7 ms to minimize.
[2024-05-22 12:35:39] [INFO ] Deduced a trap composed of 173 places in 129 ms of which 3 ms to minimize.
[2024-05-22 12:35:39] [INFO ] Deduced a trap composed of 191 places in 122 ms of which 2 ms to minimize.
[2024-05-22 12:35:40] [INFO ] Deduced a trap composed of 180 places in 164 ms of which 2 ms to minimize.
[2024-05-22 12:35:40] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:35:40] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-05-22 12:35:40] [INFO ] Deduced a trap composed of 136 places in 126 ms of which 2 ms to minimize.
[2024-05-22 12:35:40] [INFO ] Deduced a trap composed of 198 places in 109 ms of which 2 ms to minimize.
[2024-05-22 12:35:41] [INFO ] Deduced a trap composed of 115 places in 136 ms of which 3 ms to minimize.
[2024-05-22 12:35:41] [INFO ] Deduced a trap composed of 187 places in 123 ms of which 2 ms to minimize.
[2024-05-22 12:35:41] [INFO ] Deduced a trap composed of 166 places in 111 ms of which 2 ms to minimize.
[2024-05-22 12:35:41] [INFO ] Deduced a trap composed of 102 places in 89 ms of which 2 ms to minimize.
[2024-05-22 12:35:42] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-22 12:35:43] [INFO ] Deduced a trap composed of 127 places in 92 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1380 variables, 17/778 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1380 variables, 0/778 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 1/1381 variables, 1/779 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1381/1381 variables, and 779 constraints, problems are : Problem set: 3 solved, 12 unsolved in 45019 ms.
Refiners :[State Equation: 716/716 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 12/15 constraints, Known Traps: 17/17 constraints]
After SMT, in 59671ms problems are : Problem set: 3 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 152 out of 716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 665/665 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 7 place count 716 transition count 658
Reduce places removed 7 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 14 rules applied. Total rules applied 21 place count 709 transition count 651
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 28 place count 702 transition count 651
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 28 place count 702 transition count 645
Deduced a syphon composed of 6 places in 14 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 40 place count 696 transition count 645
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 94 place count 669 transition count 618
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 668 transition count 618
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 668 transition count 615
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 102 place count 665 transition count 615
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 122 place count 665 transition count 595
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 142 place count 645 transition count 595
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 159 place count 645 transition count 595
Applied a total of 159 rules in 159 ms. Remains 645 /716 variables (removed 71) and now considering 595/665 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 645/716 places, 595/665 transitions.
RANDOM walk for 40000 steps (1851 resets) in 297 ms. (134 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1486 resets) in 186 ms. (213 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1491 resets) in 217 ms. (183 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1486 resets) in 203 ms. (196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1500 resets) in 185 ms. (215 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1477 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1525 resets) in 182 ms. (218 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1513 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1528 resets) in 224 ms. (177 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (2051 resets) in 198 ms. (201 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1529 resets) in 251 ms. (158 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1506 resets) in 208 ms. (191 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1480 resets) in 202 ms. (197 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 177237 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 12
Probabilistic random walk after 177237 steps, saw 88685 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
// Phase 1: matrix 595 rows 645 cols
[2024-05-22 12:36:07] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 12:36:07] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 399/551 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 617/1168 variables, 427/586 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 32/618 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1168 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 72/1240 variables, 66/684 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1240 variables, 3/687 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1240 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/1240 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1240/1240 variables, and 687 constraints, problems are : Problem set: 0 solved, 12 unsolved in 8243 ms.
Refiners :[State Equation: 645/645 constraints, ReadFeed: 42/42 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/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 399/551 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 617/1168 variables, 427/586 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 32/618 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1168 variables, 12/630 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1168 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 72/1240 variables, 66/696 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1240 variables, 3/699 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 12:37:13] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 4 ms to minimize.
[2024-05-22 12:37:13] [INFO ] Deduced a trap composed of 216 places in 189 ms of which 4 ms to minimize.
[2024-05-22 12:37:13] [INFO ] Deduced a trap composed of 206 places in 182 ms of which 3 ms to minimize.
[2024-05-22 12:37:14] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 4 ms to minimize.
[2024-05-22 12:37:14] [INFO ] Deduced a trap composed of 58 places in 178 ms of which 3 ms to minimize.
[2024-05-22 12:37:14] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
[2024-05-22 12:37:14] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 3 ms to minimize.
[2024-05-22 12:37:15] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 3 ms to minimize.
[2024-05-22 12:37:15] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 3 ms to minimize.
[2024-05-22 12:37:15] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-05-22 12:37:16] [INFO ] Deduced a trap composed of 210 places in 183 ms of which 3 ms to minimize.
[2024-05-22 12:37:16] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 4 ms to minimize.
[2024-05-22 12:37:16] [INFO ] Deduced a trap composed of 196 places in 182 ms of which 3 ms to minimize.
[2024-05-22 12:37:16] [INFO ] Deduced a trap composed of 81 places in 177 ms of which 4 ms to minimize.
[2024-05-22 12:37:17] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 4 ms to minimize.
[2024-05-22 12:37:17] [INFO ] Deduced a trap composed of 75 places in 182 ms of which 3 ms to minimize.
[2024-05-22 12:37:17] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 4 ms to minimize.
[2024-05-22 12:37:17] [INFO ] Deduced a trap composed of 165 places in 181 ms of which 4 ms to minimize.
[2024-05-22 12:37:18] [INFO ] Deduced a trap composed of 77 places in 179 ms of which 4 ms to minimize.
[2024-05-22 12:37:19] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 4 ms to minimize.
Problem DoubleExponent-PT-020-ReachabilityCardinality-2024-13 is UNSAT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (INCLUDED_ONLY) 0/1240 variables, 20/719 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1240/1240 variables, and 719 constraints, problems are : Problem set: 1 solved, 11 unsolved in 75016 ms.
Refiners :[State Equation: 645/645 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 20/20 constraints]
After SMT, in 83333ms problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 115 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 595/595 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 645 transition count 591
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 641 transition count 590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 640 transition count 590
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 10 place count 640 transition count 586
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 18 place count 636 transition count 586
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 54 place count 618 transition count 568
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 62 place count 614 transition count 568
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 614 transition count 567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 613 transition count 567
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 72 place count 613 transition count 559
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 80 place count 605 transition count 559
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 86 place count 605 transition count 559
Applied a total of 86 rules in 129 ms. Remains 605 /645 variables (removed 40) and now considering 559/595 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 605/645 places, 559/595 transitions.
RANDOM walk for 40000 steps (2030 resets) in 524 ms. (76 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (1606 resets) in 314 ms. (126 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (1578 resets) in 201 ms. (198 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (1604 resets) in 261 ms. (152 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1591 resets) in 199 ms. (200 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1612 resets) in 216 ms. (184 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1613 resets) in 283 ms. (140 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1615 resets) in 239 ms. (166 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (1596 resets) in 253 ms. (157 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (2162 resets) in 245 ms. (162 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1594 resets) in 301 ms. (132 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1617 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 169142 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 11
Probabilistic random walk after 169142 steps, saw 84626 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 559 rows 605 cols
[2024-05-22 12:37:34] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 12:37:34] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 309/424 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 620/1044 variables, 381/502 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1044 variables, 44/546 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1044 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 120/1164 variables, 109/655 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1164 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1164 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/1164 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 660 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4465 ms.
Refiners :[State Equation: 605/605 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 309/424 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 620/1044 variables, 381/502 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1044 variables, 44/546 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1044 variables, 10/556 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1044 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 120/1164 variables, 109/665 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1164 variables, 5/670 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/671 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 12:38:26] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 3 ms to minimize.
[2024-05-22 12:38:26] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 3 ms to minimize.
[2024-05-22 12:38:26] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-05-22 12:38:26] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 3 ms to minimize.
[2024-05-22 12:38:26] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 3 ms to minimize.
[2024-05-22 12:38:26] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 3 ms to minimize.
[2024-05-22 12:38:27] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 3 ms to minimize.
[2024-05-22 12:38:27] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 3 ms to minimize.
[2024-05-22 12:38:27] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 3 ms to minimize.
[2024-05-22 12:38:27] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 2 ms to minimize.
[2024-05-22 12:38:27] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 3 ms to minimize.
[2024-05-22 12:38:28] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
[2024-05-22 12:38:28] [INFO ] Deduced a trap composed of 121 places in 135 ms of which 3 ms to minimize.
[2024-05-22 12:38:28] [INFO ] Deduced a trap composed of 114 places in 133 ms of which 3 ms to minimize.
[2024-05-22 12:38:29] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 3 ms to minimize.
[2024-05-22 12:38:29] [INFO ] Deduced a trap composed of 133 places in 135 ms of which 3 ms to minimize.
[2024-05-22 12:38:30] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 2 ms to minimize.
[2024-05-22 12:38:30] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 2 ms to minimize.
[2024-05-22 12:38:30] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 3 ms to minimize.
[2024-05-22 12:38:30] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 20/691 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 12:38:37] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 3 ms to minimize.
[2024-05-22 12:38:37] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 3 ms to minimize.
[2024-05-22 12:38:37] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 3 ms to minimize.
[2024-05-22 12:38:38] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 3 ms to minimize.
[2024-05-22 12:38:38] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 3 ms to minimize.
[2024-05-22 12:38:38] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:38:38] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-22 12:38:38] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 2 ms to minimize.
[2024-05-22 12:38:39] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:38:39] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-05-22 12:38:39] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 2 ms to minimize.
[2024-05-22 12:38:39] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-05-22 12:38:39] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-05-22 12:38:39] [INFO ] Deduced a trap composed of 109 places in 88 ms of which 1 ms to minimize.
[2024-05-22 12:38:40] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-22 12:38:40] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-22 12:38:40] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 1 ms to minimize.
[2024-05-22 12:38:40] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 1 ms to minimize.
[2024-05-22 12:38:40] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 1 ms to minimize.
[2024-05-22 12:38:41] [INFO ] Deduced a trap composed of 130 places in 106 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 20/711 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 12:38:51] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 3 ms to minimize.
[2024-05-22 12:38:51] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
[2024-05-22 12:38:51] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 2 ms to minimize.
[2024-05-22 12:38:52] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-22 12:38:53] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 1 ms to minimize.
[2024-05-22 12:38:53] [INFO ] Deduced a trap composed of 181 places in 169 ms of which 3 ms to minimize.
[2024-05-22 12:38:53] [INFO ] Deduced a trap composed of 211 places in 170 ms of which 3 ms to minimize.
[2024-05-22 12:38:54] [INFO ] Deduced a trap composed of 203 places in 170 ms of which 3 ms to minimize.
[2024-05-22 12:38:55] [INFO ] Deduced a trap composed of 201 places in 171 ms of which 4 ms to minimize.
[2024-05-22 12:38:56] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 4 ms to minimize.
[2024-05-22 12:38:56] [INFO ] Deduced a trap composed of 192 places in 170 ms of which 4 ms to minimize.
[2024-05-22 12:38:56] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 3 ms to minimize.
[2024-05-22 12:38:57] [INFO ] Deduced a trap composed of 219 places in 168 ms of which 3 ms to minimize.
[2024-05-22 12:38:57] [INFO ] Deduced a trap composed of 92 places in 169 ms of which 3 ms to minimize.
[2024-05-22 12:38:59] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-05-22 12:39:00] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
[2024-05-22 12:39:00] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 2 ms to minimize.
[2024-05-22 12:39:00] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2024-05-22 12:39:03] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 3 ms to minimize.
[2024-05-22 12:39:04] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 20/731 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 731 constraints, problems are : Problem set: 0 solved, 11 unsolved in 90009 ms.
Refiners :[State Equation: 605/605 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 60/60 constraints]
After SMT, in 94535ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 115 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 559/559 transitions.
Applied a total of 0 rules in 26 ms. Remains 605 /605 variables (removed 0) and now considering 559/559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 605/605 places, 559/559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 559/559 transitions.
Applied a total of 0 rules in 11 ms. Remains 605 /605 variables (removed 0) and now considering 559/559 (removed 0) transitions.
// Phase 1: matrix 559 rows 605 cols
[2024-05-22 12:39:09] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-22 12:39:09] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 559 rows 605 cols
[2024-05-22 12:39:09] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-22 12:39:10] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-22 12:39:18] [INFO ] Implicit Places using invariants and state equation in 8508 ms returned [16, 24, 56, 63, 90, 100, 198, 199, 263, 271, 278, 304, 344, 366, 372, 397, 406, 497, 499, 504, 527, 534, 562, 567]
[2024-05-22 12:39:18] [INFO ] Actually due to overlaps returned [271, 504, 63, 56, 198, 263, 278, 497, 16, 199]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 8834 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 595/605 places, 559/559 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 594 transition count 558
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 594 transition count 558
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 594 transition count 556
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 592 transition count 556
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 592 transition count 556
Applied a total of 8 rules in 72 ms. Remains 592 /595 variables (removed 3) and now considering 556/559 (removed 3) transitions.
// Phase 1: matrix 556 rows 592 cols
[2024-05-22 12:39:18] [INFO ] Computed 90 invariants in 78 ms
[2024-05-22 12:39:18] [INFO ] Implicit Places using invariants in 408 ms returned [86, 96, 294, 334, 356, 362, 387, 396, 488, 514, 521, 549, 554]
[2024-05-22 12:39:18] [INFO ] Actually due to overlaps returned [294, 521, 86, 96, 488, 514]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 410 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 586/605 places, 556/559 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 586 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 585 transition count 555
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 585 transition count 555
Applied a total of 4 rules in 41 ms. Remains 585 /586 variables (removed 1) and now considering 555/556 (removed 1) transitions.
// Phase 1: matrix 555 rows 585 cols
[2024-05-22 12:39:18] [INFO ] Invariants computation overflowed in 105 ms
[2024-05-22 12:39:19] [INFO ] Implicit Places using invariants in 327 ms returned []
// Phase 1: matrix 555 rows 585 cols
[2024-05-22 12:39:19] [INFO ] Invariants computation overflowed in 63 ms
[2024-05-22 12:39:19] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 12:39:26] [INFO ] Implicit Places using invariants and state equation in 7713 ms returned [331, 353, 359, 384, 393, 542, 547]
[2024-05-22 12:39:26] [INFO ] Actually due to overlaps returned [331, 542, 547]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 8046 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 582/605 places, 555/559 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 582 transition count 554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 581 transition count 554
Applied a total of 2 rules in 34 ms. Remains 581 /582 variables (removed 1) and now considering 554/555 (removed 1) transitions.
// Phase 1: matrix 554 rows 581 cols
[2024-05-22 12:39:26] [INFO ] Computed 81 invariants in 75 ms
[2024-05-22 12:39:27] [INFO ] Implicit Places using invariants in 455 ms returned [352, 358, 383, 392]
[2024-05-22 12:39:27] [INFO ] Actually due to overlaps returned [358, 352]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 459 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 579/605 places, 554/559 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 579 transition count 553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 578 transition count 553
Applied a total of 2 rules in 22 ms. Remains 578 /579 variables (removed 1) and now considering 553/554 (removed 1) transitions.
// Phase 1: matrix 553 rows 578 cols
[2024-05-22 12:39:27] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-22 12:39:27] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 553 rows 578 cols
[2024-05-22 12:39:27] [INFO ] Invariants computation overflowed in 55 ms
[2024-05-22 12:39:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 12:39:48] [INFO ] Implicit Places using invariants and state equation in 21124 ms returned [380, 389]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 21415 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 576/605 places, 553/559 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 576 transition count 552
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 575 transition count 552
Applied a total of 2 rules in 25 ms. Remains 575 /576 variables (removed 1) and now considering 552/553 (removed 1) transitions.
// Phase 1: matrix 552 rows 575 cols
[2024-05-22 12:39:48] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-22 12:39:49] [INFO ] Implicit Places using invariants in 243 ms returned []
// Phase 1: matrix 552 rows 575 cols
[2024-05-22 12:39:49] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-22 12:39:49] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 12:39:55] [INFO ] Implicit Places using invariants and state equation in 6375 ms returned []
Implicit Place search using SMT with State Equation took 6619 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 575/605 places, 552/559 transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 45990 ms. Remains : 575/605 places, 552/559 transitions.
RANDOM walk for 40000 steps (2087 resets) in 306 ms. (130 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1652 resets) in 204 ms. (195 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1660 resets) in 213 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (1648 resets) in 265 ms. (150 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1630 resets) in 298 ms. (133 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1637 resets) in 356 ms. (112 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1669 resets) in 205 ms. (194 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (1671 resets) in 300 ms. (132 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1672 resets) in 241 ms. (165 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (2220 resets) in 280 ms. (142 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1637 resets) in 286 ms. (139 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (1645 resets) in 236 ms. (168 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 161759 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 11
Probabilistic random walk after 161759 steps, saw 80911 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
// Phase 1: matrix 552 rows 575 cols
[2024-05-22 12:39:59] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-22 12:39:59] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 312/427 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/427 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 594/1021 variables, 364/485 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1021 variables, 46/531 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1021 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 106/1127 variables, 96/627 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1127 variables, 5/632 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1127 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/1127 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1127/1127 variables, and 632 constraints, problems are : Problem set: 0 solved, 11 unsolved in 7151 ms.
Refiners :[State Equation: 575/575 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 312/427 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/427 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 594/1021 variables, 364/485 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1021 variables, 46/531 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1021 variables, 10/541 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1021 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 106/1127 variables, 96/637 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1127 variables, 5/642 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1127 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 12:40:55] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 3 ms to minimize.
[2024-05-22 12:40:55] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-05-22 12:40:55] [INFO ] Deduced a trap composed of 228 places in 165 ms of which 3 ms to minimize.
[2024-05-22 12:40:56] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 3 ms to minimize.
[2024-05-22 12:40:56] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 3 ms to minimize.
[2024-05-22 12:40:56] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 3 ms to minimize.
[2024-05-22 12:40:57] [INFO ] Deduced a trap composed of 225 places in 157 ms of which 3 ms to minimize.
[2024-05-22 12:40:57] [INFO ] Deduced a trap composed of 233 places in 161 ms of which 3 ms to minimize.
[2024-05-22 12:40:57] [INFO ] Deduced a trap composed of 224 places in 155 ms of which 3 ms to minimize.
[2024-05-22 12:40:57] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-05-22 12:40:57] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 3 ms to minimize.
[2024-05-22 12:40:58] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 3 ms to minimize.
[2024-05-22 12:40:58] [INFO ] Deduced a trap composed of 224 places in 149 ms of which 3 ms to minimize.
[2024-05-22 12:40:58] [INFO ] Deduced a trap composed of 224 places in 160 ms of which 3 ms to minimize.
[2024-05-22 12:40:59] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 2 ms to minimize.
[2024-05-22 12:40:59] [INFO ] Deduced a trap composed of 207 places in 165 ms of which 3 ms to minimize.
[2024-05-22 12:40:59] [INFO ] Deduced a trap composed of 220 places in 157 ms of which 4 ms to minimize.
[2024-05-22 12:41:00] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-05-22 12:41:00] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 2 ms to minimize.
[2024-05-22 12:41:00] [INFO ] Deduced a trap composed of 220 places in 155 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1127 variables, 20/663 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 12:41:08] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 3 ms to minimize.
[2024-05-22 12:41:11] [INFO ] Deduced a trap composed of 176 places in 169 ms of which 3 ms to minimize.
[2024-05-22 12:41:11] [INFO ] Deduced a trap composed of 187 places in 175 ms of which 3 ms to minimize.
[2024-05-22 12:41:12] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 2 ms to minimize.
[2024-05-22 12:41:12] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 3 ms to minimize.
[2024-05-22 12:41:12] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 3 ms to minimize.
[2024-05-22 12:41:12] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 3 ms to minimize.
[2024-05-22 12:41:13] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 3 ms to minimize.
[2024-05-22 12:41:13] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 3 ms to minimize.
[2024-05-22 12:41:17] [INFO ] Deduced a trap composed of 213 places in 161 ms of which 3 ms to minimize.
[2024-05-22 12:41:18] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 4 ms to minimize.
[2024-05-22 12:41:18] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 3 ms to minimize.
[2024-05-22 12:41:18] [INFO ] Deduced a trap composed of 58 places in 154 ms of which 3 ms to minimize.
[2024-05-22 12:41:19] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 3 ms to minimize.
[2024-05-22 12:41:20] [INFO ] Deduced a trap composed of 203 places in 152 ms of which 3 ms to minimize.
[2024-05-22 12:41:20] [INFO ] Deduced a trap composed of 203 places in 163 ms of which 3 ms to minimize.
[2024-05-22 12:41:21] [INFO ] Deduced a trap composed of 215 places in 160 ms of which 3 ms to minimize.
[2024-05-22 12:41:21] [INFO ] Deduced a trap composed of 215 places in 157 ms of which 3 ms to minimize.
[2024-05-22 12:41:22] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-05-22 12:41:24] [INFO ] Deduced a trap composed of 217 places in 158 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1127 variables, 20/683 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 12:41:36] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 2 ms to minimize.
[2024-05-22 12:41:36] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 2 ms to minimize.
[2024-05-22 12:41:36] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
[2024-05-22 12:41:36] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 1 ms to minimize.
[2024-05-22 12:41:37] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 1 ms to minimize.
[2024-05-22 12:41:37] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 4 ms to minimize.
[2024-05-22 12:41:37] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 2 ms to minimize.
[2024-05-22 12:41:37] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 1 ms to minimize.
[2024-05-22 12:41:37] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 1 ms to minimize.
[2024-05-22 12:41:38] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 1 ms to minimize.
[2024-05-22 12:41:39] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 3 ms to minimize.
[2024-05-22 12:41:39] [INFO ] Deduced a trap composed of 201 places in 152 ms of which 4 ms to minimize.
[2024-05-22 12:41:39] [INFO ] Deduced a trap composed of 203 places in 154 ms of which 3 ms to minimize.
[2024-05-22 12:41:39] [INFO ] Deduced a trap composed of 201 places in 160 ms of which 3 ms to minimize.
[2024-05-22 12:41:40] [INFO ] Deduced a trap composed of 202 places in 161 ms of which 3 ms to minimize.
[2024-05-22 12:41:40] [INFO ] Deduced a trap composed of 181 places in 156 ms of which 3 ms to minimize.
[2024-05-22 12:41:40] [INFO ] Deduced a trap composed of 205 places in 155 ms of which 3 ms to minimize.
[2024-05-22 12:41:40] [INFO ] Deduced a trap composed of 186 places in 158 ms of which 3 ms to minimize.
[2024-05-22 12:41:41] [INFO ] Deduced a trap composed of 209 places in 157 ms of which 3 ms to minimize.
[2024-05-22 12:41:41] [INFO ] Deduced a trap composed of 189 places in 161 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1127 variables, 20/703 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1127/1127 variables, and 703 constraints, problems are : Problem set: 0 solved, 11 unsolved in 105014 ms.
Refiners :[State Equation: 575/575 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 60/60 constraints]
After SMT, in 112242ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 115 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 552/552 transitions.
Applied a total of 0 rules in 13 ms. Remains 575 /575 variables (removed 0) and now considering 552/552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 575/575 places, 552/552 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 552/552 transitions.
Applied a total of 0 rules in 9 ms. Remains 575 /575 variables (removed 0) and now considering 552/552 (removed 0) transitions.
// Phase 1: matrix 552 rows 575 cols
[2024-05-22 12:41:52] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-22 12:41:52] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 552 rows 575 cols
[2024-05-22 12:41:52] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-22 12:41:52] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 12:41:59] [INFO ] Implicit Places using invariants and state equation in 6646 ms returned []
Implicit Place search using SMT with State Equation took 6906 ms to find 0 implicit places.
[2024-05-22 12:41:59] [INFO ] Redundant transitions in 30 ms returned []
Running 551 sub problems to find dead transitions.
// Phase 1: matrix 552 rows 575 cols
[2024-05-22 12:41:59] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-22 12:41:59] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/574 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 552/1126 variables, 574/574 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1126 variables, 57/631 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1126 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 551 unsolved
SMT process timed out in 30199ms, After SMT, problems are : Problem set: 0 solved, 551 unsolved
Search for dead transitions found 0 dead transitions in 30206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37167 ms. Remains : 575/575 places, 552/552 transitions.
[2024-05-22 12:42:29] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-22 12:42:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 575 places, 552 transitions and 2290 arcs took 7 ms.
[2024-05-22 12:42:29] [INFO ] Flatten gal took : 83 ms
Total runtime 465246 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-020

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 575
TRANSITIONS: 552
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.008s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1121
MODEL NAME: /home/mcc/execution/412/model
575 places, 552 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716382511467

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-020"
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 DoubleExponent-PT-020, 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 r135-tall-171631131400566"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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