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

About the Execution of 2022-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
311.271 70062.00 107471.00 243.00 T normal

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.r256-tall-167856440600117.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 gold2022
Input is JoinFreeModules-PT-0100, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r256-tall-167856440600117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 304K 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 booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678662710442

Running Version 202205111006
[2023-03-12 23:11:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -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, 1800]
[2023-03-12 23:11:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:11:51] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2023-03-12 23:11:51] [INFO ] Transformed 501 places.
[2023-03-12 23:11:51] [INFO ] Transformed 801 transitions.
[2023-03-12 23:11:51] [INFO ] Parsed PT model containing 501 places and 801 transitions in 231 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 501/501 places, 801/801 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 801
Applied a total of 1 rules in 51 ms. Remains 500 /501 variables (removed 1) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 500 cols
[2023-03-12 23:11:52] [INFO ] Computed 100 place invariants in 14 ms
[2023-03-12 23:11:52] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
// Phase 1: matrix 801 rows 500 cols
[2023-03-12 23:11:52] [INFO ] Computed 100 place invariants in 4 ms
[2023-03-12 23:11:52] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 801 rows 500 cols
[2023-03-12 23:11:52] [INFO ] Computed 100 place invariants in 4 ms
[2023-03-12 23:11:52] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-12 23:11:52] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
// Phase 1: matrix 801 rows 500 cols
[2023-03-12 23:11:52] [INFO ] Computed 100 place invariants in 5 ms
[2023-03-12 23:11:53] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 500/501 places, 801/801 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/501 places, 801/801 transitions.
Discarding 400 transitions out of 801. Remains 401
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10045 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 400) seen :189
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 211) seen :0
Running SMT prover for 211 properties.
// Phase 1: matrix 801 rows 500 cols
[2023-03-12 23:11:53] [INFO ] Computed 100 place invariants in 6 ms
[2023-03-12 23:11:55] [INFO ] [Real]Absence check using 100 positive place invariants in 14 ms returned sat
[2023-03-12 23:12:04] [INFO ] After 11344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:211
[2023-03-12 23:12:06] [INFO ] [Nat]Absence check using 100 positive place invariants in 21 ms returned sat
[2023-03-12 23:12:22] [INFO ] After 14047ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :211
[2023-03-12 23:12:22] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-12 23:12:29] [INFO ] After 7627ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :210
[2023-03-12 23:12:29] [INFO ] After 7630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :210
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 23:12:29] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :210
Parikh walk visited 159 properties in 30208 ms.
Support contains 52 out of 500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 500/500 places, 801/801 transitions.
Graph (complete) has 1200 edges and 500 vertex of which 160 are kept as prefixes of interest. Removing 340 places using SCC suffix rule.6 ms
Discarding 340 places :
Also discarding 544 output transitions
Drop transitions removed 544 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 160 transition count 256
Applied a total of 2 rules in 32 ms. Remains 160 /500 variables (removed 340) and now considering 256/801 (removed 545) transitions.
// Phase 1: matrix 256 rows 160 cols
[2023-03-12 23:13:00] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-12 23:13:00] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/500 places, 256/801 transitions.
Finished random walk after 9998 steps, including 0 resets, run visited all 52 properties in 71 ms. (steps per millisecond=140 )
Able to resolve query QuasiLiveness after proving 401 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 68773 ms.

BK_STOP 1678662780504

--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 QuasiLiveness -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 1800 -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="JoinFreeModules-PT-0100"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 JoinFreeModules-PT-0100, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r256-tall-167856440600117"
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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;