fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654446500158
Last Updated
July 7, 2024

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
6943.640 80629.00 209697.00 76.50 TTFFFFTFFFTTFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446500158.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-COL-S04J06T08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446500158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716910053533

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
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
ReachabilityCardinality COL
Running Version 202405141337
[2024-05-28 15:27:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:27:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:27:35] [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.
[2024-05-28 15:27:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 15:27:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 613 ms
[2024-05-28 15:27:35] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 792 PT places and 4336.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:27:35] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 15:27:35] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
[2024-05-28 15:27:35] [INFO ] Flatten gal took : 50 ms
[2024-05-28 15:27:35] [INFO ] Flatten gal took : 16 ms
[2024-05-28 15:27:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1820435071448085553.gal : 14 ms
[2024-05-28 15:27:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14667530101108852966.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1820435071448085553.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14667530101108852966.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14667530101108852966.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :9 after 18
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :18 after 25
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :25 after 65
Reachability property PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-11 is true.
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :65 after 270
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :270 after 300
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :300 after 367
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :367 after 1037
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :1037 after 1680
RANDOM walk for 40000 steps (14 resets) in 1952 ms. (20 steps per ms) remains 12/15 properties
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :1680 after 2577
Reachability property PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-15 is true.
BEST_FIRST walk for 40002 steps (8 resets) in 690 ms. (57 steps per ms) remains 12/12 properties
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :2577 after 6192
BEST_FIRST walk for 40000 steps (9 resets) in 439 ms. (90 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (10 resets) in 282 ms. (141 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (9 resets) in 302 ms. (132 steps per ms) remains 12/12 properties
SDD proceeding with computation,13 properties remain. new max is 4096
BEST_FIRST walk for 40002 steps (8 resets) in 292 ms. (136 steps per ms) remains 12/12 properties
SDD size :6192 after 12830
BEST_FIRST walk for 40002 steps (8 resets) in 267 ms. (149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 301 ms. (132 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (12 resets) in 269 ms. (148 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (14 resets) in 235 ms. (169 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 386 ms. (103 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 458 ms. (87 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (23 resets) in 231 ms. (172 steps per ms) remains 11/11 properties
[2024-05-28 15:27:37] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 15:27:37] [INFO ] Computed 26 invariants in 15 ms
[2024-05-28 15:27:37] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-02 is UNSAT
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-03 is UNSAT
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-04 is UNSAT
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-05 is UNSAT
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-14 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 9/9 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-08 is UNSAT
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-10 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 10/19 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 4 unsolved
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-09 is UNSAT
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-13 is UNSAT
At refinement iteration 3 (OVERLAPS) 2/79 variables, 2/21 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/21 constraints. Problems are: Problem set: 9 solved, 2 unsolved
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-01 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/81 variables, 5/26 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 10 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 10 solved, 1 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/59 variables, 8/9 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/62 variables, 2/11 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/11 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/81 variables, 15/26 constraints. Problems are: Problem set: 10 solved, 1 unsolved
[2024-05-28 15:27:38] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 7 ms to minimize.
[2024-05-28 15:27:38] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/28 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/28 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 64/145 variables, 81/109 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 8/117 constraints. Problems are: Problem set: 10 solved, 1 unsolved
Problem PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-07 is UNSAT
After SMT solving in domain Int declared 145/145 variables, and 118 constraints, problems are : Problem set: 11 solved, 0 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/11 constraints, Known Traps: 2/2 constraints]
After SMT, in 717ms problems are : Problem set: 11 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.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-28 15:27:38] [INFO ] Flatten gal took : 7 ms
[2024-05-28 15:27:38] [INFO ] Flatten gal took : 6 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 )
[2024-05-28 15:27:38] [INFO ] Flatten gal took : 6 ms
[2024-05-28 15:27:38] [INFO ] Flatten gal took : 12 ms
[2024-05-28 15:27:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12412582962887926420.gal : 6 ms
[2024-05-28 15:27:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality865220953932463472.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12412582962887926420.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality865220953932463472.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-01 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-02 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-03 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-05 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-07 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-08 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-09 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-10 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-13 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-14 FALSE TECHNIQUES CPN_APPROX
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
[2024-05-28 15:27:38] [INFO ] Unfolded HLPN to a Petri net with 792 places and 4268 transitions 28832 arcs in 87 ms.
[2024-05-28 15:27:38] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
RANDOM walk for 40000 steps (8 resets) in 802 ms. (49 steps per ms) remains 1/4 properties
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 265 ms. (150 steps per ms) remains 1/1 properties
[2024-05-28 15:27:39] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 792 cols
[2024-05-28 15:27:39] [INFO ] Computed 58 invariants in 82 ms
[2024-05-28 15:27:39] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:27:39] [INFO ] Flatten gal took : 336 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 356/381 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/481 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:27:39] [INFO ] Flatten gal took : 163 ms
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:27:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16715689638230923830.gal : 29 ms
[2024-05-28 15:27:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10128279817740935214.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16715689638230923830.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10128279817740935214.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
At refinement iteration 7 (OVERLAPS) 308/789 variables, 32/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Loading property file /tmp/ReachabilityCardinality10128279817740935214.prop.
[2024-05-28 15:27:39] [INFO ] Deduced a trap composed of 83 places in 446 ms of which 6 ms to minimize.
[2024-05-28 15:27:40] [INFO ] Deduced a trap composed of 83 places in 422 ms of which 6 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 13
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :13 after 14
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :14 after 15
[2024-05-28 15:27:40] [INFO ] Deduced a trap composed of 84 places in 441 ms of which 5 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15 after 25
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :25 after 29
[2024-05-28 15:27:41] [INFO ] Deduced a trap composed of 83 places in 433 ms of which 4 ms to minimize.
[2024-05-28 15:27:41] [INFO ] Deduced a trap composed of 85 places in 418 ms of which 6 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :29 after 2724
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2724 after 3741
[2024-05-28 15:27:54] [INFO ] Deduced a trap composed of 200 places in 12319 ms of which 15 ms to minimize.
SMT process timed out in 14998ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 788 transition count 2044
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 116 place count 732 transition count 2044
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 116 place count 732 transition count 1940
Deduced a syphon composed of 104 places in 4 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 324 place count 628 transition count 1940
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 332 place count 620 transition count 1932
Iterating global reduction 2 with 8 rules applied. Total rules applied 340 place count 620 transition count 1932
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 484 place count 548 transition count 1860
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 500 place count 548 transition count 1844
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 516 place count 532 transition count 1844
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 524 place count 532 transition count 1844
Applied a total of 524 rules in 662 ms. Remains 532 /792 variables (removed 260) and now considering 1844/2100 (removed 256) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-28 15:27:54] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 532 cols
[2024-05-28 15:27:54] [INFO ] Computed 54 invariants in 89 ms
[2024-05-28 15:27:55] [INFO ] State equation strengthened by 160 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :82717 after 1.1979e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 15:28:25] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 1 ms to minimize.
[2024-05-28 15:28:25] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 1 ms to minimize.
[2024-05-28 15:28:25] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 1 ms to minimize.
[2024-05-28 15:28:26] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 0 ms to minimize.
[2024-05-28 15:28:26] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:28:26] [INFO ] Deduced a trap composed of 51 places in 148 ms of which 1 ms to minimize.
[2024-05-28 15:28:26] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 1 ms to minimize.
[2024-05-28 15:28:26] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 0 ms to minimize.
[2024-05-28 15:28:27] [INFO ] Deduced a trap composed of 227 places in 581 ms of which 3 ms to minimize.
[2024-05-28 15:28:27] [INFO ] Deduced a trap composed of 215 places in 359 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.1979e+06 after 1.57223e+06
[2024-05-28 15:28:28] [INFO ] Deduced a trap composed of 216 places in 667 ms of which 3 ms to minimize.
[2024-05-28 15:28:29] [INFO ] Deduced a trap composed of 214 places in 633 ms of which 3 ms to minimize.
[2024-05-28 15:28:30] [INFO ] Deduced a trap composed of 211 places in 626 ms of which 4 ms to minimize.
SMT process timed out in 35391ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 35436ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36138 ms. Remains : 532/792 places, 1844/2100 transitions.
RANDOM walk for 40000 steps (10 resets) in 927 ms. (43 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 220750 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 1
Probabilistic random walk after 220750 steps, saw 154226 distinct states, run finished after 3022 ms. (steps per millisecond=73 ) properties seen :0
[2024-05-28 15:28:33] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 15:28:33] [INFO ] Invariant cache hit.
[2024-05-28 15:28:33] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 292/309 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/461 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/529 variables, 26/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:28:34] [INFO ] Deduced a trap composed of 51 places in 237 ms of which 2 ms to minimize.
[2024-05-28 15:28:34] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 2 ms to minimize.
[2024-05-28 15:28:34] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 2 ms to minimize.
[2024-05-28 15:28:34] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 2 ms to minimize.
[2024-05-28 15:28:34] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 2 ms to minimize.
[2024-05-28 15:28:35] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-05-28 15:28:36] [INFO ] Deduced a trap composed of 51 places in 1495 ms of which 27 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/530 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1812/2342 variables, 530/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2342 variables, 160/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:28:38] [INFO ] Deduced a trap composed of 47 places in 399 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2342 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2342 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/2344 variables, 2/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2344 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2344 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2344 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2344/2344 variables, and 754 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4503 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 532/532 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 292/309 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/461 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/529 variables, 26/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:28:38] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/530 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1812/2342 variables, 530/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2342 variables, 160/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2342 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2342 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/2344 variables, 2/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2344 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2344 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2344 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2344/2344 variables, and 756 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3295 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 532/532 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 7836ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 9 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1844/1844 transitions.
Applied a total of 0 rules in 116 ms. Remains 532 /532 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 532/532 places, 1844/1844 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1844/1844 transitions.
Applied a total of 0 rules in 102 ms. Remains 532 /532 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
[2024-05-28 15:28:41] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 15:28:41] [INFO ] Invariant cache hit.
[2024-05-28 15:28:42] [INFO ] Implicit Places using invariants in 951 ms returned [468, 469, 470, 471, 472, 473, 474, 475]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 958 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 524/532 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 516 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 516 transition count 1836
Applied a total of 16 rules in 43 ms. Remains 516 /524 variables (removed 8) and now considering 1836/1844 (removed 8) transitions.
[2024-05-28 15:28:42] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
// Phase 1: matrix 1804 rows 516 cols
[2024-05-28 15:28:42] [INFO ] Computed 46 invariants in 32 ms
[2024-05-28 15:28:44] [INFO ] Implicit Places using invariants in 1245 ms returned []
[2024-05-28 15:28:44] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 15:28:44] [INFO ] Invariant cache hit.
[2024-05-28 15:28:44] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 15:28:53] [INFO ] Implicit Places using invariants and state equation in 9655 ms returned []
Implicit Place search using SMT with State Equation took 10911 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 516/532 places, 1836/1844 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12016 ms. Remains : 516/532 places, 1836/1844 transitions.
RANDOM walk for 34135 steps (10 resets) in 496 ms. (68 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 79101 ms.

BK_STOP 1716910134162

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S04J06T08"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S04J06T08, 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 r290-tajo-171654446500158"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;