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.r179-tall-171640602400830.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 greatspnxred
Input is HealthRecord-PT-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602400830
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 20:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 175K May 18 16:42 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 HealthRecord-PT-17-ReachabilityCardinality-2024-00
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-01
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-02
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-03
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-04
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-05
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-06
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-07
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-08
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-09
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-10
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-11
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-12
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-13
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-14
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716492050104

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:20:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 19:20:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:20:51] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-23 19:20:51] [INFO ] Transformed 624 places.
[2024-05-23 19:20:51] [INFO ] Transformed 828 transitions.
[2024-05-23 19:20:51] [INFO ] Found NUPN structural information;
[2024-05-23 19:20:51] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (343 resets) in 1776 ms. (22 steps per ms) remains 11/12 properties
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (55 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (60 resets) in 446 ms. (89 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (57 resets) in 570 ms. (70 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (54 resets) in 146 ms. (272 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (58 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (57 resets) in 136 ms. (291 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (56 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (11 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (57 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (57 resets) in 88 ms. (449 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (59 resets) in 98 ms. (404 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 319828 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 11
Probabilistic random walk after 319828 steps, saw 111656 distinct states, run finished after 3007 ms. (steps per millisecond=106 ) properties seen :0
// Phase 1: matrix 828 rows 624 cols
[2024-05-23 19:20:55] [INFO ] Computed 18 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 172/277 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 172/287 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 347/624 variables, 8/295 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 347/642 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 828/1452 variables, 624/1266 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1452 variables, 0/1266 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/1452 variables, 0/1266 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1452/1452 variables, and 1266 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2063 ms.
Refiners :[Domain max(s): 624/624 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 172/277 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 172/287 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 19:20:58] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 18 ms to minimize.
[2024-05-23 19:20:58] [INFO ] Deduced a trap composed of 97 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:20:58] [INFO ] Deduced a trap composed of 92 places in 65 ms of which 1 ms to minimize.
[2024-05-23 19:20:58] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 1 ms to minimize.
[2024-05-23 19:20:58] [INFO ] Deduced a trap composed of 105 places in 70 ms of which 2 ms to minimize.
[2024-05-23 19:20:58] [INFO ] Deduced a trap composed of 93 places in 62 ms of which 1 ms to minimize.
[2024-05-23 19:20:58] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:20:58] [INFO ] Deduced a trap composed of 99 places in 68 ms of which 2 ms to minimize.
[2024-05-23 19:20:59] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 1 ms to minimize.
[2024-05-23 19:20:59] [INFO ] Deduced a trap composed of 94 places in 70 ms of which 1 ms to minimize.
[2024-05-23 19:20:59] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 11/298 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 19:20:59] [INFO ] Deduced a trap composed of 93 places in 66 ms of which 1 ms to minimize.
[2024-05-23 19:20:59] [INFO ] Deduced a trap composed of 97 places in 68 ms of which 2 ms to minimize.
[2024-05-23 19:20:59] [INFO ] Deduced a trap composed of 105 places in 66 ms of which 1 ms to minimize.
[2024-05-23 19:20:59] [INFO ] Deduced a trap composed of 97 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:20:59] [INFO ] Deduced a trap composed of 93 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:20:59] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:20:59] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 7/305 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem HealthRecord-PT-17-ReachabilityCardinality-2024-03 is UNSAT
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 347/624 variables, 8/313 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/624 variables, 347/660 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/624 variables, 0/660 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 828/1452 variables, 624/1284 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1452 variables, 10/1294 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-23 19:21:01] [INFO ] Deduced a trap composed of 121 places in 145 ms of which 3 ms to minimize.
[2024-05-23 19:21:01] [INFO ] Deduced a trap composed of 136 places in 91 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1452 variables, 2/1296 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-23 19:21:02] [INFO ] Deduced a trap composed of 162 places in 165 ms of which 3 ms to minimize.
[2024-05-23 19:21:02] [INFO ] Deduced a trap composed of 117 places in 146 ms of which 3 ms to minimize.
[2024-05-23 19:21:02] [INFO ] Deduced a trap composed of 120 places in 150 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1452 variables, 3/1299 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1452/1452 variables, and 1299 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5017 ms.
Refiners :[Domain max(s): 624/624 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 23/23 constraints]
After SMT, in 7207ms problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 63 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 589 edges and 624 vertex of which 69 / 624 are part of one of the 20 SCC in 4 ms
Free SCC test removed 49 places
Drop transitions (Empty/Sink Transition effects.) removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Graph (complete) has 1222 edges and 575 vertex of which 561 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 561 transition count 549
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 230 rules applied. Total rules applied 432 place count 361 transition count 519
Reduce places removed 10 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 40 rules applied. Total rules applied 472 place count 351 transition count 489
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 502 place count 321 transition count 489
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 502 place count 321 transition count 479
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 522 place count 311 transition count 479
Discarding 71 places :
Symmetric choice reduction at 4 with 71 rule applications. Total rules 593 place count 240 transition count 370
Iterating global reduction 4 with 71 rules applied. Total rules applied 664 place count 240 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 665 place count 240 transition count 369
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 684 place count 221 transition count 332
Iterating global reduction 5 with 19 rules applied. Total rules applied 703 place count 221 transition count 332
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 705 place count 219 transition count 328
Iterating global reduction 5 with 2 rules applied. Total rules applied 707 place count 219 transition count 328
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 773 place count 186 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 775 place count 186 transition count 293
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 789 place count 179 transition count 320
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 792 place count 179 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 806 place count 179 transition count 303
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 807 place count 178 transition count 302
Iterating global reduction 7 with 1 rules applied. Total rules applied 808 place count 178 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 810 place count 177 transition count 310
Free-agglomeration rule applied 17 times.
Iterating global reduction 7 with 17 rules applied. Total rules applied 827 place count 177 transition count 293
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 844 place count 160 transition count 293
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 846 place count 160 transition count 298
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 848 place count 158 transition count 298
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 849 place count 158 transition count 298
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 853 place count 158 transition count 298
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 854 place count 157 transition count 297
Iterating global reduction 9 with 1 rules applied. Total rules applied 855 place count 157 transition count 297
Applied a total of 855 rules in 178 ms. Remains 157 /624 variables (removed 467) and now considering 297/828 (removed 531) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 157/624 places, 297/828 transitions.
RANDOM walk for 40000 steps (66 resets) in 1008 ms. (39 steps per ms) remains 9/10 properties
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (69 resets) in 278 ms. (143 steps per ms) remains 8/9 properties
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (141 resets) in 170 ms. (233 steps per ms) remains 7/8 properties
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (115 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (78 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (53 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (97 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (81 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
[2024-05-23 19:21:03] [INFO ] Flow matrix only has 295 transitions (discarded 2 similar events)
// Phase 1: matrix 295 rows 157 cols
[2024-05-23 19:21:03] [INFO ] Computed 9 invariants in 2 ms
[2024-05-23 19:21:03] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 100/157 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 295/452 variables, 157/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 14/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/452 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 180 constraints, problems are : Problem set: 0 solved, 7 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 157/157 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 100/157 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 19:21:04] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:21:04] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:21:04] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:21:04] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-23 19:21:04] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:21:04] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:21:04] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 19:21:04] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-23 19:21:04] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-23 19:21:05] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:21:05] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-05-23 19:21:05] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 19:21:05] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 19:21:05] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-23 19:21:05] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 19:21:05] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 19:21:05] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 2 ms to minimize.
[2024-05-23 19:21:05] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:21:05] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 19:21:05] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 295/452 variables, 157/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 14/200 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 7/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/452 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 207 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2296 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 157/157 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 20/20 constraints]
After SMT, in 2609ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 1210 ms.
Support contains 38 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 297/297 transitions.
Graph (trivial) has 71 edges and 157 vertex of which 4 / 157 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 503 edges and 155 vertex of which 154 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 154 transition count 281
Reduce places removed 12 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 142 transition count 277
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 34 place count 138 transition count 277
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 34 place count 138 transition count 275
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 38 place count 136 transition count 275
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 43 place count 131 transition count 266
Iterating global reduction 3 with 5 rules applied. Total rules applied 48 place count 131 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 130 transition count 263
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 130 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 130 transition count 262
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 61 place count 125 transition count 257
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 65 place count 125 transition count 253
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 66 place count 124 transition count 251
Iterating global reduction 5 with 1 rules applied. Total rules applied 67 place count 124 transition count 251
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 68 place count 123 transition count 248
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 123 transition count 248
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 71 place count 123 transition count 246
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 72 place count 122 transition count 244
Iterating global reduction 6 with 1 rules applied. Total rules applied 73 place count 122 transition count 244
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 81 place count 118 transition count 264
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 82 place count 118 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 83 place count 117 transition count 263
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 84 place count 117 transition count 263
Applied a total of 84 rules in 41 ms. Remains 117 /157 variables (removed 40) and now considering 263/297 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 117/157 places, 263/297 transitions.
RANDOM walk for 40000 steps (2146 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (319 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (327 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (324 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1055088 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :0 out of 3
Probabilistic random walk after 1055088 steps, saw 188427 distinct states, run finished after 3001 ms. (steps per millisecond=351 ) properties seen :0
[2024-05-23 19:21:10] [INFO ] Flow matrix only has 259 transitions (discarded 4 similar events)
// Phase 1: matrix 259 rows 117 cols
[2024-05-23 19:21:10] [INFO ] Computed 8 invariants in 5 ms
[2024-05-23 19:21:10] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 259/376 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 13/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/376 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 138 constraints, problems are : Problem set: 0 solved, 3 unsolved in 222 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 259/376 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 13/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 19:21:11] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-05-23 19:21:11] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/376 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 143 constraints, problems are : Problem set: 0 solved, 3 unsolved in 540 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 782ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 258 ms.
Support contains 8 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 263/263 transitions.
Graph (trivial) has 98 edges and 117 vertex of which 2 / 117 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 426 edges and 116 vertex of which 115 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 115 transition count 249
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 24 place count 104 transition count 249
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 24 place count 104 transition count 243
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 36 place count 98 transition count 243
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 45 place count 89 transition count 220
Iterating global reduction 2 with 9 rules applied. Total rules applied 54 place count 89 transition count 220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 87 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 87 transition count 214
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 76 place count 78 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 79 place count 78 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 76 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 76 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 75 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 75 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 87 place count 75 transition count 191
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 97 place count 70 transition count 199
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 98 place count 69 transition count 192
Iterating global reduction 4 with 1 rules applied. Total rules applied 99 place count 69 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 112 place count 69 transition count 179
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 126 place count 69 transition count 165
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 142 place count 55 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 144 place count 55 transition count 161
Applied a total of 144 rules in 33 ms. Remains 55 /117 variables (removed 62) and now considering 161/263 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 55/117 places, 161/263 transitions.
RANDOM walk for 40000 steps (5506 resets) in 395 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (600 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (611 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 483711 steps, run visited all 2 properties in 617 ms. (steps per millisecond=783 )
Probabilistic random walk after 483711 steps, saw 95979 distinct states, run finished after 622 ms. (steps per millisecond=777 ) properties seen :2
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 21564 ms.
ITS solved all properties within timeout

BK_STOP 1716492072864

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="HealthRecord-PT-17"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is HealthRecord-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 r179-tall-171640602400830"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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