fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r354-tall-178024402800150
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for LastZero-PT-N24

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
969.808 26823.00 65874.00 140.90 FTTTTFFTFTTTFFFT 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.r354-tall-178024402800150.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 LastZero-PT-N24, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 8.0K May 27 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 27 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 27 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 27 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 203K May 27 10:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 751K May 27 10:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 13K May 27 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 27 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 27 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 27 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 18K May 27 10:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 49K May 27 10:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 5.2M Jun 10 11:58 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 LastZero-PT-N24-ReachabilityCardinality-2024-00
FORMULA_NAME LastZero-PT-N24-ReachabilityCardinality-2024-01
FORMULA_NAME LastZero-PT-N24-ReachabilityCardinality-2024-02
FORMULA_NAME LastZero-PT-N24-ReachabilityCardinality-2024-03
FORMULA_NAME LastZero-PT-N24-ReachabilityCardinality-2024-04
FORMULA_NAME LastZero-PT-N24-ReachabilityCardinality-2024-05
FORMULA_NAME LastZero-PT-N24-ReachabilityCardinality-2024-06
FORMULA_NAME LastZero-PT-N24-ReachabilityCardinality-2024-07
FORMULA_NAME LastZero-PT-N24-ReachabilityCardinality-2024-08
FORMULA_NAME LastZero-PT-N24-ReachabilityCardinality-2024-09
FORMULA_NAME LastZero-PT-N24-ReachabilityCardinality-2024-10
FORMULA_NAME LastZero-PT-N24-ReachabilityCardinality-2024-11
FORMULA_NAME LastZero-PT-N24-ReachabilityCardinality-2024-12
FORMULA_NAME LastZero-PT-N24-ReachabilityCardinality-2024-13
FORMULA_NAME LastZero-PT-N24-ReachabilityCardinality-2024-14
FORMULA_NAME LastZero-PT-N24-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781100174951

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-PT-N24
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-06-10 14:02:56] [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-06-10 14:02:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 14:02:56] [INFO ] Load time of PNML (sax parser for PT used): 361 ms
[2026-06-10 14:02:56] [INFO ] Transformed 1300 places.
[2026-06-10 14:02:56] [INFO ] Transformed 16777 transitions.
[2026-06-10 14:02:56] [INFO ] Parsed PT model containing 1300 places and 16777 transitions and 51483 arcs in 507 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 626 places in 72 ms
Reduce places removed 626 places and 10977 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (544 resets) in 1909 ms. (20 steps per ms) remains 4/9 properties
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (45 resets) in 398 ms. (100 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (44 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (45 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (47 resets) in 281 ms. (141 steps per ms) remains 4/4 properties
[2026-06-10 14:02:57] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3663471672073265191.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6049235526921342305.kers'
[2026-06-10 14:02:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3663471672073265191.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6049235526921342305.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 5524 rows 672 cols 15647 entries
Finished phase 1 with 648 SingleSign rule and 0 generalized
[2026-06-10 14:02:57] [INFO ] Computed 25 invariants in 14 ms
Computed 25 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-6049235526921342305.kers
Total runtime 21 ms.
[2026-06-10 14:02:57] [INFO ] Flatten gal took : 618 ms
[2026-06-10 14:02:57] [INFO ] State equation strengthened by 600 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem LastZero-PT-N24-ReachabilityCardinality-2024-09 is UNSAT
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 200/234 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2026-06-10 14:02:58] [INFO ] Flatten gal took : 314 ms
[2026-06-10 14:02:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17504231650033431102.gal : 141 ms
[2026-06-10 14:02:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7253569478892629198.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17504231650033431102.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7253569478892629198.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 ...329
At refinement iteration 3 (OVERLAPS) 3437/3671 variables, 234/247 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3671 variables, 32/279 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3671 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality7253569478892629198.prop.
At refinement iteration 6 (OVERLAPS) 1295/4966 variables, 236/515 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4966 variables, 3/518 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4966 variables, 349/867 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4966 variables, 0/867 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 88/5054 variables, 47/914 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5054 variables, 41/955 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5054 variables, 0/955 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 880/5934 variables, 80/1035 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5934 variables, 0/1035 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 257/6191 variables, 150/1185 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/6191 variables, 9/1194 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 18
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :18 after 40
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :40 after 153
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :153 after 2115
At refinement iteration 17 (INCLUDED_ONLY) 0/6191 variables, 98/1292 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2115 after 59362
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :59362 after 5.75796e+06
At refinement iteration 18 (INCLUDED_ONLY) 0/6191 variables, 0/1292 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 6/6197 variables, 6/1298 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/6197 variables, 0/1298 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/6197 variables, 0/1298 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6197/6197 variables, and 1298 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4469 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 673/673 constraints, ReadFeed: 600/600 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 179/205 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3074/3279 variables, 205/216 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3279 variables, 25/241 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3279 variables, 1/242 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3279 variables, 1/243 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3279 variables, 0/243 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1030/4309 variables, 195/438 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4309 variables, 2/440 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4309 variables, 275/715 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4309 variables, 0/715 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 62/4371 variables, 33/748 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4371 variables, 29/777 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4371 variables, 0/777 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1413/5784 variables, 110/887 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5784 variables, 0/887 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 405/6189 variables, 232/1119 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/6189 variables, 12/1131 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem LastZero-PT-N24-ReachabilityCardinality-2024-00 is UNSAT
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 19 (INCLUDED_ONLY) 0/6189 variables, 161/1292 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6189/6197 variables, and 1292 constraints, problems are : Problem set: 2 solved, 2 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 665/673 constraints, ReadFeed: 600/600 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9714ms problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 673 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 673/673 places, 5800/5800 transitions.
Graph (complete) has 6123 edges and 673 vertex of which 648 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.13 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 300 transitions
Reduce isomorphic transitions removed 300 transitions.
Iterating post reduction 0 with 300 rules applied. Total rules applied 301 place count 648 transition count 5500
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 301 place count 648 transition count 5499
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 303 place count 647 transition count 5499
Applied a total of 303 rules in 187 ms. Remains 647 /673 variables (removed 26) and now considering 5499/5800 (removed 301) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 647/673 places, 5499/5800 transitions.
RANDOM walk for 40000 steps (832 resets) in 886 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (52 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (51 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :5.75796e+06 after 4.16876e+09
Reachability property LastZero-PT-N24-ReachabilityCardinality-2024-04 is true.
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Interrupted probabilistic random walk after 127090 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 2
Probabilistic random walk after 127090 steps, saw 26474 distinct states, run finished after 3006 ms. (steps per millisecond=42 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4355774941535650010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8794317033872793669.kers'
[2026-06-10 14:03:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4355774941535650010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8794317033872793669.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 5499 rows 646 cols 15597 entries
Finished phase 1 with 623 SingleSign rule and 0 generalized
[2026-06-10 14:03:11] [INFO ] Computed 24 invariants in 15 ms
Computed 24 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-8794317033872793669.kers
Total runtime 20 ms.
[2026-06-10 14:03:11] [INFO ] State equation strengthened by 576 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 147/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2947/3107 variables, 160/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3107 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3107 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1088/4195 variables, 193/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4195 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4195 variables, 268/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4195 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 80/4275 variables, 43/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4275 variables, 37/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4275 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 757/5032 variables, 89/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5032 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 834/5866 variables, 147/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5866 variables, 4/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5866 variables, 127/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5866 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 95/5961 variables, 51/1137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5961 variables, 3/1140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5961 variables, 6/1146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5961 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 36/5997 variables, 6/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/5997 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 25/6022 variables, 13/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/6022 variables, 1/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/6022 variables, 6/1172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/6022 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/6023 variables, 1/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/6023 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 25/6048 variables, 5/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/6048 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 21/6069 variables, 11/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/6069 variables, 1/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/6069 variables, 5/1195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/6069 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1/6070 variables, 1/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/6070 variables, 0/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 16/6086 variables, 4/1200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/6086 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 17/6103 variables, 9/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/6103 variables, 1/1210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/6103 variables, 4/1214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/6103 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 1/6104 variables, 1/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/6104 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 9/6113 variables, 3/1218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/6113 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 13/6126 variables, 7/1225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/6126 variables, 1/1226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/6126 variables, 3/1229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/6126 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 1/6127 variables, 1/1230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/6127 variables, 0/1230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 4/6131 variables, 2/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/6131 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 9/6140 variables, 5/1237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/6140 variables, 1/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/6140 variables, 2/1240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/6140 variables, 0/1240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 1/6141 variables, 1/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/6141 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 1/6142 variables, 1/1242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/6142 variables, 0/1242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 4/6146 variables, 3/1245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/6146 variables, 1/1246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/6146 variables, 1/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/6146 variables, 0/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 0/6146 variables, 0/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6146/6146 variables, and 1247 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4283 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 647/647 constraints, ReadFeed: 576/576 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 147/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2947/3107 variables, 160/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3107 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3107 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1088/4195 variables, 193/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4195 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4195 variables, 268/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4195 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 80/4275 variables, 43/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4275 variables, 37/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4275 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 757/5032 variables, 89/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5032 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 834/5866 variables, 147/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5866 variables, 4/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5866 variables, 127/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5866 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 95/5961 variables, 51/1137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5961 variables, 3/1140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5961 variables, 6/1146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5961 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 36/5997 variables, 6/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/5997 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 25/6022 variables, 13/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/6022 variables, 1/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/6022 variables, 6/1172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/6022 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/6023 variables, 1/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/6023 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 25/6048 variables, 5/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/6048 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 21/6069 variables, 11/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/6069 variables, 1/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/6069 variables, 5/1195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/6069 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1/6070 variables, 1/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/6070 variables, 0/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 16/6086 variables, 4/1200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/6086 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 17/6103 variables, 9/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/6103 variables, 1/1210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/6103 variables, 4/1214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/6103 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 1/6104 variables, 1/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/6104 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 9/6113 variables, 3/1218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/6113 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 13/6126 variables, 7/1225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/6126 variables, 1/1226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/6126 variables, 3/1229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/6126 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 1/6127 variables, 1/1230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/6127 variables, 0/1230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 4/6131 variables, 2/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/6131 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 9/6140 variables, 5/1237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/6140 variables, 1/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/6140 variables, 2/1240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/6140 variables, 0/1240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 1/6141 variables, 1/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/6141 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 1/6142 variables, 1/1242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/6142 variables, 0/1242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 4/6146 variables, 3/1245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/6146 variables, 1/1246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/6146 variables, 1/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/6146 variables, 0/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 0/6146 variables, 0/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6146/6146 variables, and 1247 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6261 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 647/647 constraints, ReadFeed: 576/576 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10624ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
FORMULA LastZero-PT-N24-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 10 ms.
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 25649 ms.

BK_STOP 1781100201774

--------------------
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="LastZero-PT-N24"
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 LastZero-PT-N24, 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 r354-tall-178024402800150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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