fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r130-smll-177955809100334
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for FlexibleBarrier-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
457.399 11971.00 33758.00 179.60 TTTFFTTFFTTFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r130-smll-177955809100334.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is FlexibleBarrier-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809100334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.7K Mar 7 05:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 05:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 05:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 05:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 05:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 7 05:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 05:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 141K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-12
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-13
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-14
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779872661897

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-27 09:04:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 09:04:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 09:04:24] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2026-05-27 09:04:24] [INFO ] Transformed 542 places.
[2026-05-27 09:04:24] [INFO ] Transformed 621 transitions.
[2026-05-27 09:04:24] [INFO ] Found NUPN structural information;
[2026-05-27 09:04:24] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (769 resets) in 2234 ms. (17 steps per ms) remains 4/13 properties
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-27 09:04:25] [INFO ] Flatten gal took : 210 ms
BEST_FIRST walk for 40004 steps (107 resets) in 466 ms. (85 steps per ms) remains 4/4 properties
[2026-05-27 09:04:26] [INFO ] Flatten gal took : 106 ms
BEST_FIRST walk for 40003 steps (113 resets) in 317 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (118 resets) in 242 ms. (164 steps per ms) remains 4/4 properties
[2026-05-27 09:04:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6254864337565406179.gal : 124 ms
BEST_FIRST walk for 40004 steps (112 resets) in 240 ms. (165 steps per ms) remains 4/4 properties
[2026-05-27 09:04:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5770537071046032195.prop : 2 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6254864337565406179.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5770537071046032195.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5770537071046032195.prop.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14487601622170099124.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10205435747188065911.kers'
[2026-05-27 09:04:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14487601622170099124.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10205435747188065911.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 621 rows 542 cols 1533 entries
Finished phase 1 with 534 SingleSign rule and 0 generalized
[2026-05-27 09:04:26] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10205435747188065911.kers
Total runtime 5 ms.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 26
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :26 after 406
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :406 after 8025
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :8025 after 3.20842e+06
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 409/423 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 409/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 119/542 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 119/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 621/1163 variables, 542/1092 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1163 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1163 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 1092 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1568 ms.
Refiners :[Domain max(s): 542/542 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 409/423 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 409/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 119/542 variables, 2/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 119/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 2/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 621/1163 variables, 542/1096 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1163 variables, 4/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1163 variables, 5/1105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1163 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1163 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 1105 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5010 ms.
Refiners :[Domain max(s): 542/542 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6708ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 359 ms.
Support contains 6 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 621/621 transitions.
Graph (trivial) has 511 edges and 542 vertex of which 38 / 542 are part of one of the 6 SCC in 10 ms
Free SCC test removed 32 places
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 143 place count 510 transition count 440
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 285 place count 368 transition count 440
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 285 place count 368 transition count 414
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 337 place count 342 transition count 414
Discarding 164 places :
Symmetric choice reduction at 2 with 164 rule applications. Total rules 501 place count 178 transition count 250
Iterating global reduction 2 with 164 rules applied. Total rules applied 665 place count 178 transition count 250
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 665 place count 178 transition count 243
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 679 place count 171 transition count 243
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 703 place count 147 transition count 219
Iterating global reduction 2 with 24 rules applied. Total rules applied 727 place count 147 transition count 219
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 748 place count 147 transition count 198
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 810 place count 116 transition count 167
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 822 place count 116 transition count 155
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 828 place count 110 transition count 149
Iterating global reduction 4 with 6 rules applied. Total rules applied 834 place count 110 transition count 149
Free-agglomeration rule applied 66 times.
Iterating global reduction 4 with 66 rules applied. Total rules applied 900 place count 110 transition count 83
Reduce places removed 66 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 990 place count 44 transition count 59
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 991 place count 44 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 992 place count 43 transition count 58
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 30 edges and 42 vertex of which 10 / 42 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 994 place count 37 transition count 58
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1004 place count 37 transition count 48
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 1004 place count 37 transition count 43
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1014 place count 32 transition count 43
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1019 place count 32 transition count 38
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1035 place count 24 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1036 place count 24 transition count 29
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 1043 place count 24 transition count 22
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 1059 place count 14 transition count 16
Applied a total of 1059 rules in 188 ms. Remains 14 /542 variables (removed 528) and now considering 16/621 (removed 605) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 14/542 places, 16/621 transitions.
RANDOM walk for 562 steps (0 resets) in 9 ms. (56 steps per ms) remains 0/2 properties
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 9371 ms.

BK_STOP 1779872673868

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="FlexibleBarrier-PT-06b"
export BK_EXAMINATION="ReachabilityCardinality"
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-5973"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-06b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-177955809100334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-06b.tgz
mv FlexibleBarrier-PT-06b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;