fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r303-tall-162124171200111
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for GPUForwardProgress-PT-32b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
344.268 15342.00 24298.00 206.20 FFTTFFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171200111.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is GPUForwardProgress-PT-32b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171200111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 18K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 170K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 123K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.3K May 11 18:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 11 15:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 11 15:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 109K May 12 08:13 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 net-ReachabilityCardinality-00
FORMULA_NAME net-ReachabilityCardinality-01
FORMULA_NAME net-ReachabilityCardinality-02
FORMULA_NAME net-ReachabilityCardinality-03
FORMULA_NAME net-ReachabilityCardinality-04
FORMULA_NAME net-ReachabilityCardinality-05
FORMULA_NAME net-ReachabilityCardinality-06
FORMULA_NAME net-ReachabilityCardinality-07
FORMULA_NAME net-ReachabilityCardinality-08
FORMULA_NAME net-ReachabilityCardinality-09
FORMULA_NAME net-ReachabilityCardinality-10
FORMULA_NAME net-ReachabilityCardinality-11
FORMULA_NAME net-ReachabilityCardinality-12
FORMULA_NAME net-ReachabilityCardinality-13
FORMULA_NAME net-ReachabilityCardinality-14
FORMULA_NAME net-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621339461032

[2021-05-18 12:04:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 12:04:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:04:22] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2021-05-18 12:04:22] [INFO ] Transformed 644 places.
[2021-05-18 12:04:22] [INFO ] Transformed 677 transitions.
[2021-05-18 12:04:22] [INFO ] Found NUPN structural information;
[2021-05-18 12:04:22] [INFO ] Parsed PT model containing 644 places and 677 transitions in 114 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
FORMULA net-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 35 resets, run finished after 70 ms. (steps per millisecond=142 ) properties seen :[1, 0, 1, 0, 1, 0, 1, 1]
FORMULA net-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 1]
FORMULA net-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 677 rows 644 cols
[2021-05-18 12:04:22] [INFO ] Computed 34 place invariants in 18 ms
[2021-05-18 12:04:23] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 54 ms returned sat
[2021-05-18 12:04:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:04:24] [INFO ] [Real]Absence check using state equation in 997 ms returned sat
[2021-05-18 12:04:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:04:25] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 700 ms returned sat
[2021-05-18 12:04:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:04:26] [INFO ] [Nat]Absence check using state equation in 924 ms returned sat
[2021-05-18 12:04:26] [INFO ] Computed and/alt/rep : 676/1383/676 causal constraints in 51 ms.
[2021-05-18 12:04:29] [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 closed (=> (> t420 0) (and (> t419 0) (< o419 o420)))") while checking expression at index 0
[2021-05-18 12:04:29] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 35 ms returned sat
[2021-05-18 12:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:04:30] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2021-05-18 12:04:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:04:30] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 570 ms returned sat
[2021-05-18 12:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:04:31] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2021-05-18 12:04:31] [INFO ] Computed and/alt/rep : 676/1383/676 causal constraints in 45 ms.
[2021-05-18 12:04:35] [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: Broken pipe (=> (> t488 0) (and (> t487 0) (< o487 o488)))") while checking expression at index 1
Support contains 9 out of 644 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 644/644 places, 677/677 transitions.
Graph (trivial) has 562 edges and 644 vertex of which 7 / 644 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (complete) has 968 edges and 638 vertex of which 601 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.35 ms
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 356 Post agglomeration using F-continuation condition.Transition count delta: 356
Iterating post reduction 0 with 366 rules applied. Total rules applied 368 place count 601 transition count 308
Reduce places removed 356 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 388 rules applied. Total rules applied 756 place count 245 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 757 place count 244 transition count 276
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 757 place count 244 transition count 213
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 883 place count 181 transition count 213
Symmetric choice reduction at 3 with 35 rule applications. Total rules 918 place count 181 transition count 213
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 35 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 988 place count 146 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 988 place count 146 transition count 176
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 992 place count 144 transition count 176
Discarding 79 places :
Also discarding 78 output transitions
Drop transitions removed 78 transitions
Graph (complete) has 272 edges and 144 vertex of which 65 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.1 ms
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 3 with 23 rules applied. Total rules applied 1015 place count 65 transition count 76
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 4 with 55 rules applied. Total rules applied 1070 place count 43 transition count 43
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 1070 place count 43 transition count 39
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1078 place count 39 transition count 39
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1082 place count 39 transition count 39
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1090 place count 35 transition count 35
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 1111 place count 24 transition count 25
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1113 place count 24 transition count 25
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1115 place count 24 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1116 place count 23 transition count 22
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 1118 place count 22 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1119 place count 21 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 1119 place count 21 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1125 place count 18 transition count 18
Applied a total of 1125 rules in 134 ms. Remains 18 /644 variables (removed 626) and now considering 18/677 (removed 659) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/644 places, 18/677 transitions.
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=14 )
FORMULA net-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621339476374

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="GPUForwardProgress-PT-32b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is GPUForwardProgress-PT-32b, 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 r303-tall-162124171200111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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