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.r334-tall-171679081200845.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 itstools
Input is SharedMemory-PT-000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679081200845
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 127M
-rw-r--r-- 1 mcc users 1.9M Apr 12 23:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.6M Apr 12 23:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7M Apr 12 20:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 14M Apr 12 20:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 1.8M Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 4.8M Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4M Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.9M Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5M Apr 13 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13M Apr 13 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12M Apr 13 11:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47M Apr 13 11:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 202K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 419K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M 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 SharedMemory-PT-000100-UpperBounds-00
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-01
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-02
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-03
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-04
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-05
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-06
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-07
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-08
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-09
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-10
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-11
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-12
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-13
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-14
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716876207680

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-PT-000100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 06:03:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 06:03:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:03:29] [INFO ] Load time of PNML (sax parser for PT used): 606 ms
[2024-05-28 06:03:29] [INFO ] Transformed 10301 places.
[2024-05-28 06:03:29] [INFO ] Transformed 20100 transitions.
[2024-05-28 06:03:29] [INFO ] Found NUPN structural information;
[2024-05-28 06:03:29] [INFO ] Parsed PT model containing 10301 places and 20100 transitions and 80000 arcs in 797 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 43 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[1, 0, 100, 0, 100, 0, 1, 0, 0, 0, 1] Max Struct:[1, 100, 100, 9900, 100, 1, 1, 1, 1, 1, 1]
FORMULA SharedMemory-PT-000100-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[100, 9900, 1, 1, 1, 1]
// Phase 1: matrix 20100 rows 10301 cols
[2024-05-28 06:03:32] [INFO ] Computed 201 invariants in 2166 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[100, 9900, 1, 1, 1, 1]
RANDOM walk for 7351 steps (2 resets) in 30017 ms. (0 steps per ms)
FORMULA SharedMemory-PT-000100-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-PT-000100-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1871 ms. (21 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[35, 1, 0, 0] Max Struct:[100, 9900, 1, 1]
[2024-05-28 06:04:04] [INFO ] Invariant cache hit.
[2024-05-28 06:04:06] [INFO ] [Real]Absence check using 201 positive place invariants in 728 ms returned sat
[2024-05-28 06:04:09] [INFO ] [Real]Absence check using state equation in 2522 ms returned unknown
[2024-05-28 06:04:11] [INFO ] [Real]Absence check using 201 positive place invariants in 534 ms returned unsat
[2024-05-28 06:04:13] [INFO ] [Real]Absence check using 201 positive place invariants in 717 ms returned sat
[2024-05-28 06:04:16] [INFO ] [Real]Absence check using state equation in 2555 ms returned sat
[2024-05-28 06:04:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:04:18] [INFO ] [Nat]Absence check using 201 positive place invariants in 738 ms returned sat
[2024-05-28 06:04:21] [INFO ] [Nat]Absence check using state equation in 2491 ms returned sat
[2024-05-28 06:04:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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)
[2024-05-28 06:04:24] [INFO ] [Real]Absence check using 201 positive place invariants in 746 ms returned sat
[2024-05-28 06:04:26] [INFO ] [Real]Absence check using state equation in 2496 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[35, 1, 0, 0] Max Struct:[100, 1, 1, 1]
FORMULA SharedMemory-PT-000100-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[35, 0, 0] Max Struct:[100, 1, 1]
Support contains 102 out of 10301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9898 transitions
Trivial Post-agglo rules discarded 9898 transitions
Performed 9898 trivial Post agglomeration. Transition count delta: 9898
Iterating post reduction 0 with 9898 rules applied. Total rules applied 9898 place count 10301 transition count 10202
Reduce places removed 9996 places and 0 transitions.
Ensure Unique test removed 9602 transitions
Reduce isomorphic transitions removed 9602 transitions.
Iterating post reduction 1 with 19598 rules applied. Total rules applied 29496 place count 305 transition count 600
Drop transitions (Redundant composition of simpler transitions.) removed 196 transitions
Redundant transition composition rules discarded 196 transitions
Iterating global reduction 2 with 196 rules applied. Total rules applied 29692 place count 305 transition count 404
Free-agglomeration rule applied 100 times.
Iterating global reduction 2 with 100 rules applied. Total rules applied 29792 place count 305 transition count 304
Reduce places removed 100 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 29992 place count 205 transition count 204
Applied a total of 29992 rules in 398 ms. Remains 205 /10301 variables (removed 10096) and now considering 204/20100 (removed 19896) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 205/10301 places, 204/20100 transitions.
// Phase 1: matrix 204 rows 205 cols
[2024-05-28 06:04:27] [INFO ] Computed 103 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[35, 0, 0] Max Struct:[100, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 10213 ms. (97 steps per ms)
FORMULA SharedMemory-PT-000100-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-PT-000100-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 3010 ms. (332 steps per ms)
FORMULA SharedMemory-PT-000100-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-PT-000100-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-PT-000100-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-PT-000100-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 )
[2024-05-28 06:04:40] [INFO ] Flatten gal took : 42 ms
[2024-05-28 06:04:40] [INFO ] Flatten gal took : 13 ms
[2024-05-28 06:04:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6029924797651632943.gal : 10 ms
[2024-05-28 06:04:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3856336969375085269.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6029924797651632943.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3856336969375085269.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:281)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:343)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 71909 ms.

BK_STOP 1716876280714

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="SharedMemory-PT-000100"
export BK_EXAMINATION="UpperBounds"
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-5568"
echo " Executing tool itstools"
echo " Input is SharedMemory-PT-000100, 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 r334-tall-171679081200845"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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