fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r156-tall-174881253800351
Last Updated
June 24, 2025

About the Execution of ITS-Tools for PolyORBLF-COL-S04J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 111032.00 0.00 0.00 TFTTTTFTTTTFFTTT normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253800351.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is PolyORBLF-COL-S04J06T08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253800351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K May 29 14:32 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 PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-00
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-01
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-02
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-03
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-04
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-05
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-06
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-07
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-08
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-09
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-10
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-11
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-12
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-13
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-14
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748944539592

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityFireability COL
Running Version 202505121319
[2025-06-03 09:55:40] [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]
[2025-06-03 09:55:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 09:55:40] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 09:55:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 09:55:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 609 ms
[2025-06-03 09:55:41] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 792 PT places and 4336.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 09:55:41] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2025-06-03 09:55:41] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Remains 2 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 3773 steps (2 resets) in 104 ms. (35 steps per ms) remains 0/2 properties
[2025-06-03 09:55:41] [INFO ] Flatten gal took : 61 ms
[2025-06-03 09:55:41] [INFO ] Flatten gal took : 7 ms
[2025-06-03 09:55:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16977488558999910234.gal : 9 ms
[2025-06-03 09:55:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14143744439284363998.prop : 0 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16977488558999910234.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14143744439284363998.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS tools runner thread asked to quit. Dying gracefully.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2025-06-03 09:55:41] [INFO ] Flatten gal took : 7 ms
[2025-06-03 09:55:41] [INFO ] Flatten gal took : 7 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-03 09:55:41] [INFO ] Flatten gal took : 9 ms
[2025-06-03 09:55:41] [INFO ] Flatten gal took : 9 ms
[2025-06-03 09:55:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6781299635678717249.gal : 5 ms
[2025-06-03 09:55:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16491197362755688935.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6781299635678717249.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16491197362755688935.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-03 09:55:41] [INFO ] Unfolded HLPN to a Petri net with 792 places and 4268 transitions 28832 arcs in 98 ms.
[2025-06-03 09:55:41] [INFO ] Unfolded 15 HLPN properties in 2 ms.
[2025-06-03 09:55:41] [INFO ] Reduced 48 identical enabling conditions.
[2025-06-03 09:55:41] [INFO ] Reduced 352 identical enabling conditions.
[2025-06-03 09:55:41] [INFO ] Reduced 48 identical enabling conditions.
[2025-06-03 09:55:41] [INFO ] Reduced 352 identical enabling conditions.
[2025-06-03 09:55:41] [INFO ] Reduced 1768 identical enabling conditions.
[2025-06-03 09:55:41] [INFO ] Reduced 1768 identical enabling conditions.
[2025-06-03 09:55:41] [INFO ] Reduced 1768 identical enabling conditions.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
[2025-06-03 09:55:42] [INFO ] Flatten gal took : 293 ms
[2025-06-03 09:55:42] [INFO ] Flatten gal took : 210 ms
[2025-06-03 09:55:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14696593140671664838.gal : 83 ms
[2025-06-03 09:55:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7125338649965223646.prop : 58 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14696593140671664838.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7125338649965223646.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (10 resets) in 3999 ms. (10 steps per ms) remains 4/15 properties
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Loading property file /tmp/ReachabilityCardinality7125338649965223646.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 2536 ms. (15 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 3543 ms. (11 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 1549 ms. (25 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2752 ms. (14 steps per ms) remains 4/4 properties
[2025-06-03 09:55:46] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 792 cols
[2025-06-03 09:55:46] [INFO ] Computed 58 invariants in 112 ms
[2025-06-03 09:55:46] [INFO ] State equation strengthened by 160 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 3
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/660 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/660 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/660 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :3 after 6
At refinement iteration 3 (OVERLAPS) 24/684 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :6 after 7
At refinement iteration 4 (INCLUDED_ONLY) 0/684 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :7 after 12
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :12 after 13
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :13 after 14
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :14 after 15
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :15 after 25
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :25 after 29
Problem PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-11 is UNSAT
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
Problem PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-04 is UNSAT
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-04 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Real declared 791/2860 variables, and 57 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3562 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/792 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :29 after 2724
At refinement iteration 0 (INCLUDED_ONLY) 0/660 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/660 variables, 8/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:55:50] [INFO ] Deduced a trap composed of 2 places in 275 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/660 variables, 1/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 24/684 variables, 3/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :2724 after 3741
At refinement iteration 5 (INCLUDED_ONLY) 0/684 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 791/2860 variables, and 58 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3317 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/792 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7069ms problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 643 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 792 transition count 2092
Reduce places removed 8 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 16 rules applied. Total rules applied 24 place count 784 transition count 2084
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 32 place count 776 transition count 2084
Applied a total of 32 rules in 156 ms. Remains 776 /792 variables (removed 16) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2025-06-03 09:55:53] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 776 cols
[2025-06-03 09:55:53] [INFO ] Computed 58 invariants in 86 ms
[2025-06-03 09:55:53] [INFO ] State equation strengthened by 160 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
SMT process timed out in 22719ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 22736ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22915 ms. Remains : 776/792 places, 2084/2100 transitions.
RANDOM walk for 40000 steps (10 resets) in 922 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (9 resets) in 2089 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3817 ms. (10 steps per ms) remains 2/2 properties
Reachability property PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-15 is true.
Interrupted probabilistic random walk after 122416 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 2
Probabilistic random walk after 122416 steps, saw 74904 distinct states, run finished after 3004 ms. (steps per millisecond=40 ) properties seen :0
[2025-06-03 09:56:21] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2025-06-03 09:56:21] [INFO ] Invariant cache hit.
[2025-06-03 09:56:21] [INFO ] State equation strengthened by 160 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/667 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/667 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-00 is UNSAT
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 775/2828 variables, and 57 constraints, problems are : Problem set: 1 solved, 1 unsolved in 9543 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/776 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/550 variables, 4/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 775/2828 variables, and 57 constraints, problems are : Problem set: 1 solved, 1 unsolved in 9323 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/776 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18892ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 498 out of 776 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 776/776 places, 2084/2084 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 772 transition count 2084
Applied a total of 4 rules in 74 ms. Remains 772 /776 variables (removed 4) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 772/776 places, 2084/2084 transitions.
RANDOM walk for 40000 steps (8 resets) in 557 ms. (71 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 4483 ms. (8 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 172609 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 1
Probabilistic random walk after 172609 steps, saw 105512 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2025-06-03 09:56:44] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2025-06-03 09:56:44] [INFO ] Computed 54 invariants in 44 ms
[2025-06-03 09:56:44] [INFO ] State equation strengthened by 160 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/534 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
Reachability property PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-09 is true.
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :82717 after 1.1979e+06
After SMT solving in domain Real declared 771/2824 variables, and 53 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15291 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 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
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/534 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:57:00] [INFO ] Deduced a trap composed of 2 places in 128 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :1.1979e+06 after 1.56864e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 771/2824 variables, and 54 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15498 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30884ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 498 out of 772 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 2084/2084 transitions.
Applied a total of 0 rules in 64 ms. Remains 772 /772 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 772/772 places, 2084/2084 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 2084/2084 transitions.
Applied a total of 0 rules in 30 ms. Remains 772 /772 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
[2025-06-03 09:57:15] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2025-06-03 09:57:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:57:15] [INFO ] Implicit Places using invariants in 483 ms returned [612, 613, 614, 615, 616, 617, 618, 619]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 493 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 764/772 places, 2084/2084 transitions.
Applied a total of 0 rules in 52 ms. Remains 764 /764 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 579 ms. Remains : 764/772 places, 2084/2084 transitions.
RANDOM walk for 40000 steps (11 resets) in 308 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 4204 ms. (9 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 183885 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 1
Probabilistic random walk after 183885 steps, saw 112115 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2025-06-03 09:57:20] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 764 cols
[2025-06-03 09:57:20] [INFO ] Computed 46 invariants in 37 ms
[2025-06-03 09:57:20] [INFO ] State equation strengthened by 160 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/525 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
Problem PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-03 is UNSAT
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2025-03 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Real declared 763/2816 variables, and 45 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10056 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 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
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
After SMT solving in domain Int declared 498/2816 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 0/33 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10218ms problems are : Problem set: 1 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 109814 ms.

BK_STOP 1748944650624

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="PolyORBLF-COL-S04J06T08"
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-5832"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S04J06T08, 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 r156-tall-174881253800351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J06T08.tgz
mv PolyORBLF-COL-S04J06T08 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.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 ;