Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399800559.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BusinessProcesses-PT-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800559
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 156K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717225878437

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:11:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:11:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:11:19] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-06-01 07:11:19] [INFO ] Transformed 624 places.
[2024-06-01 07:11:19] [INFO ] Transformed 564 transitions.
[2024-06-01 07:11:19] [INFO ] Found NUPN structural information;
[2024-06-01 07:11:19] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 24 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (269 resets) in 1521 ms. (26 steps per ms) remains 5/15 properties
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (43 resets) in 227 ms. (175 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (46 resets) in 269 ms. (148 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (53 resets) in 600 ms. (66 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (47 resets) in 658 ms. (60 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (45 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
// Phase 1: matrix 556 rows 616 cols
[2024-06-01 07:11:21] [INFO ] Computed 99 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 432/503 variables, 60/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 432/563 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 112/615 variables, 37/601 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 112/713 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/616 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/616 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 556/1172 variables, 616/1331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1172 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1172 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1172/1172 variables, and 1331 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1607 ms.
Refiners :[Domain max(s): 616/616 constraints, Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 616/616 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 432/503 variables, 60/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 432/563 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 38 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 14 places in 341 ms of which 4 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 5 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 10 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 126 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 123 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 117 places in 182 ms of which 4 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 120 places in 211 ms of which 7 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 116 places in 260 ms of which 19 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 22 places in 271 ms of which 8 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 6 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/584 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 119 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 134 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
SMT process timed out in 6865ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (complete) has 1260 edges and 616 vertex of which 610 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 610 transition count 481
Reduce places removed 74 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 80 rules applied. Total rules applied 155 place count 536 transition count 475
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 161 place count 530 transition count 475
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 161 place count 530 transition count 355
Deduced a syphon composed of 120 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 414 place count 397 transition count 355
Discarding 72 places :
Symmetric choice reduction at 3 with 72 rule applications. Total rules 486 place count 325 transition count 283
Iterating global reduction 3 with 72 rules applied. Total rules applied 558 place count 325 transition count 283
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 558 place count 325 transition count 280
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 566 place count 320 transition count 280
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 7 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 708 place count 249 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 709 place count 249 transition count 208
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 710 place count 249 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 711 place count 248 transition count 207
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 716 place count 248 transition count 207
Applied a total of 716 rules in 167 ms. Remains 248 /616 variables (removed 368) and now considering 207/556 (removed 349) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 248/616 places, 207/556 transitions.
RANDOM walk for 40000 steps (984 resets) in 953 ms. (41 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (225 resets) in 283 ms. (140 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (214 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (230 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (217 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (204 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 861382 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :2 out of 5
Probabilistic random walk after 861382 steps, saw 149970 distinct states, run finished after 3007 ms. (steps per millisecond=286 ) properties seen :2
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 207 rows 248 cols
[2024-06-01 07:11:31] [INFO ] Computed 79 invariants in 5 ms
[2024-06-01 07:11:31] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 163/199 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 45/244 variables, 23/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/245 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 207/452 variables, 245/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/455 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/455 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 329 constraints, problems are : Problem set: 0 solved, 3 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 248/248 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 163/199 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 5 places in 856 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 4 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 5 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 45/244 variables, 23/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/245 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 207/452 variables, 245/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/452 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/452 variables, 8/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/452 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/452 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/452 variables, 5/400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/452 variables, 4/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/452 variables, 2/406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/452 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 3/455 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/455 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/455 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/455 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/455 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/455 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 414 constraints, problems are : Problem set: 0 solved, 3 unsolved in 8039 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 248/248 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 82/82 constraints]
After SMT, in 8365ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 269 ms.
Support contains 18 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 207/207 transitions.
Graph (trivial) has 44 edges and 248 vertex of which 2 / 248 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 247 transition count 197
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 239 transition count 197
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 17 place count 239 transition count 184
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 47 place count 222 transition count 184
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 216 transition count 178
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 216 transition count 178
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 111 place count 189 transition count 153
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 114 place count 189 transition count 150
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 186 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 185 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 184 transition count 149
Applied a total of 119 rules in 106 ms. Remains 184 /248 variables (removed 64) and now considering 149/207 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 184/248 places, 149/207 transitions.
RANDOM walk for 40000 steps (1465 resets) in 192 ms. (207 steps per ms) remains 1/2 properties
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 38439 steps (340 resets) in 116 ms. (328 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 21162 ms.
ITS solved all properties within timeout

BK_STOP 1717225900767

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-14"
export BK_EXAMINATION="ReachabilityFireability"
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 BusinessProcesses-PT-14, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399800559"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;