fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r170-smll-158987815600270
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for FlexibleBarrier-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.960 3600000.00 35016.00 356.10 FFFFTTFFFTFTFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815600270.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-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 itslola
Input is FlexibleBarrier-PT-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815600270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 3.4K Apr 4 18:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 18:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 4 06:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 06:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 3 20:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 3 20:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 3 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 3 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 69K Mar 24 05:37 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 FlexibleBarrier-PT-04b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591333546160

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 05:05:49] [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-05 05:05:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 05:05:49] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2020-06-05 05:05:49] [INFO ] Transformed 268 places.
[2020-06-05 05:05:49] [INFO ] Transformed 305 transitions.
[2020-06-05 05:05:49] [INFO ] Found NUPN structural information;
[2020-06-05 05:05:49] [INFO ] Parsed PT model containing 268 places and 305 transitions in 215 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 245 resets, run finished after 113 ms. (steps per millisecond=88 ) properties seen :[0, 1, 0, 0, 1, 1, 1, 0, 1, 1]
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 305 rows 268 cols
[2020-06-05 05:05:49] [INFO ] Computed 6 place invariants in 22 ms
[2020-06-05 05:05:50] [INFO ] [Real]Absence check using 6 positive place invariants in 41 ms returned sat
[2020-06-05 05:05:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:05:50] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2020-06-05 05:05:51] [INFO ] Deduced a trap composed of 77 places in 263 ms
[2020-06-05 05:05:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2020-06-05 05:05:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:05:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 3516 ms returned sat
[2020-06-05 05:05:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:05:55] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2020-06-05 05:05:55] [INFO ] Deduced a trap composed of 69 places in 214 ms
[2020-06-05 05:05:55] [INFO ] Deduced a trap composed of 77 places in 190 ms
[2020-06-05 05:05:55] [INFO ] Deduced a trap composed of 38 places in 105 ms
[2020-06-05 05:05:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 610 ms
[2020-06-05 05:05:55] [INFO ] Computed and/alt/rep : 304/775/304 causal constraints in 42 ms.
[2020-06-05 05:05:56] [INFO ] Added : 55 causal constraints over 11 iterations in 494 ms. Result :unknown
[2020-06-05 05:05:56] [INFO ] [Real]Absence check using 6 positive place invariants in 24 ms returned sat
[2020-06-05 05:05:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:05:56] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2020-06-05 05:05:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:05:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 147 ms returned sat
[2020-06-05 05:05:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:05:57] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2020-06-05 05:05:57] [INFO ] Deduced a trap composed of 75 places in 112 ms
[2020-06-05 05:05:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2020-06-05 05:05:57] [INFO ] Computed and/alt/rep : 304/775/304 causal constraints in 43 ms.
[2020-06-05 05:06:00] [INFO ] Added : 302 causal constraints over 61 iterations in 3309 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
[2020-06-05 05:06:01] [INFO ] [Real]Absence check using 6 positive place invariants in 25 ms returned sat
[2020-06-05 05:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:01] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2020-06-05 05:06:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:06:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1189 ms returned unsat
[2020-06-05 05:06:03] [INFO ] [Real]Absence check using 6 positive place invariants in 23 ms returned sat
[2020-06-05 05:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:03] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2020-06-05 05:06:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:06:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 1241 ms returned unsat
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 33800 steps, including 549 resets, run finished after 147 ms. (steps per millisecond=229 ) properties seen :[0, 0] could not realise parikh vector
Support contains 12 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 305/305 transitions.
Graph (trivial) has 232 edges and 268 vertex of which 20 / 268 are part of one of the 3 SCC in 7 ms
Free SCC test removed 17 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 251 transition count 213
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 164 place count 180 transition count 213
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 164 place count 180 transition count 202
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 186 place count 169 transition count 202
Symmetric choice reduction at 2 with 62 rule applications. Total rules 248 place count 169 transition count 202
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 62 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 372 place count 107 transition count 140
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 372 place count 107 transition count 138
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 376 place count 105 transition count 138
Symmetric choice reduction at 2 with 8 rule applications. Total rules 384 place count 105 transition count 138
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 400 place count 97 transition count 130
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 408 place count 97 transition count 122
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 454 place count 74 transition count 99
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 457 place count 74 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 461 place count 72 transition count 97
Free-agglomeration rule applied 24 times.
Iterating global reduction 4 with 24 rules applied. Total rules applied 485 place count 72 transition count 73
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 515 place count 48 transition count 67
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 519 place count 48 transition count 67
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 522 place count 48 transition count 64
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 523 place count 48 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 524 place count 47 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 525 place count 46 transition count 62
Applied a total of 525 rules in 107 ms. Remains 46 /268 variables (removed 222) and now considering 62/305 (removed 243) transitions.
Finished structural reductions, in 1 iterations. Remains : 46/268 places, 62/305 transitions.
Finished random walk after 3517 steps, including 0 resets, run visited all 2 properties in 17 ms. (steps per millisecond=206 )
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-00 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="FlexibleBarrier-PT-04b"
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 FlexibleBarrier-PT-04b, 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 r170-smll-158987815600270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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