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.r528-tall-171683761300525.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 ltsminxred
Input is ShieldPPPs-PT-100B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761300525
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 13 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:43 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 ShieldPPPs-PT-100B-UpperBounds-00
FORMULA_NAME ShieldPPPs-PT-100B-UpperBounds-01
FORMULA_NAME ShieldPPPs-PT-100B-UpperBounds-02
FORMULA_NAME ShieldPPPs-PT-100B-UpperBounds-03
FORMULA_NAME ShieldPPPs-PT-100B-UpperBounds-04
FORMULA_NAME ShieldPPPs-PT-100B-UpperBounds-05
FORMULA_NAME ShieldPPPs-PT-100B-UpperBounds-06
FORMULA_NAME ShieldPPPs-PT-100B-UpperBounds-07
FORMULA_NAME ShieldPPPs-PT-100B-UpperBounds-08
FORMULA_NAME ShieldPPPs-PT-100B-UpperBounds-09
FORMULA_NAME ShieldPPPs-PT-100B-UpperBounds-10
FORMULA_NAME ShieldPPPs-PT-100B-UpperBounds-11
FORMULA_NAME ShieldPPPs-PT-100B-UpperBounds-12
FORMULA_NAME ShieldPPPs-PT-100B-UpperBounds-13
FORMULA_NAME ShieldPPPs-PT-100B-UpperBounds-14
FORMULA_NAME ShieldPPPs-PT-100B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717254562205

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:09:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 15:09:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:09:23] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2024-06-01 15:09:23] [INFO ] Transformed 6803 places.
[2024-06-01 15:09:23] [INFO ] Transformed 6303 transitions.
[2024-06-01 15:09:23] [INFO ] Found NUPN structural information;
[2024-06-01 15:09:24] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 721 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 6303 rows 6803 cols
[2024-06-01 15:09:24] [INFO ] Computed 1101 invariants in 69 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 (2 resets) in 174 ms. (57 steps per ms)
FORMULA ShieldPPPs-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPs-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPs-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPs-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPs-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPs-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPs-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (18 resets) in 129 ms. (692 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 15:09:24] [INFO ] Invariant cache hit.
[2024-06-01 15:09:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 694 ms returned sat
[2024-06-01 15:09:29] [INFO ] [Real]Absence check using state equation in 3114 ms returned unknown
[2024-06-01 15:09:31] [INFO ] [Real]Absence check using 1101 positive place invariants in 670 ms returned sat
[2024-06-01 15:09:34] [INFO ] [Real]Absence check using state equation in 3383 ms returned unknown
[2024-06-01 15:09:36] [INFO ] [Real]Absence check using 1101 positive place invariants in 691 ms returned sat
[2024-06-01 15:09:39] [INFO ] [Real]Absence check using state equation in 3246 ms returned unknown
[2024-06-01 15:09:41] [INFO ] [Real]Absence check using 1101 positive place invariants in 647 ms returned sat
[2024-06-01 15:09:44] [INFO ] [Real]Absence check using state equation in 3269 ms returned unknown
[2024-06-01 15:09:46] [INFO ] [Real]Absence check using 1101 positive place invariants in 650 ms returned sat
[2024-06-01 15:09:49] [INFO ] [Real]Absence check using state equation in 3351 ms returned unknown
[2024-06-01 15:09:51] [INFO ] [Real]Absence check using 1101 positive place invariants in 649 ms returned sat
[2024-06-01 15:09:54] [INFO ] [Real]Absence check using state equation in 3314 ms returned sat
[2024-06-01 15:09:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:09:56] [INFO ] [Nat]Absence check using 1101 positive place invariants in 670 ms returned sat
[2024-06-01 15:09:59] [INFO ] [Nat]Absence check using state equation in 3338 ms returned unknown
[2024-06-01 15:10:01] [INFO ] [Real]Absence check using 1101 positive place invariants in 644 ms returned sat
[2024-06-01 15:10:04] [INFO ] [Real]Absence check using state equation in 3422 ms returned unknown
[2024-06-01 15:10:06] [INFO ] [Real]Absence check using 1101 positive place invariants in 662 ms returned sat
[2024-06-01 15:10:09] [INFO ] [Real]Absence check using state equation in 3400 ms returned unknown
[2024-06-01 15:10:11] [INFO ] [Real]Absence check using 1101 positive place invariants in 652 ms returned sat
[2024-06-01 15:10:14] [INFO ] [Real]Absence check using state equation in 3399 ms returned sat
[2024-06-01 15:10:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:10:16] [INFO ] [Nat]Absence check using 1101 positive place invariants in 628 ms returned sat
[2024-06-01 15:10:19] [INFO ] [Nat]Absence check using state equation in 3400 ms returned sat
[2024-06-01 15:10:24] [INFO ] Deduced a trap composed of 14 places in 4778 ms of which 243 ms to minimize.
[2024-06-01 15:10:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 6803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6803 transition count 5602
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 6102 transition count 5602
Performed 498 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 498 Pre rules applied. Total rules applied 1402 place count 6102 transition count 5104
Deduced a syphon composed of 498 places in 29 ms
Reduce places removed 498 places and 0 transitions.
Iterating global reduction 2 with 996 rules applied. Total rules applied 2398 place count 5604 transition count 5104
Discarding 698 places :
Symmetric choice reduction at 2 with 698 rule applications. Total rules 3096 place count 4906 transition count 4406
Iterating global reduction 2 with 698 rules applied. Total rules applied 3794 place count 4906 transition count 4406
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 300 Pre rules applied. Total rules applied 3794 place count 4906 transition count 4106
Deduced a syphon composed of 300 places in 23 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 2 with 600 rules applied. Total rules applied 4394 place count 4606 transition count 4106
Performed 1494 Post agglomeration using F-continuation condition.Transition count delta: 1494
Deduced a syphon composed of 1494 places in 7 ms
Reduce places removed 1494 places and 0 transitions.
Iterating global reduction 2 with 2988 rules applied. Total rules applied 7382 place count 3112 transition count 2612
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 894 times.
Drop transitions (Partial Free agglomeration) removed 894 transitions
Iterating global reduction 2 with 894 rules applied. Total rules applied 8276 place count 3112 transition count 2612
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8277 place count 3111 transition count 2611
Applied a total of 8277 rules in 3170 ms. Remains 3111 /6803 variables (removed 3692) and now considering 2611/6303 (removed 3692) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3180 ms. Remains : 3111/6803 places, 2611/6303 transitions.
// Phase 1: matrix 2611 rows 3111 cols
[2024-06-01 15:10:28] [INFO ] Computed 1101 invariants in 111 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (58 resets) in 19369 ms. (51 steps per ms)
FORMULA ShieldPPPs-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPs-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPs-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPs-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPs-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPs-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPs-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPs-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPs-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 445867 steps (1 resets) in 5001 ms. (89 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 8 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 89337 ms.
ITS solved all properties within timeout

BK_STOP 1717254652640

--------------------
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="ShieldPPPs-PT-100B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPs-PT-100B, 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 r528-tall-171683761300525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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