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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 169K 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-010-ReachabilityCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2023-06
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2023-07
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2023-08
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-12
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-13
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2023-14
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716377666039

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-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:34:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 11:34:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:34:27] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-22 11:34:27] [INFO ] Transformed 534 places.
[2024-05-22 11:34:27] [INFO ] Transformed 498 transitions.
[2024-05-22 11:34:27] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1330 resets) in 1717 ms. (23 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (111 resets) in 87 ms. (45 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (110 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (114 resets) in 22 ms. (173 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (114 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (112 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (116 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (108 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (119 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (107 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (111 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (116 resets) in 61 ms. (64 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (114 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (114 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (120 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (116 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 164662 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :1 out of 16
Probabilistic random walk after 164662 steps, saw 82348 distinct states, run finished after 3008 ms. (steps per millisecond=54 ) properties seen :1
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 498 rows 534 cols
[2024-05-22 11:34:31] [INFO ] Computed 54 invariants in 68 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem DoubleExponent-PT-010-ReachabilityCardinality-2024-12 is UNSAT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 278/415 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 119/534 variables, 51/54 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 498/1032 variables, 534/588 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1032 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/1032 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1032/1032 variables, and 588 constraints, problems are : Problem set: 1 solved, 14 unsolved in 2366 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 534/534 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 300/407 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 127/534 variables, 51/54 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-22 11:34:34] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 32 ms to minimize.
[2024-05-22 11:34:34] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 4 ms to minimize.
[2024-05-22 11:34:35] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 3 ms to minimize.
[2024-05-22 11:34:35] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 4 ms to minimize.
[2024-05-22 11:34:35] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 3 ms to minimize.
[2024-05-22 11:34:35] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 3 ms to minimize.
[2024-05-22 11:34:35] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 3 ms to minimize.
[2024-05-22 11:34:35] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 3 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 3 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 3 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 2 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 3 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 3 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 3 ms to minimize.
[2024-05-22 11:34:36] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 3 ms to minimize.
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 121 places in 127 ms of which 3 ms to minimize.
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 115 places in 125 ms of which 3 ms to minimize.
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 113 places in 128 ms of which 3 ms to minimize.
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 123 places in 124 ms of which 2 ms to minimize.
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 124 places in 123 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 20/74 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 231 places in 145 ms of which 3 ms to minimize.
[2024-05-22 11:34:37] [INFO ] Deduced a trap composed of 253 places in 145 ms of which 3 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 3 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 228 places in 140 ms of which 4 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 199 places in 137 ms of which 3 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 196 places in 141 ms of which 3 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 223 places in 142 ms of which 4 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 4 ms to minimize.
[2024-05-22 11:34:38] [INFO ] Deduced a trap composed of 242 places in 137 ms of which 4 ms to minimize.
[2024-05-22 11:34:39] [INFO ] Deduced a trap composed of 256 places in 142 ms of which 3 ms to minimize.
SMT process timed out in 7685ms, After SMT, problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 107 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 529 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 528 transition count 454
Reduce places removed 43 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 70 rules applied. Total rules applied 116 place count 485 transition count 427
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 143 place count 458 transition count 427
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 143 place count 458 transition count 406
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 185 place count 437 transition count 406
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 6 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 273 place count 393 transition count 362
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 295 place count 382 transition count 362
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 298 place count 382 transition count 359
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 301 place count 379 transition count 359
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 4 with 26 rules applied. Total rules applied 327 place count 379 transition count 333
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 353 place count 353 transition count 333
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 379 place count 353 transition count 333
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 380 place count 353 transition count 333
Applied a total of 380 rules in 216 ms. Remains 353 /534 variables (removed 181) and now considering 333/498 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 353/534 places, 333/498 transitions.
RANDOM walk for 40000 steps (2565 resets) in 841 ms. (47 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1923 resets) in 328 ms. (121 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1911 resets) in 274 ms. (145 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1921 resets) in 246 ms. (161 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1925 resets) in 127 ms. (312 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1910 resets) in 162 ms. (245 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1931 resets) in 129 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1930 resets) in 132 ms. (300 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1955 resets) in 198 ms. (201 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1894 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1930 resets) in 137 ms. (289 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1919 resets) in 129 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1933 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1940 resets) in 121 ms. (327 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1899 resets) in 119 ms. (333 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 180082 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 14
Probabilistic random walk after 180082 steps, saw 90087 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 333 rows 353 cols
[2024-05-22 11:34:43] [INFO ] Computed 50 invariants in 16 ms
[2024-05-22 11:34:43] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 6/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 207/320 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 11/331 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 333/664 variables, 331/381 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 15/396 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 22/686 variables, 22/418 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/686 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 686/686 variables, and 418 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2943 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 353/353 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 6/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 207/320 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 11/331 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 333/664 variables, 331/381 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 15/396 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 6/402 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 11:34:47] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 22/686 variables, 22/425 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 11:34:55] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2024-05-22 11:34:55] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:34:55] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:34:56] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 5 ms to minimize.
[2024-05-22 11:34:56] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-22 11:34:56] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:34:56] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 2 ms to minimize.
[2024-05-22 11:34:56] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 1 ms to minimize.
[2024-05-22 11:34:56] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 3 ms to minimize.
[2024-05-22 11:34:56] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
[2024-05-22 11:34:57] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:34:57] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:34:57] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 2 ms to minimize.
[2024-05-22 11:34:57] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:34:57] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:34:57] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 0 ms to minimize.
[2024-05-22 11:34:57] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/686 variables, 17/450 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 11:35:02] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-22 11:35:02] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:35:02] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/686 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/686 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/686 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 686/686 variables, and 453 constraints, problems are : Problem set: 0 solved, 14 unsolved in 21774 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 353/353 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 21/21 constraints]
After SMT, in 24774ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 30003 ms.
Support contains 107 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 333/333 transitions.
Applied a total of 0 rules in 16 ms. Remains 353 /353 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 353/353 places, 333/333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 333/333 transitions.
Applied a total of 0 rules in 13 ms. Remains 353 /353 variables (removed 0) and now considering 333/333 (removed 0) transitions.
[2024-05-22 11:35:38] [INFO ] Invariant cache hit.
[2024-05-22 11:35:38] [INFO ] Implicit Places using invariants in 201 ms returned [297]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 208 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 352/353 places, 333/333 transitions.
Applied a total of 0 rules in 13 ms. Remains 352 /352 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 234 ms. Remains : 352/353 places, 333/333 transitions.
RANDOM walk for 40000 steps (2546 resets) in 261 ms. (152 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1915 resets) in 201 ms. (198 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1911 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1915 resets) in 129 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1924 resets) in 166 ms. (239 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1921 resets) in 163 ms. (243 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1921 resets) in 163 ms. (243 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1937 resets) in 145 ms. (273 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1932 resets) in 223 ms. (178 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1916 resets) in 149 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1908 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1954 resets) in 180 ms. (221 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1918 resets) in 146 ms. (272 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1931 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1920 resets) in 220 ms. (181 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 236638 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 14
Probabilistic random walk after 236638 steps, saw 118366 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
// Phase 1: matrix 333 rows 352 cols
[2024-05-22 11:35:42] [INFO ] Computed 49 invariants in 11 ms
[2024-05-22 11:35:42] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 6/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 203/316 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 12/328 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 333/661 variables, 328/377 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 15/392 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 24/685 variables, 24/416 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/685 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/685 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 685/685 variables, and 416 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2252 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 352/352 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 6/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 203/316 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 11:35:45] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 12/328 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 333/661 variables, 328/378 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 15/393 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 6/399 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/661 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 24/685 variables, 24/423 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/685 variables, 8/431 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 11:35:54] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-22 11:35:54] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-22 11:35:54] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-22 11:35:54] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:35:55] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:35:55] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:35:55] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:35:55] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 0 ms to minimize.
[2024-05-22 11:35:55] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:35:56] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/685 variables, 10/441 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 11:35:59] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:35:59] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:35:59] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:35:59] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:35:59] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/685 variables, 5/446 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/685 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 11:36:04] [INFO ] Deduced a trap composed of 68 places in 44 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/685 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/685 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 0/685 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 685/685 variables, and 447 constraints, problems are : Problem set: 0 solved, 14 unsolved in 25420 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 352/352 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 17/17 constraints]
After SMT, in 27711ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 107 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 333/333 transitions.
Applied a total of 0 rules in 13 ms. Remains 352 /352 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 352/352 places, 333/333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 333/333 transitions.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 333/333 (removed 0) transitions.
[2024-05-22 11:36:40] [INFO ] Invariant cache hit.
[2024-05-22 11:36:40] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 11:36:40] [INFO ] Invariant cache hit.
[2024-05-22 11:36:40] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 11:36:41] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned [196, 230, 268, 341, 348]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 1466 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 347/352 places, 333/333 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 347 transition count 333
Applied a total of 2 rules in 16 ms. Remains 347 /347 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 347 cols
[2024-05-22 11:36:41] [INFO ] Computed 44 invariants in 22 ms
[2024-05-22 11:36:41] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-22 11:36:41] [INFO ] Invariant cache hit.
[2024-05-22 11:36:42] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 11:36:43] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 1265 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 347/352 places, 333/333 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2759 ms. Remains : 347/352 places, 333/333 transitions.
RANDOM walk for 40000 steps (2560 resets) in 358 ms. (111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1910 resets) in 140 ms. (283 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1898 resets) in 200 ms. (199 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1891 resets) in 221 ms. (180 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1909 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1915 resets) in 135 ms. (294 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1936 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1930 resets) in 136 ms. (291 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1931 resets) in 149 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1923 resets) in 208 ms. (191 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1896 resets) in 160 ms. (248 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1928 resets) in 143 ms. (277 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1925 resets) in 163 ms. (243 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1922 resets) in 139 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1917 resets) in 184 ms. (216 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 230193 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 14
Probabilistic random walk after 230193 steps, saw 115147 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-22 11:36:47] [INFO ] Invariant cache hit.
[2024-05-22 11:36:47] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 6/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 204/317 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 6/323 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 333/656 variables, 323/367 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/656 variables, 15/382 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/656 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 24/680 variables, 24/406 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/680 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/680 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 680/680 variables, and 406 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2218 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 347/347 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 6/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 204/317 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 11:36:49] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:36:49] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 6/323 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 333/656 variables, 323/369 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/656 variables, 15/384 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/656 variables, 6/390 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/656 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 24/680 variables, 24/414 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/680 variables, 8/422 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 11:36:59] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-22 11:36:59] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-22 11:36:59] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:36:59] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:37:00] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:37:00] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-05-22 11:37:00] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-22 11:37:00] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:37:00] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-05-22 11:37:00] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:37:01] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:37:01] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:37:01] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 0 ms to minimize.
[2024-05-22 11:37:01] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-22 11:37:02] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-22 11:37:02] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-22 11:37:02] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:37:02] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:37:02] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:37:03] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/680 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 11:37:06] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:37:06] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 0 ms to minimize.
[2024-05-22 11:37:07] [INFO ] Deduced a trap composed of 62 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/680 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 11:37:10] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 0 ms to minimize.
[2024-05-22 11:37:10] [INFO ] Deduced a trap composed of 68 places in 47 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/680 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/680 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 0/680 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 680/680 variables, and 447 constraints, problems are : Problem set: 0 solved, 14 unsolved in 26218 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 347/347 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 27/27 constraints]
After SMT, in 28457ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 107 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 333/333 transitions.
Applied a total of 0 rules in 9 ms. Remains 347 /347 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 347/347 places, 333/333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 333/333 transitions.
Applied a total of 0 rules in 8 ms. Remains 347 /347 variables (removed 0) and now considering 333/333 (removed 0) transitions.
[2024-05-22 11:37:45] [INFO ] Invariant cache hit.
[2024-05-22 11:37:45] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-22 11:37:45] [INFO ] Invariant cache hit.
[2024-05-22 11:37:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 11:37:46] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
[2024-05-22 11:37:46] [INFO ] Redundant transitions in 19 ms returned []
Running 332 sub problems to find dead transitions.
[2024-05-22 11:37:46] [INFO ] Invariant cache hit.
[2024-05-22 11:37:46] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/347 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/680 variables, 347/391 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/680 variables, 15/406 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 11:38:04] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:38:04] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:38:04] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:38:04] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/680 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 11:38:09] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-05-22 11:38:09] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-22 11:38:14] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:38:14] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:38:14] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:38:15] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/680 variables, and 416 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 347/347 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/347 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (OVERLAPS) 333/680 variables, 347/401 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/680 variables, 15/416 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/680 variables, 332/748 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 11:38:42] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-22 11:38:43] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:38:45] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:38:45] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:38:46] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/680 variables, and 753 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 347/347 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 15/15 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61277 ms. Remains : 347/347 places, 333/333 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 347 transition count 330
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 344 transition count 330
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 344 transition count 326
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 340 transition count 326
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 340 transition count 325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 339 transition count 325
Applied a total of 16 rules in 26 ms. Remains 339 /347 variables (removed 8) and now considering 325/333 (removed 8) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 325 rows 339 cols
[2024-05-22 11:38:46] [INFO ] Computed 44 invariants in 22 ms
[2024-05-22 11:38:47] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-22 11:38:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 11:38:47] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 12 ms returned sat
[2024-05-22 11:38:49] [INFO ] After 2333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
TRAPS : Iteration 0
[2024-05-22 11:38:50] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-22 11:38:50] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-22 11:38:50] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-05-22 11:38:50] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-05-22 11:38:50] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-22 11:38:50] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:38:50] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
[2024-05-22 11:38:50] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-22 11:38:51] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:38:51] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:38:51] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:38:51] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:38:51] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:38:51] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:38:51] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1434 ms
[2024-05-22 11:38:52] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:38:52] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:38:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2024-05-22 11:38:52] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:38:52] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:38:52] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:38:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 277 ms
[2024-05-22 11:38:52] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:38:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-22 11:38:53] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:38:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-05-22 11:38:53] [INFO ] Deduced a trap composed of 68 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:38:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-05-22 11:38:53] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:38:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-22 11:38:53] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:38:53] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:38:53] [INFO ] Deduced a trap composed of 68 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:38:53] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:38:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 318 ms
[2024-05-22 11:38:54] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:38:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
TRAPS : Iteration 1
[2024-05-22 11:38:58] [INFO ] Deduced a trap composed of 70 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:38:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
TRAPS : Iteration 2
[2024-05-22 11:39:01] [INFO ] After 13651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
[2024-05-22 11:39:05] [INFO ] After 18189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Over-approximation ignoring read arcs solved 0 properties in 18549 ms.
[2024-05-22 11:39:05] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-05-22 11:39:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 347 places, 333 transitions and 1171 arcs took 4 ms.
[2024-05-22 11:39:05] [INFO ] Flatten gal took : 61 ms
Total runtime 278521 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-010

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 1037
MODEL NAME: /home/mcc/execution/414/model
347 places, 333 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
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.
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.
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.
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..
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..
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..
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.
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.
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.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
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.
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.
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..

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DoubleExponent-PT-010"
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-010, 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-171631131300558"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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