About the Execution of 2020-gold for BART-PT-020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
276.800 | 3600000.00 | 48737.00 | 300.40 | FFTTFFFTFTFTTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r011-tall-162038006200311.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 gold2020
Input is BART-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038006200311
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.9M
-rw-r--r-- 1 mcc users 4.2K Mar 20 13:27 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 20 13:27 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Jun 8 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 8 09:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jun 8 09:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 8 09:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 8 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Jun 8 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 8 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 8 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 8 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 8 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 20 13:27 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 20 13:27 instance
-rw-r--r-- 1 mcc users 6 Mar 20 13:27 iscolored
-rw-r--r-- 1 mcc users 4.8M Mar 20 13:27 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 BART-PT-020-ReachabilityCardinality-00
FORMULA_NAME BART-PT-020-ReachabilityCardinality-01
FORMULA_NAME BART-PT-020-ReachabilityCardinality-02
FORMULA_NAME BART-PT-020-ReachabilityCardinality-03
FORMULA_NAME BART-PT-020-ReachabilityCardinality-04
FORMULA_NAME BART-PT-020-ReachabilityCardinality-05
FORMULA_NAME BART-PT-020-ReachabilityCardinality-06
FORMULA_NAME BART-PT-020-ReachabilityCardinality-07
FORMULA_NAME BART-PT-020-ReachabilityCardinality-08
FORMULA_NAME BART-PT-020-ReachabilityCardinality-09
FORMULA_NAME BART-PT-020-ReachabilityCardinality-10
FORMULA_NAME BART-PT-020-ReachabilityCardinality-11
FORMULA_NAME BART-PT-020-ReachabilityCardinality-12
FORMULA_NAME BART-PT-020-ReachabilityCardinality-13
FORMULA_NAME BART-PT-020-ReachabilityCardinality-14
FORMULA_NAME BART-PT-020-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1623181699783
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-06-08 19:48:21] [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]
[2021-06-08 19:48:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-08 19:48:21] [INFO ] Load time of PNML (sax parser for PT used): 340 ms
[2021-06-08 19:48:21] [INFO ] Transformed 2850 places.
[2021-06-08 19:48:21] [INFO ] Transformed 4040 transitions.
[2021-06-08 19:48:21] [INFO ] Found NUPN structural information;
[2021-06-08 19:48:21] [INFO ] Parsed PT model containing 2850 places and 4040 transitions in 417 ms.
Reduce places removed 210 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 62 ms.
Working with output stream class java.io.PrintStream
FORMULA BART-PT-020-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=106 ) properties seen :[1, 0, 0, 1, 0, 0, 0, 0, 0, 0]
FORMULA BART-PT-020-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-020-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0]
FORMULA BART-PT-020-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 4040 rows 2640 cols
[2021-06-08 19:48:22] [INFO ] Computed 20 place invariants in 68 ms
[2021-06-08 19:48:22] [INFO ] [Real]Absence check using 20 positive place invariants in 118 ms returned sat
[2021-06-08 19:48:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 19:48:27] [INFO ] SMT solver returned unknown. Retrying;
[2021-06-08 19:48:27] [INFO ] [Real]Absence check using state equation in 4503 ms returned (error "Failed to check-sat")
[2021-06-08 19:48:27] [INFO ] [Real]Absence check using 20 positive place invariants in 106 ms returned sat
[2021-06-08 19:48:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 19:48:32] [INFO ] [Real]Absence check using state equation in 4567 ms returned (error "Solver has unexpectedly terminated")
[2021-06-08 19:48:32] [INFO ] [Real]Absence check using 20 positive place invariants in 108 ms returned sat
[2021-06-08 19:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 19:48:37] [INFO ] SMT solver returned unknown. Retrying;
[2021-06-08 19:48:37] [INFO ] [Real]Absence check using state equation in 4589 ms returned (error "Failed to check-sat")
[2021-06-08 19:48:37] [INFO ] [Real]Absence check using 20 positive place invariants in 105 ms returned sat
[2021-06-08 19:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 19:48:42] [INFO ] SMT solver returned unknown. Retrying;
[2021-06-08 19:48:42] [INFO ] [Real]Absence check using state equation in 4577 ms returned (error "Failed to check-sat")
[2021-06-08 19:48:42] [INFO ] [Real]Absence check using 20 positive place invariants in 98 ms returned sat
[2021-06-08 19:48:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 19:48:47] [INFO ] SMT solver returned unknown. Retrying;
[2021-06-08 19:48:47] [INFO ] [Real]Absence check using state equation in 4615 ms returned (error "Failed to check-sat")
[2021-06-08 19:48:47] [INFO ] [Real]Absence check using 20 positive place invariants in 102 ms returned sat
[2021-06-08 19:48:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 19:48:52] [INFO ] SMT solver returned unknown. Retrying;
[2021-06-08 19:48:52] [INFO ] [Real]Absence check using state equation in 4565 ms returned (error "Failed to check-sat")
[2021-06-08 19:48:52] [INFO ] [Real]Absence check using 20 positive place invariants in 99 ms returned sat
[2021-06-08 19:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 19:48:57] [INFO ] SMT solver returned unknown. Retrying;
[2021-06-08 19:48:57] [INFO ] [Real]Absence check using state equation in 4578 ms returned (error "Failed to check-sat")
Support contains 28 out of 2640 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 3967 edges and 2640 vertex of which 2432 / 2640 are part of one of the 20 SCC in 12 ms
Free SCC test removed 2412 places
Discarding 3 places :
Also discarding 606 output transitions
Drop transitions removed 606 transitions
Graph (complete) has 290 edges and 228 vertex of which 225 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.11 ms
Drop transitions removed 3139 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 3144 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 3272 rules applied. Total rules applied 3274 place count 225 transition count 162
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 152 rules applied. Total rules applied 3426 place count 97 transition count 138
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 24 rules applied. Total rules applied 3450 place count 89 transition count 122
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 3 with 21 rules applied. Total rules applied 3471 place count 81 transition count 109
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 4 with 15 rules applied. Total rules applied 3486 place count 76 transition count 99
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 10 rules applied. Total rules applied 3496 place count 71 transition count 94
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 3501 place count 69 transition count 91
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 3503 place count 68 transition count 90
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 3503 place count 68 transition count 88
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3507 place count 66 transition count 88
Symmetric choice reduction at 8 with 8 rule applications. Total rules 3515 place count 66 transition count 88
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 3531 place count 58 transition count 80
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 3539 place count 58 transition count 72
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 3539 place count 58 transition count 70
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 3543 place count 56 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 3547 place count 54 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3549 place count 54 transition count 66
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 3557 place count 54 transition count 58
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3566 place count 46 transition count 57
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 3567 place count 46 transition count 57
Applied a total of 3567 rules in 86 ms. Remains 46 /2640 variables (removed 2594) and now considering 57/4040 (removed 3983) transitions.
Finished structural reductions, in 1 iterations. Remains : 46/2640 places, 57/4040 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1421 ms. (steps per millisecond=703 ) properties seen :[0, 1, 1, 1, 1, 1, 1]
FORMULA BART-PT-020-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-020-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-020-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-020-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-020-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-020-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties seen :[0]
// Phase 1: matrix 57 rows 46 cols
[2021-06-08 19:48:59] [INFO ] Computed 17 place invariants in 1 ms
[2021-06-08 19:48:59] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-06-08 19:48:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 19:48:59] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-06-08 19:48:59] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 19:48:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned unsat
FORMULA BART-PT-020-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
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="BART-PT-020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is BART-PT-020, 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 r011-tall-162038006200311"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-020.tgz
mv BART-PT-020 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 ;