Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 24K 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 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:31 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 159K 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-16-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717225989653

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:13:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:13:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:13:11] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2024-06-01 07:13:11] [INFO ] Transformed 638 places.
[2024-06-01 07:13:11] [INFO ] Transformed 578 transitions.
[2024-06-01 07:13:11] [INFO ] Found NUPN structural information;
[2024-06-01 07:13:11] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 17 ms
Reduce places removed 8 places and 8 transitions.
RANDOM walk for 40000 steps (267 resets) in 2067 ms. (19 steps per ms) remains 6/16 properties
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (47 resets) in 513 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 218 ms. (182 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (46 resets) in 1275 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (47 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (48 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (49 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
// Phase 1: matrix 570 rows 630 cols
[2024-06-01 07:13:12] [INFO ] Computed 100 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 411/522 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 411/583 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 5/527 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 5/590 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 102/629 variables, 36/626 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 102/728 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/630 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/630 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/630 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 570/1200 variables, 630/1360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1200 variables, 0/1360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1200 variables, 0/1360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1200/1200 variables, and 1360 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2192 ms.
Refiners :[Domain max(s): 630/630 constraints, Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem BusinessProcesses-PT-16-ReachabilityFireability-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 411/522 variables, 61/172 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 411/583 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 1/584 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 30 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 3 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 3 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 5 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 20/604 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 6 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 3 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 20/624 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 3 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
SMT process timed out in 7427ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 104 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (complete) has 1291 edges and 630 vertex of which 624 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 624 transition count 509
Reduce places removed 60 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 72 rules applied. Total rules applied 133 place count 564 transition count 497
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 145 place count 552 transition count 497
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 145 place count 552 transition count 399
Deduced a syphon composed of 98 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 352 place count 443 transition count 399
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 417 place count 378 transition count 334
Iterating global reduction 3 with 65 rules applied. Total rules applied 482 place count 378 transition count 334
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 482 place count 378 transition count 333
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 484 place count 377 transition count 333
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 636 place count 300 transition count 258
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 637 place count 300 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 638 place count 299 transition count 257
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 642 place count 299 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 643 place count 298 transition count 256
Applied a total of 643 rules in 185 ms. Remains 298 /630 variables (removed 332) and now considering 256/570 (removed 314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 298/630 places, 256/570 transitions.
RANDOM walk for 40000 steps (599 resets) in 992 ms. (40 steps per ms) remains 4/5 properties
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (113 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (108 resets) in 163 ms. (243 steps per ms) remains 3/4 properties
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (111 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (109 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
// Phase 1: matrix 256 rows 298 cols
[2024-06-01 07:13:21] [INFO ] Computed 82 invariants in 6 ms
[2024-06-01 07:13:21] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 162/221 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 22/243 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 47/290 variables, 25/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/291 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 254/545 variables, 291/372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 9/554 variables, 7/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/554 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/554 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 382 constraints, problems are : Problem set: 0 solved, 3 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 298/298 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 162/221 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 22/243 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 47/290 variables, 25/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 10 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/291 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 254/545 variables, 291/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 20/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/545 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 9/554 variables, 7/423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/554 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/554 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 7 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-16-ReachabilityFireability-2024-04 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/554 variables, 18/443 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/554 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/554 variables, 5/448 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/554 variables, 0/448 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/554 variables, 0/448 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 448 constraints, problems are : Problem set: 1 solved, 2 unsolved in 8360 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 298/298 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 63/63 constraints]
After SMT, in 8704ms problems are : Problem set: 1 solved, 2 unsolved
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 3217 steps, including 40 resets, run visited all 1 properties in 13 ms. (steps per millisecond=247 )
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 86 ms.
All properties solved without resorting to model-checking.
Total runtime 18838 ms.
ITS solved all properties within timeout

BK_STOP 1717226009881

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-16, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399800575"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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