About the Execution of GreatSPN+red for DBSingleClientW-PT-d1m10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1980.644 | 216901.00 | 377590.00 | 695.10 | 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.r100-tall-171624200700337.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 DBSingleClientW-PT-d1m10, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-tall-171624200700337
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K 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 1716365272196
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d1m10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:07:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-22 08:07:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:07:53] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-22 08:07:53] [INFO ] Transformed 1440 places.
[2024-05-22 08:07:53] [INFO ] Transformed 672 transitions.
[2024-05-22 08:07:53] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 224 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1440/1440 places, 672/672 transitions.
Reduce places removed 1114 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1194 place count 326 transition count 592
Applied a total of 1194 rules in 37 ms. Remains 326 /1440 variables (removed 1114) and now considering 592/672 (removed 80) transitions.
// Phase 1: matrix 592 rows 326 cols
[2024-05-22 08:07:53] [INFO ] Computed 2 invariants in 35 ms
[2024-05-22 08:07:54] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-22 08:07:54] [INFO ] Invariant cache hit.
[2024-05-22 08:07:54] [INFO ] State equation strengthened by 338 read => feed constraints.
[2024-05-22 08:07:55] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 1784 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-05-22 08:07:55] [INFO ] Invariant cache hit.
[2024-05-22 08:07:55] [INFO ] State equation strengthened by 338 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/326 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (OVERLAPS) 592/918 variables, 326/328 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/918 variables, 338/666 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/918 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 918/918 variables, and 666 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 326/326 constraints, ReadFeed: 338/338 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/326 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (OVERLAPS) 592/918 variables, 326/328 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/918 variables, 338/666 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/918 variables, 591/1257 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 918/918 variables, and 1257 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 326/326 constraints, ReadFeed: 338/338 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 0/0 constraints]
After SMT, in 62188ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 62214ms
Starting structural reductions in LIVENESS mode, iteration 1 : 326/1440 places, 592/672 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 64116 ms. Remains : 326/1440 places, 592/672 transitions.
Discarding 275 transitions out of 592. Remains 317
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (9232 resets) in 2973 ms. (13 steps per ms) remains 258/316 properties
BEST_FIRST walk for 403 steps (20 resets) in 21 ms. (18 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (25 resets) in 14 ms. (26 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (21 resets) in 11 ms. (33 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (19 resets) in 21 ms. (18 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (19 resets) in 17 ms. (22 steps per ms) remains 258/258 properties
BEST_FIRST walk for 404 steps (19 resets) in 24 ms. (16 steps per ms) remains 258/258 properties
BEST_FIRST walk for 402 steps (21 resets) in 18 ms. (21 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (21 resets) in 23 ms. (16 steps per ms) remains 258/258 properties
BEST_FIRST walk for 401 steps (15 resets) in 21 ms. (18 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (18 resets) in 22 ms. (17 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (20 resets) in 19 ms. (20 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (21 resets) in 24 ms. (16 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (17 resets) in 21 ms. (18 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (20 resets) in 24 ms. (16 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (20 resets) in 21 ms. (18 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (15 resets) in 30 ms. (13 steps per ms) remains 258/258 properties
BEST_FIRST walk for 402 steps (26 resets) in 30 ms. (12 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (21 resets) in 32 ms. (12 steps per ms) remains 258/258 properties
BEST_FIRST walk for 404 steps (21 resets) in 7 ms. (50 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (17 resets) in 8 ms. (44 steps per ms) remains 258/258 properties
BEST_FIRST walk for 404 steps (21 resets) in 10 ms. (36 steps per ms) remains 258/258 properties
BEST_FIRST walk for 404 steps (22 resets) in 7 ms. (50 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (18 resets) in 7 ms. (50 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (16 resets) in 5 ms. (67 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (15 resets) in 6 ms. (57 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (22 resets) in 5 ms. (67 steps per ms) remains 258/258 properties
BEST_FIRST walk for 402 steps (23 resets) in 8 ms. (44 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (18 resets) in 8 ms. (44 steps per ms) remains 258/258 properties
BEST_FIRST walk for 404 steps (23 resets) in 8 ms. (44 steps per ms) remains 258/258 properties
BEST_FIRST walk for 401 steps (22 resets) in 9 ms. (40 steps per ms) remains 258/258 properties
BEST_FIRST walk for 402 steps (25 resets) in 18 ms. (21 steps per ms) remains 258/258 properties
BEST_FIRST walk for 404 steps (15 resets) in 5 ms. (67 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (17 resets) in 8 ms. (44 steps per ms) remains 258/258 properties
BEST_FIRST walk for 404 steps (16 resets) in 7 ms. (50 steps per ms) remains 258/258 properties
BEST_FIRST walk for 401 steps (21 resets) in 7 ms. (50 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (16 resets) in 7 ms. (50 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (24 resets) in 6 ms. (57 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (20 resets) in 6 ms. (57 steps per ms) remains 258/258 properties
BEST_FIRST walk for 402 steps (25 resets) in 7 ms. (50 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (14 resets) in 7 ms. (50 steps per ms) remains 258/258 properties
BEST_FIRST walk for 402 steps (19 resets) in 5 ms. (67 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (18 resets) in 7 ms. (50 steps per ms) remains 258/258 properties
BEST_FIRST walk for 402 steps (19 resets) in 8 ms. (44 steps per ms) remains 258/258 properties
BEST_FIRST walk for 401 steps (18 resets) in 7 ms. (50 steps per ms) remains 258/258 properties
BEST_FIRST walk for 404 steps (20 resets) in 7 ms. (50 steps per ms) remains 258/258 properties
BEST_FIRST walk for 404 steps (19 resets) in 7 ms. (50 steps per ms) remains 258/258 properties
BEST_FIRST walk for 402 steps (18 resets) in 5 ms. (67 steps per ms) remains 258/258 properties
BEST_FIRST walk for 403 steps (20 resets) in 7 ms. (50 steps per ms) remains 258/258 properties
BEST_FIRST walk for 402 steps (23 resets) in 7 ms. (50 steps per ms) remains 258/258 properties
BEST_FIRST walk for 401 steps (19 resets) in 7 ms. (50 steps per ms) remains 258/258 properties
[2024-05-22 08:08:58] [INFO ] Invariant cache hit.
[2024-05-22 08:08:58] [INFO ] State equation strengthened by 338 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 19/287 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 25/312 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
(s125 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/918 variables, and 2 constraints, problems are : Problem set: 0 solved, 258 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/326 constraints, ReadFeed: 0/338 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 19/287 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 25/312 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 578/890 variables, 312/314 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 324/638 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 890/918 variables, and 694 constraints, problems are : Problem set: 0 solved, 258 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 312/326 constraints, ReadFeed: 324/338 constraints, PredecessorRefiner: 56/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 10765ms problems are : Problem set: 0 solved, 258 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 268 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 592/592 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 322 transition count 588
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 322 transition count 588
Applied a total of 8 rules in 76 ms. Remains 322 /326 variables (removed 4) and now considering 588/592 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 322/326 places, 588/592 transitions.
RANDOM walk for 4000000 steps (916641 resets) in 72340 ms. (55 steps per ms) remains 221/258 properties
BEST_FIRST walk for 40003 steps (1864 resets) in 281 ms. (141 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (1847 resets) in 282 ms. (141 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40001 steps (1841 resets) in 218 ms. (182 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (1913 resets) in 268 ms. (148 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1940 resets) in 283 ms. (140 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1938 resets) in 231 ms. (172 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (1946 resets) in 219 ms. (181 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (1878 resets) in 225 ms. (177 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (1806 resets) in 272 ms. (146 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (1925 resets) in 233 ms. (170 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1848 resets) in 218 ms. (182 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1908 resets) in 224 ms. (177 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1826 resets) in 230 ms. (173 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1928 resets) in 233 ms. (170 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1928 resets) in 290 ms. (137 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1831 resets) in 207 ms. (192 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1910 resets) in 272 ms. (146 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1849 resets) in 219 ms. (181 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (1897 resets) in 256 ms. (155 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (1858 resets) in 277 ms. (143 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (1853 resets) in 213 ms. (186 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (1935 resets) in 253 ms. (157 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (1839 resets) in 213 ms. (186 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (1876 resets) in 219 ms. (181 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40000 steps (1873 resets) in 226 ms. (176 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1845 resets) in 212 ms. (187 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1914 resets) in 271 ms. (147 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (1865 resets) in 254 ms. (156 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (1882 resets) in 221 ms. (180 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40001 steps (1905 resets) in 286 ms. (139 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (1935 resets) in 244 ms. (163 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (1826 resets) in 213 ms. (186 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (1866 resets) in 274 ms. (145 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (1893 resets) in 275 ms. (144 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (1877 resets) in 274 ms. (145 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (1910 resets) in 280 ms. (142 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (1861 resets) in 273 ms. (146 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1847 resets) in 293 ms. (136 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (1853 resets) in 251 ms. (158 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (1867 resets) in 235 ms. (169 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (1896 resets) in 224 ms. (177 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (1835 resets) in 231 ms. (172 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1852 resets) in 225 ms. (177 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (1911 resets) in 218 ms. (182 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1879 resets) in 218 ms. (182 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1865 resets) in 254 ms. (156 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1956 resets) in 220 ms. (181 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (1865 resets) in 249 ms. (160 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40001 steps (1839 resets) in 286 ms. (139 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40001 steps (1876 resets) in 247 ms. (161 steps per ms) remains 221/221 properties
// Phase 1: matrix 588 rows 322 cols
[2024-05-22 08:09:35] [INFO ] Computed 2 invariants in 7 ms
[2024-05-22 08:09:35] [INFO ] State equation strengthened by 338 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 28/263 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 34/297 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 561/858 variables, 297/299 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/858 variables, 311/610 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/858 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 52/910 variables, 25/635 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/910 variables, 27/662 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/910 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/910 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 910/910 variables, and 662 constraints, problems are : Problem set: 0 solved, 221 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 322/322 constraints, ReadFeed: 338/338 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 28/263 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 34/297 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 561/858 variables, 297/299 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/858 variables, 311/610 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/858 variables, 39/649 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 08:10:31] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 24 ms to minimize.
[2024-05-22 08:10:32] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 3 ms to minimize.
[2024-05-22 08:10:32] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 12 ms to minimize.
[2024-05-22 08:10:32] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 1 ms to minimize.
[2024-05-22 08:10:32] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 3 ms to minimize.
[2024-05-22 08:10:32] [INFO ] Deduced a trap composed of 101 places in 76 ms of which 2 ms to minimize.
[2024-05-22 08:10:32] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 1 ms to minimize.
[2024-05-22 08:10:32] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 2 ms to minimize.
[2024-05-22 08:10:33] [INFO ] Deduced a trap composed of 106 places in 80 ms of which 2 ms to minimize.
[2024-05-22 08:10:33] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-22 08:10:33] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-05-22 08:10:33] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 2 ms to minimize.
[2024-05-22 08:10:34] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2024-05-22 08:10:34] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-05-22 08:10:34] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 6 ms to minimize.
[2024-05-22 08:10:34] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2024-05-22 08:10:34] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 2 ms to minimize.
[2024-05-22 08:10:34] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 6 ms to minimize.
[2024-05-22 08:10:35] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 2 ms to minimize.
[2024-05-22 08:10:35] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/858 variables, 20/669 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 08:10:43] [INFO ] Deduced a trap composed of 114 places in 71 ms of which 2 ms to minimize.
[2024-05-22 08:10:43] [INFO ] Deduced a trap composed of 114 places in 66 ms of which 1 ms to minimize.
[2024-05-22 08:10:43] [INFO ] Deduced a trap composed of 112 places in 73 ms of which 2 ms to minimize.
[2024-05-22 08:10:43] [INFO ] Deduced a trap composed of 105 places in 89 ms of which 2 ms to minimize.
[2024-05-22 08:10:43] [INFO ] Deduced a trap composed of 108 places in 78 ms of which 1 ms to minimize.
[2024-05-22 08:10:43] [INFO ] Deduced a trap composed of 106 places in 81 ms of which 2 ms to minimize.
[2024-05-22 08:10:43] [INFO ] Deduced a trap composed of 108 places in 78 ms of which 2 ms to minimize.
[2024-05-22 08:10:43] [INFO ] Deduced a trap composed of 109 places in 82 ms of which 1 ms to minimize.
[2024-05-22 08:10:43] [INFO ] Deduced a trap composed of 105 places in 86 ms of which 2 ms to minimize.
[2024-05-22 08:10:43] [INFO ] Deduced a trap composed of 104 places in 82 ms of which 1 ms to minimize.
[2024-05-22 08:10:43] [INFO ] Deduced a trap composed of 102 places in 77 ms of which 2 ms to minimize.
[2024-05-22 08:10:44] [INFO ] Deduced a trap composed of 108 places in 83 ms of which 1 ms to minimize.
[2024-05-22 08:10:44] [INFO ] Deduced a trap composed of 111 places in 81 ms of which 1 ms to minimize.
[2024-05-22 08:10:44] [INFO ] Deduced a trap composed of 109 places in 77 ms of which 2 ms to minimize.
[2024-05-22 08:10:44] [INFO ] Deduced a trap composed of 112 places in 78 ms of which 1 ms to minimize.
[2024-05-22 08:10:44] [INFO ] Deduced a trap composed of 108 places in 82 ms of which 2 ms to minimize.
[2024-05-22 08:10:44] [INFO ] Deduced a trap composed of 109 places in 81 ms of which 1 ms to minimize.
[2024-05-22 08:10:44] [INFO ] Deduced a trap composed of 108 places in 76 ms of which 2 ms to minimize.
[2024-05-22 08:10:44] [INFO ] Deduced a trap composed of 111 places in 84 ms of which 2 ms to minimize.
[2024-05-22 08:10:44] [INFO ] Deduced a trap composed of 109 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/858 variables, 20/689 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 08:10:53] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2024-05-22 08:10:53] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-05-22 08:10:53] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-05-22 08:10:53] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-05-22 08:10:53] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-05-22 08:10:53] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-22 08:10:53] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-22 08:10:53] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-22 08:10:54] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-05-22 08:10:54] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-22 08:10:54] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-05-22 08:10:54] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-22 08:10:54] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-05-22 08:10:54] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-22 08:10:54] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-22 08:10:55] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
[2024-05-22 08:10:55] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-22 08:10:55] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-22 08:10:55] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-22 08:10:55] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/858 variables, 20/709 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 08:11:05] [INFO ] Deduced a trap composed of 114 places in 59 ms of which 2 ms to minimize.
[2024-05-22 08:11:05] [INFO ] Deduced a trap composed of 115 places in 57 ms of which 2 ms to minimize.
[2024-05-22 08:11:05] [INFO ] Deduced a trap composed of 115 places in 59 ms of which 2 ms to minimize.
[2024-05-22 08:11:05] [INFO ] Deduced a trap composed of 116 places in 60 ms of which 2 ms to minimize.
[2024-05-22 08:11:05] [INFO ] Deduced a trap composed of 119 places in 59 ms of which 1 ms to minimize.
SMT process timed out in 90514ms, After SMT, problems are : Problem set: 0 solved, 221 unsolved
Fused 221 Parikh solutions to 66 different solutions.
Parikh walk visited 0 properties in 3335 ms.
Support contains 235 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 588/588 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 315 transition count 563
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 315 transition count 563
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 310 transition count 558
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 310 transition count 558
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 307 transition count 555
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 307 transition count 555
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 307 transition count 553
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 306 transition count 551
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 306 transition count 551
Applied a total of 34 rules in 44 ms. Remains 306 /322 variables (removed 16) and now considering 551/588 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 306/322 places, 551/588 transitions.
RANDOM walk for 4000000 steps (917113 resets) in 54850 ms. (72 steps per ms) remains 213/221 properties
BEST_FIRST walk for 40003 steps (1892 resets) in 177 ms. (224 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40001 steps (1912 resets) in 169 ms. (235 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40001 steps (1804 resets) in 165 ms. (240 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (1852 resets) in 165 ms. (240 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (1921 resets) in 220 ms. (181 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (1875 resets) in 172 ms. (231 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40001 steps (1839 resets) in 167 ms. (238 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (1843 resets) in 175 ms. (227 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (1854 resets) in 175 ms. (227 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (1844 resets) in 167 ms. (238 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (1892 resets) in 170 ms. (233 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (1816 resets) in 175 ms. (227 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (1864 resets) in 170 ms. (233 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (1907 resets) in 240 ms. (165 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (1940 resets) in 225 ms. (177 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (1851 resets) in 351 ms. (113 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (1881 resets) in 240 ms. (165 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (1884 resets) in 238 ms. (167 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (1894 resets) in 249 ms. (160 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (1845 resets) in 307 ms. (129 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (1858 resets) in 252 ms. (158 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40001 steps (1890 resets) in 308 ms. (129 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (1900 resets) in 269 ms. (148 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (1807 resets) in 274 ms. (145 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (1912 resets) in 254 ms. (156 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (1845 resets) in 260 ms. (153 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (1890 resets) in 245 ms. (162 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (1908 resets) in 279 ms. (142 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (1843 resets) in 306 ms. (130 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40001 steps (1889 resets) in 276 ms. (144 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (1826 resets) in 259 ms. (153 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (1846 resets) in 264 ms. (150 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (1844 resets) in 287 ms. (138 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (1848 resets) in 277 ms. (143 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (1881 resets) in 242 ms. (164 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (1871 resets) in 273 ms. (146 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40000 steps (1867 resets) in 267 ms. (149 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (1826 resets) in 260 ms. (153 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40000 steps (1878 resets) in 281 ms. (141 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (1820 resets) in 216 ms. (184 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (1865 resets) in 290 ms. (137 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40001 steps (1866 resets) in 280 ms. (142 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (1920 resets) in 235 ms. (169 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (1881 resets) in 467 ms. (85 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (1859 resets) in 268 ms. (148 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (1845 resets) in 378 ms. (105 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (1821 resets) in 255 ms. (156 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (1890 resets) in 251 ms. (158 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40001 steps (1886 resets) in 252 ms. (158 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (1910 resets) in 319 ms. (125 steps per ms) remains 213/213 properties
Finished probabilistic random walk after 123896 steps, run visited all 213 properties in 1504 ms. (steps per millisecond=82 )
Probabilistic random walk after 123896 steps, saw 52229 distinct states, run finished after 1508 ms. (steps per millisecond=82 ) properties seen :213
Able to resolve query QuasiLiveness after proving 317 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 215763 ms.
ITS solved all properties within timeout
BK_STOP 1716365489097
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="DBSingleClientW-PT-d1m10"
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 DBSingleClientW-PT-d1m10, 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 r100-tall-171624200700337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m10.tgz
mv DBSingleClientW-PT-d1m10 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 ;