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.r386-smll-171683818600072.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 SieveSingleMsgMbox-PT-d2m18, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r386-smll-171683818600072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 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 1716892740003

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SieveSingleMsgMbox-PT-d2m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 10:39:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-28 10:39:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:39:02] [INFO ] Load time of PNML (sax parser for PT used): 585 ms
[2024-05-28 10:39:02] [INFO ] Transformed 2398 places.
[2024-05-28 10:39:02] [INFO ] Transformed 1954 transitions.
[2024-05-28 10:39:02] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 859 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2398/2398 places, 1954/1954 transitions.
Reduce places removed 2009 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 2837 rules applied. Total rules applied 2837 place count 389 transition count 1126
Applied a total of 2837 rules in 110 ms. Remains 389 /2398 variables (removed 2009) and now considering 1126/1954 (removed 828) transitions.
// Phase 1: matrix 1126 rows 389 cols
[2024-05-28 10:39:03] [INFO ] Computed 5 invariants in 58 ms
[2024-05-28 10:39:04] [INFO ] Implicit Places using invariants in 1267 ms returned []
[2024-05-28 10:39:04] [INFO ] Invariant cache hit.
[2024-05-28 10:39:05] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-28 10:39:10] [INFO ] Implicit Places using invariants and state equation in 5653 ms returned []
Implicit Place search using SMT with State Equation took 6976 ms to find 0 implicit places.
Running 1125 sub problems to find dead transitions.
[2024-05-28 10:39:10] [INFO ] Invariant cache hit.
[2024-05-28 10:39:10] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.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 timeout
0.0)
(s85 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/389 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 389/1515 variables, and 5 constraints, problems are : Problem set: 0 solved, 1125 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/389 constraints, ReadFeed: 0/846 constraints, PredecessorRefiner: 1125/1125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
At refinement iteration 3 (OVERLAPS) 1/389 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
[2024-05-28 10:40:09] [INFO ] Deduced a trap composed of 42 places in 262 ms of which 47 ms to minimize.
[2024-05-28 10:40:09] [INFO ] Deduced a trap composed of 42 places in 285 ms of which 7 ms to minimize.
[2024-05-28 10:40:10] [INFO ] Deduced a trap composed of 41 places in 408 ms of which 6 ms to minimize.
[2024-05-28 10:40:10] [INFO ] Deduced a trap composed of 42 places in 253 ms of which 6 ms to minimize.
[2024-05-28 10:40:10] [INFO ] Deduced a trap composed of 109 places in 224 ms of which 5 ms to minimize.
[2024-05-28 10:40:10] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 5 ms to minimize.
[2024-05-28 10:40:10] [INFO ] Deduced a trap composed of 110 places in 200 ms of which 7 ms to minimize.
[2024-05-28 10:40:11] [INFO ] Deduced a trap composed of 109 places in 194 ms of which 5 ms to minimize.
[2024-05-28 10:40:11] [INFO ] Deduced a trap composed of 117 places in 251 ms of which 4 ms to minimize.
[2024-05-28 10:40:11] [INFO ] Deduced a trap composed of 117 places in 246 ms of which 4 ms to minimize.
[2024-05-28 10:40:12] [INFO ] Deduced a trap composed of 117 places in 214 ms of which 4 ms to minimize.
[2024-05-28 10:40:12] [INFO ] Deduced a trap composed of 117 places in 195 ms of which 3 ms to minimize.
[2024-05-28 10:40:12] [INFO ] Deduced a trap composed of 117 places in 241 ms of which 5 ms to minimize.
[2024-05-28 10:40:12] [INFO ] Deduced a trap composed of 117 places in 283 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 0)
(s299 1)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 1)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 1)
(s316 0)
(s317 1)
(s318 0)
(s319 1)
(s320 0)
(s321 1)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 1)
(s332 1)
(s333 0)
(s334 0)
(s335 0)
(s336 2)
(s337 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/1515 variables, and 19 constraints, problems are : Problem set: 0 solved, 1125 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/389 constraints, ReadFeed: 0/846 constraints, PredecessorRefiner: 0/1125 constraints, Known Traps: 14/14 constraints]
After SMT, in 66305ms problems are : Problem set: 0 solved, 1125 unsolved
Search for dead transitions found 0 dead transitions in 66357ms
Starting structural reductions in LIVENESS mode, iteration 1 : 389/2398 places, 1126/1954 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 73502 ms. Remains : 389/2398 places, 1126/1954 transitions.
Discarding 748 transitions out of 1126. Remains 378
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8802 resets) in 5382 ms. (7 steps per ms) remains 352/377 properties
BEST_FIRST walk for 404 steps (17 resets) in 17 ms. (22 steps per ms) remains 352/352 properties
BEST_FIRST walk for 401 steps (22 resets) in 16 ms. (23 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (17 resets) in 13 ms. (28 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (14 resets) in 25 ms. (15 steps per ms) remains 352/352 properties
BEST_FIRST walk for 404 steps (18 resets) in 42 ms. (9 steps per ms) remains 352/352 properties
BEST_FIRST walk for 400 steps (27 resets) in 30 ms. (12 steps per ms) remains 352/352 properties
BEST_FIRST walk for 402 steps (23 resets) in 31 ms. (12 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (14 resets) in 35 ms. (11 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (17 resets) in 23 ms. (16 steps per ms) remains 352/352 properties
BEST_FIRST walk for 404 steps (13 resets) in 19 ms. (20 steps per ms) remains 352/352 properties
BEST_FIRST walk for 404 steps (18 resets) in 15 ms. (25 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (24 resets) in 21 ms. (18 steps per ms) remains 352/352 properties
BEST_FIRST walk for 404 steps (17 resets) in 17 ms. (22 steps per ms) remains 352/352 properties
BEST_FIRST walk for 404 steps (13 resets) in 19 ms. (20 steps per ms) remains 352/352 properties
BEST_FIRST walk for 404 steps (20 resets) in 16 ms. (23 steps per ms) remains 352/352 properties
BEST_FIRST walk for 404 steps (26 resets) in 19 ms. (20 steps per ms) remains 352/352 properties
BEST_FIRST walk for 401 steps (20 resets) in 17 ms. (22 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (16 resets) in 21 ms. (18 steps per ms) remains 352/352 properties
BEST_FIRST walk for 401 steps (16 resets) in 14 ms. (26 steps per ms) remains 352/352 properties
BEST_FIRST walk for 401 steps (17 resets) in 15 ms. (25 steps per ms) remains 352/352 properties
BEST_FIRST walk for 404 steps (17 resets) in 18 ms. (21 steps per ms) remains 352/352 properties
BEST_FIRST walk for 404 steps (11 resets) in 18 ms. (21 steps per ms) remains 352/352 properties
BEST_FIRST walk for 404 steps (21 resets) in 17 ms. (22 steps per ms) remains 352/352 properties
BEST_FIRST walk for 402 steps (15 resets) in 15 ms. (25 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (21 resets) in 16 ms. (23 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (17 resets) in 20 ms. (19 steps per ms) remains 352/352 properties
BEST_FIRST walk for 402 steps (23 resets) in 17 ms. (22 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (14 resets) in 14 ms. (26 steps per ms) remains 352/352 properties
BEST_FIRST walk for 404 steps (19 resets) in 13 ms. (28 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (19 resets) in 14 ms. (26 steps per ms) remains 352/352 properties
BEST_FIRST walk for 401 steps (20 resets) in 11 ms. (33 steps per ms) remains 352/352 properties
BEST_FIRST walk for 404 steps (19 resets) in 15 ms. (25 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (22 resets) in 17 ms. (22 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (19 resets) in 14 ms. (26 steps per ms) remains 352/352 properties
BEST_FIRST walk for 402 steps (18 resets) in 16 ms. (23 steps per ms) remains 352/352 properties
BEST_FIRST walk for 404 steps (22 resets) in 13 ms. (28 steps per ms) remains 352/352 properties
BEST_FIRST walk for 402 steps (26 resets) in 15 ms. (25 steps per ms) remains 352/352 properties
BEST_FIRST walk for 402 steps (15 resets) in 29 ms. (13 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (17 resets) in 12 ms. (31 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (19 resets) in 14 ms. (26 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (16 resets) in 13 ms. (28 steps per ms) remains 352/352 properties
BEST_FIRST walk for 402 steps (20 resets) in 15 ms. (25 steps per ms) remains 352/352 properties
BEST_FIRST walk for 404 steps (18 resets) in 12 ms. (31 steps per ms) remains 352/352 properties
BEST_FIRST walk for 404 steps (16 resets) in 16 ms. (23 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (16 resets) in 13 ms. (28 steps per ms) remains 352/352 properties
BEST_FIRST walk for 402 steps (15 resets) in 14 ms. (26 steps per ms) remains 352/352 properties
BEST_FIRST walk for 402 steps (20 resets) in 15 ms. (25 steps per ms) remains 352/352 properties
BEST_FIRST walk for 401 steps (13 resets) in 15 ms. (25 steps per ms) remains 352/352 properties
BEST_FIRST walk for 403 steps (21 resets) in 15 ms. (25 steps per ms) remains 352/352 properties
BEST_FIRST walk for 402 steps (20 resets) in 13 ms. (28 steps per ms) remains 352/352 properties
Interrupted probabilistic random walk after 99273 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :151 out of 352
Probabilistic random walk after 99273 steps, saw 46140 distinct states, run finished after 3020 ms. (steps per millisecond=32 ) properties seen :151
[2024-05-28 10:40:21] [INFO ] Invariant cache hit.
[2024-05-28 10:40:21] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 103/315 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 40/355 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 355/1515 variables, and 5 constraints, problems are : Problem set: 0 solved, 201 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/389 constraints, ReadFeed: 0/846 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 103/315 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 40/355 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 1)
(s238 1)
(s239 0)
(s240 0)
(s241 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/1515 variables, and 5 constraints, problems are : Problem set: 0 solved, 201 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/389 constraints, ReadFeed: 0/846 constraints, PredecessorRefiner: 0/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 10971ms problems are : Problem set: 0 solved, 201 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 212 out of 389 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 389/389 places, 1126/1126 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 359 transition count 958
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 359 transition count 958
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 93 place count 359 transition count 925
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 107 place count 345 transition count 911
Iterating global reduction 1 with 14 rules applied. Total rules applied 121 place count 345 transition count 911
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 122 place count 345 transition count 910
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 127 place count 340 transition count 903
Iterating global reduction 2 with 5 rules applied. Total rules applied 132 place count 340 transition count 903
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 134 place count 340 transition count 901
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 339 transition count 900
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 339 transition count 900
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 338 transition count 899
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 338 transition count 899
Applied a total of 138 rules in 401 ms. Remains 338 /389 variables (removed 51) and now considering 899/1126 (removed 227) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 338/389 places, 899/1126 transitions.
RANDOM walk for 4000000 steps (897657 resets) in 87595 ms. (45 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40001 steps (1930 resets) in 286 ms. (139 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1886 resets) in 287 ms. (138 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1895 resets) in 289 ms. (137 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1888 resets) in 292 ms. (136 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1872 resets) in 296 ms. (134 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1850 resets) in 295 ms. (135 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1904 resets) in 297 ms. (134 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1846 resets) in 293 ms. (136 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1889 resets) in 309 ms. (129 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1799 resets) in 282 ms. (141 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40001 steps (1933 resets) in 313 ms. (127 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1873 resets) in 301 ms. (132 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1910 resets) in 287 ms. (138 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1849 resets) in 288 ms. (138 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1888 resets) in 287 ms. (138 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 291 ms. (136 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1884 resets) in 289 ms. (137 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1892 resets) in 292 ms. (136 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1864 resets) in 287 ms. (138 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1831 resets) in 289 ms. (137 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1870 resets) in 294 ms. (135 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1899 resets) in 294 ms. (135 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1950 resets) in 300 ms. (132 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1869 resets) in 298 ms. (133 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1863 resets) in 298 ms. (133 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1959 resets) in 299 ms. (133 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1911 resets) in 294 ms. (135 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1931 resets) in 291 ms. (136 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1834 resets) in 302 ms. (132 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 301 ms. (132 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1889 resets) in 299 ms. (133 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1877 resets) in 296 ms. (134 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40001 steps (1906 resets) in 292 ms. (136 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1853 resets) in 293 ms. (136 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1805 resets) in 289 ms. (137 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1849 resets) in 299 ms. (133 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1888 resets) in 398 ms. (100 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1865 resets) in 360 ms. (110 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1887 resets) in 361 ms. (110 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1950 resets) in 362 ms. (110 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 348 ms. (114 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1895 resets) in 357 ms. (111 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40001 steps (1883 resets) in 358 ms. (111 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1946 resets) in 337 ms. (118 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1872 resets) in 285 ms. (139 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1957 resets) in 288 ms. (138 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40001 steps (1889 resets) in 366 ms. (108 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1861 resets) in 286 ms. (139 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1941 resets) in 289 ms. (137 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1866 resets) in 409 ms. (97 steps per ms) remains 201/201 properties
Interrupted probabilistic random walk after 3915168 steps, run timeout after 78001 ms. (steps per millisecond=50 ) properties seen :31 out of 201
Probabilistic random walk after 3915168 steps, saw 1808773 distinct states, run finished after 78001 ms. (steps per millisecond=50 ) properties seen :31
// Phase 1: matrix 899 rows 338 cols
[2024-05-28 10:42:17] [INFO ] Computed 5 invariants in 22 ms
[2024-05-28 10:42:17] [INFO ] State equation strengthened by 644 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 79/259 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (OVERLAPS) 39/298 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 10:42:25] [INFO ] Deduced a trap composed of 189 places in 151 ms of which 3 ms to minimize.
[2024-05-28 10:42:25] [INFO ] Deduced a trap composed of 189 places in 145 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 621/919 variables, 298/305 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/919 variables, 366/671 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/919 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 170 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 318/1237 variables, 40/711 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1237 variables, 278/989 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1237/1237 variables, and 989 constraints, problems are : Problem set: 0 solved, 170 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 338/338 constraints, ReadFeed: 644/644 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 79/259 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (OVERLAPS) 39/298 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 621/919 variables, 298/305 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/919 variables, 366/671 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/919 variables, 64/735 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 10:43:20] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/919 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/919 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Problem qltransition_227 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 90451ms, After SMT, problems are : Problem set: 0 solved, 170 unsolved
Fused 170 Parikh solutions to 153 different solutions.
Parikh walk visited 0 properties in 11755 ms.
Support contains 180 out of 338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 899/899 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 321 transition count 642
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 321 transition count 642
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 304 transition count 625
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 304 transition count 625
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 74 place count 304 transition count 619
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 298 transition count 607
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 298 transition count 607
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 90 place count 298 transition count 603
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 297 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 297 transition count 602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 296 transition count 601
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 296 transition count 601
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 295 transition count 600
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 295 transition count 600
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 109 place count 295 transition count 587
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 294 transition count 586
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 294 transition count 586
Applied a total of 111 rules in 99 ms. Remains 294 /338 variables (removed 44) and now considering 586/899 (removed 313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 294/338 places, 586/899 transitions.
Total runtime 297915 ms.
ITS solved all properties within timeout

BK_STOP 1716893039955

--------------------
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="SieveSingleMsgMbox-PT-d2m18"
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 SieveSingleMsgMbox-PT-d2m18, 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 r386-smll-171683818600072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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