Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r187-oct2-158987942300246.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is SafeBus-PT-03, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r187-oct2-158987942300246
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.2K Apr 12 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 12 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 11 13:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 13:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 10 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 9 23:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 9 23:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 93K Mar 24 05:38 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1591284496356

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 15:28:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 1800, -rebuildPNML]
[2020-06-04 15:28:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 15:28:18] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2020-06-04 15:28:18] [INFO ] Transformed 57 places.
[2020-06-04 15:28:18] [INFO ] Transformed 91 transitions.
[2020-06-04 15:28:18] [INFO ] Parsed PT model containing 57 places and 91 transitions in 82 ms.
Reduce places removed 3 places and 0 transitions.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 8 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 3 ms.19527KB memory used
Starting structural reductions, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 15 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2020-06-04 15:28:18] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2020-06-04 15:28:18] [INFO ] Computed 17 place invariants in 5 ms
[2020-06-04 15:28:19] [INFO ] Implicit Places using invariants in 201 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 222 ms to find 3 implicit places.
[2020-06-04 15:28:19] [INFO ] Redundant transitions in 1 ms returned []
[2020-06-04 15:28:19] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 51 cols
[2020-06-04 15:28:19] [INFO ] Computed 14 place invariants in 2 ms
[2020-06-04 15:28:19] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned [7, 11, 15, 16, 20, 24, 25, 29, 33]
Found 9 dead transitions using SMT.
Drop transitions removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions :[33, 29, 25, 24, 20, 16, 15, 11, 7]
Starting structural reductions, iteration 1 : 51/54 places, 82/91 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 51 transition count 79
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 79
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 45 transition count 82
Applied a total of 12 rules in 16 ms. Remains 45 /51 variables (removed 6) and now considering 82/82 (removed 0) transitions.
[2020-06-04 15:28:19] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2020-06-04 15:28:19] [INFO ] Computed 14 place invariants in 1 ms
[2020-06-04 15:28:19] [INFO ] Implicit Places using invariants in 61 ms returned []
[2020-06-04 15:28:19] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2020-06-04 15:28:19] [INFO ] Computed 14 place invariants in 1 ms
[2020-06-04 15:28:19] [INFO ] State equation strengthened by 13 read => feed constraints.
[2020-06-04 15:28:19] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 45/54 places, 82/91 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1004 ms (no deadlock found). (steps per millisecond=1245 )
Random directed walk for 1250002 steps, including 0 resets, run took 759 ms (no deadlock found). (steps per millisecond=1646 )
[2020-06-04 15:28:21] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2020-06-04 15:28:21] [INFO ] Computed 14 place invariants in 2 ms
[2020-06-04 15:28:21] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 15:28:21] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 15:28:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:28:21] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2020-06-04 15:28:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:28:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 15:28:21] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-04 15:28:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:28:21] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-06-04 15:28:21] [INFO ] State equation strengthened by 13 read => feed constraints.
[2020-06-04 15:28:21] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2020-06-04 15:28:21] [INFO ] Deduced a trap composed of 11 places in 54 ms
[2020-06-04 15:28:21] [INFO ] Deduced a trap composed of 11 places in 48 ms
[2020-06-04 15:28:21] [INFO ] Deduced a trap composed of 11 places in 46 ms
[2020-06-04 15:28:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 171 ms
[2020-06-04 15:28:21] [INFO ] Computed and/alt/rep : 79/693/65 causal constraints in 4 ms.
[2020-06-04 15:28:21] [INFO ] Added : 53 causal constraints over 11 iterations in 171 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Parikh directed walk for 10300 steps, including 712 resets, run took 33 ms. (steps per millisecond=312 )
Random directed walk for 500000 steps, including 0 resets, run took 273 ms (no deadlock found). (steps per millisecond=1831 )
Random walk for 500000 steps, including 0 resets, run took 342 ms (no deadlock found). (steps per millisecond=1461 )
Random directed walk for 500003 steps, including 0 resets, run took 279 ms (no deadlock found). (steps per millisecond=1792 )
Random walk for 500000 steps, including 0 resets, run took 340 ms (no deadlock found). (steps per millisecond=1470 )
[2020-06-04 15:28:23] [INFO ] Flatten gal took : 74 ms
[2020-06-04 15:28:23] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2020-06-04 15:28:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 1800 - MCC
vrfy: Checking ReachabilityDeadlock @ SafeBus-PT-03 @ 1770 seconds

FORMULA ReachabilityDeadlock FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1767
rslt: Output for ReachabilityDeadlock @ SafeBus-PT-03

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityDeadlock.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=combined",
"--siphontrap=par",
"--siphondepth=10",
"--findpath=par",
"--retrylimit=0",
"--depthlimit=1000000",
"--symmetry",
"--symmtimelimit=300",
"--threads=2",
"--symmetrydepth=1073741824",
"--timelimit=1770",
"--json=ReachabilityDeadlock.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 15:28:23 2020
",
"timelimit": 1770
},
"child": null,
"exit":
{
"error": null,
"memory": 18240,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityDeadlock.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 1,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "E (F (DEADLOCK))",
"processed_size": 16,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 529,
"conflict_clusters": 4,
"places": 54,
"places_significant": 37,
"singleton_clusters": 0,
"transitions": 91
},
"result":
{
"edges": 5548,
"markings": 2279,
"produced_by": "state space",
"value": false
},
"task":
{
"findpath":
{
"depthlimit": 1000000,
"retrylimit": null,
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 2
},
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"symmetry":
{
"card": 6.000000,
"composed": 0,
"dead_branches": 0,
"generators": 3,
"interrupted": false,
"real_computed": 3,
"timelimit": 300
},
"threads": 2,
"type": "dfs"
},
"type": "reachability",
"workflow": "findpath||search"
}
}
lola: LoLA will run for 1770 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 145/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 91 transitions, 37 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityDeadlock.xml
lola: E (F (DEADLOCK))
lola: checking reachability
lola: Planning: workflow for reachability check: findpath||search (--findpath=par)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (DEADLOCK))
lola: processed formula length: 16
lola: 1 rewrites
lola: closed formula file ReachabilityDeadlock.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: SEARCH (findpath)
lola: findpath: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: findpath: starting randomized, memory-less exploration (--findpath)
lola: findpath: searching for paths with maximal depth 1000000 (--depthlimit)
lola: computing symmetries (--symmetry)
lola: time limit for symmetry computation of 300 seconds given (--symmtimelimit)
lola: findpath: no retry limit given (--retrylimit)
lola: findpath: transitions are chosen hash-driven
lola: computed 3 generators (3 in search tree, 0 by composition)
lola: representing 6 symmetries
lola: 0 dead branches visited in search tree
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2279 markings, 5548 edges
lola: memory consumption: 18240 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityDeadlock.json
lola: closed JSON file ReachabilityDeadlock.json
rslt: finished

--------------------
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="SafeBus-PT-03"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 SafeBus-PT-03, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r187-oct2-158987942300246"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-03.tgz
mv SafeBus-PT-03 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;