Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 146K Mar 5 18:22 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-12-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678644169510

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-12
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:02:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:02:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:02:51] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-12 18:02:51] [INFO ] Transformed 586 places.
[2023-03-12 18:02:51] [INFO ] Transformed 525 transitions.
[2023-03-12 18:02:51] [INFO ] Found NUPN structural information;
[2023-03-12 18:02:51] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 16) seen :7
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :1
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 521 rows 582 cols
[2023-03-12 18:02:52] [INFO ] Computed 98 place invariants in 20 ms
[2023-03-12 18:02:52] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 18:02:53] [INFO ] [Nat]Absence check using 55 positive place invariants in 18 ms returned sat
[2023-03-12 18:02:53] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-12 18:02:53] [INFO ] After 455ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2023-03-12 18:02:53] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 6 ms to minimize.
[2023-03-12 18:02:53] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2023-03-12 18:02:54] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
[2023-03-12 18:02:54] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
[2023-03-12 18:02:54] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2023-03-12 18:02:54] [INFO ] Deduced a trap composed of 138 places in 118 ms of which 1 ms to minimize.
[2023-03-12 18:02:54] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2023-03-12 18:02:54] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2023-03-12 18:02:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1198 ms
[2023-03-12 18:02:55] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 1 ms to minimize.
[2023-03-12 18:02:55] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2023-03-12 18:02:55] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 0 ms to minimize.
[2023-03-12 18:02:55] [INFO ] Deduced a trap composed of 126 places in 140 ms of which 0 ms to minimize.
[2023-03-12 18:02:55] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
[2023-03-12 18:02:56] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
[2023-03-12 18:02:56] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 1 ms to minimize.
[2023-03-12 18:02:56] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 1 ms to minimize.
[2023-03-12 18:02:56] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2023-03-12 18:02:56] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 0 ms to minimize.
[2023-03-12 18:02:56] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1667 ms
[2023-03-12 18:02:56] [INFO ] Deduced a trap composed of 128 places in 159 ms of which 2 ms to minimize.
[2023-03-12 18:02:57] [INFO ] Deduced a trap composed of 137 places in 132 ms of which 0 ms to minimize.
[2023-03-12 18:02:57] [INFO ] Deduced a trap composed of 138 places in 128 ms of which 1 ms to minimize.
[2023-03-12 18:02:57] [INFO ] Deduced a trap composed of 139 places in 124 ms of which 1 ms to minimize.
[2023-03-12 18:02:57] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 1 ms to minimize.
[2023-03-12 18:02:57] [INFO ] Deduced a trap composed of 134 places in 138 ms of which 2 ms to minimize.
[2023-03-12 18:02:57] [INFO ] Deduced a trap composed of 133 places in 113 ms of which 1 ms to minimize.
[2023-03-12 18:02:57] [INFO ] Deduced a trap composed of 140 places in 128 ms of which 1 ms to minimize.
[2023-03-12 18:02:58] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 0 ms to minimize.
[2023-03-12 18:02:58] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 1 ms to minimize.
[2023-03-12 18:02:58] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 0 ms to minimize.
[2023-03-12 18:02:58] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 1 ms to minimize.
[2023-03-12 18:02:58] [INFO ] Deduced a trap composed of 143 places in 117 ms of which 0 ms to minimize.
[2023-03-12 18:02:58] [INFO ] Deduced a trap composed of 136 places in 112 ms of which 1 ms to minimize.
[2023-03-12 18:02:59] [INFO ] Deduced a trap composed of 137 places in 117 ms of which 0 ms to minimize.
[2023-03-12 18:02:59] [INFO ] Deduced a trap composed of 130 places in 111 ms of which 4 ms to minimize.
[2023-03-12 18:02:59] [INFO ] Deduced a trap composed of 133 places in 126 ms of which 0 ms to minimize.
[2023-03-12 18:02:59] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 0 ms to minimize.
[2023-03-12 18:02:59] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 0 ms to minimize.
[2023-03-12 18:02:59] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 0 ms to minimize.
[2023-03-12 18:02:59] [INFO ] Deduced a trap composed of 130 places in 114 ms of which 1 ms to minimize.
[2023-03-12 18:03:00] [INFO ] Deduced a trap composed of 132 places in 116 ms of which 1 ms to minimize.
[2023-03-12 18:03:00] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 1 ms to minimize.
[2023-03-12 18:03:00] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2023-03-12 18:03:00] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2023-03-12 18:03:00] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2023-03-12 18:03:00] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 0 ms to minimize.
[2023-03-12 18:03:01] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2023-03-12 18:03:01] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2023-03-12 18:03:01] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2023-03-12 18:03:01] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2023-03-12 18:03:01] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 0 ms to minimize.
[2023-03-12 18:03:01] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2023-03-12 18:03:01] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 4802 ms
[2023-03-12 18:03:01] [INFO ] After 8419ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 360 ms.
[2023-03-12 18:03:01] [INFO ] After 9053ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 20 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (complete) has 1186 edges and 582 vertex of which 578 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 578 transition count 438
Reduce places removed 82 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 86 rules applied. Total rules applied 169 place count 496 transition count 434
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 173 place count 492 transition count 434
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 173 place count 492 transition count 313
Deduced a syphon composed of 121 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 257 rules applied. Total rules applied 430 place count 356 transition count 313
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 499 place count 287 transition count 244
Iterating global reduction 3 with 69 rules applied. Total rules applied 568 place count 287 transition count 244
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 568 place count 287 transition count 240
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 577 place count 282 transition count 240
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 183 rules applied. Total rules applied 760 place count 189 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 761 place count 189 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 763 place count 188 transition count 153
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 764 place count 188 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 765 place count 187 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 766 place count 186 transition count 152
Applied a total of 766 rules in 194 ms. Remains 186 /582 variables (removed 396) and now considering 152/521 (removed 369) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 186/582 places, 152/521 transitions.
Incomplete random walk after 10000 steps, including 784 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 4) seen :1
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 207 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 199 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 209 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 152 rows 186 cols
[2023-03-12 18:03:02] [INFO ] Computed 75 place invariants in 8 ms
[2023-03-12 18:03:02] [INFO ] [Real]Absence check using 53 positive place invariants in 12 ms returned sat
[2023-03-12 18:03:02] [INFO ] [Real]Absence check using 53 positive and 22 generalized place invariants in 6 ms returned sat
[2023-03-12 18:03:02] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 18:03:02] [INFO ] [Nat]Absence check using 53 positive place invariants in 6 ms returned sat
[2023-03-12 18:03:02] [INFO ] [Nat]Absence check using 53 positive and 22 generalized place invariants in 3 ms returned sat
[2023-03-12 18:03:02] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 18:03:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 18:03:03] [INFO ] After 58ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 18:03:03] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2023-03-12 18:03:03] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2023-03-12 18:03:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2023-03-12 18:03:03] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2023-03-12 18:03:03] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 7 ms to minimize.
[2023-03-12 18:03:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2023-03-12 18:03:03] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 0 ms to minimize.
[2023-03-12 18:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-12 18:03:03] [INFO ] After 348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-12 18:03:03] [INFO ] After 604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 19 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 152/152 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 186 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 151
Applied a total of 2 rules in 18 ms. Remains 185 /186 variables (removed 1) and now considering 151/152 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 185/186 places, 151/152 transitions.
Incomplete random walk after 10000 steps, including 795 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 193 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 206 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 209 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Finished probabilistic random walk after 764 steps, run visited all 3 properties in 13 ms. (steps per millisecond=58 )
Probabilistic random walk after 764 steps, saw 304 distinct states, run finished after 13 ms. (steps per millisecond=58 ) properties seen :3
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 12570 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/646/inv_0_ --invariant=/tmp/646/inv_1_ --invariant=/tmp/646/inv_2_ --invariant=/tmp/646/inv_3_ --invariant=/tmp/646/inv_4_ --invariant=/tmp/646/inv_5_ --invariant=/tmp/646/inv_6_ --invariant=/tmp/646/inv_7_ --invariant=/tmp/646/inv_8_ --invariant=/tmp/646/inv_9_ --invariant=/tmp/646/inv_10_ --invariant=/tmp/646/inv_11_ --invariant=/tmp/646/inv_12_ --invariant=/tmp/646/inv_13_ --invariant=/tmp/646/inv_14_ --invariant=/tmp/646/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 5626596 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16100588 kB
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-00
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-01
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-02
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-03
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-04
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-05
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-06
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-07
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-08
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-09
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-10
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-11
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-12
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-13
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-14
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityFireability-15

BK_STOP 1678647755342

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-00
rfs formula type AG
rfs formula formula --invariant=/tmp/646/inv_0_
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-01
rfs formula type EF
rfs formula formula --invariant=/tmp/646/inv_1_
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-02
rfs formula type EF
rfs formula formula --invariant=/tmp/646/inv_2_
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-03
rfs formula type EF
rfs formula formula --invariant=/tmp/646/inv_3_
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/646/inv_4_
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/646/inv_5_
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-06
rfs formula type EF
rfs formula formula --invariant=/tmp/646/inv_6_
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/646/inv_7_
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-08
rfs formula type EF
rfs formula formula --invariant=/tmp/646/inv_8_
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-09
rfs formula type EF
rfs formula formula --invariant=/tmp/646/inv_9_
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-10
rfs formula type AG
rfs formula formula --invariant=/tmp/646/inv_10_
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-11
rfs formula type EF
rfs formula formula --invariant=/tmp/646/inv_11_
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-12
rfs formula type EF
rfs formula formula --invariant=/tmp/646/inv_12_
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/646/inv_13_
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-14
rfs formula type AG
rfs formula formula --invariant=/tmp/646/inv_14_
rfs formula name BusinessProcesses-PT-12-ReachabilityFireability-15
rfs formula type AG
rfs formula formula --invariant=/tmp/646/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 586 places, 525 transitions and 1560 arcs
pnml2lts-sym: Petri net BusinessProcesses-PT-12 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 525->525 groups
pnml2lts-sym: Regrouping took 0.150 real 0.140 user 0.000 sys
pnml2lts-sym: state vector length is 586; there are 525 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 652
Killing (9) : 652

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-12"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-12, 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 r041-tajo-167813694800543"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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