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-171620399800558.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800558
=====================================================================

--------------------
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-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717225874373

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
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:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:11:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:11:15] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-01 07:11:15] [INFO ] Transformed 624 places.
[2024-06-01 07:11:15] [INFO ] Transformed 564 transitions.
[2024-06-01 07:11:15] [INFO ] Found NUPN structural information;
[2024-06-01 07:11:15] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (268 resets) in 1660 ms. (24 steps per ms) remains 10/13 properties
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (46 resets) in 444 ms. (89 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (42 resets) in 482 ms. (82 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (46 resets) in 310 ms. (128 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (61 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (45 resets) in 193 ms. (206 steps per ms) remains 9/10 properties
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (48 resets) in 313 ms. (127 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (54 resets) in 492 ms. (81 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
// Phase 1: matrix 556 rows 616 cols
[2024-06-01 07:11:17] [INFO ] Computed 99 invariants in 48 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 422/476 variables, 55/109 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 422/531 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 19/495 variables, 5/536 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 19/555 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 121/616 variables, 39/594 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/616 variables, 121/715 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 556/1172 variables, 616/1331 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1172 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/1172 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1172/1172 variables, and 1331 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1469 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: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 422/476 variables, 55/109 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 422/531 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 21 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 10 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 116 places in 164 ms of which 5 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 130 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 140 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 120 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 113 places in 509 ms of which 2 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 136 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 118 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 20/551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 143 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 143 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 140 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 127 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 143 places in 178 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 130 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 137 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 142 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 123 places in 94 ms of which 2 ms to minimize.
SMT process timed out in 6623ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 299 edges and 616 vertex of which 4 / 616 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1256 edges and 613 vertex of which 607 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 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 607 transition count 446
Reduce places removed 105 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 116 rules applied. Total rules applied 223 place count 502 transition count 435
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 234 place count 491 transition count 435
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 234 place count 491 transition count 350
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 181 rules applied. Total rules applied 415 place count 395 transition count 350
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 485 place count 325 transition count 280
Iterating global reduction 3 with 70 rules applied. Total rules applied 555 place count 325 transition count 280
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 555 place count 325 transition count 276
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 563 place count 321 transition count 276
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 713 place count 245 transition count 202
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 717 place count 245 transition count 198
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 721 place count 241 transition count 198
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 727 place count 241 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 728 place count 240 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 729 place count 239 transition count 197
Applied a total of 729 rules in 144 ms. Remains 239 /616 variables (removed 377) and now considering 197/556 (removed 359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 239/616 places, 197/556 transitions.
RANDOM walk for 40000 steps (668 resets) in 771 ms. (51 steps per ms) remains 5/9 properties
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (127 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (136 resets) in 116 ms. (341 steps per ms) remains 4/5 properties
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (122 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 4/4 properties
// Phase 1: matrix 197 rows 239 cols
[2024-06-01 07:11:24] [INFO ] Computed 80 invariants in 7 ms
[2024-06-01 07:11:24] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 153/195 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/199 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 35/234 variables, 26/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 196/430 variables, 234/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/435 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/436 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/436 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 320 constraints, problems are : Problem set: 0 solved, 4 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 239/239 constraints, ReadFeed: 1/1 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/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 153/195 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 4 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 5 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 3 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 4/199 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 66 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem BusinessProcesses-PT-14-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-14-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 35/234 variables, 26/155 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 196/430 variables, 234/389 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 1/390 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 2/392 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 5/397 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 0/397 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 5/435 variables, 4/401 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/435 variables, 1/402 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/435 variables, 1/403 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 0/403 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/436 variables, 1/404 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-14-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/436 variables, 8/412 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/436 variables, 0/412 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/436 variables, 0/412 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 412 constraints, problems are : Problem set: 3 solved, 1 unsolved in 6455 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 239/239 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 90/90 constraints]
After SMT, in 6966ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 2047 steps, including 43 resets, run visited all 1 properties in 7 ms. (steps per millisecond=292 )
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 11 ms.
All properties solved without resorting to model-checking.
Total runtime 16094 ms.
ITS solved all properties within timeout

BK_STOP 1717225891818

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-14"
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 BusinessProcesses-PT-14, 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 r472-tajo-171620399800558"
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 [ "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 ;