Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920100134.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 175K Jun 2 16:33 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 MedleyA-PT-17-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717376218924

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-06-03 00:57:01] [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-06-03 00:57:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:57:01] [INFO ] Load time of PNML (sax parser for PT used): 312 ms
[2024-06-03 00:57:01] [INFO ] Transformed 248 places.
[2024-06-03 00:57:01] [INFO ] Transformed 591 transitions.
[2024-06-03 00:57:01] [INFO ] Found NUPN structural information;
[2024-06-03 00:57:01] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 567 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1376 resets) in 3012 ms. (13 steps per ms) remains 11/11 properties
[2024-06-03 00:57:03] [INFO ] Flatten gal took : 401 ms
BEST_FIRST walk for 40004 steps (436 resets) in 1057 ms. (37 steps per ms) remains 11/11 properties
[2024-06-03 00:57:03] [INFO ] Flatten gal took : 229 ms
BEST_FIRST walk for 40004 steps (299 resets) in 661 ms. (60 steps per ms) remains 11/11 properties
[2024-06-03 00:57:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8897571232919723266.gal : 176 ms
[2024-06-03 00:57:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16791539650549560320.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8897571232919723266.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16791539650549560320.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
BEST_FIRST walk for 40004 steps (362 resets) in 609 ms. (65 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (296 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (297 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
Loading property file /tmp/ReachabilityCardinality16791539650549560320.prop.
BEST_FIRST walk for 40003 steps (302 resets) in 272 ms. (146 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (299 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :2 after 4
BEST_FIRST walk for 40004 steps (388 resets) in 238 ms. (167 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :4 after 46
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :46 after 222
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :222 after 665
BEST_FIRST walk for 40004 steps (299 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 128
BEST_FIRST walk for 40003 steps (300 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
SDD size :665 after 945
BEST_FIRST walk for 40004 steps (294 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :945 after 973
Reachability property MedleyA-PT-17-ReachabilityCardinality-2024-04 is true.
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :973 after 30845
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :30845 after 30875
Invariant property MedleyA-PT-17-ReachabilityCardinality-2024-05 does not hold.
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :30875 after 33018
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :33018 after 35364
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :35364 after 36988
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :36988 after 43513
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :43513 after 176842
Interrupted probabilistic random walk after 1010975 steps, run timeout after 6001 ms. (steps per millisecond=168 ) properties seen :5 out of 11
Probabilistic random walk after 1010975 steps, saw 179626 distinct states, run finished after 6028 ms. (steps per millisecond=167 ) properties seen :5
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 589 rows 248 cols
[2024-06-03 00:57:10] [INFO ] Computed 7 invariants in 28 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 191/248 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 191/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 589/837 variables, 248/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/837 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 837/837 variables, and 503 constraints, problems are : Problem set: 0 solved, 5 unsolved in 914 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MedleyA-PT-17-ReachabilityCardinality-2024-00 is UNSAT
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-17-ReachabilityCardinality-2024-10 is UNSAT
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 191/248 variables, 7/64 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 191/255 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-03 00:57:11] [INFO ] Deduced a trap composed of 19 places in 300 ms of which 42 ms to minimize.
[2024-06-03 00:57:12] [INFO ] Deduced a trap composed of 47 places in 373 ms of which 4 ms to minimize.
[2024-06-03 00:57:12] [INFO ] Deduced a trap composed of 43 places in 325 ms of which 5 ms to minimize.
[2024-06-03 00:57:12] [INFO ] Deduced a trap composed of 56 places in 261 ms of which 3 ms to minimize.
[2024-06-03 00:57:13] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 3 ms to minimize.
[2024-06-03 00:57:13] [INFO ] Deduced a trap composed of 103 places in 216 ms of which 3 ms to minimize.
[2024-06-03 00:57:13] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 3 ms to minimize.
[2024-06-03 00:57:13] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 4 ms to minimize.
[2024-06-03 00:57:13] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 4 ms to minimize.
[2024-06-03 00:57:14] [INFO ] Deduced a trap composed of 41 places in 270 ms of which 3 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :176842 after 302557
[2024-06-03 00:57:14] [INFO ] Deduced a trap composed of 39 places in 292 ms of which 11 ms to minimize.
[2024-06-03 00:57:14] [INFO ] Deduced a trap composed of 29 places in 262 ms of which 3 ms to minimize.
[2024-06-03 00:57:15] [INFO ] Deduced a trap composed of 17 places in 242 ms of which 3 ms to minimize.
[2024-06-03 00:57:15] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 3 ms to minimize.
[2024-06-03 00:57:15] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 3 ms to minimize.
[2024-06-03 00:57:15] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 16/271 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/271 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 589/837 variables, 248/519 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 837/837 variables, and 522 constraints, problems are : Problem set: 2 solved, 3 unsolved in 5009 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 16/16 constraints]
After SMT, in 6120ms problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 589/589 transitions.
Graph (trivial) has 204 edges and 248 vertex of which 6 / 248 are part of one of the 2 SCC in 6 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 244 transition count 561
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 28 rules applied. Total rules applied 51 place count 222 transition count 555
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 56 place count 217 transition count 555
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 56 place count 217 transition count 545
Deduced a syphon composed of 10 places in 8 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 76 place count 207 transition count 545
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 110 place count 173 transition count 484
Iterating global reduction 3 with 34 rules applied. Total rules applied 144 place count 173 transition count 484
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 160 place count 173 transition count 468
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 160 place count 173 transition count 467
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 172 transition count 467
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 163 place count 171 transition count 465
Iterating global reduction 4 with 1 rules applied. Total rules applied 164 place count 171 transition count 465
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 188 place count 159 transition count 453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 189 place count 159 transition count 452
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 225 place count 141 transition count 522
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 226 place count 141 transition count 521
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 228 place count 139 transition count 505
Iterating global reduction 6 with 2 rules applied. Total rules applied 230 place count 139 transition count 505
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 6 with 25 rules applied. Total rules applied 255 place count 139 transition count 480
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 263 place count 135 transition count 476
Free-agglomeration rule applied 23 times.
Iterating global reduction 6 with 23 rules applied. Total rules applied 286 place count 135 transition count 453
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 309 place count 112 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 310 place count 112 transition count 452
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 311 place count 112 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 312 place count 111 transition count 466
Applied a total of 312 rules in 420 ms. Remains 111 /248 variables (removed 137) and now considering 466/589 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 111/248 places, 466/589 transitions.
RANDOM walk for 40000 steps (13 resets) in 487 ms. (81 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (11 resets) in 238 ms. (167 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (15 resets) in 402 ms. (99 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (25 resets) in 349 ms. (114 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 538287 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :1 out of 3
Probabilistic random walk after 538287 steps, saw 99361 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :1
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-03 00:57:20] [INFO ] Flow matrix only has 428 transitions (discarded 38 similar events)
// Phase 1: matrix 428 rows 111 cols
[2024-06-03 00:57:20] [INFO ] Computed 7 invariants in 5 ms
[2024-06-03 00:57:20] [INFO ] State equation strengthened by 182 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 72/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 428/539 variables, 111/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 182/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/539 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/539 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 111/111 constraints, ReadFeed: 182/182 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 72/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:57:20] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 2 ms to minimize.
[2024-06-03 00:57:21] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 2 ms to minimize.
[2024-06-03 00:57:21] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 1 ms to minimize.
[2024-06-03 00:57:21] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-06-03 00:57:21] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-06-03 00:57:21] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 2 ms to minimize.
[2024-06-03 00:57:21] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 2 ms to minimize.
[2024-06-03 00:57:22] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 2 ms to minimize.
[2024-06-03 00:57:22] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-06-03 00:57:22] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 2 ms to minimize.
[2024-06-03 00:57:22] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 2 ms to minimize.
[2024-06-03 00:57:22] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 2 ms to minimize.
Invariant property MedleyA-PT-17-ReachabilityCardinality-2024-08 does not hold.
[2024-06-03 00:57:22] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 5 ms to minimize.
[2024-06-03 00:57:23] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2024-06-03 00:57:23] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:57:23] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:57:23] [INFO ] Deduced a trap composed of 63 places in 160 ms of which 2 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :302557 after 519095
[2024-06-03 00:57:23] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 428/539 variables, 111/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 182/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:57:24] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/539 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 539/539 variables, and 321 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4264 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 111/111 constraints, ReadFeed: 182/182 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints]
After SMT, in 4667ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1949 ms.
Support contains 39 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 466/466 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 465
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 108 transition count 479
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 108 transition count 473
Applied a total of 12 rules in 46 ms. Remains 108 /111 variables (removed 3) and now considering 473/466 (removed -7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 108/111 places, 473/466 transitions.
RANDOM walk for 40000 steps (15 resets) in 669 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (9 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (15 resets) in 382 ms. (104 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 905523 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :1 out of 2
Probabilistic random walk after 905523 steps, saw 153479 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :1
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-03 00:57:30] [INFO ] Flow matrix only has 435 transitions (discarded 38 similar events)
// Phase 1: matrix 435 rows 108 cols
[2024-06-03 00:57:30] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 00:57:30] [INFO ] State equation strengthened by 182 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/108 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 435/543 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 182/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/543 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 182/182 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/108 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:57:31] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 2 ms to minimize.
[2024-06-03 00:57:31] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 2 ms to minimize.
[2024-06-03 00:57:31] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2024-06-03 00:57:31] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 2 ms to minimize.
[2024-06-03 00:57:31] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 4 ms to minimize.
[2024-06-03 00:57:31] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 2 ms to minimize.
[2024-06-03 00:57:31] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:57:32] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :519095 after 637968
At refinement iteration 5 (OVERLAPS) 435/543 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 182/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:57:32] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 00:57:32] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/543 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/543 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2260 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 182/182 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 2540ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 13 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 473/473 transitions.
Graph (trivial) has 76 edges and 108 vertex of which 2 / 108 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 469
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 105 transition count 469
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 5 place count 105 transition count 461
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 21 place count 97 transition count 461
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 27 place count 91 transition count 450
Iterating global reduction 2 with 6 rules applied. Total rules applied 33 place count 91 transition count 450
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 90 transition count 434
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 90 transition count 434
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 49 place count 83 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 83 transition count 426
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 66 place count 75 transition count 460
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 85 place count 75 transition count 441
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 75 transition count 435
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 107 place count 69 transition count 425
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 123 place count 69 transition count 409
Applied a total of 123 rules in 232 ms. Remains 69 /108 variables (removed 39) and now considering 409/473 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 69/108 places, 409/473 transitions.
RANDOM walk for 40000 steps (2673 resets) in 2318 ms. (17 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (514 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 407717 steps, run visited all 1 properties in 1076 ms. (steps per millisecond=378 )
Probabilistic random walk after 407717 steps, saw 77257 distinct states, run finished after 1084 ms. (steps per millisecond=376 ) properties seen :1
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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 34029 ms.

BK_STOP 1717376255223

--------------------
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="MedleyA-PT-17"
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 MedleyA-PT-17, 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 r576-smll-171734920100134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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