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.r498-tall-171640618100517.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 QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r498-tall-171640618100517
=====================================================================

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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717194133101

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:22:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 22:22:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:22:14] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-05-31 22:22:14] [INFO ] Transformed 624 places.
[2024-05-31 22:22:14] [INFO ] Transformed 828 transitions.
[2024-05-31 22:22:14] [INFO ] Found NUPN structural information;
[2024-05-31 22:22:14] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 199 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 750 edges and 624 vertex of which 87 / 624 are part of one of the 21 SCC in 25 ms
Free SCC test removed 66 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 296 place count 558 transition count 458
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 337 rules applied. Total rules applied 633 place count 263 transition count 416
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 647 place count 249 transition count 416
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 647 place count 249 transition count 406
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 667 place count 239 transition count 406
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 861 place count 142 transition count 309
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -77
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 933 place count 106 transition count 386
Applied a total of 933 rules in 111 ms. Remains 106 /624 variables (removed 518) and now considering 386/828 (removed 442) transitions.
[2024-05-31 22:22:14] [INFO ] Flow matrix only has 357 transitions (discarded 29 similar events)
// Phase 1: matrix 357 rows 106 cols
[2024-05-31 22:22:14] [INFO ] Computed 18 invariants in 20 ms
[2024-05-31 22:22:14] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-31 22:22:14] [INFO ] Flow matrix only has 357 transitions (discarded 29 similar events)
[2024-05-31 22:22:14] [INFO ] Invariant cache hit.
[2024-05-31 22:22:15] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-31 22:22:15] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2024-05-31 22:22:15] [INFO ] Flow matrix only has 357 transitions (discarded 29 similar events)
[2024-05-31 22:22:15] [INFO ] Invariant cache hit.
[2024-05-31 22:22:15] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 10 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (OVERLAPS) 356/462 variables, 106/235 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 53/288 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 10 (OVERLAPS) 1/463 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 12 (OVERLAPS) 0/463 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 289 constraints, problems are : Problem set: 0 solved, 356 unsolved in 18153 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (OVERLAPS) 356/462 variables, 106/235 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 53/288 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 356/644 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-31 22:22:41] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2024-05-31 22:22:41] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:22:41] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 12 (OVERLAPS) 1/463 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/463 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 14 (OVERLAPS) 0/463 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 648 constraints, problems are : Problem set: 0 solved, 356 unsolved in 27915 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 8/8 constraints]
After SMT, in 46810ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 46835ms
Starting structural reductions in LIVENESS mode, iteration 1 : 106/624 places, 386/828 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 47494 ms. Remains : 106/624 places, 386/828 transitions.
Discarding 295 transitions out of 386. Remains 91
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (3785 resets) in 2363 ms. (16 steps per ms) remains 40/90 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (25 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (27 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (25 resets) in 13 ms. (285 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4003 steps (26 resets) in 26 ms. (148 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (25 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (26 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (25 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (24 resets) in 13 ms. (286 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (25 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (26 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (41 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (41 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (19 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (18 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (18 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (19 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (18 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (18 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (25 resets) in 8 ms. (444 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (26 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (24 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (26 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (26 resets) in 9 ms. (400 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4003 steps (26 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (26 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
[2024-05-31 22:23:02] [INFO ] Flow matrix only has 357 transitions (discarded 29 similar events)
[2024-05-31 22:23:02] [INFO ] Invariant cache hit.
[2024-05-31 22:23:02] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 15/64 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-31 22:23:03] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:23:03] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:23:03] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-31 22:23:03] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 42/106 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 42/128 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-31 22:23:03] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 356/462 variables, 106/235 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 53/288 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 1/463 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 289 constraints, problems are : Problem set: 0 solved, 34 unsolved in 2238 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 15/64 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 42/106 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 42/128 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 356/462 variables, 106/235 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 53/288 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 34/322 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (OVERLAPS) 1/463 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 323 constraints, problems are : Problem set: 0 solved, 34 unsolved in 2418 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 5/5 constraints]
After SMT, in 4726ms problems are : Problem set: 0 solved, 34 unsolved
Fused 34 Parikh solutions to 26 different solutions.
Parikh walk visited 5 properties in 551 ms.
Support contains 43 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 386/386 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 106 transition count 365
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 101 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 101 transition count 340
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 43 place count 89 transition count 316
Iterating global reduction 1 with 12 rules applied. Total rules applied 55 place count 89 transition count 316
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 64 place count 89 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 96 place count 89 transition count 275
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 104 place count 89 transition count 267
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 81 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 123 place count 81 transition count 256
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 81 transition count 256
Applied a total of 126 rules in 73 ms. Remains 81 /106 variables (removed 25) and now considering 256/386 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 81/106 places, 256/386 transitions.
RANDOM walk for 4000000 steps (383514 resets) in 19986 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (3807 resets) in 281 ms. (1418 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (3838 resets) in 272 ms. (1465 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (3826 resets) in 269 ms. (1481 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (3840 resets) in 269 ms. (1481 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (3788 resets) in 265 ms. (1503 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (3826 resets) in 281 ms. (1418 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (3818 resets) in 271 ms. (1470 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (3813 resets) in 337 ms. (1183 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (3834 resets) in 297 ms. (1342 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (3787 resets) in 259 ms. (1538 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (3831 resets) in 279 ms. (1428 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (3807 resets) in 268 ms. (1487 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (3804 resets) in 275 ms. (1449 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (3812 resets) in 268 ms. (1487 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (5093 resets) in 315 ms. (1265 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (5093 resets) in 324 ms. (1230 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (4911 resets) in 329 ms. (1212 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (3406 resets) in 304 ms. (1311 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (3393 resets) in 292 ms. (1365 steps per ms) remains 27/29 properties
BEST_FIRST walk for 400004 steps (3377 resets) in 287 ms. (1388 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400004 steps (3393 resets) in 301 ms. (1324 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (3399 resets) in 299 ms. (1333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (3408 resets) in 296 ms. (1346 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (3806 resets) in 283 ms. (1408 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (3812 resets) in 279 ms. (1428 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (3802 resets) in 291 ms. (1369 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (3780 resets) in 285 ms. (1398 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (3795 resets) in 296 ms. (1346 steps per ms) remains 26/26 properties
[2024-05-31 22:23:17] [INFO ] Flow matrix only has 244 transitions (discarded 12 similar events)
// Phase 1: matrix 244 rows 81 cols
[2024-05-31 22:23:17] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 22:23:17] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 15/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:23:17] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 3 ms to minimize.
[2024-05-31 22:23:17] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
[2024-05-31 22:23:17] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 26/81 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:23:17] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 244/325 variables, 81/103 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 53/156 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/325 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 156 constraints, problems are : Problem set: 0 solved, 26 unsolved in 995 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 15/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 26/81 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 244/325 variables, 81/103 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 53/156 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 26/182 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/325 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 182 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1008 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 4/4 constraints]
After SMT, in 2043ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 18 different solutions.
Parikh walk visited 6 properties in 247 ms.
Support contains 34 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 256/256 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 78 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 78 transition count 241
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 76 transition count 225
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 76 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 75 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 75 transition count 218
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 75 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 75 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 74 transition count 205
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 74 transition count 205
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 74 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 73 transition count 204
Applied a total of 24 rules in 23 ms. Remains 73 /81 variables (removed 8) and now considering 204/256 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 73/81 places, 204/256 transitions.
RANDOM walk for 4000000 steps (381855 resets) in 19111 ms. (209 steps per ms) remains 7/20 properties
BEST_FIRST walk for 4000003 steps (38342 resets) in 1762 ms. (2268 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (38374 resets) in 1731 ms. (2309 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (49437 resets) in 2216 ms. (1804 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (34083 resets) in 1918 ms. (2084 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (34091 resets) in 1922 ms. (2080 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (38137 resets) in 1872 ms. (2135 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (38194 resets) in 1918 ms. (2084 steps per ms) remains 7/7 properties
[2024-05-31 22:23:30] [INFO ] Flow matrix only has 191 transitions (discarded 13 similar events)
// Phase 1: matrix 191 rows 73 cols
[2024-05-31 22:23:30] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 22:23:30] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 26/46 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 22:23:31] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 27/73 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 191/264 variables, 73/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/264 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 130 constraints, problems are : Problem set: 0 solved, 7 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 73/73 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 26/46 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 27/73 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 191/264 variables, 73/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 7/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/264 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 137 constraints, problems are : Problem set: 0 solved, 7 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 73/73 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 639ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 4 properties in 146 ms.
Support contains 12 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 204/204 transitions.
Graph (complete) has 393 edges and 73 vertex of which 64 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 61 transition count 193
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 61 transition count 193
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 9 place count 59 transition count 184
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 59 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 58 transition count 176
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 58 transition count 176
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 20 place count 58 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 56 transition count 184
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 56 transition count 180
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 56 transition count 176
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 38 place count 52 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 52 transition count 170
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 47 place count 52 transition count 170
Applied a total of 47 rules in 27 ms. Remains 52 /73 variables (removed 21) and now considering 170/204 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 52/73 places, 170/204 transitions.
RANDOM walk for 4000000 steps (482121 resets) in 10831 ms. (369 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (44002 resets) in 1536 ms. (2602 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (43944 resets) in 1534 ms. (2605 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (45351 resets) in 2853 ms. (1401 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 309105 steps, run visited all 3 properties in 917 ms. (steps per millisecond=337 )
Probabilistic random walk after 309105 steps, saw 58602 distinct states, run finished after 923 ms. (steps per millisecond=334 ) properties seen :3
Able to resolve query QuasiLiveness after proving 91 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 83353 ms.
ITS solved all properties within timeout

BK_STOP 1717194217676

--------------------
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 QuasiLiveness -timeout 180 -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="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r498-tall-171640618100517"
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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;