Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r007-oct2-167813594900047.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ASLink-PT-03a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813594900047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 8.3K Feb 26 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 357K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678334714427

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 04:05:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 04:05:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 04:05:16] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-09 04:05:16] [INFO ] Transformed 821 places.
[2023-03-09 04:05:16] [INFO ] Transformed 1281 transitions.
[2023-03-09 04:05:16] [INFO ] Found NUPN structural information;
[2023-03-09 04:05:16] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 16) seen :6
FORMULA ASLink-PT-03a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1268 rows 821 cols
[2023-03-09 04:05:17] [INFO ] Computed 156 place invariants in 40 ms
[2023-03-09 04:05:18] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2023-03-09 04:05:18] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 36 ms returned sat
[2023-03-09 04:05:18] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-09 04:05:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2023-03-09 04:05:18] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 38 ms returned sat
[2023-03-09 04:05:34] [INFO ] After 15409ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :3
[2023-03-09 04:05:34] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 7 ms to minimize.
[2023-03-09 04:05:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2023-03-09 04:05:34] [INFO ] After 16025ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :3
Attempting to minimize the solution found.
Minimization took 171 ms.
[2023-03-09 04:05:35] [INFO ] After 16677ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :3
FORMULA ASLink-PT-03a-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 73 ms.
Support contains 7 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 803 transition count 1201
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 152 place count 736 transition count 1201
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 152 place count 736 transition count 1132
Deduced a syphon composed of 69 places in 3 ms
Ensure Unique test removed 27 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 317 place count 640 transition count 1132
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 318 place count 640 transition count 1131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 319 place count 639 transition count 1131
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 325 place count 633 transition count 1102
Ensure Unique test removed 1 places
Iterating global reduction 4 with 7 rules applied. Total rules applied 332 place count 632 transition count 1102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 338 place count 631 transition count 1097
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 341 place count 628 transition count 1097
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 342 place count 627 transition count 1089
Iterating global reduction 6 with 1 rules applied. Total rules applied 343 place count 627 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 344 place count 626 transition count 1081
Iterating global reduction 6 with 1 rules applied. Total rules applied 345 place count 626 transition count 1081
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 346 place count 625 transition count 1073
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 625 transition count 1073
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 348 place count 624 transition count 1065
Iterating global reduction 6 with 1 rules applied. Total rules applied 349 place count 624 transition count 1065
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 350 place count 623 transition count 1057
Iterating global reduction 6 with 1 rules applied. Total rules applied 351 place count 623 transition count 1057
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 352 place count 622 transition count 1049
Iterating global reduction 6 with 1 rules applied. Total rules applied 353 place count 622 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 354 place count 621 transition count 1041
Iterating global reduction 6 with 1 rules applied. Total rules applied 355 place count 621 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 356 place count 620 transition count 1033
Iterating global reduction 6 with 1 rules applied. Total rules applied 357 place count 620 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 358 place count 619 transition count 1025
Iterating global reduction 6 with 1 rules applied. Total rules applied 359 place count 619 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 360 place count 618 transition count 1017
Iterating global reduction 6 with 1 rules applied. Total rules applied 361 place count 618 transition count 1017
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 362 place count 617 transition count 1009
Iterating global reduction 6 with 1 rules applied. Total rules applied 363 place count 617 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 364 place count 616 transition count 1001
Iterating global reduction 6 with 1 rules applied. Total rules applied 365 place count 616 transition count 1001
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 366 place count 615 transition count 993
Iterating global reduction 6 with 1 rules applied. Total rules applied 367 place count 615 transition count 993
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 368 place count 614 transition count 985
Iterating global reduction 6 with 1 rules applied. Total rules applied 369 place count 614 transition count 985
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 370 place count 613 transition count 977
Iterating global reduction 6 with 1 rules applied. Total rules applied 371 place count 613 transition count 977
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 372 place count 612 transition count 969
Iterating global reduction 6 with 1 rules applied. Total rules applied 373 place count 612 transition count 969
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 415 place count 591 transition count 948
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 419 place count 591 transition count 944
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 423 place count 587 transition count 944
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 426 place count 587 transition count 944
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 427 place count 586 transition count 943
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 433 place count 580 transition count 943
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 433 place count 580 transition count 933
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 454 place count 569 transition count 933
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 457 place count 566 transition count 933
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 457 place count 566 transition count 932
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 459 place count 565 transition count 932
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 465 place count 562 transition count 929
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 467 place count 560 transition count 927
Iterating global reduction 9 with 2 rules applied. Total rules applied 469 place count 560 transition count 927
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 471 place count 560 transition count 925
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 473 place count 558 transition count 925
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 476 place count 558 transition count 925
Applied a total of 476 rules in 722 ms. Remains 558 /821 variables (removed 263) and now considering 925/1268 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 723 ms. Remains : 558/821 places, 925/1268 transitions.
Incomplete random walk after 10000 steps, including 146 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 278973 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 278973 steps, saw 117663 distinct states, run finished after 3002 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 925 rows 558 cols
[2023-03-09 04:05:39] [INFO ] Computed 99 place invariants in 21 ms
[2023-03-09 04:05:39] [INFO ] [Real]Absence check using 25 positive place invariants in 5 ms returned sat
[2023-03-09 04:05:39] [INFO ] [Real]Absence check using 25 positive and 74 generalized place invariants in 15 ms returned sat
[2023-03-09 04:05:39] [INFO ] After 291ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-09 04:05:39] [INFO ] After 351ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-09 04:05:39] [INFO ] After 527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 04:05:39] [INFO ] [Nat]Absence check using 25 positive place invariants in 11 ms returned sat
[2023-03-09 04:05:39] [INFO ] [Nat]Absence check using 25 positive and 74 generalized place invariants in 31 ms returned sat
[2023-03-09 04:05:44] [INFO ] After 4878ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 04:05:45] [INFO ] After 5301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-09 04:05:45] [INFO ] After 5750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 20 ms.
Support contains 7 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 925/925 transitions.
Applied a total of 0 rules in 25 ms. Remains 558 /558 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 558/558 places, 925/925 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 925/925 transitions.
Applied a total of 0 rules in 21 ms. Remains 558 /558 variables (removed 0) and now considering 925/925 (removed 0) transitions.
[2023-03-09 04:05:45] [INFO ] Invariant cache hit.
[2023-03-09 04:05:45] [INFO ] Implicit Places using invariants in 358 ms returned [0, 18, 19, 30, 48, 66, 141, 150, 151, 152, 170, 188, 262, 266, 267, 278, 279, 280, 298, 316, 385, 389, 390, 393, 404, 405, 406, 424, 426, 429, 447, 448, 449, 450, 462, 468, 474, 480, 486, 492, 498, 504, 510, 516, 522]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 361 ms to find 45 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 513/558 places, 925/925 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 513 transition count 854
Reduce places removed 71 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 74 rules applied. Total rules applied 145 place count 442 transition count 851
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 148 place count 439 transition count 851
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 148 place count 439 transition count 832
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 39 rules applied. Total rules applied 187 place count 419 transition count 832
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 199 place count 415 transition count 824
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 207 place count 407 transition count 824
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 223 place count 391 transition count 808
Iterating global reduction 5 with 16 rules applied. Total rules applied 239 place count 391 transition count 808
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 243 place count 391 transition count 804
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 243 place count 391 transition count 803
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 245 place count 390 transition count 803
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 248 place count 387 transition count 800
Iterating global reduction 6 with 3 rules applied. Total rules applied 251 place count 387 transition count 800
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 252 place count 386 transition count 799
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 386 transition count 799
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 254 place count 385 transition count 798
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 385 transition count 798
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 319 place count 353 transition count 766
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 320 place count 353 transition count 765
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 321 place count 352 transition count 764
Iterating global reduction 7 with 1 rules applied. Total rules applied 322 place count 352 transition count 764
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 323 place count 352 transition count 763
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 330 place count 352 transition count 756
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 338 place count 344 transition count 756
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 348 place count 344 transition count 756
Applied a total of 348 rules in 123 ms. Remains 344 /513 variables (removed 169) and now considering 756/925 (removed 169) transitions.
// Phase 1: matrix 756 rows 344 cols
[2023-03-09 04:05:46] [INFO ] Computed 48 place invariants in 23 ms
[2023-03-09 04:05:46] [INFO ] Implicit Places using invariants in 259 ms returned [90, 96, 99, 101, 110, 111, 163, 180, 186, 189, 191, 200, 201, 253, 270, 276, 279, 281]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 260 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 326/558 places, 756/925 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 317 transition count 747
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 317 transition count 747
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 314 transition count 744
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 314 transition count 744
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 34 place count 309 transition count 739
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 43 place count 309 transition count 730
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 52 place count 300 transition count 730
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 300 transition count 728
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 298 transition count 728
Applied a total of 56 rules in 60 ms. Remains 298 /326 variables (removed 28) and now considering 728/756 (removed 28) transitions.
// Phase 1: matrix 728 rows 298 cols
[2023-03-09 04:05:46] [INFO ] Computed 30 place invariants in 8 ms
[2023-03-09 04:05:46] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-09 04:05:46] [INFO ] Invariant cache hit.
[2023-03-09 04:05:47] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 298/558 places, 728/925 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1576 ms. Remains : 298/558 places, 728/925 transitions.
Incomplete random walk after 10000 steps, including 203 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :1
FORMULA ASLink-PT-03a-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 78 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 04:05:47] [INFO ] Invariant cache hit.
[2023-03-09 04:05:47] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-09 04:05:47] [INFO ] [Real]Absence check using 10 positive and 20 generalized place invariants in 8 ms returned sat
[2023-03-09 04:05:47] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 04:05:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 04:05:47] [INFO ] [Nat]Absence check using 10 positive and 20 generalized place invariants in 59 ms returned sat
[2023-03-09 04:05:48] [INFO ] After 773ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 04:05:57] [INFO ] After 9899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-09 04:05:57] [INFO ] After 10088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 5 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 728/728 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 298 transition count 727
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 297 transition count 727
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 296 transition count 727
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 295 transition count 726
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 295 transition count 725
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 294 transition count 724
Applied a total of 8 rules in 75 ms. Remains 294 /298 variables (removed 4) and now considering 724/728 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 294/298 places, 724/728 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 331383 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 331383 steps, saw 238625 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 724 rows 294 cols
[2023-03-09 04:06:00] [INFO ] Computed 29 place invariants in 4 ms
[2023-03-09 04:06:01] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 04:06:01] [INFO ] [Real]Absence check using 8 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-09 04:06:01] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 04:06:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 04:06:01] [INFO ] [Nat]Absence check using 8 positive and 21 generalized place invariants in 25 ms returned sat
[2023-03-09 04:06:08] [INFO ] After 7022ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 04:06:08] [INFO ] After 7306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 287 ms.
[2023-03-09 04:06:08] [INFO ] After 7721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 724/724 transitions.
Applied a total of 0 rules in 11 ms. Remains 294 /294 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 294/294 places, 724/724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 724/724 transitions.
Applied a total of 0 rules in 11 ms. Remains 294 /294 variables (removed 0) and now considering 724/724 (removed 0) transitions.
[2023-03-09 04:06:09] [INFO ] Invariant cache hit.
[2023-03-09 04:06:09] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-09 04:06:09] [INFO ] Invariant cache hit.
[2023-03-09 04:06:09] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
[2023-03-09 04:06:09] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-09 04:06:09] [INFO ] Invariant cache hit.
[2023-03-09 04:06:10] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1105 ms. Remains : 294/294 places, 724/724 transitions.
Applied a total of 0 rules in 8 ms. Remains 294 /294 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-09 04:06:10] [INFO ] Invariant cache hit.
[2023-03-09 04:06:10] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 04:06:10] [INFO ] [Real]Absence check using 8 positive and 21 generalized place invariants in 6 ms returned sat
[2023-03-09 04:06:10] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 04:06:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 04:06:10] [INFO ] [Nat]Absence check using 8 positive and 21 generalized place invariants in 43 ms returned sat
[2023-03-09 04:06:11] [INFO ] After 624ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 04:06:11] [INFO ] After 1071ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6342 ms.
[2023-03-09 04:06:17] [INFO ] After 7549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-09 04:06:17] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 13 ms.
[2023-03-09 04:06:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 294 places, 724 transitions and 2930 arcs took 9 ms.
[2023-03-09 04:06:18] [INFO ] Flatten gal took : 91 ms
Total runtime 62011 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ASLink-PT-03a
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
ReachabilityFireability

FORMULA ASLink-PT-03a-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-03a-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-03a-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678334778749

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 13 (type EXCL) for 0 ASLink-PT-03a-ReachabilityFireability-03
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 0 ASLink-PT-03a-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 0 ASLink-PT-03a-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 12 (type SRCH) for 0 ASLink-PT-03a-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 12 (type SRCH) for ASLink-PT-03a-ReachabilityFireability-03
lola: result : true
lola: markings : 102
lola: fired transitions : 101
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 9 (type FNDP) for ASLink-PT-03a-ReachabilityFireability-03 (obsolete)
lola: CANCELED task # 10 (type EQUN) for ASLink-PT-03a-ReachabilityFireability-03 (obsolete)
lola: CANCELED task # 13 (type EXCL) for ASLink-PT-03a-ReachabilityFireability-03 (obsolete)
lola: LAUNCH task # 20 (type EXCL) for 6 ASLink-PT-03a-ReachabilityFireability-14
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type FNDP) for 6 ASLink-PT-03a-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 6 ASLink-PT-03a-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type SRCH) for 6 ASLink-PT-03a-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 9 (type FNDP) for ASLink-PT-03a-ReachabilityFireability-03
lola: result : true
lola: fired transitions : 100
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 16 (type FNDP) for ASLink-PT-03a-ReachabilityFireability-14
lola: result : true
lola: fired transitions : 50
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 17 (type EQUN) for ASLink-PT-03a-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 19 (type SRCH) for ASLink-PT-03a-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 20 (type EXCL) for ASLink-PT-03a-ReachabilityFireability-14 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 26 (type EXCL) for 3 ASLink-PT-03a-ReachabilityFireability-09
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 22 (type FNDP) for 3 ASLink-PT-03a-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type EQUN) for 3 ASLink-PT-03a-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type SRCH) for 3 ASLink-PT-03a-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 22 (type FNDP) for ASLink-PT-03a-ReachabilityFireability-09
lola: result : true
lola: fired transitions : 67
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 23 (type EQUN) for ASLink-PT-03a-ReachabilityFireability-09 (obsolete)
lola: CANCELED task # 25 (type SRCH) for ASLink-PT-03a-ReachabilityFireability-09 (obsolete)
lola: CANCELED task # 26 (type EXCL) for ASLink-PT-03a-ReachabilityFireability-09 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ASLink-PT-03a-ReachabilityFireability-03: EF true tandem / insertion
ASLink-PT-03a-ReachabilityFireability-09: EF true findpath
ASLink-PT-03a-ReachabilityFireability-14: AG false findpath


Time elapsed: 0 secs. Pages in use: 2

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="ASLink-PT-03a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5348"
echo " Executing tool lolaxred"
echo " Input is ASLink-PT-03a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-oct2-167813594900047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-03a.tgz
mv ASLink-PT-03a execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;