fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r161-smll-165277002800127
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for Parking-PT-864

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
285.911 24708.00 43509.00 310.30 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/mcc2022-input.r161-smll-165277002800127.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is Parking-PT-864, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-smll-165277002800127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 6.6K Apr 30 07:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 30 07:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 06:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 06:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 427K May 10 09:34 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 Parking-PT-864-UpperBounds-00
FORMULA_NAME Parking-PT-864-UpperBounds-01
FORMULA_NAME Parking-PT-864-UpperBounds-02
FORMULA_NAME Parking-PT-864-UpperBounds-03
FORMULA_NAME Parking-PT-864-UpperBounds-04
FORMULA_NAME Parking-PT-864-UpperBounds-05
FORMULA_NAME Parking-PT-864-UpperBounds-06
FORMULA_NAME Parking-PT-864-UpperBounds-07
FORMULA_NAME Parking-PT-864-UpperBounds-08
FORMULA_NAME Parking-PT-864-UpperBounds-09
FORMULA_NAME Parking-PT-864-UpperBounds-10
FORMULA_NAME Parking-PT-864-UpperBounds-11
FORMULA_NAME Parking-PT-864-UpperBounds-12
FORMULA_NAME Parking-PT-864-UpperBounds-13
FORMULA_NAME Parking-PT-864-UpperBounds-14
FORMULA_NAME Parking-PT-864-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652990436087

Running Version 0
[2022-05-19 20:00:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 20:00:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 20:00:39] [INFO ] Load time of PNML (sax parser for PT used): 269 ms
[2022-05-19 20:00:39] [INFO ] Transformed 1185 places.
[2022-05-19 20:00:39] [INFO ] Transformed 1697 transitions.
[2022-05-19 20:00:39] [INFO ] Found NUPN structural information;
[2022-05-19 20:00:39] [INFO ] Parsed PT model containing 1185 places and 1697 transitions in 370 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
// Phase 1: matrix 1009 rows 1185 cols
[2022-05-19 20:00:40] [INFO ] Computed 280 place invariants in 82 ms
Incomplete random walk after 10000 steps, including 38 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 16) seen :14
FORMULA Parking-PT-864-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
// Phase 1: matrix 1009 rows 1185 cols
[2022-05-19 20:00:40] [INFO ] Computed 280 place invariants in 21 ms
[2022-05-19 20:00:41] [INFO ] [Real]Absence check using 272 positive place invariants in 139 ms returned sat
[2022-05-19 20:00:41] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-19 20:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:00:42] [INFO ] [Real]Absence check using state equation in 886 ms returned sat
[2022-05-19 20:00:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:00:43] [INFO ] [Nat]Absence check using 272 positive place invariants in 191 ms returned sat
[2022-05-19 20:00:43] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-19 20:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:00:43] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2022-05-19 20:00:43] [INFO ] State equation strengthened by 248 read => feed constraints.
[2022-05-19 20:00:43] [INFO ] [Nat]Added 248 Read/Feed constraints in 42 ms returned sat
[2022-05-19 20:00:44] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 91 ms.
[2022-05-19 20:00:47] [INFO ] Added : 145 causal constraints over 29 iterations in 3493 ms. Result :unknown
[2022-05-19 20:00:48] [INFO ] [Real]Absence check using 272 positive place invariants in 113 ms returned sat
[2022-05-19 20:00:48] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-19 20:00:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:00:48] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2022-05-19 20:00:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:00:49] [INFO ] [Nat]Absence check using 272 positive place invariants in 153 ms returned sat
[2022-05-19 20:00:49] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-19 20:00:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:00:49] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2022-05-19 20:00:50] [INFO ] [Nat]Added 248 Read/Feed constraints in 55 ms returned sat
[2022-05-19 20:00:50] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 103 ms.
[2022-05-19 20:00:53] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 113400 steps, including 355 resets, run finished after 3200 ms. (steps per millisecond=35 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 1185 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1185 transition count 977
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1153 transition count 977
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1153 transition count 945
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 1121 transition count 945
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 136 place count 1113 transition count 937
Iterating global reduction 2 with 8 rules applied. Total rules applied 144 place count 1113 transition count 937
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 224 place count 1073 transition count 897
Free-agglomeration rule applied 192 times.
Iterating global reduction 2 with 192 rules applied. Total rules applied 416 place count 1073 transition count 705
Reduce places removed 192 places and 0 transitions.
Graph (complete) has 1840 edges and 881 vertex of which 118 are kept as prefixes of interest. Removing 763 places using SCC suffix rule.6 ms
Discarding 763 places :
Also discarding 602 output transitions
Drop transitions removed 602 transitions
Iterating post reduction 2 with 193 rules applied. Total rules applied 609 place count 118 transition count 103
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 623 place count 118 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 624 place count 117 transition count 88
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 4 with 76 rules applied. Total rules applied 700 place count 86 transition count 43
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 5 with 57 rules applied. Total rules applied 757 place count 41 transition count 31
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 9 rules applied. Total rules applied 766 place count 33 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 767 place count 32 transition count 30
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 767 place count 32 transition count 21
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 785 place count 23 transition count 21
Applied a total of 785 rules in 788 ms. Remains 23 /1185 variables (removed 1162) and now considering 21/1009 (removed 988) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/1185 places, 21/1009 transitions.
// Phase 1: matrix 21 rows 23 cols
[2022-05-19 20:00:57] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1869 ms. (steps per millisecond=535 ) properties (out of 2) seen :2
FORMULA Parking-PT-864-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652990460795

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Parking-PT-864"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is Parking-PT-864, 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 r161-smll-165277002800127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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