Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r575-smll-171734919800181.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is MedleyA-PT-23, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919800181
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 150K Jun 2 16:33 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 MedleyA-PT-23-UpperBounds-00
FORMULA_NAME MedleyA-PT-23-UpperBounds-01
FORMULA_NAME MedleyA-PT-23-UpperBounds-02
FORMULA_NAME MedleyA-PT-23-UpperBounds-03
FORMULA_NAME MedleyA-PT-23-UpperBounds-04
FORMULA_NAME MedleyA-PT-23-UpperBounds-05
FORMULA_NAME MedleyA-PT-23-UpperBounds-06
FORMULA_NAME MedleyA-PT-23-UpperBounds-07
FORMULA_NAME MedleyA-PT-23-UpperBounds-08
FORMULA_NAME MedleyA-PT-23-UpperBounds-09
FORMULA_NAME MedleyA-PT-23-UpperBounds-10
FORMULA_NAME MedleyA-PT-23-UpperBounds-11
FORMULA_NAME MedleyA-PT-23-UpperBounds-12
FORMULA_NAME MedleyA-PT-23-UpperBounds-13
FORMULA_NAME MedleyA-PT-23-UpperBounds-14
FORMULA_NAME MedleyA-PT-23-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717391921181

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 05:18:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-03 05:18:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 05:18:44] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2024-06-03 05:18:44] [INFO ] Transformed 378 places.
[2024-06-03 05:18:44] [INFO ] Transformed 614 transitions.
[2024-06-03 05:18:44] [INFO ] Found NUPN structural information;
[2024-06-03 05:18:44] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 475 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
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, 0] Max Struct:[1, 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 614 rows 378 cols
[2024-06-03 05:18:44] [INFO ] Computed 11 invariants in 51 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (16 resets) in 110 ms. (90 steps per ms)
FORMULA MedleyA-PT-23-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (85 resets) in 189 ms. (315 steps per ms)
FORMULA MedleyA-PT-23-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-03 05:18:44] [INFO ] Invariant cache hit.
[2024-06-03 05:18:45] [INFO ] [Real]Absence check using 9 positive place invariants in 25 ms returned sat
[2024-06-03 05:18:45] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 9 ms returned sat
[2024-06-03 05:18:45] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2024-06-03 05:18:46] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 166 ms.
[2024-06-03 05:18:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 05:18:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2024-06-03 05:18:46] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 6 ms returned sat
[2024-06-03 05:18:47] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2024-06-03 05:18:47] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 129 ms.
[2024-06-03 05:18:50] [INFO ] Added : 210 causal constraints over 43 iterations in 2899 ms. Result :sat
Minimization took 503 ms.
[2024-06-03 05:18:50] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2024-06-03 05:18:50] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 6 ms returned sat
[2024-06-03 05:18:51] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2024-06-03 05:18:51] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 110 ms.
[2024-06-03 05:18:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 05:18:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2024-06-03 05:18:51] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 8 ms returned sat
[2024-06-03 05:18:51] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2024-06-03 05:18:52] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 86 ms.
[2024-06-03 05:18:54] [INFO ] Added : 154 causal constraints over 32 iterations in 2274 ms. Result :sat
Minimization took 474 ms.
[2024-06-03 05:18:55] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2024-06-03 05:18:55] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 6 ms returned sat
[2024-06-03 05:18:55] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2024-06-03 05:18:55] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 87 ms.
[2024-06-03 05:18:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 05:18:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 23 ms returned sat
[2024-06-03 05:18:55] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 9 ms returned sat
[2024-06-03 05:18:56] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2024-06-03 05:18:56] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 81 ms.
[2024-06-03 05:18:58] [INFO ] Added : 172 causal constraints over 35 iterations in 1978 ms. Result :sat
Minimization took 450 ms.
[2024-06-03 05:18:58] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2024-06-03 05:18:58] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 7 ms returned sat
[2024-06-03 05:18:59] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2024-06-03 05:18:59] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 40 ms to minimize.
[2024-06-03 05:18:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 05:18:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2024-06-03 05:18:59] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 6 ms returned sat
[2024-06-03 05:19:00] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2024-06-03 05:19:00] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 4 ms to minimize.
[2024-06-03 05:19:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2024-06-03 05:19:00] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 93 ms.
[2024-06-03 05:19:02] [INFO ] Added : 177 causal constraints over 36 iterations in 1803 ms. Result :sat
Minimization took 513 ms.
[2024-06-03 05:19:02] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned sat
[2024-06-03 05:19:02] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 4 ms returned sat
[2024-06-03 05:19:03] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-06-03 05:19:03] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 4 ms to minimize.
[2024-06-03 05:19:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 05:19:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-06-03 05:19:03] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 4 ms returned sat
[2024-06-03 05:19:03] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-06-03 05:19:04] [INFO ] Deduced a trap composed of 65 places in 345 ms of which 5 ms to minimize.
[2024-06-03 05:19:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 396 ms
[2024-06-03 05:19:04] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 56 ms.
[2024-06-03 05:19:05] [INFO ] Added : 134 causal constraints over 27 iterations in 1340 ms. Result :sat
Minimization took 316 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA MedleyA-PT-23-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-23-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 614/614 transitions.
Graph (trivial) has 333 edges and 378 vertex of which 39 / 378 are part of one of the 3 SCC in 5 ms
Free SCC test removed 36 places
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 1035 edges and 342 vertex of which 339 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 114 rules applied. Total rules applied 116 place count 339 transition count 452
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 116 rules applied. Total rules applied 232 place count 228 transition count 447
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 234 place count 226 transition count 447
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 307 place count 153 transition count 374
Iterating global reduction 3 with 73 rules applied. Total rules applied 380 place count 153 transition count 374
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 380 place count 153 transition count 364
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 400 place count 143 transition count 364
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 403 place count 143 transition count 361
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 438 place count 108 transition count 256
Iterating global reduction 4 with 35 rules applied. Total rules applied 473 place count 108 transition count 256
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 15 rules applied. Total rules applied 488 place count 108 transition count 241
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 494 place count 105 transition count 238
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 496 place count 103 transition count 234
Iterating global reduction 6 with 2 rules applied. Total rules applied 498 place count 103 transition count 234
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 500 place count 101 transition count 228
Iterating global reduction 6 with 2 rules applied. Total rules applied 502 place count 101 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 504 place count 101 transition count 226
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 532 place count 87 transition count 212
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 552 place count 77 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 561 place count 77 transition count 219
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 563 place count 75 transition count 213
Iterating global reduction 7 with 2 rules applied. Total rules applied 565 place count 75 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 567 place count 75 transition count 211
Free-agglomeration rule applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 588 place count 75 transition count 190
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 618 place count 54 transition count 181
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 624 place count 51 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 625 place count 50 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 626 place count 49 transition count 177
Applied a total of 626 rules in 187 ms. Remains 49 /378 variables (removed 329) and now considering 177/614 (removed 437) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 49/378 places, 177/614 transitions.
[2024-06-03 05:19:06] [INFO ] Flow matrix only has 171 transitions (discarded 6 similar events)
// Phase 1: matrix 171 rows 49 cols
[2024-06-03 05:19:06] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (11719 resets) in 2695 ms. (370 steps per ms)
FORMULA MedleyA-PT-23-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (1224 resets) in 532 ms. (1876 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 26426 ms.
ITS solved all properties within timeout

BK_STOP 1717391950091

--------------------
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.202405141337.jar
+ 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="MedleyA-PT-23"
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 MedleyA-PT-23, 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 r575-smll-171734919800181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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