fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r004-smll-171620118300333
Last Updated
July 7, 2024

About the Execution of ITS-Tools for Anderson-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
374.623 15273.00 26735.00 240.40 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r004-smll-171620118300333.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 Anderson-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118300333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 15:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 15:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 302K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Anderson-PT-06-UpperBounds-00
FORMULA_NAME Anderson-PT-06-UpperBounds-01
FORMULA_NAME Anderson-PT-06-UpperBounds-02
FORMULA_NAME Anderson-PT-06-UpperBounds-03
FORMULA_NAME Anderson-PT-06-UpperBounds-04
FORMULA_NAME Anderson-PT-06-UpperBounds-05
FORMULA_NAME Anderson-PT-06-UpperBounds-06
FORMULA_NAME Anderson-PT-06-UpperBounds-07
FORMULA_NAME Anderson-PT-06-UpperBounds-08
FORMULA_NAME Anderson-PT-06-UpperBounds-09
FORMULA_NAME Anderson-PT-06-UpperBounds-10
FORMULA_NAME Anderson-PT-06-UpperBounds-11
FORMULA_NAME Anderson-PT-06-UpperBounds-12
FORMULA_NAME Anderson-PT-06-UpperBounds-13
FORMULA_NAME Anderson-PT-06-UpperBounds-14
FORMULA_NAME Anderson-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716425528888

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-23 00:52:11] [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-23 00:52:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:52:12] [INFO ] Load time of PNML (sax parser for PT used): 335 ms
[2024-05-23 00:52:12] [INFO ] Transformed 229 places.
[2024-05-23 00:52:12] [INFO ] Transformed 600 transitions.
[2024-05-23 00:52:12] [INFO ] Found NUPN structural information;
[2024-05-23 00:52:12] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 626 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 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, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Anderson-PT-06-UpperBounds-11 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, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 600 rows 229 cols
[2024-05-23 00:52:12] [INFO ] Computed 15 invariants in 60 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 131 ms. (75 steps per ms)
FORMULA Anderson-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 67 ms. (294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-23 00:52:12] [INFO ] Invariant cache hit.
[2024-05-23 00:52:13] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned sat
[2024-05-23 00:52:13] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 12 ms returned sat
[2024-05-23 00:52:13] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2024-05-23 00:52:13] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:52:13] [INFO ] [Real]Added 30 Read/Feed constraints in 35 ms returned sat
[2024-05-23 00:52:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:52:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 14 ms returned sat
[2024-05-23 00:52:13] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 10 ms returned sat
[2024-05-23 00:52:14] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2024-05-23 00:52:14] [INFO ] [Nat]Added 30 Read/Feed constraints in 42 ms returned sat
[2024-05-23 00:52:14] [INFO ] Computed and/alt/rep : 156/810/156 causal constraints (skipped 438 transitions) in 143 ms.
[2024-05-23 00:52:17] [INFO ] Added : 120 causal constraints over 25 iterations in 2544 ms. Result :sat
Minimization took 651 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p1_0_10) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 599/599 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 229 transition count 569
Deduced a syphon composed of 30 places in 4 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 199 transition count 569
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 119 place count 140 transition count 210
Iterating global reduction 0 with 59 rules applied. Total rules applied 178 place count 140 transition count 210
Applied a total of 178 rules in 143 ms. Remains 140 /229 variables (removed 89) and now considering 210/599 (removed 389) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 140/229 places, 210/599 transitions.
// Phase 1: matrix 210 rows 140 cols
[2024-05-23 00:52:17] [INFO ] Computed 15 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1613 ms. (619 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 890 ms. (1122 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-23 00:52:20] [INFO ] Invariant cache hit.
[2024-05-23 00:52:20] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-23 00:52:20] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-23 00:52:20] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2024-05-23 00:52:20] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:52:20] [INFO ] [Real]Added 30 Read/Feed constraints in 39 ms returned sat
[2024-05-23 00:52:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:52:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-23 00:52:20] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-23 00:52:20] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-23 00:52:20] [INFO ] [Nat]Added 30 Read/Feed constraints in 32 ms returned sat
[2024-05-23 00:52:20] [INFO ] Computed and/alt/rep : 132/851/132 causal constraints (skipped 72 transitions) in 29 ms.
[2024-05-23 00:52:21] [INFO ] Added : 11 causal constraints over 3 iterations in 154 ms. Result :sat
Minimization took 271 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 210/210 transitions.
Applied a total of 0 rules in 17 ms. Remains 140 /140 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 140/140 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 210/210 transitions.
Applied a total of 0 rules in 13 ms. Remains 140 /140 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-23 00:52:21] [INFO ] Invariant cache hit.
[2024-05-23 00:52:21] [INFO ] Implicit Places using invariants in 279 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 283 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 139/140 places, 210/210 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 139 transition count 174
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 103 transition count 174
Applied a total of 72 rules in 17 ms. Remains 103 /139 variables (removed 36) and now considering 174/210 (removed 36) transitions.
// Phase 1: matrix 174 rows 103 cols
[2024-05-23 00:52:21] [INFO ] Computed 14 invariants in 3 ms
[2024-05-23 00:52:21] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-23 00:52:21] [INFO ] Invariant cache hit.
[2024-05-23 00:52:22] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:52:22] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 103/140 places, 174/210 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 903 ms. Remains : 103/140 places, 174/210 transitions.
[2024-05-23 00:52:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA Anderson-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (10 resets) in 1304 ms. (766 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 5 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-23 00:52:23] [INFO ] Flatten gal took : 74 ms
[2024-05-23 00:52:24] [INFO ] Flatten gal took : 25 ms
[2024-05-23 00:52:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2427644410659771808.gal : 16 ms
[2024-05-23 00:52:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15276052131529680075.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/ReachabilityCardinality2427644410659771808.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15276052131529680075.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 12605 ms.

BK_STOP 1716425544161

--------------------
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="Anderson-PT-06"
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 Anderson-PT-06, 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 r004-smll-171620118300333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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