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.r520-tall-171662338400350.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is RERS2020-PT-pb103, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662338400350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 18M May 18 16:43 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 RERS2020-PT-pb103-ReachabilityCardinality-2023-00
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-2024-01
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-2024-02
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-2024-03
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-2024-04
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-2024-05
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-2024-06
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-2024-07
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-2024-08
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-2023-09
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-2024-10
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-2024-11
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-2024-12
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-2024-13
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-2024-14
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717253700222

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb103
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:55:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:55:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:55:02] [INFO ] Load time of PNML (sax parser for PT used): 777 ms
[2024-06-01 14:55:02] [INFO ] Transformed 520 places.
[2024-06-01 14:55:02] [INFO ] Transformed 31658 transitions.
[2024-06-01 14:55:02] [INFO ] Found NUPN structural information;
[2024-06-01 14:55:02] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 997 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3019 ms. (13 steps per ms) remains 8/13 properties
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 342 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 382 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (11 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 330 ms. (120 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 277 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
[2024-06-01 14:55:04] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 520 cols
[2024-06-01 14:55:04] [INFO ] Computed 15 invariants in 133 ms
[2024-06-01 14:55:04] [INFO ] State equation strengthened by 1379 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 444/513 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 444/521 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 7/520 variables, 7/528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 7/535 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 19193/19194 variables, and 1055 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5058 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 520/520 constraints, ReadFeed: 0/1379 constraints, PredecessorRefiner: 8/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 444/513 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 444/521 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 14:55:12] [INFO ] Deduced a trap composed of 53 places in 2081 ms of which 30 ms to minimize.
[2024-06-01 14:55:14] [INFO ] Deduced a trap composed of 50 places in 1817 ms of which 3 ms to minimize.
[2024-06-01 14:55:16] [INFO ] Deduced a trap composed of 130 places in 1819 ms of which 3 ms to minimize.
SMT process timed out in 11883ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 69 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1069 rules applied. Total rules applied 1069 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1071 place count 512 transition count 27378
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 1079 place count 512 transition count 27370
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 1159 place count 504 transition count 27298
Applied a total of 1159 rules in 588 ms. Remains 504 /520 variables (removed 16) and now considering 27298/28429 (removed 1131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 605 ms. Remains : 504/520 places, 27298/28429 transitions.
RANDOM walk for 40000 steps (8 resets) in 1202 ms. (33 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 187 ms. (212 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 31905 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 8
Probabilistic random walk after 31905 steps, saw 22631 distinct states, run finished after 3005 ms. (steps per millisecond=10 ) properties seen :0
[2024-06-01 14:55:20] [INFO ] Flow matrix only has 18618 transitions (discarded 8680 similar events)
// Phase 1: matrix 18618 rows 504 cols
[2024-06-01 14:55:20] [INFO ] Computed 8 invariants in 82 ms
[2024-06-01 14:55:20] [INFO ] State equation strengthened by 1373 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 435/504 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 435/512 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 18618/19122 variables, 504/1016 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19122 variables, 1373/2389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19122 variables, 0/2389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/19122 variables, 0/2389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19122/19122 variables, and 2389 constraints, problems are : Problem set: 0 solved, 8 unsolved in 9397 ms.
Refiners :[Domain max(s): 504/504 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 504/504 constraints, ReadFeed: 1373/1373 constraints, PredecessorRefiner: 8/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 435/504 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 435/512 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 14:55:32] [INFO ] Deduced a trap composed of 73 places in 2158 ms of which 6 ms to minimize.
[2024-06-01 14:55:34] [INFO ] Deduced a trap composed of 52 places in 2089 ms of which 3 ms to minimize.
[2024-06-01 14:55:36] [INFO ] Deduced a trap composed of 102 places in 1838 ms of which 3 ms to minimize.
[2024-06-01 14:55:38] [INFO ] Deduced a trap composed of 129 places in 1920 ms of which 3 ms to minimize.
[2024-06-01 14:55:40] [INFO ] Deduced a trap composed of 94 places in 1741 ms of which 3 ms to minimize.
[2024-06-01 14:55:42] [INFO ] Deduced a trap composed of 50 places in 1765 ms of which 3 ms to minimize.
[2024-06-01 14:55:44] [INFO ] Deduced a trap composed of 150 places in 2066 ms of which 3 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 48 places in 1980 ms of which 3 ms to minimize.
[2024-06-01 14:55:48] [INFO ] Deduced a trap composed of 21 places in 1752 ms of which 3 ms to minimize.
Problem RERS2020-PT-pb103-ReachabilityCardinality-2023-00 is UNSAT
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-2023-00 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 14:55:50] [INFO ] Deduced a trap composed of 92 places in 2133 ms of which 3 ms to minimize.
[2024-06-01 14:55:52] [INFO ] Deduced a trap composed of 61 places in 2039 ms of which 3 ms to minimize.
[2024-06-01 14:55:54] [INFO ] Deduced a trap composed of 22 places in 2070 ms of which 3 ms to minimize.
[2024-06-01 14:55:56] [INFO ] Deduced a trap composed of 105 places in 2021 ms of which 4 ms to minimize.
[2024-06-01 14:55:58] [INFO ] Deduced a trap composed of 12 places in 2138 ms of which 3 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 64 places in 2160 ms of which 3 ms to minimize.
Problem RERS2020-PT-pb103-ReachabilityCardinality-2024-02 is UNSAT
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem RERS2020-PT-pb103-ReachabilityCardinality-2024-03 is UNSAT
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 14:56:02] [INFO ] Deduced a trap composed of 85 places in 1192 ms of which 2 ms to minimize.
[2024-06-01 14:56:03] [INFO ] Deduced a trap composed of 26 places in 1250 ms of which 2 ms to minimize.
Problem RERS2020-PT-pb103-ReachabilityCardinality-2024-05 is UNSAT
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem RERS2020-PT-pb103-ReachabilityCardinality-2024-13 is UNSAT
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 14:56:05] [INFO ] Deduced a trap composed of 59 places in 2123 ms of which 3 ms to minimize.
[2024-06-01 14:56:07] [INFO ] Deduced a trap composed of 52 places in 2146 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 19/531 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 0/531 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 18618/19122 variables, 504/1035 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 19122/19122 variables, and 2408 constraints, problems are : Problem set: 5 solved, 3 unsolved in 45027 ms.
Refiners :[Domain max(s): 504/504 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 504/504 constraints, ReadFeed: 1373/1373 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 19/19 constraints]
After SMT, in 54955ms problems are : Problem set: 5 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 27298/27298 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 503 transition count 27297
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 503 transition count 27295
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 15 place count 501 transition count 27286
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 501 transition count 27466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 500 transition count 27466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 499 transition count 27465
Applied a total of 18 rules in 677 ms. Remains 499 /504 variables (removed 5) and now considering 27465/27298 (removed -167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 677 ms. Remains : 499/504 places, 27465/27298 transitions.
RANDOM walk for 40000 steps (10 resets) in 1177 ms. (33 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 35464 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :0 out of 3
Probabilistic random walk after 35464 steps, saw 25278 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
[2024-06-01 14:56:19] [INFO ] Flow matrix only has 18737 transitions (discarded 8728 similar events)
// Phase 1: matrix 18737 rows 499 cols
[2024-06-01 14:56:19] [INFO ] Computed 8 invariants in 68 ms
[2024-06-01 14:56:20] [INFO ] State equation strengthened by 1376 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 462/499 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 462/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 18737/19236 variables, 499/1006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19236 variables, 1376/2382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19236 variables, 0/2382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/19236 variables, 0/2382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19236/19236 variables, and 2382 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7644 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 499/499 constraints, ReadFeed: 1376/1376 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 462/499 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 462/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:56:29] [INFO ] Deduced a trap composed of 49 places in 1687 ms of which 3 ms to minimize.
[2024-06-01 14:56:31] [INFO ] Deduced a trap composed of 51 places in 2096 ms of which 2 ms to minimize.
[2024-06-01 14:56:33] [INFO ] Deduced a trap composed of 93 places in 1403 ms of which 3 ms to minimize.
[2024-06-01 14:56:34] [INFO ] Deduced a trap composed of 101 places in 1786 ms of which 3 ms to minimize.
[2024-06-01 14:56:36] [INFO ] Deduced a trap composed of 148 places in 1732 ms of which 3 ms to minimize.
[2024-06-01 14:56:38] [INFO ] Deduced a trap composed of 20 places in 1780 ms of which 4 ms to minimize.
[2024-06-01 14:56:40] [INFO ] Deduced a trap composed of 56 places in 2063 ms of which 4 ms to minimize.
[2024-06-01 14:56:43] [INFO ] Deduced a trap composed of 84 places in 2247 ms of which 3 ms to minimize.
[2024-06-01 14:56:45] [INFO ] Deduced a trap composed of 58 places in 2221 ms of which 3 ms to minimize.
[2024-06-01 14:56:47] [INFO ] Deduced a trap composed of 56 places in 2196 ms of which 3 ms to minimize.
[2024-06-01 14:56:49] [INFO ] Deduced a trap composed of 133 places in 2053 ms of which 3 ms to minimize.
[2024-06-01 14:56:51] [INFO ] Deduced a trap composed of 91 places in 2085 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 12/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:56:53] [INFO ] Deduced a trap composed of 14 places in 1815 ms of which 4 ms to minimize.
[2024-06-01 14:56:55] [INFO ] Deduced a trap composed of 11 places in 1832 ms of which 3 ms to minimize.
[2024-06-01 14:56:57] [INFO ] Deduced a trap composed of 132 places in 2154 ms of which 3 ms to minimize.
[2024-06-01 14:56:59] [INFO ] Deduced a trap composed of 32 places in 2100 ms of which 4 ms to minimize.
[2024-06-01 14:57:01] [INFO ] Deduced a trap composed of 60 places in 1988 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 5/524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:57:04] [INFO ] Deduced a trap composed of 114 places in 2088 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 18737/19236 variables, 499/1024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 19236/19236 variables, and 2400 constraints, problems are : Problem set: 0 solved, 3 unsolved in 75032 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 499/499 constraints, ReadFeed: 1376/1376 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 18/18 constraints]
After SMT, in 83087ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 27465/27465 transitions.
Applied a total of 0 rules in 124 ms. Remains 499 /499 variables (removed 0) and now considering 27465/27465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 499/499 places, 27465/27465 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 27465/27465 transitions.
Applied a total of 0 rules in 123 ms. Remains 499 /499 variables (removed 0) and now considering 27465/27465 (removed 0) transitions.
[2024-06-01 14:57:43] [INFO ] Flow matrix only has 18737 transitions (discarded 8728 similar events)
[2024-06-01 14:57:43] [INFO ] Invariant cache hit.
[2024-06-01 14:57:43] [INFO ] Implicit Places using invariants in 944 ms returned []
Implicit Place search using SMT only with invariants took 951 ms to find 0 implicit places.
Running 27461 sub problems to find dead transitions.
[2024-06-01 14:57:44] [INFO ] Flow matrix only has 18737 transitions (discarded 8728 similar events)
[2024-06-01 14:57:44] [INFO ] Invariant cache hit.
[2024-06-01 14:57:44] [INFO ] State equation strengthened by 1376 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2023-00
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2024-01
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2024-02
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2024-03
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2024-04
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2024-05
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2024-06
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2024-07
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2024-08
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2023-09
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2024-10
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2024-11
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2024-12
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2024-13
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2024-14
Could not compute solution for formula : RERS2020-PT-pb103-ReachabilityCardinality-2024-15

BK_STOP 1717253969146

--------------------
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
mcc2024
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2023-00
rfs formula type EF
rfs formula formula --invariant=/tmp/647/inv_0_
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/647/inv_1_
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/647/inv_2_
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/647/inv_3_
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/647/inv_4_
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/647/inv_5_
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/647/inv_6_
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/647/inv_7_
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/647/inv_8_
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2023-09
rfs formula type AG
rfs formula formula --invariant=/tmp/647/inv_9_
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/647/inv_10_
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/647/inv_11_
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/647/inv_12_
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/647/inv_13_
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/647/inv_14_
rfs formula name RERS2020-PT-pb103-ReachabilityCardinality-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/647/inv_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is RERS2020-PT-pb103, 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 r520-tall-171662338400350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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