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-171620399800591.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-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800591
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 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 177K 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-18-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717226093294

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-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:14:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:14:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:14:55] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-06-01 07:14:55] [INFO ] Transformed 717 places.
[2024-06-01 07:14:55] [INFO ] Transformed 642 transitions.
[2024-06-01 07:14:55] [INFO ] Found NUPN structural information;
[2024-06-01 07:14:55] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 15 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (205 resets) in 1867 ms. (21 steps per ms) remains 11/15 properties
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (41 resets) in 410 ms. (97 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (39 resets) in 242 ms. (164 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (30 resets) in 492 ms. (81 steps per ms) remains 10/11 properties
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (32 resets) in 504 ms. (79 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (38 resets) in 193 ms. (206 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (35 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (38 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (38 resets) in 153 ms. (259 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (40 resets) in 189 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (46 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
// Phase 1: matrix 627 rows 702 cols
[2024-06-01 07:14:56] [INFO ] Computed 114 invariants in 62 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 206/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-00 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 379/585 variables, 66/273 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 379/652 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 1/653 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 0/653 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 22/607 variables, 7/660 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/607 variables, 22/682 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 0/682 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 95/702 variables, 39/721 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/702 variables, 95/816 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/702 variables, 0/816 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-14 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (OVERLAPS) 627/1329 variables, 702/1518 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1329 variables, 0/1518 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/1329 variables, 0/1518 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1329/1329 variables, and 1518 constraints, problems are : Problem set: 2 solved, 8 unsolved in 3276 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 160/160 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 1/161 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/161 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 403/563 variables, 63/224 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 403/627 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 1/628 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 33 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 17 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 4 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 20/648 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 155 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 164 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 163 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 155 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 155 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 168 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 153 places in 132 ms of which 3 ms to minimize.
SMT process timed out in 8575ms, After SMT, problems are : Problem set: 3 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 89 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 627/627 transitions.
Graph (complete) has 1418 edges and 702 vertex of which 693 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 693 transition count 549
Reduce places removed 77 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 89 rules applied. Total rules applied 167 place count 616 transition count 537
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 179 place count 604 transition count 537
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 128 Pre rules applied. Total rules applied 179 place count 604 transition count 409
Deduced a syphon composed of 128 places in 3 ms
Ensure Unique test removed 14 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 449 place count 462 transition count 409
Discarding 80 places :
Symmetric choice reduction at 3 with 80 rule applications. Total rules 529 place count 382 transition count 329
Iterating global reduction 3 with 80 rules applied. Total rules applied 609 place count 382 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 611 place count 382 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 612 place count 381 transition count 327
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 612 place count 381 transition count 324
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 618 place count 378 transition count 324
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 774 place count 300 transition count 246
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 776 place count 299 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 777 place count 298 transition count 247
Applied a total of 777 rules in 166 ms. Remains 298 /702 variables (removed 404) and now considering 247/627 (removed 380) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 298/702 places, 247/627 transitions.
RANDOM walk for 40000 steps (685 resets) in 1473 ms. (27 steps per ms) remains 6/7 properties
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (179 resets) in 245 ms. (162 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (138 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (164 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (157 resets) in 75 ms. (526 steps per ms) remains 5/6 properties
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (158 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (168 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
// Phase 1: matrix 247 rows 298 cols
[2024-06-01 07:15:06] [INFO ] Computed 92 invariants in 6 ms
[2024-06-01 07:15:06] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 146/224 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 10/234 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 45/279 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/281 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 247/528 variables, 281/367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/528 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 17/545 variables, 17/387 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 6/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/545 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 393 constraints, problems are : Problem set: 0 solved, 5 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 298/298 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 146/224 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 10 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 10/234 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-10 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 45/279 variables, 24/130 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 6/136 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 8/144 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/279 variables, 3/147 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/279 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/281 variables, 2/149 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/281 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 247/528 variables, 281/430 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/528 variables, 3/433 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/528 variables, 1/434 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/528 variables, 0/434 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 17/545 variables, 17/451 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/545 variables, 6/457 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/545 variables, 3/460 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 26 (INCLUDED_ONLY) 0/545 variables, 13/473 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/545 variables, 6/479 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 07:15:16] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/545 variables, 1/480 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/545 variables, 0/480 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/545 variables, 0/480 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 480 constraints, problems are : Problem set: 2 solved, 3 unsolved in 10405 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 298/298 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 83/83 constraints]
After SMT, in 11025ms problems are : Problem set: 2 solved, 3 unsolved
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 11521 steps, including 199 resets, run visited all 1 properties in 49 ms. (steps per millisecond=235 )
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 204 ms.
All properties solved without resorting to model-checking.
Total runtime 22557 ms.
ITS solved all properties within timeout

BK_STOP 1717226117407

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

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