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.r476-tall-171620505500269.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 ltsminxred
Input is CSRepetitions-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505500269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 559K Apr 12 10:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Apr 12 10:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 699K Apr 12 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 243K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 645K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 252K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 779K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 562K Apr 12 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.0M Apr 12 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.8M Apr 12 12:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 34K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 67K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 CSRepetitions-PT-10-UpperBounds-00
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-01
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-02
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-03
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-04
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-05
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-06
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-07
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-08
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-09
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-10
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-11
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-12
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-13
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-14
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717203422214

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:57:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 00:57:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:57:03] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2024-06-01 00:57:03] [INFO ] Transformed 1311 places.
[2024-06-01 00:57:03] [INFO ] Transformed 2300 transitions.
[2024-06-01 00:57:03] [INFO ] Parsed PT model containing 1311 places and 2300 transitions and 8700 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Current structural bounds on expressions (Initially) : Max Seen:[10, 100, 0, 0, 0, 1, 0, 1, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[10, 100, 0, 0, 0, 1, 0, 1, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2300 rows 1311 cols
[2024-06-01 00:57:03] [INFO ] Computed 110 invariants in 74 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 100, 0, 0, 0, 1, 0, 1, 1, 0, 0] Max Struct:[+inf, 100, 100, +inf, 1000, 1, +inf, 1, 1, +inf, 1]
FORMULA CSRepetitions-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (54 resets) in 450 ms. (22 steps per ms)
FORMULA CSRepetitions-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 352 ms. (141 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10, 10, 1, 2] Max Struct:[+inf, +inf, 1000, +inf, +inf]
[2024-06-01 00:57:04] [INFO ] Invariant cache hit.
[2024-06-01 00:57:05] [INFO ] [Real]Absence check using 110 positive place invariants in 39 ms returned sat
[2024-06-01 00:57:05] [INFO ] [Real]Absence check using state equation in 713 ms returned unsat
[2024-06-01 00:57:06] [INFO ] [Real]Absence check using 110 positive place invariants in 38 ms returned sat
[2024-06-01 00:57:06] [INFO ] [Real]Absence check using state equation in 541 ms returned unsat
[2024-06-01 00:57:06] [INFO ] [Real]Absence check using 110 positive place invariants in 30 ms returned unsat
[2024-06-01 00:57:07] [INFO ] [Real]Absence check using 110 positive place invariants in 28 ms returned sat
[2024-06-01 00:57:07] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2024-06-01 00:57:07] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 00:57:07] [INFO ] [Real]Added 100 Read/Feed constraints in 25 ms returned sat
[2024-06-01 00:57:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:57:08] [INFO ] [Nat]Absence check using 110 positive place invariants in 34 ms returned sat
[2024-06-01 00:57:08] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2024-06-01 00:57:08] [INFO ] [Nat]Added 100 Read/Feed constraints in 13 ms returned sat
[2024-06-01 00:57:08] [INFO ] Computed and/alt/rep : 2200/3200/2200 causal constraints (skipped 0 transitions) in 177 ms.
[2024-06-01 00:57:09] [INFO ] Added : 1 causal constraints over 1 iterations in 482 ms. Result :sat
Minimization took 619 ms.
[2024-06-01 00:57:09] [INFO ] [Real]Absence check using 110 positive place invariants in 38 ms returned sat
[2024-06-01 00:57:10] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2024-06-01 00:57:10] [INFO ] [Real]Added 100 Read/Feed constraints in 12 ms returned sat
[2024-06-01 00:57:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:57:10] [INFO ] [Nat]Absence check using 110 positive place invariants in 30 ms returned sat
[2024-06-01 00:57:11] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2024-06-01 00:57:11] [INFO ] [Nat]Added 100 Read/Feed constraints in 13 ms returned sat
[2024-06-01 00:57:11] [INFO ] Computed and/alt/rep : 2200/3200/2200 causal constraints (skipped 0 transitions) in 113 ms.
[2024-06-01 00:57:11] [INFO ] Added : 1 causal constraints over 1 iterations in 359 ms. Result :sat
Minimization took 620 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10, 10, 1, 2] Max Struct:[10, 10, 10, +inf, +inf]
FORMULA CSRepetitions-PT-10-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 2] Max Struct:[+inf, +inf]
Support contains 2 out of 1311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 1311 transition count 2202
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 398 place count 1111 transition count 2102
Discarding 990 places :
Symmetric choice reduction at 1 with 990 rule applications. Total rules 1388 place count 121 transition count 1112
Iterating global reduction 1 with 990 rules applied. Total rules applied 2378 place count 121 transition count 1112
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 2467 place count 32 transition count 222
Iterating global reduction 1 with 89 rules applied. Total rules applied 2556 place count 32 transition count 222
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 2645 place count 32 transition count 133
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 2675 place count 12 transition count 123
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Graph (trivial) has 18 edges and 12 vertex of which 10 / 12 are part of one of the 1 SCC in 2 ms
Free SCC test removed 9 places
Iterating post reduction 2 with 100 rules applied. Total rules applied 2775 place count 3 transition count 24
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 2793 place count 3 transition count 6
Applied a total of 2793 rules in 404 ms. Remains 3 /1311 variables (removed 1308) and now considering 6/2300 (removed 2294) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 ms. Remains : 3/1311 places, 6/2300 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 6 rows 3 cols
[2024-06-01 00:57:12] [INFO ] Computed 0 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 2] Max Struct:[+inf, +inf]
RANDOM walk for 1000002 steps (22293 resets) in 184 ms. (5405 steps per ms)
BEST_FIRST walk for 2000002 steps (12720 resets) in 390 ms. (5115 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[+inf, +inf]
[2024-06-01 00:57:13] [INFO ] Invariant cache hit.
[2024-06-01 00:57:13] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
[2024-06-01 00:57:13] [INFO ] [Real]Absence check using state equation in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[10, 10]
FORMULA CSRepetitions-PT-10-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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 10261 ms.
ITS solved all properties within timeout

BK_STOP 1717203433717

--------------------
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="CSRepetitions-PT-10"
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 CSRepetitions-PT-10, 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 r476-tall-171620505500269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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