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

About the Execution of ITS-Tools for DiscoveryGPU-PT-15b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
385.907 8746.00 14509.00 81.20 FTFFTTTTFTTFFFFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 6.2K Apr 30 07:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 07:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 07:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 07:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 30 07:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 30 07:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 30 07:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 111K May 10 09:33 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 DiscoveryGPU-PT-15b-ReachabilityCardinality-00
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-01
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-02
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-03
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-04
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-05
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-06
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-07
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-08
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-09
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-10
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-11
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-12
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-13
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-14
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654186243084

Running Version 202205111006
[2022-06-02 16:10:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 16:10:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:10:44] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2022-06-02 16:10:44] [INFO ] Transformed 436 places.
[2022-06-02 16:10:44] [INFO ] Transformed 464 transitions.
[2022-06-02 16:10:44] [INFO ] Found NUPN structural information;
[2022-06-02 16:10:44] [INFO ] Parsed PT model containing 436 places and 464 transitions in 206 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 21 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 14) seen :7
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :1
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 464 rows 436 cols
[2022-06-02 16:10:45] [INFO ] Computed 17 place invariants in 16 ms
[2022-06-02 16:10:45] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-02 16:10:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2022-06-02 16:10:46] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2022-06-02 16:10:46] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-06-02 16:10:46] [INFO ] After 470ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 32 out of 436 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 436/436 places, 464/464 transitions.
Graph (complete) has 755 edges and 436 vertex of which 382 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.4 ms
Discarding 54 places :
Also discarding 25 output transitions
Drop transitions removed 25 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 382 transition count 352
Reduce places removed 77 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 82 rules applied. Total rules applied 170 place count 305 transition count 347
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 175 place count 300 transition count 347
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 175 place count 300 transition count 325
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 219 place count 278 transition count 325
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 239 place count 258 transition count 305
Iterating global reduction 3 with 20 rules applied. Total rules applied 259 place count 258 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 259 place count 258 transition count 303
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 263 place count 256 transition count 303
Graph (complete) has 434 edges and 256 vertex of which 169 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.0 ms
Discarding 87 places :
Also discarding 63 output transitions
Drop transitions removed 63 transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 264 place count 169 transition count 240
Drop transitions removed 49 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 4 with 50 rules applied. Total rules applied 314 place count 169 transition count 190
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 314 place count 169 transition count 188
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 318 place count 167 transition count 188
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 402 place count 125 transition count 146
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 414 place count 125 transition count 134
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 415 place count 125 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 417 place count 125 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 419 place count 123 transition count 131
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 423 place count 123 transition count 131
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 426 place count 123 transition count 128
Applied a total of 426 rules in 105 ms. Remains 123 /436 variables (removed 313) and now considering 128/464 (removed 336) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/436 places, 128/464 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 938 ms. (steps per millisecond=1066 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 897 ms. (steps per millisecond=1114 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3595927 steps, run timeout after 3001 ms. (steps per millisecond=1198 ) properties seen :{}
Probabilistic random walk after 3595927 steps, saw 405404 distinct states, run finished after 3002 ms. (steps per millisecond=1197 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 128 rows 123 cols
[2022-06-02 16:10:51] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-02 16:10:51] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:10:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 16:10:51] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:10:51] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-02 16:10:51] [INFO ] After 43ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:10:51] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-06-02 16:10:51] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 85 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3 ms.
All properties solved without resorting to model-checking.
Total runtime 7448 ms.

BK_STOP 1654186251830

--------------------
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
+ [[ 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
+ 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@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="DiscoveryGPU-PT-15b"
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 DiscoveryGPU-PT-15b, 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 r078-tall-165260109900158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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