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

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

=== Now, execution of the tool begins

BK_START 1716303967670

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
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:06:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:06:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:06:09] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-21 15:06:09] [INFO ] Transformed 376 places.
[2024-05-21 15:06:09] [INFO ] Transformed 297 transitions.
[2024-05-21 15:06:09] [INFO ] Found NUPN structural information;
[2024-05-21 15:06:09] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
RANDOM walk for 40000 steps (405 resets) in 1646 ms. (24 steps per ms) remains 7/16 properties
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (71 resets) in 434 ms. (91 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (74 resets) in 218 ms. (182 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (86 resets) in 372 ms. (107 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (96 resets) in 916 ms. (43 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (92 resets) in 212 ms. (187 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (64 resets) in 944 ms. (42 steps per ms) remains 6/7 properties
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (45 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
// Phase 1: matrix 296 rows 375 cols
[2024-05-21 15:06:10] [INFO ] Computed 81 invariants in 28 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem BusinessProcesses-PT-06-ReachabilityFireability-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 207/304 variables, 42/139 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 207/346 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/346 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 71/375 variables, 39/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 71/456 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/456 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 296/671 variables, 375/831 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/671 variables, 0/831 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/671 variables, 0/831 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 831 constraints, problems are : Problem set: 1 solved, 5 unsolved in 970 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: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem BusinessProcesses-PT-06-ReachabilityFireability-2024-04 is UNSAT
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-06-ReachabilityFireability-2024-15 is UNSAT
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 212/303 variables, 42/133 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 212/345 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 15:06:12] [INFO ] Deduced a trap composed of 72 places in 148 ms of which 18 ms to minimize.
[2024-05-21 15:06:12] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:06:12] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 14 ms to minimize.
[2024-05-21 15:06:12] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:06:12] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:06:13] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 13 ms to minimize.
[2024-05-21 15:06:13] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 3 ms to minimize.
[2024-05-21 15:06:13] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:06:13] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:06:13] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:06:13] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:06:13] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:06:13] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:06:13] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:06:13] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:06:13] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:06:14] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:06:14] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:06:14] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 1 ms to minimize.
[2024-05-21 15:06:14] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 20/365 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 15:06:14] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:06:14] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:06:14] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 15 ms to minimize.
[2024-05-21 15:06:14] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:06:14] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:06:14] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:06:14] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:06:14] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:06:15] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:06:15] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:06:15] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:06:15] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:06:15] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:06:15] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:06:15] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:06:15] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 4 ms to minimize.
[2024-05-21 15:06:15] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:06:15] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:06:16] [INFO ] Deduced a trap composed of 72 places in 601 ms of which 2 ms to minimize.
[2024-05-21 15:06:16] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 20/385 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 15:06:16] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:06:16] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 2 ms to minimize.
[2024-05-21 15:06:16] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:06:16] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:06:16] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:06:17] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 2 ms to minimize.
SMT process timed out in 6138ms, After SMT, problems are : Problem set: 3 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 296/296 transitions.
Graph (complete) has 692 edges and 375 vertex of which 372 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 372 transition count 265
Reduce places removed 29 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 36 rules applied. Total rules applied 67 place count 343 transition count 258
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 74 place count 336 transition count 258
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 74 place count 336 transition count 197
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 200 place count 271 transition count 197
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 232 place count 239 transition count 165
Iterating global reduction 3 with 32 rules applied. Total rules applied 264 place count 239 transition count 165
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 354 place count 194 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 355 place count 194 transition count 119
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 356 place count 194 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 357 place count 193 transition count 118
Applied a total of 357 rules in 113 ms. Remains 193 /375 variables (removed 182) and now considering 118/296 (removed 178) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 193/375 places, 118/296 transitions.
RANDOM walk for 40000 steps (993 resets) in 355 ms. (112 steps per ms) remains 2/3 properties
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (291 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (278 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
// Phase 1: matrix 118 rows 193 cols
[2024-05-21 15:06:17] [INFO ] Computed 76 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/151 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/155 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/192 variables, 35/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 118/310 variables, 192/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/311 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/311 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 269 constraints, problems are : Problem set: 0 solved, 2 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/151 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:06:17] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:06:17] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:06:17] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:06:17] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 2 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 5 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-21 15:06:18] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:06:19] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/155 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:06:20] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem BusinessProcesses-PT-06-ReachabilityFireability-2024-08 is UNSAT
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 37/192 variables, 35/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 118/310 variables, 192/312 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 1/313 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:06:20] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 1/314 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/310 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/311 variables, 1/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:06:20] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:06:20] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-06-ReachabilityFireability-2024-11 is UNSAT
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 311/311 variables, and 317 constraints, problems are : Problem set: 2 solved, 0 unsolved in 2688 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 47/47 constraints]
After SMT, in 2959ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 11312 ms.
ITS solved all properties within timeout

BK_STOP 1716303980431

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-06"
export BK_EXAMINATION="ReachabilityFireability"
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 ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398300495"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;