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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.020 3600000.00 57944.00 230.00 TTTFFFFTFTTFTFFF 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-158987914000542.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-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000542
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:45 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.5K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 146K 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-12-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591162681385

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:38:05] [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:38:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:38:05] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2020-06-03 05:38:05] [INFO ] Transformed 586 places.
[2020-06-03 05:38:05] [INFO ] Transformed 525 transitions.
[2020-06-03 05:38:05] [INFO ] Found NUPN structural information;
[2020-06-03 05:38:05] [INFO ] Parsed PT model containing 586 places and 525 transitions in 247 ms.
Deduced a syphon composed of 4 places in 28 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 114 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 72 resets, run finished after 79 ms. (steps per millisecond=126 ) properties seen :[1, 0, 0, 0, 0, 1, 0, 1]
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 1, 0]
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 521 rows 582 cols
[2020-06-03 05:38:06] [INFO ] Computed 98 place invariants in 33 ms
[2020-06-03 05:38:06] [INFO ] [Real]Absence check using 55 positive place invariants in 49 ms returned sat
[2020-06-03 05:38:06] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 62 ms returned sat
[2020-06-03 05:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:07] [INFO ] [Real]Absence check using state equation in 926 ms returned sat
[2020-06-03 05:38:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:38:08] [INFO ] [Nat]Absence check using 55 positive place invariants in 58 ms returned sat
[2020-06-03 05:38:08] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 45 ms returned sat
[2020-06-03 05:38:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:10] [INFO ] [Nat]Absence check using state equation in 2047 ms returned sat
[2020-06-03 05:38:10] [INFO ] Deduced a trap composed of 124 places in 584 ms
[2020-06-03 05:38:12] [INFO ] Deduced a trap composed of 22 places in 1288 ms
[2020-06-03 05:38:13] [INFO ] Deduced a trap composed of 16 places in 1128 ms
[2020-06-03 05:38:13] [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 s3 s4 s5 s6 s7 s8 s206 s209 s210 s211 s378 s379 s380) 0)") while checking expression at index 0
[2020-06-03 05:38:13] [INFO ] [Real]Absence check using 55 positive place invariants in 226 ms returned unsat
[2020-06-03 05:38:13] [INFO ] [Real]Absence check using 55 positive place invariants in 59 ms returned sat
[2020-06-03 05:38:13] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 38 ms returned sat
[2020-06-03 05:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:15] [INFO ] [Real]Absence check using state equation in 1877 ms returned sat
[2020-06-03 05:38:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:38:16] [INFO ] [Nat]Absence check using 55 positive place invariants in 181 ms returned sat
[2020-06-03 05:38:16] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 163 ms returned sat
[2020-06-03 05:38:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:17] [INFO ] [Nat]Absence check using state equation in 897 ms returned sat
[2020-06-03 05:38:17] [INFO ] Deduced a trap composed of 19 places in 222 ms
[2020-06-03 05:38:17] [INFO ] Deduced a trap composed of 11 places in 202 ms
[2020-06-03 05:38:18] [INFO ] Deduced a trap composed of 118 places in 191 ms
[2020-06-03 05:38:18] [INFO ] Deduced a trap composed of 21 places in 500 ms
[2020-06-03 05:38:18] [INFO ] Deduced a trap composed of 32 places in 349 ms
[2020-06-03 05:38:20] [INFO ] Deduced a trap composed of 30 places in 1409 ms
[2020-06-03 05:38:22] [INFO ] Deduced a trap composed of 33 places in 2373 ms
[2020-06-03 05:38:22] [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 s3 s4 s5 s6 s7 s8 s9 s10 s194 s197 s198 s199 s270 s353 s354 s355 s369 s374 s384 s432 s433 s434 s509 s510 s513 s514 s521 s522 s572 s573) 0)") while checking expression at index 2
[2020-06-03 05:38:23] [INFO ] [Real]Absence check using 55 positive place invariants in 270 ms returned sat
[2020-06-03 05:38:23] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 164 ms returned sat
[2020-06-03 05:38:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:27] [INFO ] [Real]Absence check using state equation in 4049 ms returned sat
[2020-06-03 05:38:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:38:27] [INFO ] [Nat]Absence check using 55 positive place invariants in 40 ms returned sat
[2020-06-03 05:38:27] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-06-03 05:38:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:30] [INFO ] [Nat]Absence check using state equation in 3239 ms returned sat
[2020-06-03 05:38:32] [INFO ] Deduced a trap composed of 13 places in 1838 ms
[2020-06-03 05:38:32] [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 s3 s4 s5 s6 s7 s8 s206 s398 s399 s400) 0)") while checking expression at index 3
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 6 out of 582 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 326 edges and 582 vertex of which 7 / 582 are part of one of the 1 SCC in 14 ms
Free SCC test removed 6 places
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1178 edges and 576 vertex of which 572 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.14 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Iterating post reduction 0 with 135 rules applied. Total rules applied 137 place count 572 transition count 385
Reduce places removed 127 places and 0 transitions.
Iterating post reduction 1 with 127 rules applied. Total rules applied 264 place count 445 transition count 385
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 264 place count 445 transition count 295
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 197 rules applied. Total rules applied 461 place count 338 transition count 295
Symmetric choice reduction at 2 with 70 rule applications. Total rules 531 place count 338 transition count 295
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 70 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 671 place count 268 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 671 place count 268 transition count 220
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 682 place count 262 transition count 220
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 179 rules applied. Total rules applied 861 place count 171 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 863 place count 170 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 865 place count 170 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 867 place count 168 transition count 134
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 868 place count 168 transition count 134
Applied a total of 868 rules in 205 ms. Remains 168 /582 variables (removed 414) and now considering 134/521 (removed 387) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/582 places, 134/521 transitions.
Finished random walk after 1178 steps, including 42 resets, run visited all 3 properties in 19 ms. (steps per millisecond=62 )
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-04 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-12"
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 BusinessProcesses-PT-12, 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 r182-oct2-158987914000542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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