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.r047-tajo-171620398500558.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 greatspnxred
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 r047-tajo-171620398500558
=====================================================================

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

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:53:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 15:53:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:53:40] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-21 15:53:40] [INFO ] Transformed 624 places.
[2024-05-21 15:53:40] [INFO ] Transformed 564 transitions.
[2024-05-21 15:53:40] [INFO ] Found NUPN structural information;
[2024-05-21 15:53:40] [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 23 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 (271 resets) in 2072 ms. (19 steps per ms) remains 9/13 properties
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 40003 steps (48 resets) in 189 ms. (210 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 389 ms. (102 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (47 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (61 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 122 ms. (325 steps per ms) remains 8/9 properties
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (46 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (53 resets) in 514 ms. (77 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (44 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
// Phase 1: matrix 556 rows 616 cols
[2024-05-21 15:53:42] [INFO ] Computed 99 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 419/469 variables, 54/104 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 419/523 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 24/493 variables, 6/529 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 24/553 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 122/615 variables, 38/591 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 122/713 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/616 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/616 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/616 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 556/1172 variables, 616/1331 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1172 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/1172 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1172/1172 variables, and 1331 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1176 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: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 419/469 variables, 54/104 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 419/523 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 15:53:43] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 30 ms to minimize.
[2024-05-21 15:53:43] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:53:45] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 4 ms to minimize.
[2024-05-21 15:53:45] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:53:45] [INFO ] Deduced a trap composed of 135 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:53:45] [INFO ] Deduced a trap composed of 143 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 20/543 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 15:53:45] [INFO ] Deduced a trap composed of 134 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:53:45] [INFO ] Deduced a trap composed of 134 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:53:45] [INFO ] Deduced a trap composed of 137 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:53:45] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:53:45] [INFO ] Deduced a trap composed of 131 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:53:46] [INFO ] Deduced a trap composed of 138 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:53:46] [INFO ] Deduced a trap composed of 135 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:53:46] [INFO ] Deduced a trap composed of 144 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:53:46] [INFO ] Deduced a trap composed of 139 places in 79 ms of which 3 ms to minimize.
[2024-05-21 15:53:46] [INFO ] Deduced a trap composed of 142 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:53:46] [INFO ] Deduced a trap composed of 140 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:53:46] [INFO ] Deduced a trap composed of 130 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:53:46] [INFO ] Deduced a trap composed of 147 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:53:46] [INFO ] Deduced a trap composed of 141 places in 125 ms of which 4 ms to minimize.
[2024-05-21 15:53:47] [INFO ] Deduced a trap composed of 136 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:53:47] [INFO ] Deduced a trap composed of 129 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:53:47] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:53:47] [INFO ] Deduced a trap composed of 141 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:53:47] [INFO ] Deduced a trap composed of 139 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:53:47] [INFO ] Deduced a trap composed of 143 places in 114 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 20/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 15:53:47] [INFO ] Deduced a trap composed of 140 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:53:47] [INFO ] Deduced a trap composed of 135 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:53:48] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 4 ms to minimize.
[2024-05-21 15:53:48] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:53:48] [INFO ] Deduced a trap composed of 136 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:53:48] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
SMT process timed out in 6362ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 301 edges and 616 vertex of which 4 / 616 are part of one of the 1 SCC in 4 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 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 607 transition count 445
Reduce places removed 106 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 116 rules applied. Total rules applied 224 place count 501 transition count 435
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 234 place count 491 transition count 435
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 234 place count 491 transition count 348
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 420 place count 392 transition count 348
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 490 place count 322 transition count 278
Iterating global reduction 3 with 70 rules applied. Total rules applied 560 place count 322 transition count 278
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 560 place count 322 transition count 274
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 568 place count 318 transition count 274
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 720 place count 241 transition count 199
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 724 place count 241 transition count 195
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 728 place count 237 transition count 195
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 734 place count 237 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 735 place count 236 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 736 place count 235 transition count 194
Applied a total of 736 rules in 194 ms. Remains 235 /616 variables (removed 381) and now considering 194/556 (removed 362) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 235/616 places, 194/556 transitions.
RANDOM walk for 40000 steps (672 resets) in 893 ms. (44 steps per ms) remains 4/8 properties
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-15 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 (126 resets) in 136 ms. (292 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (138 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (121 resets) in 138 ms. (287 steps per ms) remains 3/4 properties
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
// Phase 1: matrix 194 rows 235 cols
[2024-05-21 15:53:49] [INFO ] Computed 79 invariants in 4 ms
[2024-05-21 15:53:49] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 147/187 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/191 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 39/230 variables, 25/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 193/423 variables, 230/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 5/428 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/429 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/429 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 315 constraints, problems are : Problem set: 0 solved, 3 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 235/235 constraints, ReadFeed: 1/1 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/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 147/187 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:53:49] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:53:49] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:53:49] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:53:49] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:53:49] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:53:49] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:53:49] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:53:49] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:53:49] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 8 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 61 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 60 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 60 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 62 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 66 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 60 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 2 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 2 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 2 ms to minimize.
[2024-05-21 15:53:51] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:53:52] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:53:52] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:53:52] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:53:52] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:53:52] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 2 ms to minimize.
[2024-05-21 15:53:52] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 16/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:53:52] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:53:52] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:53:52] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:53:52] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:53:52] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/191 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:53:52] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:53:52] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:53:53] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 2 ms to minimize.
[2024-05-21 15:53:53] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:53:53] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:53:53] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:53:53] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:53:53] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 2 ms to minimize.
[2024-05-21 15:53:53] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 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 13 (OVERLAPS) 39/230 variables, 25/144 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/144 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 193/423 variables, 230/374 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 1/375 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 1/376 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 15:53:53] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/423 variables, 1/377 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/423 variables, 0/377 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/428 variables, 4/381 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/428 variables, 1/382 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/428 variables, 0/382 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem BusinessProcesses-PT-14-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 429/429 variables, and 383 constraints, problems are : Problem set: 3 solved, 0 unsolved in 4231 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 235/235 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 67/67 constraints]
After SMT, in 4505ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 13123 ms.
ITS solved all properties within timeout

BK_STOP 1716306833713

--------------------
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="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is 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 r047-tajo-171620398500558"
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 ;