fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r218-tajo-159033491100431
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldPPPt-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.730 1800000.00 56450.00 100.70 T normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r218-tajo-159033491100431.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldPPPt-PT-030B, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r218-tajo-159033491100431
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 3.7K May 14 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 19:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 19:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.6K May 13 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 08:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 569K May 12 20:42 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 1591347916807

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 09:05: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-05 09:05:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 09:05:18] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2020-06-05 09:05:18] [INFO ] Transformed 2343 places.
[2020-06-05 09:05:18] [INFO ] Transformed 2133 transitions.
[2020-06-05 09:05:18] [INFO ] Found NUPN structural information;
[2020-06-05 09:05:18] [INFO ] Parsed PT model containing 2343 places and 2133 transitions in 258 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 75 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 6 ms.23589KB memory used
Starting structural reductions, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Performed 573 Post agglomeration using F-continuation condition.Transition count delta: 573
Iterating post reduction 0 with 573 rules applied. Total rules applied 573 place count 2343 transition count 1560
Reduce places removed 573 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 575 rules applied. Total rules applied 1148 place count 1770 transition count 1558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1149 place count 1769 transition count 1558
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 1149 place count 1769 transition count 1438
Deduced a syphon composed of 120 places in 5 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1389 place count 1649 transition count 1438
Symmetric choice reduction at 3 with 210 rule applications. Total rules 1599 place count 1649 transition count 1438
Deduced a syphon composed of 210 places in 8 ms
Reduce places removed 210 places and 210 transitions.
Iterating global reduction 3 with 420 rules applied. Total rules applied 2019 place count 1439 transition count 1228
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 2019 place count 1439 transition count 1138
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 2199 place count 1349 transition count 1138
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 3 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 3 with 1018 rules applied. Total rules applied 3217 place count 840 transition count 629
Renaming transitions due to excessive name length > 1024 char.
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 3395 place count 751 transition count 629
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3396 place count 750 transition count 628
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3397 place count 749 transition count 628
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3397 place count 749 transition count 626
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3401 place count 747 transition count 626
Applied a total of 3401 rules in 884 ms. Remains 747 /2343 variables (removed 1596) and now considering 626/2133 (removed 1507) transitions.
Finished structural reductions, in 1 iterations. Remains : 747/2343 places, 626/2133 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6260 ms (no deadlock found). (steps per millisecond=199 )
Random directed walk for 1250000 steps, including 0 resets, run took 4831 ms (no deadlock found). (steps per millisecond=258 )
// Phase 1: matrix 626 rows 747 cols
[2020-06-05 09:05:30] [INFO ] Computed 330 place invariants in 17 ms
[2020-06-05 09:05:31] [INFO ] [Real]Absence check using 330 positive place invariants in 318 ms returned sat
[2020-06-05 09:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:05:33] [INFO ] [Real]Absence check using state equation in 1790 ms returned sat
[2020-06-05 09:05:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:05:33] [INFO ] [Nat]Absence check using 330 positive place invariants in 238 ms returned sat
[2020-06-05 09:05:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:05:35] [INFO ] [Nat]Absence check using state equation in 1478 ms returned sat
[2020-06-05 09:05:35] [INFO ] Computed and/alt/rep : 622/979/622 causal constraints in 38 ms.
[2020-06-05 09:05:42] [INFO ] Added : 546 causal constraints over 110 iterations in 7051 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 57 ms.
Parikh directed walk for 271100 steps, including 1002 resets, run took 1722 ms. (steps per millisecond=157 )
Random directed walk for 500003 steps, including 0 resets, run took 1851 ms (no deadlock found). (steps per millisecond=270 )
Random walk for 500000 steps, including 0 resets, run took 2277 ms (no deadlock found). (steps per millisecond=219 )
Random directed walk for 500000 steps, including 0 resets, run took 2199 ms (no deadlock found). (steps per millisecond=227 )
Random walk for 500000 steps, including 0 resets, run took 2354 ms (no deadlock found). (steps per millisecond=212 )
[2020-06-05 09:05:53] [INFO ] Flatten gal took : 240 ms
[2020-06-05 09:05:53] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 2 ms.
[2020-06-05 09:05:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 24 ms.
info: Time: 1800 - MCC
vrfy: Checking ReachabilityDeadlock @ ShieldPPPt-PT-030B @ 1770 seconds

FORMULA ReachabilityDeadlock TRUE 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 @ ShieldPPPt-PT-030B

{
"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": "Fri Jun 5 09:05:54 2020
",
"timelimit": 1770
},
"child": null,
"exit":
{
"error": null,
"memory": 49576,
"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": 5346,
"conflict_clusters": 1923,
"places": 2343,
"places_significant": 2012,
"singleton_clusters": 0,
"transitions": 2133
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "findpath",
"value": true
},
"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":
{
"interrupted": false,
"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: 4476/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 74976
lola: finding significant places
lola: 2343 places, 2133 transitions, 2012 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: findpath: no retry limit given (--retrylimit)
lola: findpath: transitions are chosen hash-driven
lola: time limit for symmetry computation of 300 seconds given (--symmtimelimit)
lola: RESULT
lola: result: yes
lola: produced by: findpath
lola: The predicate is reachable.
lola: memory consumption: 49576 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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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 r218-tajo-159033491100431"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B 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 ;