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.r184-oct2-158987928600454.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 JoinFreeModules-PT-0500, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928600454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 3.6K Apr 7 20:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 7 20:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 6 22:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 6 22:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 6 05:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 6 05:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 5 12:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 5 12:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 2.9M 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 JoinFreeModules-PT-0500-ReachabilityCardinality-00
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityCardinality-01
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityCardinality-02
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityCardinality-03
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityCardinality-04
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityCardinality-05
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityCardinality-06
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityCardinality-07
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityCardinality-08
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityCardinality-09
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityCardinality-10
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityCardinality-11
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityCardinality-12
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityCardinality-13
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityCardinality-14
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591208575987

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:22:57] [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 18:22:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:22:57] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2020-06-03 18:22:57] [INFO ] Transformed 2501 places.
[2020-06-03 18:22:57] [INFO ] Transformed 4001 transitions.
[2020-06-03 18:22:57] [INFO ] Parsed PT model containing 2501 places and 4001 transitions in 259 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10192 steps, including 0 resets, run finished after 252 ms. (steps per millisecond=40 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 238 ms. (steps per millisecond=42 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 235 ms. (steps per millisecond=42 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 223 ms. (steps per millisecond=44 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 253 ms. (steps per millisecond=39 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 242 ms. (steps per millisecond=41 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 234 ms. (steps per millisecond=42 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 219 ms. (steps per millisecond=45 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 220 ms. (steps per millisecond=45 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 217 ms. (steps per millisecond=46 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 215 ms. (steps per millisecond=46 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 218 ms. (steps per millisecond=45 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 217 ms. (steps per millisecond=46 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 220 ms. (steps per millisecond=45 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 219 ms. (steps per millisecond=45 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 221 ms. (steps per millisecond=45 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 220 ms. (steps per millisecond=45 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 4001 rows 2500 cols
[2020-06-03 18:23:01] [INFO ] Computed 500 place invariants in 47 ms
[2020-06-03 18:23:02] [INFO ] [Real]Absence check using 500 positive place invariants in 480 ms returned sat
[2020-06-03 18:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:06] [INFO ] [Real]Absence check using state equation in 4318 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:23:07] [INFO ] [Real]Absence check using 500 positive place invariants in 451 ms returned sat
[2020-06-03 18:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:23:11] [INFO ] [Real]Absence check using state equation in 4420 ms returned (error "Failed to check-sat")
[2020-06-03 18:23:12] [INFO ] [Real]Absence check using 500 positive place invariants in 466 ms returned sat
[2020-06-03 18:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:16] [INFO ] [Real]Absence check using state equation in 4396 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:23:17] [INFO ] [Real]Absence check using 500 positive place invariants in 431 ms returned sat
[2020-06-03 18:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:23:21] [INFO ] [Real]Absence check using state equation in 4410 ms returned (error "Failed to check-sat")
[2020-06-03 18:23:22] [INFO ] [Real]Absence check using 500 positive place invariants in 468 ms returned sat
[2020-06-03 18:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:23:26] [INFO ] [Real]Absence check using state equation in 4369 ms returned (error "Failed to check-sat")
[2020-06-03 18:23:27] [INFO ] [Real]Absence check using 500 positive place invariants in 433 ms returned sat
[2020-06-03 18:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:23:31] [INFO ] [Real]Absence check using state equation in 4423 ms returned (error "Failed to check-sat")
[2020-06-03 18:23:32] [INFO ] [Real]Absence check using 500 positive place invariants in 410 ms returned sat
[2020-06-03 18:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:23:36] [INFO ] [Real]Absence check using state equation in 4464 ms returned (error "Failed to check-sat")
[2020-06-03 18:23:37] [INFO ] [Real]Absence check using 500 positive place invariants in 507 ms returned sat
[2020-06-03 18:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:23:41] [INFO ] [Real]Absence check using state equation in 4327 ms returned (error "Failed to check-sat")
[2020-06-03 18:23:42] [INFO ] [Real]Absence check using 500 positive place invariants in 453 ms returned sat
[2020-06-03 18:23:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:23:46] [INFO ] [Real]Absence check using state equation in 4396 ms returned (error "Failed to check-sat")
[2020-06-03 18:23:47] [INFO ] [Real]Absence check using 500 positive place invariants in 457 ms returned sat
[2020-06-03 18:23:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:23:51] [INFO ] [Real]Absence check using state equation in 4395 ms returned (error "Failed to check-sat")
[2020-06-03 18:23:52] [INFO ] [Real]Absence check using 500 positive place invariants in 426 ms returned sat
[2020-06-03 18:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:23:56] [INFO ] [Real]Absence check using state equation in 4428 ms returned (error "Failed to check-sat")
[2020-06-03 18:23:57] [INFO ] [Real]Absence check using 500 positive place invariants in 480 ms returned sat
[2020-06-03 18:23:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:24:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:24:02] [INFO ] [Real]Absence check using state equation in 4388 ms returned (error "Failed to check-sat")
Support contains 42 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Discarding 2295 places :
Also discarding 3672 output transitions
Drop transitions removed 3672 transitions
Graph (complete) has 6000 edges and 2500 vertex of which 205 are kept as prefixes of interest. Removing 2295 places using SCC suffix rule.51 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 205 transition count 328
Applied a total of 2 rules in 99 ms. Remains 205 /2500 variables (removed 2295) and now considering 328/4001 (removed 3673) transitions.
// Phase 1: matrix 328 rows 205 cols
[2020-06-03 18:24:02] [INFO ] Computed 41 place invariants in 1 ms
[2020-06-03 18:24:02] [INFO ] Dead Transitions using invariants and state equation in 604 ms returned []
Finished structural reductions, in 1 iterations. Remains : 205/2500 places, 328/4001 transitions.
Finished random walk after 95517 steps, including 0 resets, run visited all 12 properties in 294 ms. (steps per millisecond=324 )
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-ReachabilityCardinality-00 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="JoinFreeModules-PT-0500"
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 JoinFreeModules-PT-0500, 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 r184-oct2-158987928600454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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