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.r312-tall-171662337800078.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 QuasiCertifProtocol-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337800078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 20K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 13 03:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 54K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 429K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 13 04:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 149K May 18 16:43 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 QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716665007209

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-25 19:23:28] [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]
[2024-05-25 19:23:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:23:28] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-25 19:23:28] [INFO ] Transformed 550 places.
[2024-05-25 19:23:28] [INFO ] Transformed 176 transitions.
[2024-05-25 19:23:28] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 19:23:29] [INFO ] Flatten gal took : 210 ms
[2024-05-25 19:23:29] [INFO ] Flatten gal took : 65 ms
[2024-05-25 19:23:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9443606110809354354.gal : 22 ms
[2024-05-25 19:23:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7682890193750898138.prop : 14 ms
RANDOM walk for 40000 steps (2765 resets) in 2662 ms. (15 steps per ms) remains 15/15 properties
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/ReachabilityCardinality9443606110809354354.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7682890193750898138.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4002 steps (30 resets) in 46 ms. (85 steps per ms) remains 15/15 properties

its-reach command run as :
BEST_FIRST walk for 4004 steps (17 resets) in 45 ms. (87 steps per ms) remains 15/15 properties

/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/ReachabilityCardinality7682890193750898138.prop.
BEST_FIRST walk for 4004 steps (19 resets) in 223 ms. (17 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 143 ms. (27 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 217 ms. (18 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (40 resets) in 120 ms. (33 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (30 resets) in 184 ms. (21 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (31 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 50 ms. (78 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (29 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (30 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (31 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (31 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (30 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (31 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :8 after 16
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :16 after 848
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :2972 after 3098
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :3098 after 3548
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :3548 after 4890
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :4890 after 8266
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :8266 after 31478
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :31478 after 154670
Interrupted probabilistic random walk after 360678 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :3 out of 15
Probabilistic random walk after 360678 steps, saw 54169 distinct states, run finished after 3014 ms. (steps per millisecond=119 ) properties seen :3
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 176 rows 550 cols
[2024-05-25 19:23:33] [INFO ] Computed 375 invariants in 34 ms
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-02 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-05 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-06 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 372/375 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 0/375 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-00 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 925 constraints, problems are : Problem set: 4 solved, 8 unsolved in 5045 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 372/375 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-05-25 19:23:41] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 20 ms to minimize.
[2024-05-25 19:23:41] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 3 ms to minimize.
[2024-05-25 19:23:41] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2024-05-25 19:23:41] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 3 ms to minimize.
[2024-05-25 19:23:41] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-25 19:23:41] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-05-25 19:23:42] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2024-05-25 19:23:42] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-25 19:23:42] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-25 19:23:42] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-25 19:23:42] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-05-25 19:23:42] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-25 19:23:42] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-05-25 19:23:42] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
[2024-05-25 19:23:42] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-25 19:23:42] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-25 19:23:43] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-25 19:23:43] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 9 ms to minimize.
[2024-05-25 19:23:43] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-25 19:23:43] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 20/395 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/726 variables, and 395 constraints, problems are : Problem set: 4 solved, 8 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 0/550 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 20/20 constraints]
After SMT, in 10592ms problems are : Problem set: 4 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 550 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 550 /550 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 550/550 places, 176/176 transitions.
RANDOM walk for 40000 steps (2760 resets) in 905 ms. (44 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (194 resets) in 844 ms. (47 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (317 resets) in 564 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (325 resets) in 1040 ms. (38 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (325 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (325 resets) in 341 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (331 resets) in 227 ms. (175 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (327 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (333 resets) in 208 ms. (191 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 520949 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 8
Probabilistic random walk after 520949 steps, saw 73375 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-05-25 19:23:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 372/375 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-07 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-09 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-10 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-11 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-14 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-15 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 925 constraints, problems are : Problem set: 6 solved, 2 unsolved in 25558 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 372/375 constraints. Problems are: Problem set: 6 solved, 2 unsolved
[2024-05-25 19:24:14] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 4 ms to minimize.
[2024-05-25 19:24:14] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 2/377 constraints. Problems are: Problem set: 6 solved, 2 unsolved
[2024-05-25 19:24:15] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 1/378 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 0/378 constraints. Problems are: Problem set: 6 solved, 2 unsolved
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-03 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-04 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 726/726 variables, and 928 constraints, problems are : Problem set: 8 solved, 0 unsolved in 4086 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 29834ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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 49649 ms.

BK_STOP 1716665058067

--------------------
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
+ 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 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="QuasiCertifProtocol-PT-10"
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-5568"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-10, 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 r312-tall-171662337800078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-PT-10 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;