Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398400509.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BusinessProcesses-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398400509
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 11 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716304411595

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:13:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 15:13:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:13:33] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-21 15:13:33] [INFO ] Transformed 393 places.
[2024-05-21 15:13:33] [INFO ] Transformed 344 transitions.
[2024-05-21 15:13:33] [INFO ] Found NUPN structural information;
[2024-05-21 15:13:33] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-UpperBounds-05 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]
// Phase 1: matrix 331 rows 380 cols
[2024-05-21 15:13:33] [INFO ] Computed 58 invariants in 30 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 (87 resets) in 38 ms. (256 steps per ms)
FORMULA BusinessProcesses-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (32 resets) in 25 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-21 15:13:33] [INFO ] Invariant cache hit.
[2024-05-21 15:13:33] [INFO ] [Real]Absence check using 44 positive place invariants in 25 ms returned sat
[2024-05-21 15:13:33] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 9 ms returned sat
[2024-05-21 15:13:33] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-05-21 15:13:34] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 25 ms to minimize.
[2024-05-21 15:13:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:13:34] [INFO ] [Nat]Absence check using 44 positive place invariants in 18 ms returned sat
[2024-05-21 15:13:34] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 19 ms returned sat
[2024-05-21 15:13:35] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2024-05-21 15:13:35] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
[2024-05-21 15:13:35] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:13:35] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 4 ms to minimize.
[2024-05-21 15:13:35] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 11 ms to minimize.
[2024-05-21 15:13:36] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:13:36] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:13:36] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 5 ms to minimize.
[2024-05-21 15:13:36] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:13:36] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:13:36] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:13:36] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:13:37] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:13:37] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:13:37] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:13:37] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:13:37] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:13:37] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 4 ms to minimize.
[2024-05-21 15:13:37] [INFO ] Deduced a trap composed of 98 places in 201 ms of which 27 ms to minimize.
[2024-05-21 15:13:38] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 3 ms to minimize.
[2024-05-21 15:13:38] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:13:38] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:13:38] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:13:38] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:13:38] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:13:38] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:13:38] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:13:39] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:13:39] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:13:39] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:13:39] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:13:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 15:13:39] [INFO ] [Real]Absence check using 44 positive place invariants in 13 ms returned sat
[2024-05-21 15:13:39] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 22 ms returned sat
[2024-05-21 15:13:39] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-21 15:13:39] [INFO ] Deduced a trap composed of 89 places in 163 ms of which 2 ms to minimize.
[2024-05-21 15:13:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:13:40] [INFO ] [Nat]Absence check using 44 positive place invariants in 23 ms returned sat
[2024-05-21 15:13:40] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-21 15:13:40] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-21 15:13:40] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 3 ms to minimize.
[2024-05-21 15:13:40] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:13:40] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 6 ms to minimize.
[2024-05-21 15:13:40] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:13:40] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:13:41] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:13:41] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:13:41] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 2 ms to minimize.
[2024-05-21 15:13:41] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2024-05-21 15:13:41] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:13:41] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:13:41] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:13:42] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:13:42] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:13:42] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:13:42] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:13:42] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:13:42] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:13:42] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:13:42] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2449 ms
[2024-05-21 15:13:42] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 22 ms.
[2024-05-21 15:13:43] [INFO ] Added : 184 causal constraints over 39 iterations in 893 ms. Result :sat
Minimization took 224 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[1, 1]
Support contains 2 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 331/331 transitions.
Graph (trivial) has 241 edges and 380 vertex of which 8 / 380 are part of one of the 1 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 724 edges and 373 vertex of which 364 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 364 transition count 223
Reduce places removed 96 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 268 transition count 221
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 199 place count 266 transition count 221
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 199 place count 266 transition count 174
Deduced a syphon composed of 47 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 105 rules applied. Total rules applied 304 place count 208 transition count 174
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 369 place count 143 transition count 109
Iterating global reduction 3 with 65 rules applied. Total rules applied 434 place count 143 transition count 109
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 434 place count 143 transition count 103
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 449 place count 134 transition count 103
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 559 place count 79 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 560 place count 78 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 561 place count 77 transition count 47
Applied a total of 561 rules in 102 ms. Remains 77 /380 variables (removed 303) and now considering 47/331 (removed 284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 77/380 places, 47/331 transitions.
// Phase 1: matrix 47 rows 77 cols
[2024-05-21 15:13:44] [INFO ] Computed 36 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1] Max Struct:[1, 1]
FORMULA BusinessProcesses-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (51479 resets) in 1600 ms. (624 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 12959 ms.
ITS solved all properties within timeout

BK_STOP 1716304425814

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-08, 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 r047-tajo-171620398400509"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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