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

About the Execution of ITS-Tools for Peterson-COL-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
242.376 5462.00 10080.00 258.50 TFFTTTFTTFTFFFFT 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.r140-tall-162089128100558.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 itstools
Input is Peterson-COL-2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128100558
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 42K 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 Peterson-COL-2-ReachabilityCardinality-00
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-01
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-02
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-03
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-04
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-05
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-06
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-07
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-08
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-09
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-10
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-11
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-12
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-13
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-14
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621007359169

Running Version 0
[2021-05-14 15:49:20] [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]
[2021-05-14 15:49:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 15:49:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-14 15:49:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 15:49:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 558 ms
[2021-05-14 15:49:21] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-2-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 15:49:21] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 4 ms.
[2021-05-14 15:49:21] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_12451048414632421177.dot
Reduce places removed 2 places and 0 transitions.
FORMULA Peterson-COL-2-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=598 ) properties (out of 11) seen :6
Running SMT prover for 5 properties.
// Phase 1: matrix 14 rows 9 cols
[2021-05-14 15:49:21] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-14 15:49:21] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned unsat
[2021-05-14 15:49:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:49:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:21] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-14 15:49:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:49:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
[2021-05-14 15:49:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
[2021-05-14 15:49:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
FORMULA Peterson-COL-2-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 15:49:21] [INFO ] Flatten gal took : 15 ms
[2021-05-14 15:49:21] [INFO ] Flatten gal took : 3 ms
[2021-05-14 15:49:21] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions in 9 ms.
[2021-05-14 15:49:21] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_17384773709621207775.dot
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :4
FORMULA Peterson-COL-2-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2021-05-14 15:49:21] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 15:49:21] [INFO ] Computed 11 place invariants in 9 ms
[2021-05-14 15:49:22] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 15:49:22] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 15:49:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:22] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-14 15:49:22] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 15:49:22] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 15:49:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:49:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 15:49:22] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:49:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:22] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-14 15:49:22] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 0 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 1 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 37 places in 20 ms of which 0 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 403 ms
[2021-05-14 15:49:22] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 15:49:22] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 15:49:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:22] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-14 15:49:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:49:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 15:49:22] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:49:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:22] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-14 15:49:22] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2021-05-14 15:49:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 242 ms
[2021-05-14 15:49:22] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 15:49:22] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:49:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:22] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-14 15:49:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:49:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 15:49:22] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:49:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:23] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-14 15:49:23] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2021-05-14 15:49:23] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 1 ms to minimize.
[2021-05-14 15:49:23] [INFO ] Deduced a trap composed of 12 places in 11 ms of which 1 ms to minimize.
[2021-05-14 15:49:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 49 ms
[2021-05-14 15:49:23] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 16 ms.
[2021-05-14 15:49:23] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2021-05-14 15:49:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2021-05-14 15:49:23] [INFO ] Added : 69 causal constraints over 14 iterations in 199 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
FORMULA Peterson-COL-2-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-2-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 43 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
FORMULA Peterson-COL-2-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621007364631

--------------------
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
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ 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="Peterson-COL-2"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Peterson-COL-2, 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 r140-tall-162089128100558"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-2.tgz
mv Peterson-COL-2 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 ;