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

About the Execution of 2020-gold for NoC3x3-PT-3B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
246.376 3600000.00 37385.00 257.50 FTTTTTTFFTFFFTTF 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.r151-tall-162089151100135.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 NoC3x3-PT-3B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151100135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 06:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 07:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 07:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 581K May 5 16:51 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 NoC3x3-PT-3B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620994702521

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 12:18:24] [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, -timeout, 3600, -rebuildPNML]
[2021-05-14 12:18:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 12:18:24] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2021-05-14 12:18:24] [INFO ] Transformed 2117 places.
[2021-05-14 12:18:24] [INFO ] Transformed 2435 transitions.
[2021-05-14 12:18:24] [INFO ] Found NUPN structural information;
[2021-05-14 12:18:24] [INFO ] Parsed PT model containing 2117 places and 2435 transitions in 182 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 79 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 16 resets, run finished after 94 ms. (steps per millisecond=106 ) properties seen :[0, 0, 0, 0, 1, 0, 1, 0, 1, 0]
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 1, 0, 0, 0, 0, 0]
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 1, 0, 0]
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 2435 rows 2117 cols
[2021-05-14 12:18:24] [INFO ] Computed 66 place invariants in 76 ms
[2021-05-14 12:18:25] [INFO ] [Real]Absence check using 66 positive place invariants in 158 ms returned sat
[2021-05-14 12:18:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 12:18:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 12:18:29] [INFO ] [Real]Absence check using state equation in 4444 ms returned (error "Failed to check-sat")
[2021-05-14 12:18:30] [INFO ] [Real]Absence check using 66 positive place invariants in 137 ms returned sat
[2021-05-14 12:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 12:18:34] [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 (= s1314 (- t2292 t821))") while checking expression at index 1
[2021-05-14 12:18:35] [INFO ] [Real]Absence check using 66 positive place invariants in 149 ms returned sat
[2021-05-14 12:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 12:18:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 12:18:39] [INFO ] [Real]Absence check using state equation in 4601 ms returned (error "Failed to check-sat")
[2021-05-14 12:18:40] [INFO ] [Real]Absence check using 66 positive place invariants in 126 ms returned sat
[2021-05-14 12:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 12:18:44] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 12:18:44] [INFO ] [Real]Absence check using state equation in 4557 ms returned (error "Failed to check-sat")
[2021-05-14 12:18:45] [INFO ] [Real]Absence check using 66 positive place invariants in 122 ms returned sat
[2021-05-14 12:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 12:18:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 12:18:49] [INFO ] [Real]Absence check using state equation in 4632 ms returned (error "Failed to check-sat")
Support contains 15 out of 2117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1725 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 10 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Performed 432 Post agglomeration using F-continuation condition.Transition count delta: 432
Iterating post reduction 0 with 509 rules applied. Total rules applied 510 place count 2049 transition count 1931
Reduce places removed 432 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 438 rules applied. Total rules applied 948 place count 1617 transition count 1925
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 951 place count 1614 transition count 1925
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 951 place count 1614 transition count 1901
Deduced a syphon composed of 24 places in 8 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 999 place count 1590 transition count 1901
Symmetric choice reduction at 3 with 363 rule applications. Total rules 1362 place count 1590 transition count 1901
Deduced a syphon composed of 363 places in 11 ms
Reduce places removed 363 places and 363 transitions.
Iterating global reduction 3 with 726 rules applied. Total rules applied 2088 place count 1227 transition count 1538
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 2088 place count 1227 transition count 1497
Deduced a syphon composed of 41 places in 9 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 2170 place count 1186 transition count 1497
Symmetric choice reduction at 3 with 111 rule applications. Total rules 2281 place count 1186 transition count 1497
Deduced a syphon composed of 111 places in 5 ms
Reduce places removed 111 places and 111 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 2503 place count 1075 transition count 1386
Symmetric choice reduction at 3 with 133 rule applications. Total rules 2636 place count 1075 transition count 1386
Deduced a syphon composed of 133 places in 4 ms
Reduce places removed 133 places and 148 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 2902 place count 942 transition count 1238
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2954 place count 942 transition count 1238
Deduced a syphon composed of 52 places in 3 ms
Reduce places removed 52 places and 97 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 3058 place count 890 transition count 1141
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 19 rules applied. Total rules applied 3077 place count 888 transition count 1124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3079 place count 886 transition count 1124
Symmetric choice reduction at 5 with 37 rule applications. Total rules 3116 place count 886 transition count 1124
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 37 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 3190 place count 849 transition count 1087
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 3196 place count 846 transition count 1084
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 3199 place count 843 transition count 1084
Symmetric choice reduction at 7 with 25 rule applications. Total rules 3224 place count 843 transition count 1084
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 50 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 3274 place count 818 transition count 1034
Symmetric choice reduction at 7 with 25 rule applications. Total rules 3299 place count 818 transition count 1034
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 25 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 3349 place count 793 transition count 1009
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 7 with 32 rules applied. Total rules applied 3381 place count 789 transition count 981
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 3385 place count 785 transition count 981
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 300
Deduced a syphon composed of 300 places in 0 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 9 with 600 rules applied. Total rules applied 3985 place count 485 transition count 681
Symmetric choice reduction at 9 with 15 rule applications. Total rules 4000 place count 485 transition count 681
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 4030 place count 470 transition count 666
Symmetric choice reduction at 9 with 11 rule applications. Total rules 4041 place count 470 transition count 666
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 22 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 4063 place count 459 transition count 644
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 4065 place count 459 transition count 642
Symmetric choice reduction at 10 with 2 rule applications. Total rules 4067 place count 459 transition count 642
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 10 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 4071 place count 457 transition count 632
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -137
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 10 with 54 rules applied. Total rules applied 4125 place count 430 transition count 769
Free-agglomeration rule applied 21 times.
Iterating global reduction 10 with 21 rules applied. Total rules applied 4146 place count 430 transition count 748
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 4173 place count 409 transition count 742
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 4177 place count 409 transition count 738
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 4181 place count 405 transition count 738
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 4182 place count 405 transition count 738
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 4183 place count 405 transition count 737
Applied a total of 4183 rules in 941 ms. Remains 405 /2117 variables (removed 1712) and now considering 737/2435 (removed 1698) transitions.
Finished structural reductions, in 1 iterations. Remains : 405/2117 places, 737/2435 transitions.
Finished random walk after 24154 steps, including 311 resets, run visited all 5 properties in 161 ms. (steps per millisecond=150 )
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

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

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="NoC3x3-PT-3B"
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 NoC3x3-PT-3B, 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 r151-tall-162089151100135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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