About the Execution of GreatSPN+red for AutoFlight-PT-12b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 659.840 | 234153.00 | 532019.00 | 672.90 | T | normal |
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.r034-smll-171620174800102.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 AutoFlight-PT-12b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-smll-171620174800102
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 22:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 266K 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 1716244860959
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 22:41:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-20 22:41:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:41:03] [INFO ] Load time of PNML (sax parser for PT used): 311 ms
[2024-05-20 22:41:03] [INFO ] Transformed 1126 places.
[2024-05-20 22:41:03] [INFO ] Transformed 1124 transitions.
[2024-05-20 22:41:03] [INFO ] Found NUPN structural information;
[2024-05-20 22:41:03] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 556 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 448 transitions
Trivial Post-agglo rules discarded 448 transitions
Performed 448 trivial Post agglomeration. Transition count delta: 448
Iterating post reduction 0 with 448 rules applied. Total rules applied 448 place count 1126 transition count 676
Reduce places removed 448 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 532 rules applied. Total rules applied 980 place count 678 transition count 592
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 1004 place count 654 transition count 592
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 1004 place count 654 transition count 441
Deduced a syphon composed of 151 places in 22 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 1306 place count 503 transition count 441
Performed 218 Post agglomeration using F-continuation condition.Transition count delta: 218
Deduced a syphon composed of 218 places in 1 ms
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 3 with 436 rules applied. Total rules applied 1742 place count 285 transition count 223
Applied a total of 1742 rules in 339 ms. Remains 285 /1126 variables (removed 841) and now considering 223/1124 (removed 901) transitions.
// Phase 1: matrix 223 rows 285 cols
[2024-05-20 22:41:04] [INFO ] Computed 76 invariants in 38 ms
[2024-05-20 22:41:05] [INFO ] Implicit Places using invariants in 1349 ms returned [87, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 120, 284]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1418 ms to find 13 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 272/1126 places, 223/1124 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 272 transition count 211
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 260 transition count 211
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 52 place count 246 transition count 197
Applied a total of 52 rules in 21 ms. Remains 246 /272 variables (removed 26) and now considering 197/223 (removed 26) transitions.
// Phase 1: matrix 197 rows 246 cols
[2024-05-20 22:41:05] [INFO ] Computed 63 invariants in 5 ms
[2024-05-20 22:41:05] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-20 22:41:05] [INFO ] Invariant cache hit.
[2024-05-20 22:41:06] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-20 22:41:07] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 1923 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 246/1126 places, 197/1124 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 3743 ms. Remains : 246/1126 places, 197/1124 transitions.
Discarding 48 transitions out of 197. Remains 149
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (900 resets) in 3387 ms. (11 steps per ms) remains 51/148 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
[2024-05-20 22:41:09] [INFO ] Invariant cache hit.
[2024-05-20 22:41:09] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 110/198 variables, 39/127 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 110/237 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-20 22:41:10] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 23 ms to minimize.
[2024-05-20 22:41:10] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 3 ms to minimize.
[2024-05-20 22:41:10] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2024-05-20 22:41:10] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2024-05-20 22:41:10] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 5/242 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 48/246 variables, 24/266 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 48/314 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 197/443 variables, 246/560 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 60/620 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/443 variables, and 620 constraints, problems are : Problem set: 0 solved, 51 unsolved in 5023 ms.
Refiners :[Domain max(s): 246/246 constraints, Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 246/246 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 110/198 variables, 39/127 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 110/237 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 5/242 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-20 22:41:15] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 48/246 variables, 24/267 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 48/315 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 197/443 variables, 246/561 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 60/621 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 51/672 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-20 22:41:17] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
[2024-05-20 22:41:17] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 2/674 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/443 variables, and 674 constraints, problems are : Problem set: 0 solved, 51 unsolved in 5012 ms.
Refiners :[Domain max(s): 246/246 constraints, Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 246/246 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 8/8 constraints]
After SMT, in 10206ms problems are : Problem set: 0 solved, 51 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 88 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 197/197 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 235 transition count 186
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 235 transition count 186
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 46 place count 235 transition count 162
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 70 place count 211 transition count 162
Applied a total of 70 rules in 58 ms. Remains 211 /246 variables (removed 35) and now considering 162/197 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 211/246 places, 162/197 transitions.
RANDOM walk for 4000000 steps (75467 resets) in 34696 ms. (115 steps per ms) remains 26/51 properties
BEST_FIRST walk for 400004 steps (831 resets) in 822 ms. (486 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (839 resets) in 863 ms. (462 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (841 resets) in 924 ms. (432 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (865 resets) in 1031 ms. (387 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (817 resets) in 771 ms. (518 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (836 resets) in 808 ms. (494 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (840 resets) in 1099 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (824 resets) in 1140 ms. (350 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (833 resets) in 955 ms. (418 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (856 resets) in 878 ms. (455 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (827 resets) in 772 ms. (517 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (848 resets) in 755 ms. (529 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (829 resets) in 765 ms. (522 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (843 resets) in 755 ms. (529 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (818 resets) in 751 ms. (531 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (848 resets) in 770 ms. (518 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (821 resets) in 760 ms. (525 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (832 resets) in 751 ms. (531 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (820 resets) in 752 ms. (531 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (855 resets) in 749 ms. (533 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (844 resets) in 754 ms. (529 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (847 resets) in 769 ms. (519 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (824 resets) in 778 ms. (513 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (852 resets) in 778 ms. (513 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (843 resets) in 779 ms. (512 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (826 resets) in 761 ms. (524 steps per ms) remains 26/26 properties
// Phase 1: matrix 162 rows 211 cols
[2024-05-20 22:41:35] [INFO ] Computed 63 invariants in 6 ms
[2024-05-20 22:41:35] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 111/150 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 61/211 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 162/373 variables, 211/274 constraints. Problems are: Problem set: 0 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 84/358 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/373 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 358 constraints, problems are : Problem set: 0 solved, 26 unsolved in 2163 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 211/211 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 111/150 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 61/211 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-20 22:41:38] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 162/373 variables, 211/275 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 84/359 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 26/385 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 385 constraints, problems are : Problem set: 0 solved, 26 unsolved in 3289 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 211/211 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 1/1 constraints]
After SMT, in 5492ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 2127 ms.
Support contains 39 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 162/162 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 210 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 161
Applied a total of 2 rules in 26 ms. Remains 210 /211 variables (removed 1) and now considering 161/162 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 210/211 places, 161/162 transitions.
RANDOM walk for 4000000 steps (75476 resets) in 31701 ms. (126 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (834 resets) in 817 ms. (489 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (814 resets) in 827 ms. (483 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (831 resets) in 751 ms. (531 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (815 resets) in 1406 ms. (284 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (813 resets) in 1052 ms. (379 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (846 resets) in 956 ms. (417 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (844 resets) in 774 ms. (516 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (849 resets) in 754 ms. (529 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (838 resets) in 751 ms. (531 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (838 resets) in 749 ms. (533 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (836 resets) in 763 ms. (523 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (839 resets) in 777 ms. (514 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (824 resets) in 780 ms. (512 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (817 resets) in 781 ms. (511 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (828 resets) in 808 ms. (494 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (823 resets) in 795 ms. (502 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (832 resets) in 835 ms. (478 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (836 resets) in 905 ms. (441 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (840 resets) in 1052 ms. (379 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (846 resets) in 937 ms. (426 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (836 resets) in 796 ms. (501 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (834 resets) in 775 ms. (515 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (845 resets) in 777 ms. (514 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (860 resets) in 748 ms. (534 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (829 resets) in 1017 ms. (392 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (831 resets) in 957 ms. (417 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 4521752 steps, run timeout after 45001 ms. (steps per millisecond=100 ) properties seen :13 out of 26
Probabilistic random walk after 4521752 steps, saw 1188700 distinct states, run finished after 45011 ms. (steps per millisecond=100 ) properties seen :13
// Phase 1: matrix 161 rows 210 cols
[2024-05-20 22:42:43] [INFO ] Computed 63 invariants in 3 ms
[2024-05-20 22:42:43] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 122/148 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 62/210 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 161/371 variables, 210/273 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 84/357 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/371 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 357 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1091 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 210/210 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 122/148 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 62/210 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 161/371 variables, 210/273 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 84/357 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 13/370 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 370 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1815 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 210/210 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 2926ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 9666 ms.
Support contains 26 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 161/161 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 160
Applied a total of 2 rules in 36 ms. Remains 209 /210 variables (removed 1) and now considering 160/161 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 209/210 places, 160/161 transitions.
RANDOM walk for 4000000 steps (75356 resets) in 24216 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8384 resets) in 7582 ms. (527 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (8302 resets) in 6707 ms. (596 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8367 resets) in 6755 ms. (592 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8402 resets) in 6742 ms. (593 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8333 resets) in 6752 ms. (592 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (8381 resets) in 6643 ms. (602 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8334 resets) in 6876 ms. (581 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8392 resets) in 6695 ms. (597 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8355 resets) in 6665 ms. (600 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8336 resets) in 6727 ms. (594 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (8394 resets) in 6785 ms. (589 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (8375 resets) in 6808 ms. (587 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4000003 steps (8356 resets) in 6688 ms. (597 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 9415226 steps, run timeout after 87001 ms. (steps per millisecond=108 ) properties seen :0 out of 12
Probabilistic random walk after 9415226 steps, saw 2295602 distinct states, run finished after 87001 ms. (steps per millisecond=108 ) properties seen :0
// Phase 1: matrix 160 rows 209 cols
[2024-05-20 22:44:52] [INFO ] Computed 63 invariants in 3 ms
[2024-05-20 22:44:52] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 121/145 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 64/209 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 160/369 variables, 209/272 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 84/356 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/369 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 356 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 209/209 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 121/145 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 64/209 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 160/369 variables, 209/272 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 84/356 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 12/368 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 368 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1727 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 209/209 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 2978ms problems are : Problem set: 0 solved, 12 unsolved
Finished Parikh walk after 66 steps, including 0 resets, run visited all 12 properties in 7 ms. (steps per millisecond=9 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 12 properties in 28 ms.
Able to resolve query QuasiLiveness after proving 149 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 232055 ms.
ITS solved all properties within timeout
BK_STOP 1716245095112
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="AutoFlight-PT-12b"
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 AutoFlight-PT-12b, 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 r034-smll-171620174800102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-12b.tgz
mv AutoFlight-PT-12b 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 '
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 ;