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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:49 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.5K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 12K Feb 25 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:50 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 192K 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-20-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678649995350

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-20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:39:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 19:39:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:39:57] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2023-03-12 19:39:57] [INFO ] Transformed 782 places.
[2023-03-12 19:39:57] [INFO ] Transformed 697 transitions.
[2023-03-12 19:39:57] [INFO ] Found NUPN structural information;
[2023-03-12 19:39:57] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 185 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 63 places in 18 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 52 resets, run finished after 508 ms. (steps per millisecond=19 ) properties (out of 15) seen :4
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :3
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 7 properties.
// Phase 1: matrix 638 rows 719 cols
[2023-03-12 19:39:58] [INFO ] Computed 121 place invariants in 44 ms
[2023-03-12 19:39:59] [INFO ] [Real]Absence check using 78 positive place invariants in 43 ms returned sat
[2023-03-12 19:39:59] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-12 19:39:59] [INFO ] After 533ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-12 19:39:59] [INFO ] [Nat]Absence check using 78 positive place invariants in 25 ms returned sat
[2023-03-12 19:39:59] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 16 ms returned sat
[2023-03-12 19:40:00] [INFO ] After 885ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-12 19:40:00] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 6 ms to minimize.
[2023-03-12 19:40:00] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 2 ms to minimize.
[2023-03-12 19:40:00] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 13 ms to minimize.
[2023-03-12 19:40:01] [INFO ] Deduced a trap composed of 62 places in 142 ms of which 2 ms to minimize.
[2023-03-12 19:40:01] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 2 ms to minimize.
[2023-03-12 19:40:01] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 1 ms to minimize.
[2023-03-12 19:40:01] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2023-03-12 19:40:01] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2023-03-12 19:40:01] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 0 ms to minimize.
[2023-03-12 19:40:02] [INFO ] Deduced a trap composed of 32 places in 410 ms of which 0 ms to minimize.
[2023-03-12 19:40:02] [INFO ] Deduced a trap composed of 68 places in 144 ms of which 0 ms to minimize.
[2023-03-12 19:40:02] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 0 ms to minimize.
[2023-03-12 19:40:02] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 0 ms to minimize.
[2023-03-12 19:40:02] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 1 ms to minimize.
[2023-03-12 19:40:03] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 0 ms to minimize.
[2023-03-12 19:40:03] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 1 ms to minimize.
[2023-03-12 19:40:03] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 1 ms to minimize.
[2023-03-12 19:40:03] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 1 ms to minimize.
[2023-03-12 19:40:03] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 0 ms to minimize.
[2023-03-12 19:40:03] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2023-03-12 19:40:03] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 1 ms to minimize.
[2023-03-12 19:40:03] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 0 ms to minimize.
[2023-03-12 19:40:04] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2023-03-12 19:40:04] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3778 ms
[2023-03-12 19:40:04] [INFO ] Deduced a trap composed of 128 places in 195 ms of which 1 ms to minimize.
[2023-03-12 19:40:04] [INFO ] Deduced a trap composed of 142 places in 193 ms of which 0 ms to minimize.
[2023-03-12 19:40:04] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 0 ms to minimize.
[2023-03-12 19:40:05] [INFO ] Deduced a trap composed of 157 places in 246 ms of which 1 ms to minimize.
[2023-03-12 19:40:05] [INFO ] Deduced a trap composed of 155 places in 235 ms of which 0 ms to minimize.
[2023-03-12 19:40:05] [INFO ] Deduced a trap composed of 155 places in 202 ms of which 0 ms to minimize.
[2023-03-12 19:40:05] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 1 ms to minimize.
[2023-03-12 19:40:06] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 0 ms to minimize.
[2023-03-12 19:40:06] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 0 ms to minimize.
[2023-03-12 19:40:06] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 1 ms to minimize.
[2023-03-12 19:40:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2262 ms
[2023-03-12 19:40:06] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 13 ms to minimize.
[2023-03-12 19:40:06] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 10 ms to minimize.
[2023-03-12 19:40:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2023-03-12 19:40:07] [INFO ] Deduced a trap composed of 159 places in 149 ms of which 1 ms to minimize.
[2023-03-12 19:40:07] [INFO ] Deduced a trap composed of 153 places in 161 ms of which 0 ms to minimize.
[2023-03-12 19:40:07] [INFO ] Deduced a trap composed of 155 places in 209 ms of which 0 ms to minimize.
[2023-03-12 19:40:07] [INFO ] Deduced a trap composed of 151 places in 145 ms of which 0 ms to minimize.
[2023-03-12 19:40:07] [INFO ] Deduced a trap composed of 161 places in 150 ms of which 2 ms to minimize.
[2023-03-12 19:40:07] [INFO ] Deduced a trap composed of 162 places in 145 ms of which 0 ms to minimize.
[2023-03-12 19:40:08] [INFO ] Deduced a trap composed of 161 places in 169 ms of which 1 ms to minimize.
[2023-03-12 19:40:08] [INFO ] Deduced a trap composed of 154 places in 147 ms of which 0 ms to minimize.
[2023-03-12 19:40:08] [INFO ] Deduced a trap composed of 158 places in 142 ms of which 0 ms to minimize.
[2023-03-12 19:40:08] [INFO ] Deduced a trap composed of 147 places in 134 ms of which 0 ms to minimize.
[2023-03-12 19:40:08] [INFO ] Deduced a trap composed of 154 places in 143 ms of which 1 ms to minimize.
[2023-03-12 19:40:09] [INFO ] Deduced a trap composed of 149 places in 145 ms of which 1 ms to minimize.
[2023-03-12 19:40:09] [INFO ] Deduced a trap composed of 150 places in 143 ms of which 1 ms to minimize.
[2023-03-12 19:40:09] [INFO ] Deduced a trap composed of 154 places in 192 ms of which 1 ms to minimize.
[2023-03-12 19:40:09] [INFO ] Deduced a trap composed of 149 places in 160 ms of which 1 ms to minimize.
[2023-03-12 19:40:09] [INFO ] Deduced a trap composed of 169 places in 166 ms of which 1 ms to minimize.
[2023-03-12 19:40:09] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 1 ms to minimize.
[2023-03-12 19:40:10] [INFO ] Deduced a trap composed of 157 places in 147 ms of which 1 ms to minimize.
[2023-03-12 19:40:10] [INFO ] Deduced a trap composed of 155 places in 172 ms of which 0 ms to minimize.
[2023-03-12 19:40:10] [INFO ] Deduced a trap composed of 153 places in 144 ms of which 0 ms to minimize.
[2023-03-12 19:40:10] [INFO ] Deduced a trap composed of 147 places in 160 ms of which 8 ms to minimize.
[2023-03-12 19:40:10] [INFO ] Deduced a trap composed of 145 places in 156 ms of which 13 ms to minimize.
[2023-03-12 19:40:11] [INFO ] Deduced a trap composed of 160 places in 135 ms of which 1 ms to minimize.
[2023-03-12 19:40:11] [INFO ] Deduced a trap composed of 151 places in 136 ms of which 0 ms to minimize.
[2023-03-12 19:40:11] [INFO ] Deduced a trap composed of 154 places in 200 ms of which 1 ms to minimize.
[2023-03-12 19:40:11] [INFO ] Deduced a trap composed of 161 places in 169 ms of which 1 ms to minimize.
[2023-03-12 19:40:11] [INFO ] Deduced a trap composed of 154 places in 144 ms of which 1 ms to minimize.
[2023-03-12 19:40:12] [INFO ] Deduced a trap composed of 146 places in 153 ms of which 0 ms to minimize.
[2023-03-12 19:40:12] [INFO ] Deduced a trap composed of 148 places in 136 ms of which 1 ms to minimize.
[2023-03-12 19:40:12] [INFO ] Deduced a trap composed of 146 places in 134 ms of which 1 ms to minimize.
[2023-03-12 19:40:12] [INFO ] Deduced a trap composed of 152 places in 160 ms of which 3 ms to minimize.
[2023-03-12 19:40:12] [INFO ] Deduced a trap composed of 150 places in 136 ms of which 1 ms to minimize.
[2023-03-12 19:40:12] [INFO ] Deduced a trap composed of 153 places in 140 ms of which 0 ms to minimize.
[2023-03-12 19:40:13] [INFO ] Deduced a trap composed of 147 places in 147 ms of which 3 ms to minimize.
[2023-03-12 19:40:13] [INFO ] Deduced a trap composed of 147 places in 161 ms of which 1 ms to minimize.
[2023-03-12 19:40:13] [INFO ] Deduced a trap composed of 165 places in 137 ms of which 0 ms to minimize.
[2023-03-12 19:40:13] [INFO ] Deduced a trap composed of 153 places in 166 ms of which 1 ms to minimize.
[2023-03-12 19:40:13] [INFO ] Deduced a trap composed of 166 places in 140 ms of which 0 ms to minimize.
[2023-03-12 19:40:13] [INFO ] Deduced a trap composed of 175 places in 135 ms of which 0 ms to minimize.
[2023-03-12 19:40:14] [INFO ] Deduced a trap composed of 148 places in 182 ms of which 0 ms to minimize.
[2023-03-12 19:40:14] [INFO ] Deduced a trap composed of 160 places in 158 ms of which 1 ms to minimize.
[2023-03-12 19:40:14] [INFO ] Deduced a trap composed of 152 places in 138 ms of which 0 ms to minimize.
[2023-03-12 19:40:14] [INFO ] Deduced a trap composed of 160 places in 182 ms of which 0 ms to minimize.
[2023-03-12 19:40:14] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 1 ms to minimize.
[2023-03-12 19:40:15] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 1 ms to minimize.
[2023-03-12 19:40:15] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 1 ms to minimize.
[2023-03-12 19:40:15] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 0 ms to minimize.
[2023-03-12 19:40:15] [INFO ] Deduced a trap composed of 153 places in 153 ms of which 0 ms to minimize.
[2023-03-12 19:40:15] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2023-03-12 19:40:16] [INFO ] Deduced a trap composed of 161 places in 158 ms of which 0 ms to minimize.
[2023-03-12 19:40:16] [INFO ] Deduced a trap composed of 155 places in 178 ms of which 0 ms to minimize.
[2023-03-12 19:40:16] [INFO ] Deduced a trap composed of 159 places in 206 ms of which 1 ms to minimize.
[2023-03-12 19:40:16] [INFO ] Deduced a trap composed of 168 places in 167 ms of which 1 ms to minimize.
[2023-03-12 19:40:17] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 0 ms to minimize.
[2023-03-12 19:40:17] [INFO ] Deduced a trap composed of 156 places in 167 ms of which 1 ms to minimize.
[2023-03-12 19:40:17] [INFO ] Deduced a trap composed of 145 places in 160 ms of which 1 ms to minimize.
[2023-03-12 19:40:17] [INFO ] Deduced a trap composed of 160 places in 163 ms of which 0 ms to minimize.
[2023-03-12 19:40:17] [INFO ] Deduced a trap composed of 155 places in 160 ms of which 0 ms to minimize.
[2023-03-12 19:40:18] [INFO ] Deduced a trap composed of 128 places in 260 ms of which 1 ms to minimize.
[2023-03-12 19:40:18] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 0 ms to minimize.
[2023-03-12 19:40:18] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2023-03-12 19:40:18] [INFO ] Trap strengthening (SAT) tested/added 62/61 trap constraints in 11973 ms
[2023-03-12 19:40:19] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 1 ms to minimize.
[2023-03-12 19:40:19] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 0 ms to minimize.
[2023-03-12 19:40:19] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 0 ms to minimize.
[2023-03-12 19:40:19] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 0 ms to minimize.
[2023-03-12 19:40:19] [INFO ] Deduced a trap composed of 74 places in 166 ms of which 1 ms to minimize.
[2023-03-12 19:40:20] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 0 ms to minimize.
[2023-03-12 19:40:20] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 1 ms to minimize.
[2023-03-12 19:40:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 1530 ms
[2023-03-12 19:40:20] [INFO ] After 21065ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 485 ms.
[2023-03-12 19:40:20] [INFO ] After 21866ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 101 ms.
Support contains 39 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (complete) has 1418 edges and 719 vertex of which 694 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.4 ms
Discarding 25 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 694 transition count 523
Reduce places removed 104 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 111 rules applied. Total rules applied 216 place count 590 transition count 516
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 223 place count 583 transition count 516
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 139 Pre rules applied. Total rules applied 223 place count 583 transition count 377
Deduced a syphon composed of 139 places in 2 ms
Ensure Unique test removed 18 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 296 rules applied. Total rules applied 519 place count 426 transition count 377
Discarding 85 places :
Symmetric choice reduction at 3 with 85 rule applications. Total rules 604 place count 341 transition count 292
Iterating global reduction 3 with 85 rules applied. Total rules applied 689 place count 341 transition count 292
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 689 place count 341 transition count 286
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 702 place count 334 transition count 286
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 894 place count 237 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 895 place count 237 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 899 place count 235 transition count 197
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 903 place count 235 transition count 197
Applied a total of 903 rules in 160 ms. Remains 235 /719 variables (removed 484) and now considering 197/638 (removed 441) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 235/719 places, 197/638 transitions.
Incomplete random walk after 10000 steps, including 353 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 531012 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 531012 steps, saw 93260 distinct states, run finished after 3002 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 19:40:24] [INFO ] Flow matrix only has 196 transitions (discarded 1 similar events)
// Phase 1: matrix 196 rows 235 cols
[2023-03-12 19:40:24] [INFO ] Computed 86 place invariants in 8 ms
[2023-03-12 19:40:25] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-12 19:40:25] [INFO ] [Real]Absence check using 63 positive and 23 generalized place invariants in 6 ms returned sat
[2023-03-12 19:40:25] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 19:40:25] [INFO ] [Nat]Absence check using 63 positive place invariants in 9 ms returned sat
[2023-03-12 19:40:25] [INFO ] [Nat]Absence check using 63 positive and 23 generalized place invariants in 5 ms returned sat
[2023-03-12 19:40:25] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 19:40:25] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 19:40:25] [INFO ] After 143ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 19:40:25] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2023-03-12 19:40:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-12 19:40:25] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2023-03-12 19:40:25] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2023-03-12 19:40:25] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2023-03-12 19:40:25] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 0 ms to minimize.
[2023-03-12 19:40:25] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2023-03-12 19:40:26] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 0 ms to minimize.
[2023-03-12 19:40:26] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 0 ms to minimize.
[2023-03-12 19:40:26] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 0 ms to minimize.
[2023-03-12 19:40:26] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 0 ms to minimize.
[2023-03-12 19:40:26] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 0 ms to minimize.
[2023-03-12 19:40:26] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2023-03-12 19:40:26] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2023-03-12 19:40:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1047 ms
[2023-03-12 19:40:26] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 0 ms to minimize.
[2023-03-12 19:40:26] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 0 ms to minimize.
[2023-03-12 19:40:26] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 0 ms to minimize.
[2023-03-12 19:40:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 318 ms
[2023-03-12 19:40:26] [INFO ] After 1684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-12 19:40:27] [INFO ] After 2058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 81 ms.
Support contains 39 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 197/197 transitions.
Applied a total of 0 rules in 8 ms. Remains 235 /235 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 235/235 places, 197/197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 197/197 transitions.
Applied a total of 0 rules in 7 ms. Remains 235 /235 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-12 19:40:27] [INFO ] Flow matrix only has 196 transitions (discarded 1 similar events)
[2023-03-12 19:40:27] [INFO ] Invariant cache hit.
[2023-03-12 19:40:27] [INFO ] Implicit Places using invariants in 430 ms returned [17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 56, 185, 207]
Discarding 13 places :
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Implicit Place search using SMT only with invariants took 433 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 222/235 places, 194/197 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 218 transition count 178
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 218 transition count 178
Applied a total of 8 rules in 15 ms. Remains 218 /222 variables (removed 4) and now considering 178/194 (removed 16) transitions.
[2023-03-12 19:40:27] [INFO ] Flow matrix only has 177 transitions (discarded 1 similar events)
// Phase 1: matrix 177 rows 218 cols
[2023-03-12 19:40:27] [INFO ] Computed 76 place invariants in 3 ms
[2023-03-12 19:40:28] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-12 19:40:28] [INFO ] Flow matrix only has 177 transitions (discarded 1 similar events)
[2023-03-12 19:40:28] [INFO ] Invariant cache hit.
[2023-03-12 19:40:28] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 19:40:28] [INFO ] Implicit Places using invariants and state equation in 291 ms returned [48, 49, 50, 51, 52, 54, 55, 58, 62, 136, 138, 140, 142, 147, 151]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 630 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 203/235 places, 178/197 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 203 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 202 transition count 177
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 200 transition count 175
Applied a total of 6 rules in 22 ms. Remains 200 /203 variables (removed 3) and now considering 175/178 (removed 3) transitions.
[2023-03-12 19:40:28] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
// Phase 1: matrix 174 rows 200 cols
[2023-03-12 19:40:28] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-12 19:40:28] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-12 19:40:28] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2023-03-12 19:40:28] [INFO ] Invariant cache hit.
[2023-03-12 19:40:28] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 19:40:28] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 200/235 places, 175/197 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1518 ms. Remains : 200/235 places, 175/197 transitions.
Incomplete random walk after 10000 steps, including 354 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 518471 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 518471 steps, saw 97558 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 19:40:32] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2023-03-12 19:40:32] [INFO ] Invariant cache hit.
[2023-03-12 19:40:32] [INFO ] [Real]Absence check using 51 positive place invariants in 8 ms returned sat
[2023-03-12 19:40:32] [INFO ] [Real]Absence check using 51 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-12 19:40:32] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 19:40:32] [INFO ] [Nat]Absence check using 51 positive place invariants in 7 ms returned sat
[2023-03-12 19:40:32] [INFO ] [Nat]Absence check using 51 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-12 19:40:32] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 19:40:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 19:40:32] [INFO ] After 60ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 19:40:32] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2023-03-12 19:40:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-12 19:40:32] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2023-03-12 19:40:32] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 0 ms to minimize.
[2023-03-12 19:40:32] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2023-03-12 19:40:33] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2023-03-12 19:40:33] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2023-03-12 19:40:33] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2023-03-12 19:40:33] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 1 ms to minimize.
[2023-03-12 19:40:33] [INFO ] Deduced a trap composed of 49 places in 287 ms of which 0 ms to minimize.
[2023-03-12 19:40:33] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 0 ms to minimize.
[2023-03-12 19:40:34] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2023-03-12 19:40:34] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 0 ms to minimize.
[2023-03-12 19:40:34] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 0 ms to minimize.
[2023-03-12 19:40:34] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 0 ms to minimize.
[2023-03-12 19:40:34] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 0 ms to minimize.
[2023-03-12 19:40:34] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2023-03-12 19:40:34] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 0 ms to minimize.
[2023-03-12 19:40:34] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2202 ms
[2023-03-12 19:40:34] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2023-03-12 19:40:35] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 0 ms to minimize.
[2023-03-12 19:40:35] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2023-03-12 19:40:35] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2023-03-12 19:40:35] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2023-03-12 19:40:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 544 ms
[2023-03-12 19:40:35] [INFO ] After 3036ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-12 19:40:35] [INFO ] After 3259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 60 ms.
Support contains 39 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 175/175 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 200/200 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 175/175 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2023-03-12 19:40:35] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2023-03-12 19:40:35] [INFO ] Invariant cache hit.
[2023-03-12 19:40:35] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-12 19:40:35] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2023-03-12 19:40:35] [INFO ] Invariant cache hit.
[2023-03-12 19:40:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 19:40:35] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-12 19:40:35] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-12 19:40:35] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2023-03-12 19:40:35] [INFO ] Invariant cache hit.
[2023-03-12 19:40:35] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 200/200 places, 175/175 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 200 transition count 174
Applied a total of 1 rules in 8 ms. Remains 200 /200 variables (removed 0) and now considering 174/175 (removed 1) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 174 rows 200 cols
[2023-03-12 19:40:36] [INFO ] Computed 61 place invariants in 1 ms
[2023-03-12 19:40:36] [INFO ] [Real]Absence check using 51 positive place invariants in 9 ms returned sat
[2023-03-12 19:40:36] [INFO ] [Real]Absence check using 51 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-12 19:40:36] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 19:40:36] [INFO ] [Nat]Absence check using 51 positive place invariants in 8 ms returned sat
[2023-03-12 19:40:36] [INFO ] [Nat]Absence check using 51 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-12 19:40:36] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 19:40:36] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2023-03-12 19:40:36] [INFO ] Deduced a trap composed of 6 places in 487 ms of which 1 ms to minimize.
[2023-03-12 19:40:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 558 ms
[2023-03-12 19:40:36] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 0 ms to minimize.
[2023-03-12 19:40:37] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2023-03-12 19:40:37] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 0 ms to minimize.
[2023-03-12 19:40:37] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 0 ms to minimize.
[2023-03-12 19:40:37] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 0 ms to minimize.
[2023-03-12 19:40:37] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 0 ms to minimize.
[2023-03-12 19:40:37] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 0 ms to minimize.
[2023-03-12 19:40:37] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2023-03-12 19:40:37] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 0 ms to minimize.
[2023-03-12 19:40:37] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 0 ms to minimize.
[2023-03-12 19:40:37] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 0 ms to minimize.
[2023-03-12 19:40:37] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 0 ms to minimize.
[2023-03-12 19:40:37] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 881 ms
[2023-03-12 19:40:37] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2023-03-12 19:40:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-12 19:40:37] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 0 ms to minimize.
[2023-03-12 19:40:37] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2023-03-12 19:40:38] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2023-03-12 19:40:38] [INFO ] Deduced a trap composed of 54 places in 284 ms of which 0 ms to minimize.
[2023-03-12 19:40:38] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2023-03-12 19:40:38] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2023-03-12 19:40:38] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 0 ms to minimize.
[2023-03-12 19:40:38] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 0 ms to minimize.
[2023-03-12 19:40:38] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 0 ms to minimize.
[2023-03-12 19:40:38] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2023-03-12 19:40:38] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 0 ms to minimize.
[2023-03-12 19:40:38] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2023-03-12 19:40:38] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 0 ms to minimize.
[2023-03-12 19:40:39] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 0 ms to minimize.
[2023-03-12 19:40:39] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 0 ms to minimize.
[2023-03-12 19:40:39] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1276 ms
[2023-03-12 19:40:39] [INFO ] After 2929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-12 19:40:39] [INFO ] After 3106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-12 19:40:39] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-12 19:40:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 200 places, 175 transitions and 764 arcs took 14 ms.
[2023-03-12 19:40:39] [INFO ] Flatten gal took : 43 ms
Total runtime 42433 ms.
There are residual formulas that ITS could not solve within timeout
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/1047/inv_0_ --invariant=/tmp/1047/inv_1_ --invariant=/tmp/1047/inv_2_ --invariant=/tmp/1047/inv_3_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 14733712 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16102180 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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

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