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.r496-tall-171640604300830.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 ltsminxred
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 r496-tall-171640604300830
=====================================================================

--------------------
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 1717201908163

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:31:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:31:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:31:49] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-06-01 00:31:49] [INFO ] Transformed 624 places.
[2024-06-01 00:31:49] [INFO ] Transformed 828 transitions.
[2024-06-01 00:31:49] [INFO ] Found NUPN structural information;
[2024-06-01 00:31:49] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 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 1785 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 195 ms. (204 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (59 resets) in 429 ms. (93 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (56 resets) in 464 ms. (86 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (56 resets) in 58 ms. (678 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (56 resets) in 56 ms. (701 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (52 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (57 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (59 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (59 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (56 resets) in 46 ms. (851 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 422035 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 11
Probabilistic random walk after 422035 steps, saw 135093 distinct states, run finished after 3005 ms. (steps per millisecond=140 ) properties seen :0
// Phase 1: matrix 828 rows 624 cols
[2024-06-01 00:31:53] [INFO ] Computed 18 invariants in 16 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 1789 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-06-01 00:31:55] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 23 ms to minimize.
[2024-06-01 00:31:56] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 1 ms to minimize.
[2024-06-01 00:31:56] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:31:56] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:31:56] [INFO ] Deduced a trap composed of 105 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:31:56] [INFO ] Deduced a trap composed of 93 places in 64 ms of which 2 ms to minimize.
[2024-06-01 00:31:56] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:31:56] [INFO ] Deduced a trap composed of 99 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:31:56] [INFO ] Deduced a trap composed of 91 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:31:56] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 2 ms to minimize.
[2024-06-01 00:31:56] [INFO ] Deduced a trap composed of 90 places in 69 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-06-01 00:31:56] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:31:57] [INFO ] Deduced a trap composed of 97 places in 57 ms of which 2 ms to minimize.
[2024-06-01 00:31:57] [INFO ] Deduced a trap composed of 105 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:31:57] [INFO ] Deduced a trap composed of 97 places in 47 ms of which 3 ms to minimize.
[2024-06-01 00:31:57] [INFO ] Deduced a trap composed of 93 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:31:57] [INFO ] Deduced a trap composed of 93 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:31:57] [INFO ] Deduced a trap composed of 92 places in 49 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-06-01 00:31:58] [INFO ] Deduced a trap composed of 121 places in 137 ms of which 3 ms to minimize.
[2024-06-01 00:31:58] [INFO ] Deduced a trap composed of 136 places in 78 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-06-01 00:31:59] [INFO ] Deduced a trap composed of 162 places in 158 ms of which 3 ms to minimize.
[2024-06-01 00:31:59] [INFO ] Deduced a trap composed of 117 places in 121 ms of which 3 ms to minimize.
[2024-06-01 00:32:00] [INFO ] Deduced a trap composed of 120 places in 132 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 5015 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 6904ms 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 1 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 0 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 172 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 180 ms. Remains : 157/624 places, 297/828 transitions.
RANDOM walk for 40000 steps (56 resets) in 440 ms. (90 steps per ms) remains 9/10 properties
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (46 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (116 resets) in 237 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (127 resets) in 306 ms. (130 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (73 resets) in 145 ms. (273 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (63 resets) in 120 ms. (330 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (131 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (120 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (83 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (155 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
[2024-06-01 00:32:01] [INFO ] Flow matrix only has 295 transitions (discarded 2 similar events)
// Phase 1: matrix 295 rows 157 cols
[2024-06-01 00:32:01] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 00:32:01] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 97/157 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 295/452 variables, 157/166 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 14/180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/452 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 180 constraints, problems are : Problem set: 0 solved, 9 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 157/157 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 97/157 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:32:02] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:32:02] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:32:02] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:32:02] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:32:02] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:32:02] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:32:02] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:32:02] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:32:02] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:32:02] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:32:02] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 295/452 variables, 157/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 14/191 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:32:03] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:32:03] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/452 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/452 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 202 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2163 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 157/157 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 13/13 constraints]
After SMT, in 2509ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-06 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
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 1387 ms.
Support contains 33 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 297/297 transitions.
Graph (trivial) has 80 edges and 157 vertex of which 6 / 157 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 501 edges and 154 vertex of which 153 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 153 transition count 278
Reduce places removed 13 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 140 transition count 274
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 136 transition count 274
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 36 place count 136 transition count 271
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 133 transition count 271
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 48 place count 127 transition count 261
Iterating global reduction 3 with 6 rules applied. Total rules applied 54 place count 127 transition count 261
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 56 place count 125 transition count 255
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 125 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 125 transition count 254
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 71 place count 119 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 75 place count 119 transition count 244
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 76 place count 118 transition count 242
Iterating global reduction 5 with 1 rules applied. Total rules applied 77 place count 118 transition count 242
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 78 place count 117 transition count 239
Iterating global reduction 5 with 1 rules applied. Total rules applied 79 place count 117 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 81 place count 117 transition count 237
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 82 place count 116 transition count 235
Iterating global reduction 6 with 1 rules applied. Total rules applied 83 place count 116 transition count 235
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 91 place count 112 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 93 place count 112 transition count 253
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 96 place count 112 transition count 250
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 102 place count 109 transition count 247
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 103 place count 109 transition count 247
Applied a total of 103 rules in 71 ms. Remains 109 /157 variables (removed 48) and now considering 247/297 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 109/157 places, 247/297 transitions.
RANDOM walk for 40000 steps (2169 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (225 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (328 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1310546 steps, run timeout after 3001 ms. (steps per millisecond=436 ) properties seen :0 out of 2
Probabilistic random walk after 1310546 steps, saw 242983 distinct states, run finished after 3001 ms. (steps per millisecond=436 ) properties seen :0
[2024-06-01 00:32:08] [INFO ] Flow matrix only has 243 transitions (discarded 4 similar events)
// Phase 1: matrix 243 rows 109 cols
[2024-06-01 00:32:08] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 00:32:08] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 76/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 243/352 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 13/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/352 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 130 constraints, problems are : Problem set: 0 solved, 2 unsolved in 117 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 13/13 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 76/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 243/352 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 13/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:32:08] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/352 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 133 constraints, problems are : Problem set: 0 solved, 2 unsolved in 338 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 475ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 27 ms.
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 247/247 transitions.
Graph (trivial) has 96 edges and 109 vertex of which 2 / 109 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 406 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 107 transition count 233
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 24 place count 96 transition count 233
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 96 transition count 227
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 90 transition count 227
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 46 place count 80 transition count 202
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 80 transition count 202
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 78 transition count 196
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 78 transition count 196
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 78 place count 69 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 69 transition count 184
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 67 transition count 179
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 67 transition count 179
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 66 transition count 175
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 66 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 89 place count 66 transition count 173
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
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 99 place count 61 transition count 183
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 101 place count 59 transition count 172
Iterating global reduction 4 with 2 rules applied. Total rules applied 103 place count 59 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 115 place count 59 transition count 160
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 116 place count 58 transition count 157
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 58 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 119 place count 58 transition count 155
Free-agglomeration rule applied 13 times.
Iterating global reduction 5 with 13 rules applied. Total rules applied 132 place count 58 transition count 142
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 145 place count 45 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 150 place count 45 transition count 137
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 45 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 152 place count 44 transition count 136
Applied a total of 152 rules in 38 ms. Remains 44 /109 variables (removed 65) and now considering 136/247 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 44/109 places, 136/247 transitions.
RANDOM walk for 40000 steps (5864 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (635 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 69733 steps, run visited all 1 properties in 76 ms. (steps per millisecond=917 )
Probabilistic random walk after 69733 steps, saw 15160 distinct states, run finished after 80 ms. (steps per millisecond=871 ) properties seen :1
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 20129 ms.
ITS solved all properties within timeout

BK_STOP 1717201929448

--------------------
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="ltsminxred"
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 ltsminxred"
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 r496-tall-171640604300830"
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 ;