About the Execution of ITS-LoLa for NoC3x3-PT-5B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.900 | 3600000.00 | 41476.00 | 74.50 | FFFTTTTFFTFFFTTF | 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-158987853200406.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-5B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853200406
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 3.1K Apr 8 15:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 8 15:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 7 18:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 18:36 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.2K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 6 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 6 04:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 6 04:00 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 525K 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-5B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1591145143509
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:45:45] [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:45:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:45:45] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2020-06-03 00:45:45] [INFO ] Transformed 1571 places.
[2020-06-03 00:45:45] [INFO ] Transformed 2173 transitions.
[2020-06-03 00:45:45] [INFO ] Found NUPN structural information;
[2020-06-03 00:45:45] [INFO ] Parsed PT model containing 1571 places and 2173 transitions in 250 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 78 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 16 resets, run finished after 78 ms. (steps per millisecond=128 ) properties seen :[0, 1, 1, 0, 0, 0, 1, 1, 0, 1]
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 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 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 2173 rows 1571 cols
[2020-06-03 00:45:46] [INFO ] Computed 66 place invariants in 60 ms
[2020-06-03 00:45:46] [INFO ] [Real]Absence check using 66 positive place invariants in 149 ms returned sat
[2020-06-03 00:45:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:45:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:45:51] [INFO ] [Real]Absence check using state equation in 4498 ms returned (error "Failed to check-sat")
[2020-06-03 00:45:52] [INFO ] [Real]Absence check using 66 positive place invariants in 120 ms returned sat
[2020-06-03 00:45:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:45:56] [INFO ] [Real]Absence check using state equation in 4325 ms returned (error "Failed to check-sat")
[2020-06-03 00:45:56] [INFO ] [Real]Absence check using 66 positive place invariants in 113 ms returned sat
[2020-06-03 00:45:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:46:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:46:01] [INFO ] [Real]Absence check using state equation in 4667 ms returned (error "Failed to check-sat")
[2020-06-03 00:46:01] [INFO ] [Real]Absence check using 66 positive place invariants in 142 ms returned sat
[2020-06-03 00:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:46:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:46:06] [INFO ] [Real]Absence check using state equation in 4617 ms returned (error "Failed to check-sat")
[2020-06-03 00:46:06] [INFO ] [Real]Absence check using 66 positive place invariants in 137 ms returned sat
[2020-06-03 00:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:46:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:46:11] [INFO ] [Real]Absence check using state equation in 4619 ms returned (error "Failed to check-sat")
Support contains 25 out of 1571 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Performed 326 Post agglomeration using F-continuation condition.Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1571 transition count 1847
Reduce places removed 326 places and 0 transitions.
Iterating post reduction 1 with 326 rules applied. Total rules applied 652 place count 1245 transition count 1847
Symmetric choice reduction at 2 with 269 rule applications. Total rules 921 place count 1245 transition count 1847
Deduced a syphon composed of 269 places in 4 ms
Reduce places removed 269 places and 269 transitions.
Iterating global reduction 2 with 538 rules applied. Total rules applied 1459 place count 976 transition count 1578
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 1459 place count 976 transition count 1546
Deduced a syphon composed of 32 places in 29 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 1523 place count 944 transition count 1546
Symmetric choice reduction at 2 with 84 rule applications. Total rules 1607 place count 944 transition count 1546
Deduced a syphon composed of 84 places in 11 ms
Reduce places removed 84 places and 92 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 1775 place count 860 transition count 1454
Symmetric choice reduction at 2 with 54 rule applications. Total rules 1829 place count 860 transition count 1454
Deduced a syphon composed of 54 places in 10 ms
Reduce places removed 54 places and 119 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 1937 place count 806 transition count 1335
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1959 place count 806 transition count 1335
Deduced a syphon composed of 22 places in 9 ms
Reduce places removed 22 places and 44 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 2003 place count 784 transition count 1291
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2010 place count 784 transition count 1291
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 14 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 2024 place count 777 transition count 1277
Symmetric choice reduction at 2 with 4 rule applications. Total rules 2028 place count 777 transition count 1277
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 8 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2036 place count 773 transition count 1269
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2039 place count 773 transition count 1269
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 9 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2045 place count 770 transition count 1260
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 2 with 330 rules applied. Total rules applied 2375 place count 605 transition count 1095
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2378 place count 605 transition count 1092
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2580 place count 504 transition count 1148
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2590 place count 504 transition count 1138
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 2652 place count 473 transition count 1158
Free-agglomeration rule applied 61 times with reduction of 1 identical transitions.
Iterating global reduction 4 with 61 rules applied. Total rules applied 2713 place count 473 transition count 1096
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 4 with 136 rules applied. Total rules applied 2849 place count 412 transition count 1021
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 2864 place count 412 transition count 1021
Drop transitions removed 81 transitions
Redundant transition composition rules discarded 81 transitions
Iterating global reduction 5 with 81 rules applied. Total rules applied 2945 place count 412 transition count 940
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2947 place count 410 transition count 940
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2948 place count 409 transition count 939
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2950 place count 407 transition count 939
Applied a total of 2950 rules in 1058 ms. Remains 407 /1571 variables (removed 1164) and now considering 939/2173 (removed 1234) transitions.
Finished structural reductions, in 1 iterations. Remains : 407/1571 places, 939/2173 transitions.
Finished random walk after 7611 steps, including 35 resets, run visited all 5 properties in 51 ms. (steps per millisecond=149 )
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-00 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="NoC3x3-PT-5B"
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-5B, 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-158987853200406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-5B.tgz
mv NoC3x3-PT-5B 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 ;