fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r143-tall-165271830200071
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for JoinFreeModules-PT-0100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
839.348 33776.00 44416.00 263.50 TFFFFTTTTFTTTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r143-tall-165271830200071.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is JoinFreeModules-PT-0100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-tall-165271830200071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 7.6K Apr 30 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 02:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 30 02:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 30 02:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 30 02:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 02:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 304K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-00
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-01
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-02
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-03
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-04
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-05
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-06
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-07
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-08
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-09
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-10
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-11
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-12
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-13
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-14
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655068718110

Running Version 0
[2022-06-12 21:18:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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]
[2022-06-12 21:18:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:18:39] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-06-12 21:18:39] [INFO ] Transformed 501 places.
[2022-06-12 21:18:39] [INFO ] Transformed 801 transitions.
[2022-06-12 21:18:39] [INFO ] Parsed PT model containing 501 places and 801 transitions in 128 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 156 ms.
Working with output stream class java.io.PrintStream
[2022-06-12 21:18:39] [INFO ] Initial state test concluded for 6 properties.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10042 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=110 ) properties (out of 10) seen :5
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :1
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 801 rows 500 cols
[2022-06-12 21:18:40] [INFO ] Computed 100 place invariants in 16 ms
[2022-06-12 21:18:40] [INFO ] [Real]Absence check using 100 positive place invariants in 27 ms returned sat
[2022-06-12 21:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:40] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2022-06-12 21:18:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:40] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2022-06-12 21:18:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:41] [INFO ] [Nat]Absence check using state equation in 987 ms returned sat
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 3 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-06-12 21:18:42] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 80 ms.
[2022-06-12 21:18:44] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 14 ms to minimize.
[2022-06-12 21:18:44] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 2 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 495 ms
[2022-06-12 21:18:45] [INFO ] Added : 213 causal constraints over 44 iterations in 3264 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-12 21:18:45] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned sat
[2022-06-12 21:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:45] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2022-06-12 21:18:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:45] [INFO ] [Nat]Absence check using 100 positive place invariants in 29 ms returned sat
[2022-06-12 21:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:46] [INFO ] [Nat]Absence check using state equation in 888 ms returned sat
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 314 ms
[2022-06-12 21:18:47] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 45 ms.
[2022-06-12 21:18:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-12 21:18:50] [INFO ] [Real]Absence check using 100 positive place invariants in 21 ms returned sat
[2022-06-12 21:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:51] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2022-06-12 21:18:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:51] [INFO ] [Nat]Absence check using 100 positive place invariants in 18 ms returned sat
[2022-06-12 21:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:51] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2022-06-12 21:18:52] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 37 ms.
[2022-06-12 21:18:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-06-12 21:18:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-06-12 21:18:53] [INFO ] Added : 172 causal constraints over 35 iterations in 1965 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-12 21:18:54] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2022-06-12 21:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:54] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2022-06-12 21:18:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:54] [INFO ] [Nat]Absence check using 100 positive place invariants in 16 ms returned sat
[2022-06-12 21:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:54] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2022-06-12 21:18:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-06-12 21:18:54] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-06-12 21:18:54] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-06-12 21:18:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 178 ms
[2022-06-12 21:18:55] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 37 ms.
[2022-06-12 21:18:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-06-12 21:18:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-06-12 21:18:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-06-12 21:18:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-06-12 21:18:57] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 550 ms
[2022-06-12 21:18:58] [INFO ] Added : 238 causal constraints over 49 iterations in 3244 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Incomplete Parikh walk after 1077900 steps, including 101 resets, run finished after 8265 ms. (steps per millisecond=130 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 515100 steps, including 100 resets, run finished after 4169 ms. (steps per millisecond=123 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 1415 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=67 )
FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655068751886

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="JoinFreeModules-PT-0100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is JoinFreeModules-PT-0100, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r143-tall-165271830200071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0100.tgz
mv JoinFreeModules-PT-0100 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;