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-171620399000189.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-PT-V20P10N20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399000189
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 16K Apr 13 02:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 02:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 119K Apr 13 02:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 469K Apr 13 02:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.3K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 54K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 157K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 13 02:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 02:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 261K Apr 13 02:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 13 02:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 782K 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-PT-V20P10N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717219705379

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P10N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:28:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 05:28:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:28:26] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-06-01 05:28:26] [INFO ] Transformed 78 places.
[2024-06-01 05:28:26] [INFO ] Transformed 968 transitions.
[2024-06-01 05:28:26] [INFO ] Parsed PT model containing 78 places and 968 transitions and 7350 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 14
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[20, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[20, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 05:28:26] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2024-06-01 05:28:26] [INFO ] Computed 7 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[20, 10, 10, 2, 1, 20, 20, 1, 1, 1, 10, 20]
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (57 resets) in 108 ms. (91 steps per ms)
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-10 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (39 resets) in 95 ms. (208 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 6] Max Struct:[2, 10]
[2024-06-01 05:28:27] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2024-06-01 05:28:27] [INFO ] Invariant cache hit.
[2024-06-01 05:28:27] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2024-06-01 05:28:27] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:28:27] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-01 05:28:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:28:27] [INFO ] [Real]Added 42 Read/Feed constraints in 11 ms returned sat
[2024-06-01 05:28:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:28:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:28:27] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-06-01 05:28:27] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2024-06-01 05:28:27] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 107 transitions) in 71 ms.
[2024-06-01 05:28:27] [INFO ] Added : 21 causal constraints over 5 iterations in 192 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 6] Max Struct:[1, 10]
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[10]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 968/968 transitions.
Graph (complete) has 642 edges and 78 vertex of which 76 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 75 transition count 967
Applied a total of 3 rules in 140 ms. Remains 75 /78 variables (removed 3) and now considering 967/968 (removed 1) transitions.
Running 964 sub problems to find dead transitions.
[2024-06-01 05:28:28] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2024-06-01 05:28:28] [INFO ] Computed 5 invariants in 6 ms
[2024-06-01 05:28:28] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 964 unsolved
[2024-06-01 05:28:33] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 7 ms to minimize.
[2024-06-01 05:28:36] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 3 ms to minimize.
Problem TDEAD507 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD906 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 2/7 constraints. Problems are: Problem set: 20 solved, 944 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 944 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 3 (OVERLAPS) 169/244 variables, 75/82 constraints. Problems are: Problem set: 22 solved, 942 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 42/124 constraints. Problems are: Problem set: 22 solved, 942 unsolved
[2024-06-01 05:28:46] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD486 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 1/125 constraints. Problems are: Problem set: 42 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 244/244 variables, and 125 constraints, problems are : Problem set: 42 solved, 922 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 964/964 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 42 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 169/244 variables, 75/83 constraints. Problems are: Problem set: 42 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 42/125 constraints. Problems are: Problem set: 42 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 922/1047 constraints. Problems are: Problem set: 42 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/244 variables, and 1047 constraints, problems are : Problem set: 42 solved, 922 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 922/964 constraints, Known Traps: 3/3 constraints]
After SMT, in 43288ms problems are : Problem set: 42 solved, 922 unsolved
Search for dead transitions found 42 dead transitions in 43340ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 75/78 places, 925/968 transitions.
Applied a total of 0 rules in 54 ms. Remains 75 /75 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43592 ms. Remains : 75/78 places, 925/968 transitions.
[2024-06-01 05:29:11] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
// Phase 1: matrix 165 rows 75 cols
[2024-06-01 05:29:11] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[10]
RANDOM walk for 1000000 steps (6657 resets) in 3560 ms. (280 steps per ms)
BEST_FIRST walk for 1000000 steps (2572 resets) in 1488 ms. (671 steps per ms)
FORMULA BridgeAndVehicles-PT-V20P10N20-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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 50058 ms.
ITS solved all properties within timeout

BK_STOP 1717219756660

--------------------
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="BridgeAndVehicles-PT-V20P10N20"
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-PT-V20P10N20, 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-171620399000189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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