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.r042-tajo-167813695800461.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 marciexred
Input is BusinessProcesses-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 59K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678726928007

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:02:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 17:02:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:02:09] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-13 17:02:09] [INFO ] Transformed 262 places.
[2023-03-13 17:02:09] [INFO ] Transformed 219 transitions.
[2023-03-13 17:02:09] [INFO ] Found NUPN structural information;
[2023-03-13 17:02:09] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
// Phase 1: matrix 204 rows 245 cols
[2023-03-13 17:02:09] [INFO ] Computed 43 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 133 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :9
FORMULA BusinessProcesses-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 7) seen :0
[2023-03-13 17:02:09] [INFO ] Invariant cache hit.
[2023-03-13 17:02:10] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2023-03-13 17:02:10] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-13 17:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:02:10] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-13 17:02:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:02:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2023-03-13 17:02:10] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-13 17:02:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:02:10] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-13 17:02:10] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 3 ms to minimize.
[2023-03-13 17:02:10] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2023-03-13 17:02:10] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-13 17:02:10] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2023-03-13 17:02:10] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2023-03-13 17:02:10] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
[2023-03-13 17:02:10] [INFO ] Deduced a trap composed of 62 places in 41 ms of which 1 ms to minimize.
[2023-03-13 17:02:10] [INFO ] Deduced a trap composed of 62 places in 40 ms of which 1 ms to minimize.
[2023-03-13 17:02:10] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2023-03-13 17:02:10] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 1 ms to minimize.
[2023-03-13 17:02:10] [INFO ] Deduced a trap composed of 60 places in 39 ms of which 0 ms to minimize.
[2023-03-13 17:02:11] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 1 ms to minimize.
[2023-03-13 17:02:11] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 0 ms to minimize.
[2023-03-13 17:02:11] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
[2023-03-13 17:02:11] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2023-03-13 17:02:11] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 0 ms to minimize.
[2023-03-13 17:02:11] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 832 ms
[2023-03-13 17:02:11] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 9 ms.
[2023-03-13 17:02:11] [INFO ] Added : 126 causal constraints over 26 iterations in 312 ms. Result :sat
Minimization took 33 ms.
[2023-03-13 17:02:11] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2023-03-13 17:02:11] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-13 17:02:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:02:11] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-13 17:02:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:02:11] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-13 17:02:11] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-13 17:02:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:02:11] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-13 17:02:11] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2023-03-13 17:02:12] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2023-03-13 17:02:12] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-13 17:02:12] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-03-13 17:02:12] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2023-03-13 17:02:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 360 ms
[2023-03-13 17:02:12] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 11 ms.
[2023-03-13 17:02:12] [INFO ] Added : 121 causal constraints over 25 iterations in 246 ms. Result :sat
Minimization took 25 ms.
[2023-03-13 17:02:12] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-13 17:02:12] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 16 ms returned sat
[2023-03-13 17:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:02:12] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-13 17:02:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:02:12] [INFO ] [Nat]Absence check using 30 positive place invariants in 7 ms returned sat
[2023-03-13 17:02:12] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-13 17:02:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:02:12] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-13 17:02:12] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2023-03-13 17:02:12] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2023-03-13 17:02:13] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2023-03-13 17:02:13] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2023-03-13 17:02:13] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2023-03-13 17:02:13] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 0 ms to minimize.
[2023-03-13 17:02:13] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 0 ms to minimize.
[2023-03-13 17:02:13] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2023-03-13 17:02:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 510 ms
[2023-03-13 17:02:13] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 18 ms.
[2023-03-13 17:02:13] [INFO ] Added : 123 causal constraints over 25 iterations in 374 ms. Result :sat
Minimization took 50 ms.
[2023-03-13 17:02:13] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-13 17:02:13] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-13 17:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:02:13] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-13 17:02:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:02:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-13 17:02:14] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-13 17:02:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:02:14] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-13 17:02:14] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2023-03-13 17:02:14] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 0 ms to minimize.
[2023-03-13 17:02:14] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2023-03-13 17:02:14] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-13 17:02:14] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2023-03-13 17:02:14] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 0 ms to minimize.
[2023-03-13 17:02:14] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2023-03-13 17:02:14] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 0 ms to minimize.
[2023-03-13 17:02:14] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 0 ms to minimize.
[2023-03-13 17:02:14] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2023-03-13 17:02:14] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2023-03-13 17:02:15] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2023-03-13 17:02:15] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 0 ms to minimize.
[2023-03-13 17:02:15] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 0 ms to minimize.
[2023-03-13 17:02:15] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1057 ms
[2023-03-13 17:02:15] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 9 ms.
[2023-03-13 17:02:15] [INFO ] Added : 147 causal constraints over 30 iterations in 390 ms. Result :sat
Minimization took 41 ms.
[2023-03-13 17:02:15] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-13 17:02:15] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-13 17:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:02:15] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-13 17:02:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:02:15] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-13 17:02:15] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-13 17:02:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:02:15] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-13 17:02:16] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-13 17:02:16] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2023-03-13 17:02:16] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2023-03-13 17:02:16] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2023-03-13 17:02:16] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2023-03-13 17:02:16] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2023-03-13 17:02:16] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2023-03-13 17:02:16] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2023-03-13 17:02:16] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2023-03-13 17:02:16] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-03-13 17:02:16] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2023-03-13 17:02:16] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2023-03-13 17:02:16] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2023-03-13 17:02:16] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2023-03-13 17:02:16] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2023-03-13 17:02:16] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1068 ms
[2023-03-13 17:02:17] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 14 ms.
[2023-03-13 17:02:17] [INFO ] Added : 141 causal constraints over 29 iterations in 392 ms. Result :sat
Minimization took 42 ms.
[2023-03-13 17:02:17] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-13 17:02:17] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-13 17:02:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:02:17] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-13 17:02:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:02:17] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2023-03-13 17:02:17] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-13 17:02:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:02:17] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-13 17:02:17] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2023-03-13 17:02:17] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 0 ms to minimize.
[2023-03-13 17:02:17] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 0 ms to minimize.
[2023-03-13 17:02:17] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 1 ms to minimize.
[2023-03-13 17:02:18] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2023-03-13 17:02:18] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2023-03-13 17:02:18] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2023-03-13 17:02:18] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
[2023-03-13 17:02:18] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 0 ms to minimize.
[2023-03-13 17:02:18] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 0 ms to minimize.
[2023-03-13 17:02:18] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 0 ms to minimize.
[2023-03-13 17:02:18] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2023-03-13 17:02:18] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2023-03-13 17:02:18] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2023-03-13 17:02:18] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-13 17:02:18] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2023-03-13 17:02:18] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2023-03-13 17:02:18] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2023-03-13 17:02:18] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1155 ms
[2023-03-13 17:02:18] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 11 ms.
[2023-03-13 17:02:19] [INFO ] Added : 125 causal constraints over 25 iterations in 302 ms. Result :sat
Minimization took 39 ms.
[2023-03-13 17:02:19] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-13 17:02:19] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-13 17:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:02:19] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-13 17:02:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:02:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-13 17:02:19] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-13 17:02:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:02:19] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-13 17:02:19] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2023-03-13 17:02:19] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2023-03-13 17:02:19] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2023-03-13 17:02:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 231 ms
[2023-03-13 17:02:19] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 44 ms.
[2023-03-13 17:02:20] [INFO ] Added : 122 causal constraints over 25 iterations in 393 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 204/204 transitions.
Graph (trivial) has 141 edges and 245 vertex of which 7 / 245 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 438 edges and 239 vertex of which 227 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 227 transition count 138
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 176 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 175 transition count 137
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 107 place count 175 transition count 100
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 81 rules applied. Total rules applied 188 place count 131 transition count 100
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 217 place count 102 transition count 71
Iterating global reduction 3 with 29 rules applied. Total rules applied 246 place count 102 transition count 71
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 324 place count 62 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 325 place count 62 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 326 place count 61 transition count 32
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 327 place count 61 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 328 place count 60 transition count 31
Applied a total of 328 rules in 68 ms. Remains 60 /245 variables (removed 185) and now considering 31/204 (removed 173) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 60/245 places, 31/204 transitions.
// Phase 1: matrix 31 rows 60 cols
[2023-03-13 17:02:20] [INFO ] Computed 29 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 47042 resets, run finished after 1102 ms. (steps per millisecond=907 ) properties (out of 3) seen :3
FORMULA BusinessProcesses-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 11951 ms.
ITS solved all properties within timeout

BK_STOP 1678726941797

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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-02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BusinessProcesses-PT-02, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813695800461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-02.tgz
mv BusinessProcesses-PT-02 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;