fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r063-tajo-167813711600085
Last Updated
May 14, 2023

About the Execution of 2022-gold for CANConstruction-PT-080

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1359.924 82172.00 102168.00 78.50 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r063-tajo-167813711600085.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is CANConstruction-PT-080, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r063-tajo-167813711600085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 10M
-rw-r--r-- 1 mcc users 11K Feb 25 22:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.5M 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 CANConstruction-PT-080-UpperBounds-00
FORMULA_NAME CANConstruction-PT-080-UpperBounds-01
FORMULA_NAME CANConstruction-PT-080-UpperBounds-02
FORMULA_NAME CANConstruction-PT-080-UpperBounds-03
FORMULA_NAME CANConstruction-PT-080-UpperBounds-04
FORMULA_NAME CANConstruction-PT-080-UpperBounds-05
FORMULA_NAME CANConstruction-PT-080-UpperBounds-06
FORMULA_NAME CANConstruction-PT-080-UpperBounds-07
FORMULA_NAME CANConstruction-PT-080-UpperBounds-08
FORMULA_NAME CANConstruction-PT-080-UpperBounds-09
FORMULA_NAME CANConstruction-PT-080-UpperBounds-10
FORMULA_NAME CANConstruction-PT-080-UpperBounds-11
FORMULA_NAME CANConstruction-PT-080-UpperBounds-12
FORMULA_NAME CANConstruction-PT-080-UpperBounds-13
FORMULA_NAME CANConstruction-PT-080-UpperBounds-14
FORMULA_NAME CANConstruction-PT-080-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678933665501

Running Version 202205111006
[2023-03-16 02:27:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 02:27:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 02:27:47] [INFO ] Load time of PNML (sax parser for PT used): 623 ms
[2023-03-16 02:27:47] [INFO ] Transformed 13762 places.
[2023-03-16 02:27:47] [INFO ] Transformed 26240 transitions.
[2023-03-16 02:27:47] [INFO ] Parsed PT model containing 13762 places and 26240 transitions in 851 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 26240 rows 13762 cols
[2023-03-16 02:27:48] [INFO ] Computed 161 place invariants in 409 ms
FORMULA CANConstruction-PT-080-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 6 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 15) seen :6
FORMULA CANConstruction-PT-080-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
// Phase 1: matrix 26240 rows 13762 cols
[2023-03-16 02:27:49] [INFO ] Computed 161 place invariants in 214 ms
[2023-03-16 02:27:51] [INFO ] [Real]Absence check using 81 positive place invariants in 509 ms returned sat
[2023-03-16 02:27:51] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 78 ms returned sat
[2023-03-16 02:27:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:54] [INFO ] [Real]Absence check using state equation in 2810 ms returned unknown
[2023-03-16 02:27:56] [INFO ] [Real]Absence check using 81 positive place invariants in 499 ms returned sat
[2023-03-16 02:27:56] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 89 ms returned sat
[2023-03-16 02:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:59] [INFO ] [Real]Absence check using state equation in 2746 ms returned unknown
[2023-03-16 02:28:01] [INFO ] [Real]Absence check using 81 positive place invariants in 383 ms returned sat
[2023-03-16 02:28:01] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 83 ms returned sat
[2023-03-16 02:28:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:28:04] [INFO ] [Real]Absence check using state equation in 2961 ms returned unknown
[2023-03-16 02:28:06] [INFO ] [Real]Absence check using 81 positive place invariants in 532 ms returned sat
[2023-03-16 02:28:06] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 92 ms returned sat
[2023-03-16 02:28:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:28:09] [INFO ] [Real]Absence check using state equation in 2970 ms returned unknown
[2023-03-16 02:28:10] [INFO ] [Real]Absence check using 81 positive place invariants in 417 ms returned sat
[2023-03-16 02:28:11] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 79 ms returned sat
[2023-03-16 02:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:28:14] [INFO ] [Real]Absence check using state equation in 3205 ms returned unknown
[2023-03-16 02:28:15] [INFO ] [Real]Absence check using 81 positive place invariants in 363 ms returned sat
[2023-03-16 02:28:16] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 87 ms returned sat
[2023-03-16 02:28:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:28:19] [INFO ] [Real]Absence check using state equation in 3213 ms returned unknown
[2023-03-16 02:28:21] [INFO ] [Real]Absence check using 81 positive place invariants in 373 ms returned sat
[2023-03-16 02:28:21] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 80 ms returned sat
[2023-03-16 02:28:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:28:24] [INFO ] [Real]Absence check using state equation in 3171 ms returned unknown
[2023-03-16 02:28:25] [INFO ] [Real]Absence check using 81 positive place invariants in 362 ms returned sat
[2023-03-16 02:28:26] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 70 ms returned sat
[2023-03-16 02:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:28:29] [INFO ] [Real]Absence check using state equation in 3259 ms returned unknown
[2023-03-16 02:28:31] [INFO ] [Real]Absence check using 81 positive place invariants in 356 ms returned sat
[2023-03-16 02:28:31] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 87 ms returned sat
[2023-03-16 02:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:28:34] [INFO ] [Real]Absence check using state equation in 3194 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 13762 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13762 transition count 25680
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13202 transition count 25680
Discarding 6236 places :
Symmetric choice reduction at 2 with 6236 rule applications. Total rules 7356 place count 6966 transition count 13208
Iterating global reduction 2 with 6236 rules applied. Total rules applied 13592 place count 6966 transition count 13208
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 9 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 13752 place count 6886 transition count 13128
Free-agglomeration rule applied 152 times.
Iterating global reduction 2 with 152 rules applied. Total rules applied 13904 place count 6886 transition count 12976
Reduce places removed 152 places and 0 transitions.
Iterating post reduction 2 with 152 rules applied. Total rules applied 14056 place count 6734 transition count 12976
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 14064 place count 6734 transition count 12976
Applied a total of 14064 rules in 10207 ms. Remains 6734 /13762 variables (removed 7028) and now considering 12976/26240 (removed 13264) transitions.
Finished structural reductions, in 1 iterations. Remains : 6734/13762 places, 12976/26240 transitions.
// Phase 1: matrix 12976 rows 6734 cols
[2023-03-16 02:28:44] [INFO ] Computed 161 place invariants in 134 ms
Incomplete random walk after 1000000 steps, including 1802 resets, run finished after 22782 ms. (steps per millisecond=43 ) properties (out of 9) seen :9
FORMULA CANConstruction-PT-080-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 80856 ms.

BK_STOP 1678933747673

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="CANConstruction-PT-080"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is CANConstruction-PT-080, 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 r063-tajo-167813711600085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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