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.r549-tall-171734898000205.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 FireWire-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898000205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 91K 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 FireWire-PT-05-UpperBounds-00
FORMULA_NAME FireWire-PT-05-UpperBounds-01
FORMULA_NAME FireWire-PT-05-UpperBounds-02
FORMULA_NAME FireWire-PT-05-UpperBounds-03
FORMULA_NAME FireWire-PT-05-UpperBounds-04
FORMULA_NAME FireWire-PT-05-UpperBounds-05
FORMULA_NAME FireWire-PT-05-UpperBounds-06
FORMULA_NAME FireWire-PT-05-UpperBounds-07
FORMULA_NAME FireWire-PT-05-UpperBounds-08
FORMULA_NAME FireWire-PT-05-UpperBounds-09
FORMULA_NAME FireWire-PT-05-UpperBounds-10
FORMULA_NAME FireWire-PT-05-UpperBounds-11
FORMULA_NAME FireWire-PT-05-UpperBounds-12
FORMULA_NAME FireWire-PT-05-UpperBounds-13
FORMULA_NAME FireWire-PT-05-UpperBounds-14
FORMULA_NAME FireWire-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717365902230

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:05:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 22:05:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:05:03] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-02 22:05:03] [INFO ] Transformed 114 places.
[2024-06-02 22:05:03] [INFO ] Transformed 373 transitions.
[2024-06-02 22:05:03] [INFO ] Found NUPN structural information;
[2024-06-02 22:05:03] [INFO ] Parsed PT model containing 114 places and 373 transitions and 1389 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 57 transitions
Reduce redundant transitions removed 57 transitions.
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]
[2024-06-02 22:05:03] [INFO ] Flow matrix only has 284 transitions (discarded 32 similar events)
// Phase 1: matrix 284 rows 114 cols
[2024-06-02 22:05:03] [INFO ] Computed 8 invariants in 17 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 (540 resets) in 42 ms. (232 steps per ms)
FORMULA FireWire-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (673 resets) in 57 ms. (862 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-02 22:05:03] [INFO ] Flow matrix only has 284 transitions (discarded 32 similar events)
[2024-06-02 22:05:03] [INFO ] Invariant cache hit.
[2024-06-02 22:05:03] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 22:05:03] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-06-02 22:05:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:05:04] [INFO ] [Real]Added 40 Read/Feed constraints in 19 ms returned sat
[2024-06-02 22:05:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:05:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:05:04] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-02 22:05:04] [INFO ] [Nat]Added 40 Read/Feed constraints in 17 ms returned sat
[2024-06-02 22:05:04] [INFO ] Computed and/alt/rep : 110/403/110 causal constraints (skipped 173 transitions) in 32 ms.
[2024-06-02 22:05:04] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 7 ms to minimize.
[2024-06-02 22:05:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-06-02 22:05:04] [INFO ] Added : 7 causal constraints over 2 iterations in 167 ms. Result :sat
Minimization took 50 ms.
[2024-06-02 22:05:04] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:05:04] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-06-02 22:05:04] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-06-02 22:05:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:05:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:05:04] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-02 22:05:04] [INFO ] [Nat]Added 40 Read/Feed constraints in 11 ms returned sat
[2024-06-02 22:05:04] [INFO ] Computed and/alt/rep : 110/403/110 causal constraints (skipped 173 transitions) in 31 ms.
[2024-06-02 22:05:04] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:05:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-06-02 22:05:04] [INFO ] Added : 19 causal constraints over 4 iterations in 199 ms. Result :sat
Minimization took 50 ms.
[2024-06-02 22:05:04] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:05:04] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-02 22:05:04] [INFO ] [Real]Added 40 Read/Feed constraints in 7 ms returned sat
[2024-06-02 22:05:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:05:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:05:05] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 22:05:05] [INFO ] [Nat]Added 40 Read/Feed constraints in 12 ms returned sat
[2024-06-02 22:05:05] [INFO ] Computed and/alt/rep : 110/403/110 causal constraints (skipped 173 transitions) in 24 ms.
[2024-06-02 22:05:05] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:05:05] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:05:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2024-06-02 22:05:05] [INFO ] Added : 18 causal constraints over 6 iterations in 288 ms. Result :sat
Minimization took 48 ms.
[2024-06-02 22:05:05] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:05:05] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-02 22:05:05] [INFO ] [Real]Added 40 Read/Feed constraints in 9 ms returned sat
[2024-06-02 22:05:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:05:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:05:05] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 22:05:05] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2024-06-02 22:05:05] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:05:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-06-02 22:05:05] [INFO ] Computed and/alt/rep : 110/403/110 causal constraints (skipped 173 transitions) in 29 ms.
[2024-06-02 22:05:06] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:05:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-06-02 22:05:06] [INFO ] Added : 44 causal constraints over 12 iterations in 345 ms. Result :sat
Minimization took 54 ms.
[2024-06-02 22:05:06] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:05:06] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-02 22:05:06] [INFO ] [Real]Added 40 Read/Feed constraints in 16 ms returned sat
[2024-06-02 22:05:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:05:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:05:06] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-02 22:05:06] [INFO ] [Nat]Added 40 Read/Feed constraints in 11 ms returned sat
[2024-06-02 22:05:06] [INFO ] Computed and/alt/rep : 110/403/110 causal constraints (skipped 173 transitions) in 27 ms.
[2024-06-02 22:05:06] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:05:06] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-02 22:05:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2024-06-02 22:05:06] [INFO ] Added : 23 causal constraints over 6 iterations in 276 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA FireWire-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-05-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 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 316/316 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 114 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 113 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 113 transition count 311
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 112 transition count 311
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 10 place count 109 transition count 305
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 109 transition count 305
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 109 transition count 302
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 106 transition count 308
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 28 place count 106 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 37 place count 106 transition count 293
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 106 transition count 295
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 41 place count 105 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 43 place count 105 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 44 place count 104 transition count 290
Applied a total of 44 rules in 109 ms. Remains 104 /114 variables (removed 10) and now considering 290/316 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 104/114 places, 290/316 transitions.
[2024-06-02 22:05:07] [INFO ] Flow matrix only has 261 transitions (discarded 29 similar events)
// Phase 1: matrix 261 rows 104 cols
[2024-06-02 22:05:07] [INFO ] Computed 8 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (64055 resets) in 1202 ms. (831 steps per ms)
FORMULA FireWire-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (16475 resets) in 444 ms. (2247 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 22:05:08] [INFO ] Flow matrix only has 261 transitions (discarded 29 similar events)
[2024-06-02 22:05:08] [INFO ] Invariant cache hit.
[2024-06-02 22:05:08] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:05:08] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 22:05:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:05:08] [INFO ] [Real]Added 40 Read/Feed constraints in 29 ms returned sat
[2024-06-02 22:05:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:05:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 22:05:08] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 22:05:08] [INFO ] [Nat]Added 40 Read/Feed constraints in 21 ms returned sat
[2024-06-02 22:05:08] [INFO ] Computed and/alt/rep : 114/462/114 causal constraints (skipped 145 transitions) in 20 ms.
[2024-06-02 22:05:09] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:05:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-06-02 22:05:09] [INFO ] Added : 7 causal constraints over 3 iterations in 134 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 104 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p17) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 288/288 transitions.
Applied a total of 0 rules in 9 ms. Remains 104 /104 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 104/104 places, 288/288 transitions.
[2024-06-02 22:05:09] [INFO ] Flow matrix only has 259 transitions (discarded 29 similar events)
// Phase 1: matrix 259 rows 104 cols
[2024-06-02 22:05:09] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA FireWire-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (63602 resets) in 1079 ms. (925 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 6967 ms.
ITS solved all properties within timeout

BK_STOP 1717365910334

--------------------
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="FireWire-PT-05"
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 FireWire-PT-05, 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 r549-tall-171734898000205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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