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-171662339500870.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 ResAllocation-PT-R020C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662339500870
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 23:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 23:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 23:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 11 23:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 85K 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 ResAllocation-PT-R020C002-ReachabilityCardinality-2024-00
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-2024-01
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-2024-02
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-2024-03
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-2024-04
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-2024-05
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-2024-06
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-2024-07
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-2024-08
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-2024-09
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-2024-10
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-2024-11
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-2024-12
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-2024-13
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-2024-14
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717265324165

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R020C002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:08:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 18:08:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:08:45] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-06-01 18:08:45] [INFO ] Transformed 80 places.
[2024-06-01 18:08:45] [INFO ] Transformed 42 transitions.
[2024-06-01 18:08:45] [INFO ] Found NUPN structural information;
[2024-06-01 18:08:45] [INFO ] Parsed PT model containing 80 places and 42 transitions and 200 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (343 resets) in 1642 ms. (24 steps per ms) remains 6/9 properties
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (63 resets) in 510 ms. (78 steps per ms) remains 4/6 properties
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (63 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (64 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (73 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (68 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
// Phase 1: matrix 42 rows 80 cols
[2024-06-01 18:08:46] [INFO ] Computed 40 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/74 variables, 26/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 27/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 6/80 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 42/122 variables, 80/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 200 constraints, problems are : Problem set: 0 solved, 4 unsolved in 365 ms.
Refiners :[Domain max(s): 80/80 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem ResAllocation-PT-R020C002-ReachabilityCardinality-2024-10 is UNSAT
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 27/74 variables, 26/83 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 27/110 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 18:08:47] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 15 ms to minimize.
[2024-06-01 18:08:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
[2024-06-01 18:08:47] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 18:08:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 18:08:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 18:08:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 18:08:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 18:08:47] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 8/118 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/80 variables, 4/122 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 6/128 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 42/122 variables, 80/208 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 3/211 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/211 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 18:08:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/122 variables, 1/212 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/122 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 212 constraints, problems are : Problem set: 1 solved, 3 unsolved in 612 ms.
Refiners :[Domain max(s): 80/80 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 1040ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 308 ms.
Support contains 22 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 77 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 77 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 75 transition count 39
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 75 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 74 transition count 38
Applied a total of 10 rules in 27 ms. Remains 74 /80 variables (removed 6) and now considering 38/42 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 74/80 places, 38/42 transitions.
RANDOM walk for 40000 steps (418 resets) in 574 ms. (69 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (84 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (87 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1406200 steps, run timeout after 3001 ms. (steps per millisecond=468 ) properties seen :0 out of 2
Probabilistic random walk after 1406200 steps, saw 304299 distinct states, run finished after 3008 ms. (steps per millisecond=467 ) properties seen :0
// Phase 1: matrix 38 rows 74 cols
[2024-06-01 18:08:51] [INFO ] Computed 38 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/48 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 27/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/54 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 32/86 variables, 54/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 16/102 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 12/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 6/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 10/112 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/112 variables, 8/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/112 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/112 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/112 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 186 constraints, problems are : Problem set: 0 solved, 2 unsolved in 163 ms.
Refiners :[Domain max(s): 74/74 constraints, Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 74/74 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/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/48 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 27/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 18:08:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 18:08:51] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 18:08:51] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/54 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/86 variables, 54/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 16/102 variables, 12/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 12/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 18:08:51] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 10/112 variables, 8/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/112 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/112 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 18:08:51] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/112 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/112 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/112 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 193 constraints, problems are : Problem set: 0 solved, 2 unsolved in 402 ms.
Refiners :[Domain max(s): 74/74 constraints, Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 576ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 87 ms.
Support contains 21 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 74/74 places, 38/38 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 38/38 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-06-01 18:08:51] [INFO ] Invariant cache hit.
[2024-06-01 18:08:51] [INFO ] Implicit Places using invariants in 99 ms returned [37, 39, 41, 45, 47, 49, 51, 53, 57, 61, 63, 65, 67, 69, 71]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 108 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/74 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 113 ms. Remains : 59/74 places, 38/38 transitions.
RANDOM walk for 40000 steps (415 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (84 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (88 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1519529 steps, run timeout after 3001 ms. (steps per millisecond=506 ) properties seen :0 out of 2
Probabilistic random walk after 1519529 steps, saw 338627 distinct states, run finished after 3001 ms. (steps per millisecond=506 ) properties seen :0
// Phase 1: matrix 38 rows 59 cols
[2024-06-01 18:08:54] [INFO ] Computed 23 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/43 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/44 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 32/76 variables, 44/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 13/89 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/89 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/97 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/97 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/97 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/97 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/97 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 141 constraints, problems are : Problem set: 0 solved, 2 unsolved in 123 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 59/59 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/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/43 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 18:08:55] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 18:08:55] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 18:08:55] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/44 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/76 variables, 44/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/89 variables, 9/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 9/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/89 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/89 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/97 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/97 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/97 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/97 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/97 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 146 constraints, problems are : Problem set: 0 solved, 2 unsolved in 216 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 352ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 85 ms.
Support contains 21 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 59/59 places, 38/38 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-06-01 18:08:55] [INFO ] Invariant cache hit.
[2024-06-01 18:08:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 18:08:55] [INFO ] Invariant cache hit.
[2024-06-01 18:08:55] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-06-01 18:08:55] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-06-01 18:08:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 18:08:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 18:08:55] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 18:08:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 18:08:55] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 18:08:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 18:08:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 18:08:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 18:08:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 18:08:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 18:08:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 18:08:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 18:08:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 18:08:56] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 18:08:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 18:08:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 18:08:56] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 38/97 variables, 59/157 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 157 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1049 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 38/97 variables, 59/157 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 36/193 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 0/97 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 193 constraints, problems are : Problem set: 0 solved, 36 unsolved in 851 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 16/16 constraints]
After SMT, in 1914ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1914ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2011 ms. Remains : 59/59 places, 38/38 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 58 transition count 38
Applied a total of 1 rules in 7 ms. Remains 58 /59 variables (removed 1) and now considering 38/38 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 38 rows 58 cols
[2024-06-01 18:08:57] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 18:08:57] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 18:08:57] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2024-06-01 18:08:57] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 18:08:57] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 18:08:57] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 148 ms.
[2024-06-01 18:08:57] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-06-01 18:08:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 59 places, 38 transitions and 156 arcs took 3 ms.
[2024-06-01 18:08:57] [INFO ] Flatten gal took : 22 ms
Total runtime 12489 ms.
There are residual formulas that ITS could not solve within timeout
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 : ResAllocation-PT-R020C002-ReachabilityCardinality-2024-02
Could not compute solution for formula : ResAllocation-PT-R020C002-ReachabilityCardinality-2024-08

BK_STOP 1717265337961

--------------------
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
mcc2024
rfs formula name ResAllocation-PT-R020C002-ReachabilityCardinality-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/643/inv_0_
rfs formula name ResAllocation-PT-R020C002-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/643/inv_1_
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="ResAllocation-PT-R020C002"
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 ResAllocation-PT-R020C002, 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-171662339500870"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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