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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 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 50K 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-003-ReachabilityCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-06
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-07
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-08
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-12
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-13
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-14
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716375915129

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-003
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:05:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 11:05:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:05:16] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-22 11:05:16] [INFO ] Transformed 163 places.
[2024-05-22 11:05:16] [INFO ] Transformed 148 transitions.
[2024-05-22 11:05:16] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1343 resets) in 1835 ms. (21 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (110 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (116 resets) in 178 ms. (22 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (107 resets) in 78 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (115 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (115 resets) in 71 ms. (55 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (112 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (111 resets) in 45 ms. (86 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (114 resets) in 48 ms. (81 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
BEST_FIRST walk for 4001 steps (115 resets) in 45 ms. (86 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (116 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (113 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (113 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (106 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (112 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 217530 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :3 out of 16
Probabilistic random walk after 217530 steps, saw 108787 distinct states, run finished after 3005 ms. (steps per millisecond=72 ) properties seen :3
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 148 rows 163 cols
[2024-05-22 11:05:20] [INFO ] Computed 19 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-01 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-04 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-05 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-06 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-10 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 9/162 variables, 5/12 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 4/16 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-03 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-13 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 1/163 variables, 3/19 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 148/311 variables, 163/182 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/182 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/182 constraints. Problems are: Problem set: 7 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 182 constraints, problems are : Problem set: 7 solved, 6 unsolved in 1473 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 6 unsolved
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-09 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-15 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 24/156 variables, 5/6 constraints. Problems are: Problem set: 9 solved, 4 unsolved
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-07 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2024-08 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 6/12 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-05-22 11:05:22] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 26 ms to minimize.
[2024-05-22 11:05:22] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/14 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/14 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/163 variables, 7/21 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-05-22 11:05:22] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:05:22] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:05:22] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:05:22] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 4/25 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/25 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 148/311 variables, 163/188 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 2/190 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-05-22 11:05:23] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-22 11:05:23] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 2/192 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-05-22 11:05:23] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 1/193 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 0/193 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/311 variables, 0/193 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 193 constraints, problems are : Problem set: 11 solved, 2 unsolved in 1532 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/13 constraints, Known Traps: 9/9 constraints]
After SMT, in 3190ms problems are : Problem set: 11 solved, 2 unsolved
Parikh walk visited 0 properties in 666 ms.
Support contains 24 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Graph (complete) has 269 edges and 163 vertex of which 160 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (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 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 159 transition count 129
Reduce places removed 18 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 141 transition count 125
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 47 place count 137 transition count 125
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 47 place count 137 transition count 119
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 59 place count 131 transition count 119
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 89 place count 116 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 115 transition count 104
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 115 transition count 101
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 97 place count 112 transition count 101
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 106 place count 112 transition count 92
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 115 place count 103 transition count 92
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 125 place count 103 transition count 92
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 127 place count 103 transition count 92
Applied a total of 127 rules in 73 ms. Remains 103 /163 variables (removed 60) and now considering 92/148 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 103/163 places, 92/148 transitions.
RANDOM walk for 40000 steps (1670 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (1372 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1447 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 645652 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :0 out of 2
Probabilistic random walk after 645652 steps, saw 322918 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
// Phase 1: matrix 92 rows 103 cols
[2024-05-22 11:05:27] [INFO ] Computed 16 invariants in 9 ms
[2024-05-22 11:05:27] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/90 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/96 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 92/188 variables, 96/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/195 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/195 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 103/103 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:05:28] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 56/90 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:05:28] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/96 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 92/188 variables, 96/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 7/195 variables, 7/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:05:28] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:05:28] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
[2024-05-22 11:05:28] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
[2024-05-22 11:05:28] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:05:28] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/195 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/195 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 132 constraints, problems are : Problem set: 0 solved, 2 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 103/103 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 1031ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 888 ms.
Support contains 24 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 103/103 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-22 11:05:29] [INFO ] Invariant cache hit.
[2024-05-22 11:05:29] [INFO ] Implicit Places using invariants in 72 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 102/103 places, 92/92 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 91
Applied a total of 2 rules in 10 ms. Remains 101 /102 variables (removed 1) and now considering 91/92 (removed 1) transitions.
// Phase 1: matrix 91 rows 101 cols
[2024-05-22 11:05:29] [INFO ] Computed 15 invariants in 3 ms
[2024-05-22 11:05:29] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 11:05:29] [INFO ] Invariant cache hit.
[2024-05-22 11:05:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 11:05:30] [INFO ] Implicit Places using invariants and state equation in 127 ms returned [57, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 195 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 99/103 places, 91/92 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 91
Applied a total of 1 rules in 10 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 99 cols
[2024-05-22 11:05:30] [INFO ] Computed 13 invariants in 2 ms
[2024-05-22 11:05:30] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 11:05:30] [INFO ] Invariant cache hit.
[2024-05-22 11:05:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 11:05:30] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 99/103 places, 91/92 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 535 ms. Remains : 99/103 places, 91/92 transitions.
RANDOM walk for 40000 steps (1644 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1382 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1441 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 704547 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :0 out of 2
Probabilistic random walk after 704547 steps, saw 352381 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
[2024-05-22 11:05:33] [INFO ] Invariant cache hit.
[2024-05-22 11:05:33] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/88 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 89/177 variables, 88/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/190 variables, 11/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 117 constraints, problems are : Problem set: 0 solved, 2 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 99/99 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/88 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:05:33] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 89/177 variables, 88/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 13/190 variables, 11/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:05:33] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-22 11:05:33] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:05:33] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 99/99 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 608ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 603 ms.
Support contains 24 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 91/91 transitions.
Applied a total of 0 rules in 11 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 99/99 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-22 11:05:34] [INFO ] Invariant cache hit.
[2024-05-22 11:05:34] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 11:05:34] [INFO ] Invariant cache hit.
[2024-05-22 11:05:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 11:05:34] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-22 11:05:34] [INFO ] Redundant transitions in 1 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-22 11:05:34] [INFO ] Invariant cache hit.
[2024-05-22 11:05:34] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-22 11:05:35] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 2/99 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 91/190 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-22 11:05:36] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:05:36] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:05:36] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:05:36] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:05:36] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:05:37] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:05:37] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 7/125 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 125 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3637 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 99/99 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 2/99 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 91/190 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 90/215 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 215 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3490 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 99/99 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 8/8 constraints]
After SMT, in 7152ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 7154ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7385 ms. Remains : 99/99 places, 91/91 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 98 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 98 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 97 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 96 transition count 88
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 96 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 95 transition count 87
Applied a total of 8 rules in 11 ms. Remains 95 /99 variables (removed 4) and now considering 87/91 (removed 4) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 87 rows 95 cols
[2024-05-22 11:05:41] [INFO ] Computed 13 invariants in 4 ms
[2024-05-22 11:05:42] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:05:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 11:05:42] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2024-05-22 11:05:42] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 11:05:42] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
[2024-05-22 11:05:42] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:05:42] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-22 11:05:42] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-22 11:05:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 174 ms
TRAPS : Iteration 1
[2024-05-22 11:05:42] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-22 11:05:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-22 11:05:42] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
[2024-05-22 11:05:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
TRAPS : Iteration 2
[2024-05-22 11:05:42] [INFO ] After 470ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 11:05:42] [INFO ] After 561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 624 ms.
[2024-05-22 11:05:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-22 11:05:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 99 places, 91 transitions and 325 arcs took 3 ms.
[2024-05-22 11:05:42] [INFO ] Flatten gal took : 35 ms
Total runtime 26475 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-003

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 709
MODEL NAME: /home/mcc/execution/415/model
99 places, 91 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 35 steps.
Creating all event NSFs..
Convergence in 35 steps.
Creating all event NSFs..
Convergence in 35 steps.
Creating all event NSFs..
Convergence in 35 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 70 steps.
Creating all event NSFs..
Convergence in 70 steps.
Creating all event NSFs..
Building monolithic NSF...
Convergence in 70 steps.
Building monolithic NSF...
Creating all event NSFs..
Start RS construction.
Convergence in 70 steps.
Creating all event NSFs..
Start RS construction.
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 124 steps.
Creating all event NSFs..
Convergence in 124 steps.
Creating all event NSFs..
Convergence in 124 steps.
Creating all event NSFs..
Building monolithic NSF...
Convergence in 124 steps.
Creating all event NSFs..
Start RS construction.
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 344 steps.
Convergence in 344 steps.
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 344 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 344 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 564 steps.
Creating all event NSFs..
Building monolithic NSF...
Convergence in 564 steps.
Creating all event NSFs..
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 564 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 564 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1107 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1107 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1107 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1107 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2149 steps.
Creating all event NSFs..
Convergence in 2149 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 2149 steps.
Creating all event NSFs..
Building monolithic NSF...
Convergence in 2149 steps.
Creating all event NSFs..
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 4347 steps.
Creating all event NSFs..
Building monolithic NSF...
Convergence in 4347 steps.
Creating all event NSFs..
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 4347 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 941 steps.
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-12 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716376295432

--------------------
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

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-003"
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-003, 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-171631131300542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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