About the Execution of ITS-LoLa for NoC3x3-PT-3B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15741.030 | 3600000.00 | 38393.00 | 84.90 | TTTFFFFTFFFFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853100374.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 NoC3x3-PT-3B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853100374
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 3.9K Apr 8 15:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 8 15:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 18:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 7 18:32 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.1K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 6 20:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 6 20:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 6 03:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 6 03:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 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 581K 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 NoC3x3-PT-3B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1591142788669
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:06:30] [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 00:06:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:06:31] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2020-06-03 00:06:31] [INFO ] Transformed 2117 places.
[2020-06-03 00:06:31] [INFO ] Transformed 2435 transitions.
[2020-06-03 00:06:31] [INFO ] Found NUPN structural information;
[2020-06-03 00:06:31] [INFO ] Parsed PT model containing 2117 places and 2435 transitions in 257 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 96 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 16 resets, run finished after 77 ms. (steps per millisecond=129 ) properties seen :[0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0]
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 1, 0]
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2435 rows 2117 cols
[2020-06-03 00:06:31] [INFO ] Computed 66 place invariants in 65 ms
[2020-06-03 00:06:32] [INFO ] [Real]Absence check using 66 positive place invariants in 210 ms returned sat
[2020-06-03 00:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:06:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:06:36] [INFO ] [Real]Absence check using state equation in 4319 ms returned (error "Failed to check-sat")
[2020-06-03 00:06:37] [INFO ] [Real]Absence check using 66 positive place invariants in 182 ms returned sat
[2020-06-03 00:06:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:06:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:06:41] [INFO ] [Real]Absence check using state equation in 4460 ms returned (error "Failed to check-sat")
[2020-06-03 00:06:42] [INFO ] [Real]Absence check using 66 positive place invariants in 152 ms returned sat
[2020-06-03 00:06:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:06:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:06:46] [INFO ] [Real]Absence check using state equation in 4582 ms returned (error "Failed to check-sat")
[2020-06-03 00:06:47] [INFO ] [Real]Absence check using 66 positive place invariants in 173 ms returned sat
[2020-06-03 00:06:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:06:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:06:51] [INFO ] [Real]Absence check using state equation in 4534 ms returned unknown
Support contains 15 out of 2117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1719 edges and 2117 vertex of which 64 / 2117 are part of one of the 8 SCC in 32 ms
Free SCC test removed 56 places
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Performed 442 Post agglomeration using F-continuation condition.Transition count delta: 442
Iterating post reduction 0 with 511 rules applied. Total rules applied 512 place count 2056 transition count 1929
Reduce places removed 442 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 448 rules applied. Total rules applied 960 place count 1614 transition count 1923
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 963 place count 1611 transition count 1923
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 963 place count 1611 transition count 1898
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 1013 place count 1586 transition count 1898
Symmetric choice reduction at 3 with 362 rule applications. Total rules 1375 place count 1586 transition count 1898
Deduced a syphon composed of 362 places in 11 ms
Reduce places removed 362 places and 362 transitions.
Iterating global reduction 3 with 724 rules applied. Total rules applied 2099 place count 1224 transition count 1536
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 2099 place count 1224 transition count 1498
Deduced a syphon composed of 38 places in 10 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 2175 place count 1186 transition count 1498
Symmetric choice reduction at 3 with 109 rule applications. Total rules 2284 place count 1186 transition count 1498
Deduced a syphon composed of 109 places in 3 ms
Reduce places removed 109 places and 109 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 2502 place count 1077 transition count 1389
Symmetric choice reduction at 3 with 132 rule applications. Total rules 2634 place count 1077 transition count 1389
Deduced a syphon composed of 132 places in 3 ms
Reduce places removed 132 places and 147 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 2898 place count 945 transition count 1242
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2950 place count 945 transition count 1242
Deduced a syphon composed of 52 places in 3 ms
Reduce places removed 52 places and 97 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 3054 place count 893 transition count 1145
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 17 rules applied. Total rules applied 3071 place count 892 transition count 1129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3072 place count 891 transition count 1129
Symmetric choice reduction at 5 with 36 rule applications. Total rules 3108 place count 891 transition count 1129
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 36 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 3180 place count 855 transition count 1093
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 7 rules applied. Total rules applied 3187 place count 851 transition count 1090
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 3190 place count 848 transition count 1090
Symmetric choice reduction at 7 with 25 rule applications. Total rules 3215 place count 848 transition count 1090
Deduced a syphon composed of 25 places in 3 ms
Reduce places removed 25 places and 50 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 3265 place count 823 transition count 1040
Symmetric choice reduction at 7 with 25 rule applications. Total rules 3290 place count 823 transition count 1040
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 25 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 3340 place count 798 transition count 1015
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 7 with 35 rules applied. Total rules applied 3375 place count 793 transition count 985
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 3380 place count 788 transition count 985
Performed 301 Post agglomeration using F-continuation condition.Transition count delta: 301
Deduced a syphon composed of 301 places in 1 ms
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 9 with 602 rules applied. Total rules applied 3982 place count 487 transition count 684
Symmetric choice reduction at 9 with 15 rule applications. Total rules 3997 place count 487 transition count 684
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 4027 place count 472 transition count 669
Symmetric choice reduction at 9 with 11 rule applications. Total rules 4038 place count 472 transition count 669
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 22 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 4060 place count 461 transition count 647
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 4062 place count 461 transition count 645
Symmetric choice reduction at 10 with 2 rule applications. Total rules 4064 place count 461 transition count 645
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 10 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 4068 place count 459 transition count 635
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -124
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 10 with 56 rules applied. Total rules applied 4124 place count 431 transition count 759
Free-agglomeration rule applied 22 times.
Iterating global reduction 10 with 22 rules applied. Total rules applied 4146 place count 431 transition count 737
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 28 rules applied. Total rules applied 4174 place count 409 transition count 731
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 4178 place count 409 transition count 727
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 4182 place count 405 transition count 727
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 4183 place count 405 transition count 727
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4184 place count 404 transition count 726
Applied a total of 4184 rules in 1197 ms. Remains 404 /2117 variables (removed 1713) and now considering 726/2435 (removed 1709) transitions.
Finished structural reductions, in 1 iterations. Remains : 404/2117 places, 726/2435 transitions.
Finished random walk after 13676 steps, including 165 resets, run visited all 4 properties in 101 ms. (steps per millisecond=135 )
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-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="NoC3x3-PT-3B"
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 NoC3x3-PT-3B, 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 r174-csrt-158987853100374"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3B.tgz
mv NoC3x3-PT-3B 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 '
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 ;