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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15732.650 3600000.00 28939.00 89.80 TTTTFFTFFTTFTTTT 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-158987914000495.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-06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000495
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 2.8K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:43 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 23K 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 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:37 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 85K 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-06-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591158634678

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:30:37] [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 04:30:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:30:37] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2020-06-03 04:30:37] [INFO ] Transformed 376 places.
[2020-06-03 04:30:37] [INFO ] Transformed 297 transitions.
[2020-06-03 04:30:37] [INFO ] Found NUPN structural information;
[2020-06-03 04:30:37] [INFO ] Parsed PT model containing 376 places and 297 transitions in 152 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 101 resets, run finished after 58 ms. (steps per millisecond=172 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0]
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 296 rows 375 cols
[2020-06-03 04:30:37] [INFO ] Computed 81 place invariants in 11 ms
[2020-06-03 04:30:37] [INFO ] [Real]Absence check using 42 positive place invariants in 58 ms returned sat
[2020-06-03 04:30:37] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 17 ms returned sat
[2020-06-03 04:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:38] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2020-06-03 04:30:38] [INFO ] Deduced a trap composed of 18 places in 511 ms
[2020-06-03 04:30:39] [INFO ] Deduced a trap composed of 14 places in 903 ms
[2020-06-03 04:30:39] [INFO ] Deduced a trap composed of 8 places in 161 ms
[2020-06-03 04:30:40] [INFO ] Deduced a trap composed of 10 places in 150 ms
[2020-06-03 04:30:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 1887 ms
[2020-06-03 04:30:40] [INFO ] [Real]Absence check using 42 positive place invariants in 33 ms returned sat
[2020-06-03 04:30:40] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 9 ms returned unsat
[2020-06-03 04:30:40] [INFO ] [Real]Absence check using 42 positive place invariants in 21 ms returned sat
[2020-06-03 04:30:40] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 19 ms returned sat
[2020-06-03 04:30:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:40] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2020-06-03 04:30:41] [INFO ] Deduced a trap composed of 11 places in 661 ms
[2020-06-03 04:30:41] [INFO ] Deduced a trap composed of 14 places in 251 ms
[2020-06-03 04:30:41] [INFO ] Deduced a trap composed of 15 places in 201 ms
[2020-06-03 04:30:42] [INFO ] Deduced a trap composed of 12 places in 262 ms
[2020-06-03 04:30:42] [INFO ] Deduced a trap composed of 19 places in 191 ms
[2020-06-03 04:30:42] [INFO ] Deduced a trap composed of 15 places in 168 ms
[2020-06-03 04:30:42] [INFO ] Deduced a trap composed of 12 places in 174 ms
[2020-06-03 04:30:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 2054 ms
[2020-06-03 04:30:42] [INFO ] [Real]Absence check using 42 positive place invariants in 34 ms returned sat
[2020-06-03 04:30:42] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 36 ms returned sat
[2020-06-03 04:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:43] [INFO ] [Real]Absence check using state equation in 951 ms returned sat
[2020-06-03 04:30:43] [INFO ] Deduced a trap composed of 11 places in 205 ms
[2020-06-03 04:30:44] [INFO ] Deduced a trap composed of 23 places in 114 ms
[2020-06-03 04:30:44] [INFO ] Deduced a trap composed of 20 places in 190 ms
[2020-06-03 04:30:44] [INFO ] Deduced a trap composed of 22 places in 174 ms
[2020-06-03 04:30:44] [INFO ] Deduced a trap composed of 22 places in 85 ms
[2020-06-03 04:30:44] [INFO ] Deduced a trap composed of 16 places in 162 ms
[2020-06-03 04:30:44] [INFO ] Deduced a trap composed of 20 places in 103 ms
[2020-06-03 04:30:45] [INFO ] Deduced a trap composed of 15 places in 68 ms
[2020-06-03 04:30:45] [INFO ] Deduced a trap composed of 14 places in 99 ms
[2020-06-03 04:30:45] [INFO ] Deduced a trap composed of 25 places in 90 ms
[2020-06-03 04:30:45] [INFO ] Deduced a trap composed of 19 places in 71 ms
[2020-06-03 04:30:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1612 ms
[2020-06-03 04:30:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:30:45] [INFO ] [Nat]Absence check using 42 positive place invariants in 36 ms returned sat
[2020-06-03 04:30:45] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 20 ms returned sat
[2020-06-03 04:30:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:45] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2020-06-03 04:30:46] [INFO ] Deduced a trap composed of 14 places in 224 ms
[2020-06-03 04:30:46] [INFO ] Deduced a trap composed of 17 places in 114 ms
[2020-06-03 04:30:46] [INFO ] Deduced a trap composed of 11 places in 111 ms
[2020-06-03 04:30:46] [INFO ] Deduced a trap composed of 23 places in 100 ms
[2020-06-03 04:30:46] [INFO ] Deduced a trap composed of 15 places in 107 ms
[2020-06-03 04:30:46] [INFO ] Deduced a trap composed of 20 places in 120 ms
[2020-06-03 04:30:46] [INFO ] Deduced a trap composed of 19 places in 104 ms
[2020-06-03 04:30:46] [INFO ] Deduced a trap composed of 22 places in 114 ms
[2020-06-03 04:30:47] [INFO ] Deduced a trap composed of 20 places in 212 ms
[2020-06-03 04:30:47] [INFO ] Deduced a trap composed of 72 places in 198 ms
[2020-06-03 04:30:47] [INFO ] Deduced a trap composed of 72 places in 227 ms
[2020-06-03 04:30:47] [INFO ] Deduced a trap composed of 81 places in 153 ms
[2020-06-03 04:30:48] [INFO ] Deduced a trap composed of 8 places in 180 ms
[2020-06-03 04:30:48] [INFO ] Deduced a trap composed of 77 places in 145 ms
[2020-06-03 04:30:48] [INFO ] Deduced a trap composed of 79 places in 165 ms
[2020-06-03 04:30:48] [INFO ] Deduced a trap composed of 78 places in 171 ms
[2020-06-03 04:30:48] [INFO ] Deduced a trap composed of 73 places in 122 ms
[2020-06-03 04:30:48] [INFO ] Deduced a trap composed of 82 places in 93 ms
[2020-06-03 04:30:49] [INFO ] Deduced a trap composed of 81 places in 116 ms
[2020-06-03 04:30:49] [INFO ] Deduced a trap composed of 77 places in 429 ms
[2020-06-03 04:30:49] [INFO ] Deduced a trap composed of 78 places in 177 ms
[2020-06-03 04:30:49] [INFO ] Deduced a trap composed of 78 places in 110 ms
[2020-06-03 04:30:49] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4047 ms
[2020-06-03 04:30:49] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 11 ms.
[2020-06-03 04:30:50] [INFO ] Added : 115 causal constraints over 23 iterations in 532 ms. Result :(error "Failed to check-sat")
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 4 out of 375 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 375/375 places, 296/296 transitions.
Graph (trivial) has 193 edges and 375 vertex of which 7 / 375 are part of one of the 1 SCC in 35 ms
Free SCC test removed 6 places
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 684 edges and 369 vertex of which 366 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.25 ms
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Iterating post reduction 0 with 76 rules applied. Total rules applied 78 place count 366 transition count 219
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 145 place count 299 transition count 219
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 145 place count 299 transition count 155
Deduced a syphon composed of 64 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 283 place count 225 transition count 155
Symmetric choice reduction at 2 with 39 rule applications. Total rules 322 place count 225 transition count 155
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 39 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 400 place count 186 transition count 116
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 540 place count 112 transition count 50
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 541 place count 112 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 542 place count 111 transition count 49
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 543 place count 111 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 544 place count 110 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 545 place count 109 transition count 48
Applied a total of 545 rules in 182 ms. Remains 109 /375 variables (removed 266) and now considering 48/296 (removed 248) transitions.
Finished structural reductions, in 1 iterations. Remains : 109/375 places, 48/296 transitions.
Finished random walk after 296 steps, including 6 resets, run visited all 1 properties in 3 ms. (steps per millisecond=98 )
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-15 TRUE 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-06"
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-06, 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-158987914000495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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