fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987914000519
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BusinessProcesses-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15745.320 3600000.00 30594.00 70.20 FTFTTTFFFTFFFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914000519.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is BusinessProcesses-PT-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000519
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 3.7K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 104K 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 BusinessProcesses-PT-09-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591160666626

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:04:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:04:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:04:29] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2020-06-03 05:04:29] [INFO ] Transformed 403 places.
[2020-06-03 05:04:29] [INFO ] Transformed 374 transitions.
[2020-06-03 05:04:29] [INFO ] Found NUPN structural information;
[2020-06-03 05:04:29] [INFO ] Parsed PT model containing 403 places and 374 transitions in 192 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 103 resets, run finished after 109 ms. (steps per millisecond=91 ) properties seen :[0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1]
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 374 rows 403 cols
[2020-06-03 05:04:29] [INFO ] Computed 65 place invariants in 20 ms
[2020-06-03 05:04:30] [INFO ] [Real]Absence check using 36 positive place invariants in 54 ms returned sat
[2020-06-03 05:04:30] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 12 ms returned sat
[2020-06-03 05:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:04:30] [INFO ] [Real]Absence check using state equation in 390 ms returned unsat
[2020-06-03 05:04:30] [INFO ] [Real]Absence check using 36 positive place invariants in 24 ms returned sat
[2020-06-03 05:04:30] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 17 ms returned sat
[2020-06-03 05:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:04:30] [INFO ] [Real]Absence check using state equation in 402 ms returned unsat
[2020-06-03 05:04:31] [INFO ] [Real]Absence check using 36 positive place invariants in 23 ms returned sat
[2020-06-03 05:04:31] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 21 ms returned sat
[2020-06-03 05:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:04:31] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2020-06-03 05:04:31] [INFO ] Deduced a trap composed of 11 places in 166 ms
[2020-06-03 05:04:32] [INFO ] Deduced a trap composed of 20 places in 103 ms
[2020-06-03 05:04:32] [INFO ] Deduced a trap composed of 12 places in 102 ms
[2020-06-03 05:04:32] [INFO ] Deduced a trap composed of 93 places in 134 ms
[2020-06-03 05:04:32] [INFO ] Deduced a trap composed of 97 places in 130 ms
[2020-06-03 05:04:32] [INFO ] Deduced a trap composed of 92 places in 187 ms
[2020-06-03 05:04:32] [INFO ] Deduced a trap composed of 92 places in 120 ms
[2020-06-03 05:04:34] [INFO ] Deduced a trap composed of 94 places in 1795 ms
[2020-06-03 05:04:34] [INFO ] Deduced a trap composed of 100 places in 126 ms
[2020-06-03 05:04:35] [INFO ] Deduced a trap composed of 100 places in 1032 ms
[2020-06-03 05:04:36] [INFO ] Deduced a trap composed of 107 places in 129 ms
[2020-06-03 05:04:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s20 s21 s22 s23 s26 s27 s30 s31 s32 s33 s34 s35 s39 s41 s42 s44 s45 s48 s49 s53 s78 s82 s84 s87 s88 s89 s93 s94 s95 s108 s114 s135 s136 s137 s170 s189 s223 s225 s228 s230 s238 s240 s244 s254 s269 s272 s275 s276 s278 s279 s280 s281 s282 s283 s284 s285 s286 s287 s288 s289 s290 s291 s292 s297 s298 s301 s302 s303 s312 s319 s320 s321 s322 s324 s329 s330 s334 s335 s336 s337 s338 s340 s341 s346 s347 s354 s355 s356 s357 s360 s361 s364 s365 s366 s367 s368 s370 s371 s373 s374 s375 s376 s400 s401 s402) 0)") while checking expression at index 2
[2020-06-03 05:04:36] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2020-06-03 05:04:36] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 16 ms returned sat
[2020-06-03 05:04:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:04:36] [INFO ] [Real]Absence check using state equation in 309 ms returned unsat
[2020-06-03 05:04:36] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2020-06-03 05:04:36] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 13 ms returned sat
[2020-06-03 05:04:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:04:36] [INFO ] [Real]Absence check using state equation in 368 ms returned unsat
[2020-06-03 05:04:37] [INFO ] [Real]Absence check using 36 positive place invariants in 211 ms returned sat
[2020-06-03 05:04:37] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 209 ms returned sat
[2020-06-03 05:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:04:37] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2020-06-03 05:04:37] [INFO ] Deduced a trap composed of 12 places in 171 ms
[2020-06-03 05:04:38] [INFO ] Deduced a trap composed of 8 places in 199 ms
[2020-06-03 05:04:41] [INFO ] Deduced a trap composed of 11 places in 3864 ms
[2020-06-03 05:04:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s166 s169 s268 s269 s270 s274 s364 s365) 0)") while checking expression at index 5
[2020-06-03 05:04:42] [INFO ] [Real]Absence check using 36 positive place invariants in 97 ms returned sat
[2020-06-03 05:04:42] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 12 ms returned sat
[2020-06-03 05:04:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:04:42] [INFO ] [Real]Absence check using state equation in 641 ms returned unsat
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 29 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 374/374 transitions.
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 845 edges and 403 vertex of which 401 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 401 transition count 317
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 345 transition count 317
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 113 place count 345 transition count 242
Deduced a syphon composed of 75 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 269 place count 264 transition count 242
Symmetric choice reduction at 2 with 45 rule applications. Total rules 314 place count 264 transition count 242
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 45 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 404 place count 219 transition count 197
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 404 place count 219 transition count 194
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 410 place count 216 transition count 194
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 522 place count 160 transition count 138
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 523 place count 160 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 524 place count 159 transition count 137
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 530 place count 159 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 531 place count 158 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 532 place count 157 transition count 136
Applied a total of 532 rules in 202 ms. Remains 157 /403 variables (removed 246) and now considering 136/374 (removed 238) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/403 places, 136/374 transitions.
Finished random walk after 130726 steps, including 6657 resets, run visited all 2 properties in 368 ms. (steps per millisecond=355 )
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-06 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="BusinessProcesses-PT-09"
export BK_EXAMINATION="ReachabilityFireability"
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 BusinessProcesses-PT-09, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914000519"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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