Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842000461.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
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 r034-tall-177946842000461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.5K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 5 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 5 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 5 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 59K Mar 3 18:30 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

echo here is the order used to build the result vector(from xml 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 1779610239875

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-24 08:10:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 08:10:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:10:41] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2026-05-24 08:10:41] [INFO ] Transformed 262 places.
[2026-05-24 08:10:41] [INFO ] Transformed 219 transitions.
[2026-05-24 08:10:41] [INFO ] Found NUPN structural information;
[2026-05-24 08:10:41] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15467818511333067025.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14363834850821991278.kers'
[2026-05-24 08:10:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15467818511333067025.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14363834850821991278.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 245 cols 546 entries
Finished phase 1 with 177 SingleSign rule and 25 generalized
[2026-05-24 08:10:41] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14363834850821991278.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (136 resets) in 39 ms. (250 steps per ms)
FORMULA BusinessProcesses-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70005 steps (175 resets) in 86 ms. (804 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-24 08:10:41] [INFO ] Invariant cache hit.
[2026-05-24 08:10:41] [INFO ] [Real]Absence check using 37 positive place invariants in 33 ms returned sat
[2026-05-24 08:10:41] [INFO ] [Real]Absence check using 37 positive and 6 generalized place invariants in 10 ms returned sat
[2026-05-24 08:10:41] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2026-05-24 08:10:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:10:41] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2026-05-24 08:10:41] [INFO ] [Nat]Absence check using 37 positive and 6 generalized place invariants in 4 ms returned sat
[2026-05-24 08:10:42] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2026-05-24 08:10:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2026-05-24 08:10:42] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 14 ms.
[2026-05-24 08:10:42] [INFO ] Added : 122 causal constraints over 26 iterations in 527 ms. Result :sat
Minimization took 54 ms.
[2026-05-24 08:10:42] [INFO ] [Real]Absence check using 37 positive place invariants in 10 ms returned sat
[2026-05-24 08:10:42] [INFO ] [Real]Absence check using 37 positive and 6 generalized place invariants in 9 ms returned sat
[2026-05-24 08:10:42] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2026-05-24 08:10:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:10:43] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2026-05-24 08:10:43] [INFO ] [Nat]Absence check using 37 positive and 6 generalized place invariants in 9 ms returned sat
[2026-05-24 08:10:43] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2026-05-24 08:10:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 536 ms
[2026-05-24 08:10:43] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 13 ms.
[2026-05-24 08:10:44] [INFO ] Added : 122 causal constraints over 25 iterations in 442 ms. Result :sat
Minimization took 48 ms.
[2026-05-24 08:10:44] [INFO ] [Real]Absence check using 37 positive place invariants in 9 ms returned sat
[2026-05-24 08:10:44] [INFO ] [Real]Absence check using 37 positive and 6 generalized place invariants in 4 ms returned sat
[2026-05-24 08:10:44] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-24 08:10:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:10:44] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2026-05-24 08:10:44] [INFO ] [Nat]Absence check using 37 positive and 6 generalized place invariants in 4 ms returned sat
[2026-05-24 08:10:44] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-24 08:10:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 252 ms
[2026-05-24 08:10:45] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 14 ms.
[2026-05-24 08:10:45] [INFO ] Added : 121 causal constraints over 25 iterations in 440 ms. Result :sat
Minimization took 46 ms.
[2026-05-24 08:10:45] [INFO ] [Real]Absence check using 37 positive place invariants in 9 ms returned sat
[2026-05-24 08:10:45] [INFO ] [Real]Absence check using 37 positive and 6 generalized place invariants in 4 ms returned sat
[2026-05-24 08:10:45] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-24 08:10:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:10:45] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2026-05-24 08:10:45] [INFO ] [Nat]Absence check using 37 positive and 6 generalized place invariants in 5 ms returned sat
[2026-05-24 08:10:45] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-24 08:10:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 271 ms
[2026-05-24 08:10:46] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 9 ms.
[2026-05-24 08:10:46] [INFO ] Added : 119 causal constraints over 25 iterations in 417 ms. Result :sat
Minimization took 43 ms.
[2026-05-24 08:10:46] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2026-05-24 08:10:46] [INFO ] [Real]Absence check using 37 positive and 6 generalized place invariants in 5 ms returned sat
[2026-05-24 08:10:46] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-24 08:10:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:10:46] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2026-05-24 08:10:46] [INFO ] [Nat]Absence check using 37 positive and 6 generalized place invariants in 5 ms returned sat
[2026-05-24 08:10:47] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2026-05-24 08:10:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 751 ms
[2026-05-24 08:10:47] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 11 ms.
[2026-05-24 08:10:48] [INFO ] Added : 118 causal constraints over 24 iterations in 454 ms. Result :sat
Minimization took 55 ms.
[2026-05-24 08:10:48] [INFO ] [Real]Absence check using 37 positive place invariants in 9 ms returned sat
[2026-05-24 08:10:48] [INFO ] [Real]Absence check using 37 positive and 6 generalized place invariants in 4 ms returned sat
[2026-05-24 08:10:48] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2026-05-24 08:10:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:10:48] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2026-05-24 08:10:48] [INFO ] [Nat]Absence check using 37 positive and 6 generalized place invariants in 11 ms returned sat
[2026-05-24 08:10:48] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-24 08:10:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2026-05-24 08:10:48] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 8 ms.
[2026-05-24 08:10:49] [INFO ] Added : 121 causal constraints over 25 iterations in 440 ms. Result :sat
Minimization took 50 ms.
[2026-05-24 08:10:49] [INFO ] [Real]Absence check using 37 positive place invariants in 10 ms returned sat
[2026-05-24 08:10:49] [INFO ] [Real]Absence check using 37 positive and 6 generalized place invariants in 4 ms returned sat
[2026-05-24 08:10:49] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2026-05-24 08:10:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:10:49] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2026-05-24 08:10:49] [INFO ] [Nat]Absence check using 37 positive and 6 generalized place invariants in 4 ms returned sat
[2026-05-24 08:10:49] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-24 08:10:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 280 ms
[2026-05-24 08:10:49] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 12 ms.
[2026-05-24 08:10:50] [INFO ] Added : 124 causal constraints over 26 iterations in 352 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 204/204 transitions.
Graph (trivial) has 138 edges and 245 vertex of which 7 / 245 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) 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 (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 227 transition count 139
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 177 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 176 transition count 138
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 105 place count 176 transition count 103
Deduced a syphon composed of 35 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 75 rules applied. Total rules applied 180 place count 136 transition count 103
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 208 place count 108 transition count 75
Iterating global reduction 3 with 28 rules applied. Total rules applied 236 place count 108 transition count 75
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 316 place count 67 transition count 36
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 317 place count 67 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 318 place count 66 transition count 35
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 319 place count 66 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 320 place count 65 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 321 place count 64 transition count 34
Applied a total of 321 rules in 84 ms. Remains 64 /245 variables (removed 181) and now considering 34/204 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 64/245 places, 34/204 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9149609973881590592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13400307201390157114.kers'
[2026-05-24 08:10:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9149609973881590592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13400307201390157114.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 34 rows 44 cols 111 entries
Finished phase 1 with 31 SingleSign rule and 3 generalized
[2026-05-24 08:10:50] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13400307201390157114.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (43943 resets) in 1094 ms. (913 steps per ms)
FORMULA BusinessProcesses-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (27880 resets) in 803 ms. (1243 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 11473 ms.

BK_STOP 1779610252499

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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-5973"
echo " Executing tool itstools"
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 r034-tall-177946842000461"
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.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 ;