About the Execution of ITS-Tools for BusinessProcesses-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
240.231 | 5153.00 | 12330.00 | 43.10 | TTTTFTTTFTTFFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918400335.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 itstools
Input is BusinessProcesses-PT-02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918400335
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 9.0K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 00:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 00:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 30 00:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 30 00:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 30 00:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 30 00:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 59K May 10 09:33 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-02-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1654200387665
Running Version 202205111006
[2022-06-02 20:06:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 20:06:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:06:29] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-06-02 20:06:29] [INFO ] Transformed 262 places.
[2022-06-02 20:06:29] [INFO ] Transformed 219 transitions.
[2022-06-02 20:06:29] [INFO ] Found NUPN structural information;
[2022-06-02 20:06:29] [INFO ] Parsed PT model containing 262 places and 219 transitions in 204 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 132 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 15) seen :8
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 204 rows 245 cols
[2022-06-02 20:06:30] [INFO ] Computed 43 place invariants in 15 ms
[2022-06-02 20:06:30] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2022-06-02 20:06:30] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2022-06-02 20:06:30] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-02 20:06:30] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2022-06-02 20:06:30] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2022-06-02 20:06:30] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2022-06-02 20:06:31] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 6 ms to minimize.
[2022-06-02 20:06:31] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2022-06-02 20:06:31] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2022-06-02 20:06:31] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2022-06-02 20:06:31] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2022-06-02 20:06:31] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2022-06-02 20:06:31] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2022-06-02 20:06:31] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2022-06-02 20:06:31] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2022-06-02 20:06:31] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2022-06-02 20:06:31] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2022-06-02 20:06:31] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 733 ms
[2022-06-02 20:06:31] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 0 ms to minimize.
[2022-06-02 20:06:31] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 0 ms to minimize.
[2022-06-02 20:06:31] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 0 ms to minimize.
[2022-06-02 20:06:32] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 0 ms to minimize.
[2022-06-02 20:06:32] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2022-06-02 20:06:32] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 0 ms to minimize.
[2022-06-02 20:06:32] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2022-06-02 20:06:32] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-06-02 20:06:32] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2022-06-02 20:06:32] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2022-06-02 20:06:32] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2022-06-02 20:06:32] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2022-06-02 20:06:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 884 ms
[2022-06-02 20:06:32] [INFO ] After 1802ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-02 20:06:32] [INFO ] After 1946ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 245/245 places, 204/204 transitions.
Graph (trivial) has 143 edges and 245 vertex of which 7 / 245 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 438 edges and 239 vertex of which 227 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 227 transition count 137
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 175 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 174 transition count 136
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 109 place count 174 transition count 98
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 193 place count 128 transition count 98
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 222 place count 99 transition count 69
Iterating global reduction 3 with 29 rules applied. Total rules applied 251 place count 99 transition count 69
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 329 place count 59 transition count 31
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 330 place count 59 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 331 place count 58 transition count 30
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 332 place count 58 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 333 place count 57 transition count 29
Applied a total of 333 rules in 83 ms. Remains 57 /245 variables (removed 188) and now considering 29/204 (removed 175) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/245 places, 29/204 transitions.
Finished random walk after 173 steps, including 8 resets, run visited all 1 properties in 2 ms. (steps per millisecond=86 )
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 3832 ms.
BK_STOP 1654200392818
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-02"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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 itstools"
echo " Input is BusinessProcesses-PT-02, 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 r024-tall-165251918400335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-02.tgz
mv BusinessProcesses-PT-02 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 '
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 ;