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.r472-tajo-171620398600013.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 ltsminxred
Input is BridgeAndVehicles-COL-V10P10N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398600013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.8K Apr 13 01:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 13 01:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 01:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 01:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 13 01:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 01:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 13 01:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 38K 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 BridgeAndVehicles-COL-V10P10N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717217822088

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V10P10N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:57:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 04:57:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:57:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 04:57:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:57:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 695 ms
[2024-06-01 04:57:04] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 48 PT places and 5438.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2024-06-01 04:57:04] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2024-06-01 04:57:04] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 04:57:04] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 0, 0, 1, 0, 1, 0, 10] Max Struct:[1, 1, 1, 10, 1, 10, 1, 10, 10]
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 04:57:04] [INFO ] Invariant cache hit.
[2024-06-01 04:57:05] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 04:57:05] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 04:57:05] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:57:05] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 32 ms.
[2024-06-01 04:57:05] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 04:57:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:57:05] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:57:05] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 04:57:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 04:57:05] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:57:05] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:57:05] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 04:57:05] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 04:57:05] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 04:57:05] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:57:05] [INFO ] Added : 1 causal constraints over 1 iterations in 39 ms. Result :sat
Minimization took 30 ms.
[2024-06-01 04:57:05] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 04:57:05] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 04:57:05] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:57:05] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 04:57:05] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 04:57:05] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-01 04:57:05] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 04:57:05] [INFO ] Added : 2 causal constraints over 1 iterations in 43 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 10, 10, 10]
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 11)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 11) 11) 11)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 04:57:05] [INFO ] Unfolded HLPN to a Petri net with 48 places and 288 transitions 2090 arcs in 58 ms.
[2024-06-01 04:57:05] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 10, 10, 10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 10, 10, 10]
[2024-06-01 04:57:05] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2024-06-01 04:57:05] [INFO ] Computed 7 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 10, 10, 10]
RANDOM walk for 10000 steps (111 resets) in 98 ms. (101 steps per ms)
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (84 resets) in 138 ms. (143 steps per ms)
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[10]
[2024-06-01 04:57:06] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-06-01 04:57:06] [INFO ] Invariant cache hit.
[2024-06-01 04:57:06] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-01 04:57:06] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-01 04:57:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 04:57:06] [INFO ] [Real]Added 22 Read/Feed constraints in 29 ms returned sat
[2024-06-01 04:57:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 04:57:06] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 04:57:06] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2024-06-01 04:57:06] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 57 transitions) in 45 ms.
[2024-06-01 04:57:06] [INFO ] Added : 11 causal constraints over 3 iterations in 132 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[10]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 288/288 transitions.
Graph (complete) has 342 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 45 transition count 287
Applied a total of 3 rules in 140 ms. Remains 45 /48 variables (removed 3) and now considering 287/288 (removed 1) transitions.
Running 284 sub problems to find dead transitions.
[2024-06-01 04:57:06] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2024-06-01 04:57:06] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 04:57:06] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-01 04:57:07] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 6 ms to minimize.
[2024-06-01 04:57:08] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 2 ms to minimize.
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 2/7 constraints. Problems are: Problem set: 10 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 274 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD24 is UNSAT
At refinement iteration 3 (OVERLAPS) 89/134 variables, 45/52 constraints. Problems are: Problem set: 12 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 22/74 constraints. Problems are: Problem set: 12 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/74 constraints. Problems are: Problem set: 12 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/74 constraints. Problems are: Problem set: 12 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 74 constraints, problems are : Problem set: 12 solved, 272 unsolved in 4979 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 12 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 12 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 2/7 constraints. Problems are: Problem set: 12 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 12 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 89/134 variables, 45/52 constraints. Problems are: Problem set: 12 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 22/74 constraints. Problems are: Problem set: 12 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 272/346 constraints. Problems are: Problem set: 12 solved, 272 unsolved
[2024-06-01 04:57:16] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 1/347 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/347 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/347 constraints. Problems are: Problem set: 22 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 347 constraints, problems are : Problem set: 22 solved, 262 unsolved in 8992 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 272/284 constraints, Known Traps: 3/3 constraints]
After SMT, in 14587ms problems are : Problem set: 22 solved, 262 unsolved
Search for dead transitions found 22 dead transitions in 14621ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 22 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 45/48 places, 265/288 transitions.
Applied a total of 0 rules in 24 ms. Remains 45 /45 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14812 ms. Remains : 45/48 places, 265/288 transitions.
[2024-06-01 04:57:21] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2024-06-01 04:57:21] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[10]
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (12763 resets) in 2415 ms. (413 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 20038 ms.
ITS solved all properties within timeout

BK_STOP 1717217843957

--------------------
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="BridgeAndVehicles-COL-V10P10N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BridgeAndVehicles-COL-V10P10N10, 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 r472-tajo-171620398600013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V10P10N10.tgz
mv BridgeAndVehicles-COL-V10P10N10 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 ;