About the Execution of LTSMin+red for Kanban-PT-00500
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r233-tall-167856418700285.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Kanban-PT-00500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418700285
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 11:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 25 12:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K Mar 5 18:22 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 Kanban-PT-00500-UpperBounds-00
FORMULA_NAME Kanban-PT-00500-UpperBounds-01
FORMULA_NAME Kanban-PT-00500-UpperBounds-02
FORMULA_NAME Kanban-PT-00500-UpperBounds-03
FORMULA_NAME Kanban-PT-00500-UpperBounds-04
FORMULA_NAME Kanban-PT-00500-UpperBounds-05
FORMULA_NAME Kanban-PT-00500-UpperBounds-06
FORMULA_NAME Kanban-PT-00500-UpperBounds-07
FORMULA_NAME Kanban-PT-00500-UpperBounds-08
FORMULA_NAME Kanban-PT-00500-UpperBounds-09
FORMULA_NAME Kanban-PT-00500-UpperBounds-10
FORMULA_NAME Kanban-PT-00500-UpperBounds-11
FORMULA_NAME Kanban-PT-00500-UpperBounds-12
FORMULA_NAME Kanban-PT-00500-UpperBounds-13
FORMULA_NAME Kanban-PT-00500-UpperBounds-14
FORMULA_NAME Kanban-PT-00500-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679486703898
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Kanban-PT-00500
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 12:05:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 12:05:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:05:05] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-22 12:05:05] [INFO ] Transformed 16 places.
[2023-03-22 12:05:05] [INFO ] Transformed 16 transitions.
[2023-03-22 12:05:05] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 16 rows 16 cols
[2023-03-22 12:05:05] [INFO ] Computed 5 place invariants in 4 ms
FORMULA Kanban-PT-00500-UpperBounds-13 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00500-UpperBounds-11 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00500-UpperBounds-08 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00500-UpperBounds-07 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00500-UpperBounds-00 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10022 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1002 ) properties (out of 11) seen :3002
FORMULA Kanban-PT-00500-UpperBounds-15 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00500-UpperBounds-12 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00500-UpperBounds-10 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00500-UpperBounds-06 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00500-UpperBounds-05 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00500-UpperBounds-03 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :112
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :116
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :109
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 5) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 5) seen :68
[2023-03-22 12:05:05] [INFO ] Invariant cache hit.
[2023-03-22 12:05:05] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-22 12:05:05] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 12:05:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:05:05] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 12:05:05] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 12:05:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:05:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 12:05:05] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 12:05:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:05:05] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 12:05:05] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 12:05:05] [INFO ] Added : 7 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2023-03-22 12:05:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:05:06] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 12:05:06] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 12:05:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:05:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:05:06] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 12:05:06] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 12:05:06] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 12:05:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:05:06] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 12:05:06] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 12:05:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:05:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:05:06] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-22 12:05:06] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 12:05:06] [INFO ] Added : 7 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 12:05:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:05:06] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 12:05:06] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 12:05:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:05:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:05:06] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 12:05:06] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 12:05:06] [INFO ] Added : 14 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 12:05:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:05:06] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 12:05:06] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 12:05:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:05:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 12:05:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:05:06] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 12:05:06] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 12:05:06] [INFO ] Added : 14 causal constraints over 4 iterations in 12 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [1500, 500, 1500, 500, 500] Max seen :[52, 42, 52, 23, 23]
FORMULA Kanban-PT-00500-UpperBounds-14 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-00500-UpperBounds-09 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-00500-UpperBounds-02 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 13 edges and 16 vertex of which 8 / 16 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 9 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 9 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 6 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 4 transition count 3
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 2 transition count 2
Applied a total of 17 rules in 61 ms. Remains 2 /16 variables (removed 14) and now considering 2/16 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 2/16 places, 2/16 transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-22 12:05:07] [INFO ] Computed 1 place invariants in 0 ms
FORMULA Kanban-PT-00500-UpperBounds-04 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00500-UpperBounds-01 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000045 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=7463 ) properties (out of 0) seen :0
All properties solved without resorting to model-checking.
Total runtime 2453 ms.
ITS solved all properties within timeout
BK_STOP 1679486708712
--------------------
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.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="Kanban-PT-00500"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Kanban-PT-00500, 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 r233-tall-167856418700285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00500.tgz
mv Kanban-PT-00500 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 '
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 ;