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.r070-tall-171620505600319.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 CircadianClock-PT-100000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505600319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 11K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716281846171

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircadianClock-PT-100000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-21 08:57:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 08:57:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:57:27] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2024-05-21 08:57:27] [INFO ] Transformed 14 places.
[2024-05-21 08:57:27] [INFO ] Transformed 16 transitions.
[2024-05-21 08:57:27] [INFO ] Parsed PT model containing 14 places and 16 transitions and 58 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 08:57:27] [INFO ] Flatten gal took : 17 ms
[2024-05-21 08:57:27] [INFO ] Flatten gal took : 3 ms
[2024-05-21 08:57:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16373648480052825339.gal : 4 ms
[2024-05-21 08:57:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality570716605242812271.prop : 4 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/ReachabilityCardinality16373648480052825339.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality570716605242812271.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality570716605242812271.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
[2024-05-21 08:57:27] [INFO ] Flatten gal took : 3 ms
[2024-05-21 08:57:27] [INFO ] Applying decomposition
[2024-05-21 08:57:27] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 400006 steps (0 resets) in 1068 ms. (374 steps per ms) remains 10/11 properties
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2552976932995471099.txt' '-o' '/tmp/graph2552976932995471099.bin' '-w' '/tmp/graph2552976932995471099.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2552976932995471099.bin' '-l' '-1' '-v' '-w' '/tmp/graph2552976932995471099.weights' '-q' '0' '-e' '0.001'
[2024-05-21 08:57:28] [INFO ] Decomposing Gal with order
[2024-05-21 08:57:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 08:57:28] [INFO ] Removed a total of 7 redundant transitions.
BEST_FIRST walk for 40004 steps (8 resets) in 698 ms. (57 steps per ms) remains 9/10 properties
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-21 08:57:28] [INFO ] Flatten gal took : 65 ms
[2024-05-21 08:57:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-21 08:57:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12751212215283427430.gal : 9 ms
[2024-05-21 08:57:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1414055240811426461.prop : 3 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/ReachabilityCardinality12751212215283427430.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1414055240811426461.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality1414055240811426461.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
BEST_FIRST walk for 40004 steps (8 resets) in 750 ms. (53 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 9/9 properties
[2024-05-21 08:57:28] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2024-05-21 08:57:28] [INFO ] Computed 7 invariants in 5 ms
[2024-05-21 08:57:28] [INFO ] State equation strengthened by 2 read => feed constraints.
Problem CircadianClock-PT-100000-ReachabilityFireability-2024-02 is UNSAT
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem CircadianClock-PT-100000-ReachabilityFireability-2024-00 is UNSAT
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem CircadianClock-PT-100000-ReachabilityFireability-2023-03 is UNSAT
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2023-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem CircadianClock-PT-100000-ReachabilityFireability-2024-04 is UNSAT
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem CircadianClock-PT-100000-ReachabilityFireability-2024-05 is UNSAT
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem CircadianClock-PT-100000-ReachabilityFireability-2024-08 is UNSAT
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 14/28 variables, 14/21 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 2/23 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/23 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/28 variables, 0/23 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 23 constraints, problems are : Problem set: 6 solved, 3 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 14/28 variables, 14/21 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 2/23 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 3/26 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/26 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/26 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 26 constraints, problems are : Problem set: 6 solved, 3 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 336ms problems are : Problem set: 6 solved, 3 unsolved
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 30001 ms.
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 6 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 14/14 places, 16/16 transitions.
RANDOM walk for 400004 steps (0 resets) in 112 ms. (3539 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 717654 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :0 out of 2
Probabilistic random walk after 717654 steps, saw 485528 distinct states, run finished after 3013 ms. (steps per millisecond=238 ) properties seen :0
[2024-05-21 08:58:02] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2024-05-21 08:58:02] [INFO ] Invariant cache hit.
[2024-05-21 08:58:02] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 14/28 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/28 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 23 constraints, problems are : Problem set: 0 solved, 2 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 14/28 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 25 constraints, problems are : Problem set: 0 solved, 2 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 1500521 steps, including 2 resets, run visited all 2 properties in 3959 ms. (steps per millisecond=379 )
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 3963 ms.
All properties solved without resorting to model-checking.
Total runtime 39028 ms.

BK_STOP 1716281886391

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="CircadianClock-PT-100000"
export BK_EXAMINATION="ReachabilityFireability"
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 CircadianClock-PT-100000, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505600319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-100000.tgz
mv CircadianClock-PT-100000 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;