Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r025-smll-171620166700502.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BART-PT-060, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166700502
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 134M
-rw-r--r-- 1 mcc users 4.6M Apr 13 01:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16M Apr 13 01:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7M Apr 12 22:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 12M Apr 12 22:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.1M Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 5.5M Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2M Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.3M Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3M Apr 13 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23M Apr 13 06:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9M Apr 13 03:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32M Apr 13 03:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 15M May 18 16: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

here is the order used to build the result vector(from text file)
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-00
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-01
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-02
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-03
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-04
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-05
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-06
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-07
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-08
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-09
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-10
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-11
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-12
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-13
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-14
FORMULA_NAME BART-PT-060-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716391141911

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-060
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 15:19:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 15:19:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 15:19:06] [INFO ] Load time of PNML (sax parser for PT used): 1500 ms
[2024-05-22 15:19:06] [INFO ] Transformed 8130 places.
[2024-05-22 15:19:06] [INFO ] Transformed 12120 transitions.
[2024-05-22 15:19:06] [INFO ] Found NUPN structural information;
[2024-05-22 15:19:06] [INFO ] Parsed PT model containing 8130 places and 12120 transitions and 97200 arcs in 1887 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 812 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-060-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3457 ms. (11 steps per ms) remains 4/7 properties
FORMULA BART-PT-060-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 835 ms. (47 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 4/4 properties
// Phase 1: matrix 12120 rows 7920 cols
[2024-05-22 15:19:09] [INFO ] Computed 60 invariants in 184 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 3403/3432 variables, 26/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3432 variables, 3403/3458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3432 variables, 0/3458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5252/8684 variables, 3432/6890 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8684/20040 variables, and 6890 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5081 ms.
Refiners :[Domain max(s): 3432/7920 constraints, Positive P Invariants (semi-flows): 26/60 constraints, State Equation: 3432/7920 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 3403/3432 variables, 26/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3432 variables, 3403/3458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3432 variables, 0/3458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5252/8684 variables, 3432/6890 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8684 variables, 4/6894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8684 variables, 0/6894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8684/20040 variables, and 6894 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5048 ms.
Refiners :[Domain max(s): 3432/7920 constraints, Positive P Invariants (semi-flows): 26/60 constraints, State Equation: 3432/7920 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 10628ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 7920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Graph (trivial) has 12039 edges and 7920 vertex of which 7767 / 7920 are part of one of the 60 SCC in 32 ms
Free SCC test removed 7707 places
Drop transitions (Empty/Sink Transition effects.) removed 11894 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 11902 transitions.
Graph (complete) has 218 edges and 213 vertex of which 179 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.2 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 179 transition count 146
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 85 rules applied. Total rules applied 159 place count 107 transition count 133
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 16 rules applied. Total rules applied 175 place count 101 transition count 123
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 185 place count 97 transition count 117
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 190 place count 95 transition count 114
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 193 place count 94 transition count 112
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 6 with 23 rules applied. Total rules applied 216 place count 93 transition count 90
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 244 place count 72 transition count 83
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 244 place count 72 transition count 79
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 252 place count 68 transition count 79
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 258 place count 62 transition count 73
Iterating global reduction 8 with 6 rules applied. Total rules applied 264 place count 62 transition count 73
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 270 place count 62 transition count 67
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 270 place count 62 transition count 64
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 276 place count 59 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 278 place count 59 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 278 place count 59 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 280 place count 58 transition count 61
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 283 place count 58 transition count 58
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 286 place count 55 transition count 58
Applied a total of 286 rules in 181 ms. Remains 55 /7920 variables (removed 7865) and now considering 58/12120 (removed 12062) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 55/7920 places, 58/12120 transitions.
RANDOM walk for 1148 steps (0 resets) in 28 ms. (39 steps per ms) remains 0/4 properties
FORMULA BART-PT-060-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 15903 ms.
ITS solved all properties within timeout

BK_STOP 1716391160347

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-060"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is BART-PT-060, 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 r025-smll-171620166700502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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