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

About the Execution of ITS-Tools for AutoFlight-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
235.487 6495.00 12163.00 175.80 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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.r007-tall-162037990000397.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 AutoFlight-PT-02b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990000397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K Mar 23 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 23 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 10:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 48K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-02b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620466883178

Running Version 0
[2021-05-08 09:41:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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-08 09:41:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 09:41:24] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2021-05-08 09:41:24] [INFO ] Transformed 206 places.
[2021-05-08 09:41:24] [INFO ] Transformed 204 transitions.
[2021-05-08 09:41:24] [INFO ] Found NUPN structural information;
[2021-05-08 09:41:24] [INFO ] Parsed PT model containing 206 places and 204 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 204 rows 206 cols
[2021-05-08 09:41:24] [INFO ] Computed 16 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 88 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :14
FORMULA AutoFlight-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
// Phase 1: matrix 204 rows 206 cols
[2021-05-08 09:41:24] [INFO ] Computed 16 place invariants in 7 ms
[2021-05-08 09:41:25] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2021-05-08 09:41:25] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:41:25] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-08 09:41:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:41:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2021-05-08 09:41:25] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:41:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 09:41:25] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-08 09:41:25] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2021-05-08 09:41:25] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2021-05-08 09:41:25] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2021-05-08 09:41:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2021-05-08 09:41:25] [INFO ] Computed and/alt/rep : 203/275/203 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-08 09:41:26] [INFO ] Added : 200 causal constraints over 41 iterations in 529 ms. Result :sat
Minimization took 42 ms.
[2021-05-08 09:41:26] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-08 09:41:26] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:41:26] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-08 09:41:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:41:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2021-05-08 09:41:26] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 09:41:26] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-08 09:41:26] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
[2021-05-08 09:41:26] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2021-05-08 09:41:26] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 0 ms to minimize.
[2021-05-08 09:41:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 124 ms
[2021-05-08 09:41:26] [INFO ] Computed and/alt/rep : 203/275/203 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-08 09:41:26] [INFO ] Added : 196 causal constraints over 40 iterations in 465 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 19200 steps, including 186 resets, run finished after 76 ms. (steps per millisecond=252 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18100 steps, including 186 resets, run finished after 58 ms. (steps per millisecond=312 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 204/204 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 77 rules applied. Total rules applied 77 place count 206 transition count 127
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 91 rules applied. Total rules applied 168 place count 129 transition count 113
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 173 place count 125 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 174 place count 124 transition count 112
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 174 place count 124 transition count 83
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 232 place count 95 transition count 83
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 250 place count 77 transition count 65
Iterating global reduction 4 with 18 rules applied. Total rules applied 268 place count 77 transition count 65
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 268 place count 77 transition count 59
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 280 place count 71 transition count 59
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 316 place count 53 transition count 41
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 324 place count 53 transition count 33
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 332 place count 45 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 333 place count 44 transition count 32
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 13 rules applied. Total rules applied 346 place count 37 transition count 26
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 352 place count 31 transition count 26
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 352 place count 31 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 368 place count 23 transition count 18
Applied a total of 368 rules in 43 ms. Remains 23 /206 variables (removed 183) and now considering 18/204 (removed 186) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/206 places, 18/204 transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-08 09:41:27] [INFO ] Computed 9 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1566 ms. (steps per millisecond=638 ) properties (out of 2) seen :2
FORMULA AutoFlight-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620466889673

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="AutoFlight-PT-02b"
export BK_EXAMINATION="UpperBounds"
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 AutoFlight-PT-02b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037990000397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-02b.tgz
mv AutoFlight-PT-02b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;