About the Execution of 2024-gold for Referendum-PT-1000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r181-smll-174889242300030.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is Referendum-PT-1000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181-smll-174889242300030
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 823K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.7M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 226K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 651K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 166K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 842K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.1M May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 4.5M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.9M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 100K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 245K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.2M May 29 14:32 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Referendum-PT-1000-UpperBounds-00
FORMULA_NAME Referendum-PT-1000-UpperBounds-01
FORMULA_NAME Referendum-PT-1000-UpperBounds-02
FORMULA_NAME Referendum-PT-1000-UpperBounds-03
FORMULA_NAME Referendum-PT-1000-UpperBounds-04
FORMULA_NAME Referendum-PT-1000-UpperBounds-05
FORMULA_NAME Referendum-PT-1000-UpperBounds-06
FORMULA_NAME Referendum-PT-1000-UpperBounds-07
FORMULA_NAME Referendum-PT-1000-UpperBounds-08
FORMULA_NAME Referendum-PT-1000-UpperBounds-09
FORMULA_NAME Referendum-PT-1000-UpperBounds-10
FORMULA_NAME Referendum-PT-1000-UpperBounds-11
FORMULA_NAME Referendum-PT-1000-UpperBounds-12
FORMULA_NAME Referendum-PT-1000-UpperBounds-13
FORMULA_NAME Referendum-PT-1000-UpperBounds-14
FORMULA_NAME Referendum-PT-1000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749023565552
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-1000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-04 07:52:47] [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]
[2025-06-04 07:52:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 07:52:48] [INFO ] Load time of PNML (sax parser for PT used): 552 ms
[2025-06-04 07:52:48] [INFO ] Transformed 3001 places.
[2025-06-04 07:52:48] [INFO ] Transformed 2001 transitions.
[2025-06-04 07:52:48] [INFO ] Found NUPN structural information;
[2025-06-04 07:52:48] [INFO ] Parsed PT model containing 3001 places and 2001 transitions and 5001 arcs in 807 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 108 ms.
Reduction of identical properties reduced properties to check from 16 to 12
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1000, 1000, 1, 1000, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Referendum-PT-1000-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1000, 1000, 1000, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2001 rows 3001 cols
[2025-06-04 07:52:49] [INFO ] Computed 1000 invariants in 82 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1000, 1000, 1000, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (9 resets) in 2768 ms. (3 steps per ms)
FORMULA Referendum-PT-1000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-02 1000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-04 1000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-00 1000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 1173 ms. (17 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[518, 518] Max Struct:[1000, 1000]
[2025-06-04 07:52:53] [INFO ] Invariant cache hit.
[2025-06-04 07:52:55] [INFO ] [Real]Absence check using 1000 positive place invariants in 564 ms returned sat
[2025-06-04 07:52:57] [INFO ] [Real]Absence check using state equation in 1952 ms returned sat
[2025-06-04 07:52:58] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 0 transitions) in 291 ms.
[2025-06-04 07:52:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:53:02] [INFO ] [Real]Absence check using 1000 positive place invariants in 461 ms returned sat
[2025-06-04 07:53:03] [INFO ] [Real]Absence check using state equation in 1688 ms returned sat
[2025-06-04 07:53:04] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 0 transitions) in 248 ms.
[2025-06-04 07:53:05] [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 1
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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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:[518, 518] Max Struct:[1000, 1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[518, 518] Max Struct:[1000, 1000]
Support contains 2000 out of 3001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3000 transition count 2000
Applied a total of 1 rules in 631 ms. Remains 3000 /3001 variables (removed 1) and now considering 2000/2001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 656 ms. Remains : 3000/3001 places, 2000/2001 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2025-06-04 07:53:06] [INFO ] Computed 1000 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[518, 518] Max Struct:[1000, 1000]
RANDOM walk for 158861 steps (158 resets) in 30001 ms. (5 steps per ms)
BEST_FIRST walk for 202798 steps (0 resets) in 10048 ms. (20 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[539, 539] Max Struct:[1000, 1000]
[2025-06-04 07:53:46] [INFO ] Invariant cache hit.
[2025-06-04 07:53:48] [INFO ] [Real]Absence check using 1000 positive place invariants in 525 ms returned sat
[2025-06-04 07:53:50] [INFO ] [Real]Absence check using state equation in 2114 ms returned sat
[2025-06-04 07:53:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 179 ms.
[2025-06-04 07:53:51] [INFO ] Added : 0 causal constraints over 0 iterations in 524 ms. Result :sat
Minimization took 564 ms.
[2025-06-04 07:53:53] [INFO ] [Real]Absence check using 1000 positive place invariants in 348 ms returned sat
[2025-06-04 07:53:55] [INFO ] [Real]Absence check using state equation in 1873 ms returned sat
[2025-06-04 07:53:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 182 ms.
[2025-06-04 07:53:55] [INFO ] Added : 0 causal constraints over 0 iterations in 606 ms. Result :sat
Minimization took 595 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[539, 539] Max Struct:[1000, 1000]
FORMULA Referendum-PT-1000-UpperBounds-07 1000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Referendum-PT-1000-UpperBounds-06 1000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1000]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Graph (complete) has 2000 edges and 3000 vertex of which 2000 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.6 ms
Discarding 1000 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1001 place count 2000 transition count 1000
Applied a total of 1001 rules in 169 ms. Remains 2000 /3000 variables (removed 1000) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2025-06-04 07:54:28] [INFO ] Computed 1000 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1000]
FORMULA Referendum-PT-1000-UpperBounds-03 1000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-UpperBounds-01 1000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 525539 steps (525 resets) in 30001 ms. (17 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 6 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 )
[2025-06-04 07:54:58] [INFO ] Flatten gal took : 290 ms
[2025-06-04 07:54:58] [INFO ] Flatten gal took : 62 ms
[2025-06-04 07:54:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8263567582562893829.gal : 38 ms
[2025-06-04 07:54:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13047788222130455303.prop : 1 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/ReachabilityCardinality8263567582562893829.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13047788222130455303.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
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 130783 ms.
BK_STOP 1749023698738
--------------------
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="Referendum-PT-1000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is Referendum-PT-1000, 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 r181-smll-174889242300030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-1000.tgz
mv Referendum-PT-1000 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.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 ;