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.r560-tall-171734905800137.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FireWire-PT-07, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905800137
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717351692065

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:08:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:08:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:08:13] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-06-02 18:08:13] [INFO ] Transformed 126 places.
[2024-06-02 18:08:13] [INFO ] Transformed 396 transitions.
[2024-06-02 18:08:13] [INFO ] Found NUPN structural information;
[2024-06-02 18:08:13] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 184 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 126/126 places, 396/396 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 126 transition count 343
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 125 transition count 342
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 122 transition count 348
Applied a total of 61 rules in 48 ms. Remains 122 /126 variables (removed 4) and now considering 348/396 (removed 48) transitions.
[2024-06-02 18:08:13] [INFO ] Flow matrix only has 306 transitions (discarded 42 similar events)
// Phase 1: matrix 306 rows 122 cols
[2024-06-02 18:08:13] [INFO ] Computed 8 invariants in 16 ms
[2024-06-02 18:08:13] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-06-02 18:08:13] [INFO ] Flow matrix only has 306 transitions (discarded 42 similar events)
[2024-06-02 18:08:13] [INFO ] Invariant cache hit.
[2024-06-02 18:08:13] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-02 18:08:14] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2024-06-02 18:08:14] [INFO ] Flow matrix only has 306 transitions (discarded 42 similar events)
[2024-06-02 18:08:14] [INFO ] Invariant cache hit.
[2024-06-02 18:08:14] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-02 18:08:17] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 9 ms to minimize.
[2024-06-02 18:08:17] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 3 ms to minimize.
[2024-06-02 18:08:17] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:08:17] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:08:17] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:08:18] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:08:18] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:08:18] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 8/138 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (OVERLAPS) 305/427 variables, 122/260 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 46/306 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 9 (OVERLAPS) 1/428 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 11 (OVERLAPS) 0/428 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 347 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 307 constraints, problems are : Problem set: 0 solved, 347 unsolved in 14407 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 8/138 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (OVERLAPS) 305/427 variables, 122/260 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 46/306 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 347/653 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-02 18:08:35] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 11 (OVERLAPS) 1/428 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 347 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 655 constraints, problems are : Problem set: 0 solved, 347 unsolved in 30024 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 9/9 constraints]
After SMT, in 44802ms problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 44823ms
Starting structural reductions in LIVENESS mode, iteration 1 : 122/126 places, 348/396 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 45449 ms. Remains : 122/126 places, 348/396 transitions.
Discarding 113 transitions out of 348. Remains 235
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2202 resets) in 2145 ms. (18 steps per ms) remains 133/234 properties
BEST_FIRST walk for 402 steps (15 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (10 resets) in 20 ms. (19 steps per ms) remains 133/133 properties
BEST_FIRST walk for 401 steps (9 resets) in 11 ms. (33 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 133/133 properties
BEST_FIRST walk for 401 steps (10 resets) in 22 ms. (17 steps per ms) remains 133/133 properties
BEST_FIRST walk for 401 steps (10 resets) in 13 ms. (28 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (9 resets) in 15 ms. (25 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (10 resets) in 15 ms. (25 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (13 resets) in 10 ms. (36 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (10 resets) in 11 ms. (33 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (10 resets) in 11 ms. (33 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (11 resets) in 10 ms. (36 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (11 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (12 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (11 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (11 resets) in 10 ms. (36 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (9 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (9 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (11 resets) in 9 ms. (40 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (10 resets) in 24 ms. (16 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (12 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (10 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (9 resets) in 5 ms. (67 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (10 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (9 resets) in 5 ms. (67 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (12 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (11 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (10 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (11 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (11 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (13 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (9 resets) in 5 ms. (67 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (10 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (12 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 401 steps (13 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (9 resets) in 9 ms. (40 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 401 steps (11 resets) in 9 ms. (40 steps per ms) remains 133/133 properties
[2024-06-02 18:08:59] [INFO ] Flow matrix only has 306 transitions (discarded 42 similar events)
[2024-06-02 18:08:59] [INFO ] Invariant cache hit.
[2024-06-02 18:08:59] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 36/121 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 36/129 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-02 18:09:00] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:09:00] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:09:00] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:09:01] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 5 ms to minimize.
[2024-06-02 18:09:01] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:09:01] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 6/135 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 305/426 variables, 121/256 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 46/302 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 1/427 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 427/428 variables, and 304 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5012 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 46/47 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 36/121 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 36/129 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 6/135 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-02 18:09:05] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 305/426 variables, 121/257 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 46/303 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 126/429 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 1/427 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 133 unsolved
SMT process timed out in 10146ms, After SMT, problems are : Problem set: 0 solved, 133 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 348/348 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 122 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 18 place count 122 transition count 330
Applied a total of 18 rules in 29 ms. Remains 122 /122 variables (removed 0) and now considering 330/348 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 122/122 places, 330/348 transitions.
RANDOM walk for 4000000 steps (218816 resets) in 41610 ms. (96 steps per ms) remains 69/133 properties
BEST_FIRST walk for 400002 steps (15192 resets) in 1052 ms. (379 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (5660 resets) in 732 ms. (545 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400002 steps (5668 resets) in 853 ms. (468 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400002 steps (284 resets) in 1180 ms. (338 steps per ms) remains 67/69 properties
BEST_FIRST walk for 400001 steps (5443 resets) in 754 ms. (529 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400002 steps (10773 resets) in 815 ms. (490 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (5692 resets) in 891 ms. (448 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (457 resets) in 1013 ms. (394 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (5666 resets) in 746 ms. (535 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (10777 resets) in 828 ms. (482 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (5757 resets) in 735 ms. (543 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400002 steps (438 resets) in 1003 ms. (398 steps per ms) remains 66/67 properties
BEST_FIRST walk for 400003 steps (5596 resets) in 732 ms. (545 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (10783 resets) in 828 ms. (482 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (5622 resets) in 698 ms. (572 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (432 resets) in 1072 ms. (372 steps per ms) remains 63/66 properties
BEST_FIRST walk for 400003 steps (5564 resets) in 726 ms. (550 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (10808 resets) in 870 ms. (459 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (5604 resets) in 729 ms. (547 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (368 resets) in 1208 ms. (330 steps per ms) remains 57/63 properties
BEST_FIRST walk for 400004 steps (5590 resets) in 693 ms. (576 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (10731 resets) in 973 ms. (410 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (5781 resets) in 721 ms. (554 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400001 steps (330 resets) in 1063 ms. (375 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (5644 resets) in 708 ms. (564 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (10789 resets) in 760 ms. (525 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (5571 resets) in 654 ms. (610 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (239 resets) in 1115 ms. (358 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (5500 resets) in 730 ms. (547 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (10676 resets) in 743 ms. (537 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (5553 resets) in 744 ms. (536 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (251 resets) in 1077 ms. (371 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (5618 resets) in 685 ms. (583 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (10798 resets) in 777 ms. (514 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400002 steps (5757 resets) in 667 ms. (598 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (132 resets) in 1125 ms. (355 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400001 steps (5384 resets) in 892 ms. (447 steps per ms) remains 56/57 properties
BEST_FIRST walk for 400001 steps (10755 resets) in 789 ms. (506 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (5716 resets) in 676 ms. (590 steps per ms) remains 53/56 properties
BEST_FIRST walk for 400001 steps (324 resets) in 851 ms. (469 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (5467 resets) in 745 ms. (536 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (10782 resets) in 781 ms. (511 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (5708 resets) in 692 ms. (577 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (204 resets) in 1042 ms. (383 steps per ms) remains 52/53 properties
BEST_FIRST walk for 400004 steps (5537 resets) in 699 ms. (571 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (10715 resets) in 763 ms. (523 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400001 steps (15228 resets) in 930 ms. (429 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (5599 resets) in 653 ms. (611 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (5744 resets) in 653 ms. (611 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (5475 resets) in 689 ms. (579 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (5733 resets) in 840 ms. (475 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (5470 resets) in 684 ms. (583 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (5664 resets) in 658 ms. (606 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (5542 resets) in 691 ms. (578 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (5643 resets) in 669 ms. (597 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (5582 resets) in 663 ms. (602 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (5040 resets) in 588 ms. (679 steps per ms) remains 52/52 properties
[2024-06-02 18:09:40] [INFO ] Flow matrix only has 302 transitions (discarded 28 similar events)
// Phase 1: matrix 302 rows 122 cols
[2024-06-02 18:09:40] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 18:09:40] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 76/116 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 76/122 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:09:40] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:09:40] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:09:40] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2024-06-02 18:09:40] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 4/120 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:09:41] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:09:41] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 302/422 variables, 120/254 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 46/300 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (OVERLAPS) 2/424 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 52 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 16 (OVERLAPS) 0/424 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 304 constraints, problems are : Problem set: 0 solved, 52 unsolved in 3027 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 76/116 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 76/122 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 4/120 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 302/422 variables, 120/254 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 46/300 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 51/351 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 14 (OVERLAPS) 2/424 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 18 (OVERLAPS) 0/424 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 356 constraints, problems are : Problem set: 0 solved, 52 unsolved in 5507 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 6/6 constraints]
After SMT, in 8580ms problems are : Problem set: 0 solved, 52 unsolved
Parikh walk visited 0 properties in 3509 ms.
Support contains 40 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 330/330 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 326
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 120 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 119 transition count 323
Applied a total of 7 rules in 32 ms. Remains 119 /122 variables (removed 3) and now considering 323/330 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 119/122 places, 323/330 transitions.
RANDOM walk for 4000000 steps (231723 resets) in 22771 ms. (175 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (5488 resets) in 645 ms. (619 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (5685 resets) in 644 ms. (620 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (634 resets) in 708 ms. (564 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (5500 resets) in 669 ms. (597 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (11091 resets) in 708 ms. (564 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (5698 resets) in 626 ms. (637 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (226 resets) in 1182 ms. (338 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (5682 resets) in 693 ms. (576 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (11036 resets) in 722 ms. (553 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (5734 resets) in 649 ms. (615 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (494 resets) in 790 ms. (505 steps per ms) remains 51/52 properties
BEST_FIRST walk for 400003 steps (5509 resets) in 650 ms. (614 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (11068 resets) in 726 ms. (550 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400002 steps (5600 resets) in 634 ms. (629 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (502 resets) in 1059 ms. (377 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (5605 resets) in 610 ms. (654 steps per ms) remains 50/51 properties
BEST_FIRST walk for 400003 steps (11119 resets) in 682 ms. (585 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (5719 resets) in 606 ms. (658 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (294 resets) in 1148 ms. (348 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (5488 resets) in 614 ms. (650 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (10988 resets) in 690 ms. (578 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (5630 resets) in 620 ms. (644 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400001 steps (66 resets) in 1156 ms. (345 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (5484 resets) in 620 ms. (644 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (11070 resets) in 670 ms. (596 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (5706 resets) in 1317 ms. (303 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (109 resets) in 1783 ms. (224 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (5367 resets) in 776 ms. (514 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (11096 resets) in 729 ms. (547 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (5657 resets) in 623 ms. (641 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (560 resets) in 896 ms. (445 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (5664 resets) in 944 ms. (423 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400001 steps (10918 resets) in 851 ms. (469 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (5610 resets) in 1119 ms. (357 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (420 resets) in 1237 ms. (323 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400001 steps (5626 resets) in 630 ms. (633 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (11081 resets) in 669 ms. (597 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (5675 resets) in 599 ms. (666 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (380 resets) in 799 ms. (500 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (5474 resets) in 656 ms. (608 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400001 steps (11115 resets) in 692 ms. (577 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (15783 resets) in 854 ms. (467 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (5699 resets) in 825 ms. (484 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (5742 resets) in 830 ms. (481 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (5517 resets) in 625 ms. (638 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (5626 resets) in 614 ms. (650 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (5478 resets) in 623 ms. (641 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (5751 resets) in 607 ms. (657 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (5712 resets) in 599 ms. (666 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (5509 resets) in 604 ms. (661 steps per ms) remains 50/50 properties
Finished probabilistic random walk after 15203737 steps, run visited all 50 properties in 50937 ms. (steps per millisecond=298 )
Probabilistic random walk after 15203737 steps, saw 2758902 distinct states, run finished after 50943 ms. (steps per millisecond=298 ) properties seen :50
Able to resolve query QuasiLiveness after proving 235 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 169417 ms.
ITS solved all properties within timeout

BK_STOP 1717351862785

--------------------
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="FireWire-PT-07"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FireWire-PT-07, 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 r560-tall-171734905800137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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