fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987853600710
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Peterson-PT-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.800 3600000.00 26305.00 79.90 FTTFTFFTTTTFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853600710.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 itslola
Input is Peterson-PT-2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853600710
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.0K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 98K Apr 27 15:14 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-PT-2-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591163755994

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:55:59] [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]
[2020-06-03 05:55:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:55:59] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2020-06-03 05:55:59] [INFO ] Transformed 102 places.
[2020-06-03 05:55:59] [INFO ] Transformed 126 transitions.
[2020-06-03 05:55:59] [INFO ] Parsed PT model containing 102 places and 126 transitions in 96 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-2-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 98 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 68 ms. (steps per millisecond=147 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 65 ms. (steps per millisecond=153 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA Peterson-PT-2-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 05:56:00] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2020-06-03 05:56:00] [INFO ] Computed 11 place invariants in 8 ms
[2020-06-03 05:56:00] [INFO ] [Real]Absence check using 8 positive place invariants in 22 ms returned sat
[2020-06-03 05:56:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:00] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-03 05:56:00] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-06-03 05:56:00] [INFO ] [Real]Added 26 Read/Feed constraints in 20 ms returned sat
[2020-06-03 05:56:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2020-06-03 05:56:00] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:00] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2020-06-03 05:56:00] [INFO ] [Nat]Added 26 Read/Feed constraints in 14 ms returned sat
[2020-06-03 05:56:00] [INFO ] Deduced a trap composed of 8 places in 83 ms
[2020-06-03 05:56:01] [INFO ] Deduced a trap composed of 12 places in 281 ms
[2020-06-03 05:56:01] [INFO ] Deduced a trap composed of 12 places in 177 ms
[2020-06-03 05:56:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 620 ms
[2020-06-03 05:56:01] [INFO ] [Real]Absence check using 8 positive place invariants in 29 ms returned unsat
[2020-06-03 05:56:01] [INFO ] [Real]Absence check using 8 positive place invariants in 31 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:01] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Real]Added 26 Read/Feed constraints in 24 ms returned sat
[2020-06-03 05:56:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 28 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 7 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:02] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2020-06-03 05:56:02] [INFO ] [Nat]Added 26 Read/Feed constraints in 25 ms returned sat
[2020-06-03 05:56:02] [INFO ] Deduced a trap composed of 8 places in 455 ms
[2020-06-03 05:56:03] [INFO ] Deduced a trap composed of 13 places in 508 ms
[2020-06-03 05:56:03] [INFO ] Deduced a trap composed of 8 places in 140 ms
[2020-06-03 05:56:03] [INFO ] Deduced a trap composed of 50 places in 63 ms
[2020-06-03 05:56:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1256 ms
[2020-06-03 05:56:03] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2020-06-03 05:56:03] [INFO ] Added : 117 causal constraints over 24 iterations in 397 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2020-06-03 05:56:03] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned unsat
[2020-06-03 05:56:04] [INFO ] [Real]Absence check using 8 positive place invariants in 33 ms returned unsat
[2020-06-03 05:56:04] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned unsat
[2020-06-03 05:56:04] [INFO ] [Real]Absence check using 8 positive place invariants in 64 ms returned sat
[2020-06-03 05:56:04] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 33 ms returned sat
[2020-06-03 05:56:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:05] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2020-06-03 05:56:05] [INFO ] [Real]Added 26 Read/Feed constraints in 9 ms returned sat
[2020-06-03 05:56:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-06-03 05:56:05] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:05] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2020-06-03 05:56:05] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:56:05] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 17 ms.
[2020-06-03 05:56:05] [INFO ] Added : 117 causal constraints over 24 iterations in 577 ms. Result :sat
[2020-06-03 05:56:06] [INFO ] Deduced a trap composed of 11 places in 438 ms
[2020-06-03 05:56:06] [INFO ] Deduced a trap composed of 29 places in 512 ms
[2020-06-03 05:56:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1027 ms
Attempting to minimize the solution found.
Minimization took 50 ms.
[2020-06-03 05:56:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
[2020-06-03 05:56:07] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned unsat
[2020-06-03 05:56:07] [INFO ] [Real]Absence check using 8 positive place invariants in 50 ms returned unsat
[2020-06-03 05:56:07] [INFO ] [Real]Absence check using 8 positive place invariants in 59 ms returned unsat
[2020-06-03 05:56:07] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-06-03 05:56:07] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-03 05:56:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:07] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2020-06-03 05:56:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned unsat
FORMULA Peterson-PT-2-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 20000 steps, including 512 resets, run finished after 52 ms. (steps per millisecond=384 ) properties seen :[0, 1] could not realise parikh vector
FORMULA Peterson-PT-2-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 20700 steps, including 373 resets, run finished after 38 ms. (steps per millisecond=544 ) properties seen :[0] could not realise parikh vector
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 102 transition count 102
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 78 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 78 transition count 90
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 66 transition count 90
Applied a total of 72 rules in 52 ms. Remains 66 /102 variables (removed 36) and now considering 90/126 (removed 36) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/102 places, 90/126 transitions.
Finished random walk after 1801 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=600 )
FORMULA Peterson-PT-2-ReachabilityCardinality-05 FALSE 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="Peterson-PT-2"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is Peterson-PT-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 r174-csrt-158987853600710"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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