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-171620398300494.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-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398300494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:35 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 85K 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-06-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716303936022

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:05:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 15:05:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:05:38] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-21 15:05:38] [INFO ] Transformed 376 places.
[2024-05-21 15:05:38] [INFO ] Transformed 297 transitions.
[2024-05-21 15:05:38] [INFO ] Found NUPN structural information;
[2024-05-21 15:05:38] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (413 resets) in 2439 ms. (16 steps per ms) remains 3/14 properties
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (71 resets) in 670 ms. (59 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (65 resets) in 780 ms. (51 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (86 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
// Phase 1: matrix 296 rows 375 cols
[2024-05-21 15:05:39] [INFO ] Computed 81 invariants in 31 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem BusinessProcesses-PT-06-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 233/302 variables, 42/111 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 233/344 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 1/345 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 73/375 variables, 38/383 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 73/456 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/456 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 296/671 variables, 375/831 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/671 variables, 0/831 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/671 variables, 0/831 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 831 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1202 ms.
Refiners :[Domain max(s): 375/375 constraints, Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem BusinessProcesses-PT-06-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 238/301 variables, 42/105 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 238/343 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 1/344 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 15:05:41] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 45 ms to minimize.
[2024-05-21 15:05:41] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:05:41] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:05:42] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:05:42] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:05:42] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:05:42] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:05:42] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:05:42] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:05:42] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-21 15:05:42] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:05:42] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:05:42] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:05:43] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:05:43] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:05:43] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:05:43] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 1 ms to minimize.
[2024-05-21 15:05:43] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:05:43] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2024-05-21 15:05:43] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/364 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 15:05:43] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:05:43] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:05:44] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 1 ms to minimize.
[2024-05-21 15:05:44] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:05:44] [INFO ] Deduced a trap composed of 72 places in 160 ms of which 1 ms to minimize.
[2024-05-21 15:05:44] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 1 ms to minimize.
[2024-05-21 15:05:44] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:05:44] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 2 ms to minimize.
[2024-05-21 15:05:44] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 2 ms to minimize.
[2024-05-21 15:05:45] [INFO ] Deduced a trap composed of 74 places in 174 ms of which 2 ms to minimize.
[2024-05-21 15:05:45] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:05:45] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:05:45] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 3 ms to minimize.
[2024-05-21 15:05:45] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:05:45] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 7 ms to minimize.
[2024-05-21 15:05:45] [INFO ] Deduced a trap composed of 80 places in 184 ms of which 3 ms to minimize.
[2024-05-21 15:05:46] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:05:46] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:05:46] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
SMT process timed out in 6537ms, After SMT, problems are : Problem set: 2 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 296/296 transitions.
Graph (trivial) has 166 edges and 375 vertex of which 4 / 375 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 688 edges and 372 vertex of which 369 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 369 transition count 235
Reduce places removed 55 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 59 rules applied. Total rules applied 117 place count 314 transition count 231
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 121 place count 310 transition count 231
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 121 place count 310 transition count 176
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 237 place count 249 transition count 176
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 271 place count 215 transition count 142
Iterating global reduction 3 with 34 rules applied. Total rules applied 305 place count 215 transition count 142
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 117 rules applied. Total rules applied 422 place count 155 transition count 85
Applied a total of 422 rules in 179 ms. Remains 155 /375 variables (removed 220) and now considering 85/296 (removed 211) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 155/375 places, 85/296 transitions.
RANDOM walk for 40000 steps (1087 resets) in 1100 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (194 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1764157 steps, run timeout after 3001 ms. (steps per millisecond=587 ) properties seen :0 out of 1
Probabilistic random walk after 1764157 steps, saw 319152 distinct states, run finished after 3018 ms. (steps per millisecond=584 ) properties seen :0
// Phase 1: matrix 85 rows 155 cols
[2024-05-21 15:05:49] [INFO ] Computed 71 invariants in 9 ms
[2024-05-21 15:05:49] [INFO ] State equation strengthened by 9 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 88/124 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/154 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/239 variables, 154/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 9/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/240 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/240 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 155/155 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 88/124 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:05:50] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:05:50] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-05-21 15:05:50] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:05:50] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:05:50] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-05-21 15:05:50] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:05:50] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:05:50] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem BusinessProcesses-PT-06-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 154/240 variables, and 79 constraints, problems are : Problem set: 1 solved, 0 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/155 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 973ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 12983 ms.
ITS solved all properties within timeout

BK_STOP 1716303951066

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-06"
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-06, 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-171620398300494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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