Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821000526.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 itstools
Input is LeafsetExtension-PT-S64C2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821000526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 10K Apr 29 12:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 12:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 29 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 12:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 9 08:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 29 12:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 29 12:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 29 12:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 29 12:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14M May 10 09:34 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 LeafsetExtension-PT-S64C2-ReachabilityCardinality-00
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-01
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-02
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-03
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-04
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-05
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-06
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-07
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-08
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-09
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-10
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-11
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-12
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-13
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-14
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654241540942

Running Version 202205111006
[2022-06-03 07:32:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 07:32:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 07:32:22] [INFO ] Load time of PNML (sax parser for PT used): 693 ms
[2022-06-03 07:32:22] [INFO ] Transformed 21462 places.
[2022-06-03 07:32:23] [INFO ] Transformed 21129 transitions.
[2022-06-03 07:32:23] [INFO ] Parsed PT model containing 21462 places and 21129 transitions in 902 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 65 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 550 resets, run finished after 858 ms. (steps per millisecond=11 ) properties (out of 16) seen :4
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2022-06-03 07:32:27] [INFO ] Computed 333 place invariants in 2555 ms
[2022-06-03 07:32:33] [INFO ] After 5869ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-03 07:32:38] [INFO ] [Nat]Absence check using 67 positive place invariants in 69 ms returned sat
[2022-06-03 07:32:39] [INFO ] [Nat]Absence check using 67 positive and 266 generalized place invariants in 894 ms returned sat
[2022-06-03 07:32:58] [INFO ] After 17052ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :2
[2022-06-03 07:32:58] [INFO ] After 17088ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-03 07:32:58] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :2
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 62 out of 21462 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 2437 are kept as prefixes of interest. Removing 19025 places using SCC suffix rule.37 ms
Discarding 19025 places :
Also discarding 10499 output transitions
Drop transitions removed 10499 transitions
Drop transitions removed 4208 transitions
Reduce isomorphic transitions removed 4208 transitions.
Drop transitions removed 974 transitions
Trivial Post-agglo rules discarded 974 transitions
Performed 974 trivial Post agglomeration. Transition count delta: 974
Iterating post reduction 0 with 5182 rules applied. Total rules applied 5183 place count 2437 transition count 5448
Reduce places removed 976 places and 0 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 1007 rules applied. Total rules applied 6190 place count 1461 transition count 5417
Reduce places removed 31 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 37 rules applied. Total rules applied 6227 place count 1430 transition count 5411
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 6233 place count 1424 transition count 5411
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 6233 place count 1424 transition count 5371
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 6313 place count 1384 transition count 5371
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 6343 place count 1354 transition count 5341
Iterating global reduction 4 with 30 rules applied. Total rules applied 6373 place count 1354 transition count 5341
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 6384 place count 1354 transition count 5330
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 6395 place count 1343 transition count 5330
Partial Free-agglomeration rule applied 952 times.
Drop transitions removed 952 transitions
Iterating global reduction 5 with 952 rules applied. Total rules applied 7347 place count 1343 transition count 5330
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 5 with 22 rules applied. Total rules applied 7369 place count 1321 transition count 5330
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 7384 place count 1321 transition count 5315
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 7399 place count 1306 transition count 5315
Applied a total of 7399 rules in 1750 ms. Remains 1306 /21462 variables (removed 20156) and now considering 5315/21129 (removed 15814) transitions.
Finished structural reductions, in 1 iterations. Remains : 1306/21462 places, 5315/21129 transitions.
Incomplete random walk after 1000000 steps, including 186870 resets, run finished after 11673 ms. (steps per millisecond=85 ) properties (out of 3) seen :2
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4791 resets, run finished after 2120 ms. (steps per millisecond=471 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-03 07:33:13] [INFO ] Flow matrix only has 2263 transitions (discarded 3052 similar events)
// Phase 1: matrix 2263 rows 1306 cols
[2022-06-03 07:33:13] [INFO ] Computed 2 place invariants in 25 ms
[2022-06-03 07:33:14] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 07:33:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-03 07:33:14] [INFO ] After 632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 07:33:15] [INFO ] After 817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 126 ms.
[2022-06-03 07:33:15] [INFO ] After 1112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 25 out of 1306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1306/1306 places, 5315/5315 transitions.
Graph (complete) has 3905 edges and 1306 vertex of which 553 are kept as prefixes of interest. Removing 753 places using SCC suffix rule.3 ms
Discarding 753 places :
Also discarding 29 output transitions
Drop transitions removed 29 transitions
Drop transitions removed 711 transitions
Reduce isomorphic transitions removed 711 transitions.
Iterating post reduction 0 with 711 rules applied. Total rules applied 712 place count 553 transition count 4575
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 713 place count 553 transition count 4574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 714 place count 552 transition count 4574
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 2 with 31 rules applied. Total rules applied 745 place count 552 transition count 4574
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 746 place count 551 transition count 4574
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 747 place count 551 transition count 4573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 748 place count 550 transition count 4573
Applied a total of 748 rules in 225 ms. Remains 550 /1306 variables (removed 756) and now considering 4573/5315 (removed 742) transitions.
Finished structural reductions, in 1 iterations. Remains : 550/1306 places, 4573/5315 transitions.
Finished random walk after 686804 steps, including 125617 resets, run visited all 1 properties in 5517 ms. (steps per millisecond=124 )
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 58978 ms.

BK_STOP 1654241601138

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="LeafsetExtension-PT-S64C2"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is LeafsetExtension-PT-S64C2, 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 r132-tall-165271821000526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C2.tgz
mv LeafsetExtension-PT-S64C2 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;