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-171620166700486.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-040, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166700486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 67M
-rw-r--r-- 1 mcc users 2.8M Apr 12 23:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8M Apr 12 23:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2M Apr 12 21:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 11M Apr 12 21:49 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 1.4M Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.0M Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6M Apr 13 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.5M Apr 13 01:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3M Apr 13 00:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Apr 13 00:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 333K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 671K 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 9.5M 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-040-ReachabilityCardinality-2024-00
FORMULA_NAME BART-PT-040-ReachabilityCardinality-2024-01
FORMULA_NAME BART-PT-040-ReachabilityCardinality-2024-02
FORMULA_NAME BART-PT-040-ReachabilityCardinality-2024-03
FORMULA_NAME BART-PT-040-ReachabilityCardinality-2024-04
FORMULA_NAME BART-PT-040-ReachabilityCardinality-2024-05
FORMULA_NAME BART-PT-040-ReachabilityCardinality-2024-06
FORMULA_NAME BART-PT-040-ReachabilityCardinality-2024-07
FORMULA_NAME BART-PT-040-ReachabilityCardinality-2024-08
FORMULA_NAME BART-PT-040-ReachabilityCardinality-2024-09
FORMULA_NAME BART-PT-040-ReachabilityCardinality-2024-10
FORMULA_NAME BART-PT-040-ReachabilityCardinality-2024-11
FORMULA_NAME BART-PT-040-ReachabilityCardinality-2024-12
FORMULA_NAME BART-PT-040-ReachabilityCardinality-2024-13
FORMULA_NAME BART-PT-040-ReachabilityCardinality-2024-14
FORMULA_NAME BART-PT-040-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716386495394

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-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 14:01:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 14:01:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 14:01:39] [INFO ] Load time of PNML (sax parser for PT used): 1199 ms
[2024-05-22 14:01:39] [INFO ] Transformed 5490 places.
[2024-05-22 14:01:39] [INFO ] Transformed 8080 transitions.
[2024-05-22 14:01:39] [INFO ] Found NUPN structural information;
[2024-05-22 14:01:39] [INFO ] Parsed PT model containing 5490 places and 8080 transitions and 64800 arcs in 1751 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 527 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-040-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 4039 ms. (9 steps per ms) remains 3/6 properties
FORMULA BART-PT-040-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-040-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-040-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 641 ms. (62 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 656 ms. (60 steps per ms) remains 3/3 properties
// Phase 1: matrix 8080 rows 5280 cols
[2024-05-22 14:01:42] [INFO ] Computed 40 invariants in 110 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4294/4356 variables, 33/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4356 variables, 4294/4389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4356 variables, 0/4389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11022/13360 variables, and 8745 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5197 ms.
Refiners :[Domain max(s): 4356/5280 constraints, Positive P Invariants (semi-flows): 33/40 constraints, State Equation: 4356/5280 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4294/4356 variables, 33/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4356 variables, 4294/4389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4356 variables, 0/4389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6666/11022 variables, 4356/8745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11022 variables, 3/8748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11022/13360 variables, and 8748 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5009 ms.
Refiners :[Domain max(s): 4356/5280 constraints, Positive P Invariants (semi-flows): 33/40 constraints, State Equation: 4356/5280 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 10513ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 5280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Graph (trivial) has 7908 edges and 5280 vertex of which 4951 / 5280 are part of one of the 40 SCC in 25 ms
Free SCC test removed 4911 places
Drop transitions (Empty/Sink Transition effects.) removed 7585 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 7605 transitions.
Graph (complete) has 475 edges and 369 vertex of which 362 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 159 place count 362 transition count 318
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 187 rules applied. Total rules applied 346 place count 205 transition count 288
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 36 rules applied. Total rules applied 382 place count 191 transition count 266
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 24 rules applied. Total rules applied 406 place count 182 transition count 251
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 4 with 18 rules applied. Total rules applied 424 place count 175 transition count 240
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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 11 rules applied. Total rules applied 435 place count 171 transition count 233
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 6 with 7 rules applied. Total rules applied 442 place count 168 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 7 with 31 rules applied. Total rules applied 473 place count 167 transition count 199
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 45 rules applied. Total rules applied 518 place count 138 transition count 183
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 518 place count 138 transition count 180
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 524 place count 135 transition count 180
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 536 place count 123 transition count 168
Iterating global reduction 9 with 12 rules applied. Total rules applied 548 place count 123 transition count 168
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 9 with 14 rules applied. Total rules applied 562 place count 123 transition count 154
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 564 place count 122 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 564 place count 122 transition count 152
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 566 place count 121 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 570 place count 121 transition count 148
Free-agglomeration rule applied 25 times.
Iterating global reduction 11 with 25 rules applied. Total rules applied 595 place count 121 transition count 123
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 11 with 25 rules applied. Total rules applied 620 place count 96 transition count 123
Applied a total of 620 rules in 209 ms. Remains 96 /5280 variables (removed 5184) and now considering 123/8080 (removed 7957) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 96/5280 places, 123/8080 transitions.
RANDOM walk for 6223 steps (1 resets) in 212 ms. (29 steps per ms) remains 0/3 properties
FORMULA BART-PT-040-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-040-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-040-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 15387 ms.
ITS solved all properties within timeout

BK_STOP 1716386513192

--------------------
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-040"
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-040, 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-171620166700486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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