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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 63K 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-03-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717225051202

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-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:57:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:57:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:57:32] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-01 06:57:32] [INFO ] Transformed 274 places.
[2024-06-01 06:57:32] [INFO ] Transformed 237 transitions.
[2024-06-01 06:57:32] [INFO ] Found NUPN structural information;
[2024-06-01 06:57:32] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 1 transitions.
RANDOM walk for 40000 steps (485 resets) in 3214 ms. (12 steps per ms) remains 7/16 properties
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (90 resets) in 216 ms. (184 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (83 resets) in 440 ms. (90 steps per ms) remains 6/7 properties
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (113 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (99 resets) in 208 ms. (191 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (85 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 578 ms. (69 steps per ms) remains 6/6 properties
// Phase 1: matrix 236 rows 273 cols
[2024-06-01 06:57:34] [INFO ] Computed 43 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 152/233 variables, 27/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 152/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 18/251 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 18/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 22/273 variables, 11/294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 22/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem BusinessProcesses-PT-03-ReachabilityFireability-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 236/509 variables, 273/589 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/509 variables, 0/589 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/509 variables, 0/589 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 589 constraints, problems are : Problem set: 1 solved, 5 unsolved in 971 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 273/273 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/75 variables, 75/75 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/76 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem BusinessProcesses-PT-03-ReachabilityFireability-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 156/231 variables, 27/103 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 156/259 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-01 06:57:35] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 14 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 7 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 5/264 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/264 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 18/249 variables, 4/268 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 18/286 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 3/289 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/289 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 24/273 variables, 11/300 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 24/324 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 0/324 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 236/509 variables, 273/597 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/509 variables, 4/601 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 3 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 1 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/509 variables, 20/621 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 6 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/509 variables, 20/641 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/509 variables, and 642 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5011 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 49/49 constraints]
After SMT, in 6084ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 69 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 236/236 transitions.
Graph (complete) has 522 edges and 273 vertex of which 270 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 270 transition count 211
Reduce places removed 23 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 32 rules applied. Total rules applied 57 place count 247 transition count 202
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 238 transition count 202
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 66 place count 238 transition count 170
Deduced a syphon composed of 32 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 133 place count 203 transition count 170
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 157 place count 179 transition count 146
Iterating global reduction 3 with 24 rules applied. Total rules applied 181 place count 179 transition count 146
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 237 place count 151 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 238 place count 151 transition count 117
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 239 place count 151 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 240 place count 151 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 241 place count 150 transition count 115
Applied a total of 241 rules in 115 ms. Remains 150 /273 variables (removed 123) and now considering 115/236 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 150/273 places, 115/236 transitions.
RANDOM walk for 40000 steps (8 resets) in 486 ms. (82 steps per ms) remains 3/4 properties
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 268 ms. (148 steps per ms) remains 2/3 properties
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
// Phase 1: matrix 115 rows 150 cols
[2024-06-01 06:57:41] [INFO ] Computed 39 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/122 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/128 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/141 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 113/254 variables, 141/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/265 variables, 9/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 150/150 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/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/122 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/128 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/141 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 113/254 variables, 141/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/265 variables, 9/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 2 ms to minimize.
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/265 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 208 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1140 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 1328ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 103 ms.
Support contains 41 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 115/115 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 150 transition count 112
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 147 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 145 transition count 110
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 10 place count 145 transition count 100
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 32 place count 133 transition count 100
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 36 place count 129 transition count 96
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 129 transition count 96
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 60 place count 119 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 118 transition count 85
Applied a total of 61 rules in 27 ms. Remains 118 /150 variables (removed 32) and now considering 85/115 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 118/150 places, 85/115 transitions.
RANDOM walk for 40000 steps (8 resets) in 525 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Probably explored full state space saw : 40826 states, properties seen :1
Probabilistic random walk after 241139 steps, saw 40826 distinct states, run finished after 386 ms. (steps per millisecond=624 ) properties seen :1
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Explored full state space saw : 40826 states, properties seen :0
Exhaustive walk after 241139 steps, saw 40826 distinct states, run finished after 239 ms. (steps per millisecond=1008 ) properties seen :0
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 11061 ms.
ITS solved all properties within timeout

BK_STOP 1717225063719

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-03"
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-03, 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-171620399600471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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