About the Execution of GreatSPN+red for FlexibleBarrier-PT-04b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
281.508 | 4499.00 | 8950.00 | 46.40 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
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.r179-tall-171640600600013.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 FlexibleBarrier-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600600013
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 08:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 13 08:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 69K 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716415982055
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 22:13:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 22:13:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:13:03] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-22 22:13:03] [INFO ] Transformed 268 places.
[2024-05-22 22:13:03] [INFO ] Transformed 305 transitions.
[2024-05-22 22:13:03] [INFO ] Found NUPN structural information;
[2024-05-22 22:13:03] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 305 rows 268 cols
[2024-05-22 22:13:03] [INFO ] Computed 6 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (237 resets) in 32 ms. (303 steps per ms)
FORMULA FlexibleBarrier-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (41 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 22:13:03] [INFO ] Invariant cache hit.
[2024-05-22 22:13:03] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-22 22:13:03] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-22 22:13:04] [INFO ] Deduced a trap composed of 81 places in 177 ms of which 30 ms to minimize.
[2024-05-22 22:13:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:13:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-22 22:13:04] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-22 22:13:04] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 1 ms to minimize.
[2024-05-22 22:13:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2024-05-22 22:13:04] [INFO ] Computed and/alt/rep : 287/559/287 causal constraints (skipped 17 transitions) in 19 ms.
[2024-05-22 22:13:05] [INFO ] Added : 247 causal constraints over 50 iterations in 1290 ms. Result :sat
Minimization took 176 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 268 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p7) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 304/304 transitions.
Graph (trivial) has 253 edges and 268 vertex of which 26 / 268 are part of one of the 4 SCC in 4 ms
Free SCC test removed 22 places
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 245 transition count 200
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 154 place count 169 transition count 200
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 154 place count 169 transition count 188
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 178 place count 157 transition count 188
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 246 place count 89 transition count 120
Iterating global reduction 2 with 68 rules applied. Total rules applied 314 place count 89 transition count 120
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 314 place count 89 transition count 114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 326 place count 83 transition count 114
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 330 place count 83 transition count 110
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 338 place count 75 transition count 102
Iterating global reduction 3 with 8 rules applied. Total rules applied 346 place count 75 transition count 102
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 354 place count 75 transition count 94
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 394 place count 55 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 398 place count 55 transition count 70
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 402 place count 51 transition count 66
Iterating global reduction 5 with 4 rules applied. Total rules applied 406 place count 51 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 408 place count 50 transition count 83
Free-agglomeration rule applied 23 times.
Iterating global reduction 5 with 23 rules applied. Total rules applied 431 place count 50 transition count 60
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 32 rules applied. Total rules applied 463 place count 27 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 470 place count 27 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 471 place count 26 transition count 43
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 31 edges and 24 vertex of which 20 / 24 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 474 place count 8 transition count 43
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 34 transitions.
Graph (trivial) has 8 edges and 5 vertex of which 4 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 38 rules applied. Total rules applied 512 place count 2 transition count 9
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 520 place count 2 transition count 1
Applied a total of 520 rules in 89 ms. Remains 2 /268 variables (removed 266) and now considering 1/304 (removed 303) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 2/268 places, 1/304 transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-05-22 22:13:06] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA FlexibleBarrier-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (500000 resets) in 264 ms. (3773 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 3307 ms.
ITS solved all properties within timeout
BK_STOP 1716415986554
--------------------
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 UpperBounds -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="FlexibleBarrier-PT-04b"
export BK_EXAMINATION="UpperBounds"
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 FlexibleBarrier-PT-04b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640600600013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-04b.tgz
mv FlexibleBarrier-PT-04b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;