fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r309-tall-167873962900397
Last Updated
May 14, 2023

About the Execution of LoLa+red for PolyORBNT-COL-S05J20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4158.447 1800000.00 3402830.00 4377.60 [undef] Time out reached

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.r309-tall-167873962900397.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 PolyORBNT-COL-S05J20, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r309-tall-167873962900397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 23:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 23:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 23:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 23:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K Mar 5 18:23 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 1679443508877

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=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S05J20
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 00:05:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-22 00:05:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:05:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 00:05:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 00:05:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 711 ms
[2023-03-22 00:05:11] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 18 ms.
[2023-03-22 00:05:11] [INFO ] Unfolded HLPN to a Petri net with 369 places and 1230 transitions 8864 arcs in 46 ms.
[2023-03-22 00:05:11] [INFO ] Unfolded 38 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-22 00:05:11] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-22 00:05:11] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-22 00:05:11] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 680 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10001 steps, including 198 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-22 00:05:11] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2023-03-22 00:05:12] [INFO ] Computed 62 place invariants in 41 ms
[2023-03-22 00:05:12] [INFO ] [Real]Absence check using 55 positive place invariants in 31 ms returned sat
[2023-03-22 00:05:12] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:05:12] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:05:12] [INFO ] [Nat]Absence check using 55 positive place invariants in 15 ms returned sat
[2023-03-22 00:05:12] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:05:12] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:05:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:05:12] [INFO ] After 116ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:05:13] [INFO ] Deduced a trap composed of 109 places in 274 ms of which 4 ms to minimize.
[2023-03-22 00:05:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2023-03-22 00:05:13] [INFO ] After 510ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-22 00:05:13] [INFO ] After 1054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 344 transition count 529
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 57 place count 318 transition count 529
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 57 place count 318 transition count 504
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 107 place count 293 transition count 504
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 292 transition count 503
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 292 transition count 503
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 290 transition count 501
Applied a total of 113 rules in 146 ms. Remains 290 /349 variables (removed 59) and now considering 501/555 (removed 54) transitions.
[2023-03-22 00:05:13] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2023-03-22 00:05:13] [INFO ] Computed 57 place invariants in 14 ms
[2023-03-22 00:05:14] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 290/349 places, 406/555 transitions.
Applied a total of 0 rules in 24 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 711 ms. Remains : 290/349 places, 406/555 transitions.
Incomplete random walk after 1000000 steps, including 52035 resets, run finished after 2980 ms. (steps per millisecond=335 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7106 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2906893 steps, run timeout after 9001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 2906893 steps, saw 847512 distinct states, run finished after 9004 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:05:26] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-22 00:05:26] [INFO ] Computed 57 place invariants in 13 ms
[2023-03-22 00:05:27] [INFO ] [Real]Absence check using 50 positive place invariants in 18 ms returned sat
[2023-03-22 00:05:27] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:05:27] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:05:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 00:05:27] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-22 00:05:27] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:05:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:05:27] [INFO ] After 45ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:05:27] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2023-03-22 00:05:27] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2023-03-22 00:05:27] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 0 ms to minimize.
[2023-03-22 00:05:27] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 1 ms to minimize.
[2023-03-22 00:05:28] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:05:28] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 1 ms to minimize.
[2023-03-22 00:05:28] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 1 ms to minimize.
[2023-03-22 00:05:28] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:05:28] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:05:28] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 0 ms to minimize.
[2023-03-22 00:05:28] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 0 ms to minimize.
[2023-03-22 00:05:28] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 0 ms to minimize.
[2023-03-22 00:05:29] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 1 ms to minimize.
[2023-03-22 00:05:29] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 1 ms to minimize.
[2023-03-22 00:05:29] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:05:29] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:05:29] [INFO ] Deduced a trap composed of 107 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:05:29] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 1 ms to minimize.
[2023-03-22 00:05:29] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:05:30] [INFO ] Deduced a trap composed of 105 places in 96 ms of which 1 ms to minimize.
[2023-03-22 00:05:30] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 1 ms to minimize.
[2023-03-22 00:05:30] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 1 ms to minimize.
[2023-03-22 00:05:30] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 0 ms to minimize.
[2023-03-22 00:05:30] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 1 ms to minimize.
[2023-03-22 00:05:30] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:05:31] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 1 ms to minimize.
[2023-03-22 00:05:32] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 0 ms to minimize.
[2023-03-22 00:05:32] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:05:33] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:05:33] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:05:37] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:05:40] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 1 ms to minimize.
[2023-03-22 00:05:40] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 2 ms to minimize.
[2023-03-22 00:05:40] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 1 ms to minimize.
[2023-03-22 00:05:40] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:05:41] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 0 ms to minimize.
[2023-03-22 00:05:41] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 1 ms to minimize.
[2023-03-22 00:05:41] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 0 ms to minimize.
[2023-03-22 00:05:41] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 1 ms to minimize.
[2023-03-22 00:05:41] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:05:41] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:05:42] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 0 ms to minimize.
[2023-03-22 00:05:43] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:05:44] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 1 ms to minimize.
[2023-03-22 00:05:45] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:05:45] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 0 ms to minimize.
[2023-03-22 00:05:50] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 0 ms to minimize.
[2023-03-22 00:05:51] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 1 ms to minimize.
[2023-03-22 00:05:52] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 0 ms to minimize.
[2023-03-22 00:05:54] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 0 ms to minimize.
[2023-03-22 00:05:57] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 0 ms to minimize.
[2023-03-22 00:05:58] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 1 ms to minimize.
[2023-03-22 00:05:59] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:05:59] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 15 ms to minimize.
[2023-03-22 00:05:59] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:06:07] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 1 ms to minimize.
[2023-03-22 00:06:08] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 1 ms to minimize.
[2023-03-22 00:06:09] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 0 ms to minimize.
[2023-03-22 00:06:09] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 0 ms to minimize.
[2023-03-22 00:06:13] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 1 ms to minimize.
[2023-03-22 00:06:16] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:06:16] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 5 ms to minimize.
[2023-03-22 00:06:21] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 4 ms to minimize.
[2023-03-22 00:06:30] [INFO ] Trap strengthening (SAT) tested/added 63/63 trap constraints in 62915 ms
[2023-03-22 00:06:30] [INFO ] After 62992ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:06:30] [INFO ] After 63215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 14 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 13 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-22 00:06:30] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-22 00:06:30] [INFO ] Invariant cache hit.
[2023-03-22 00:06:30] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-22 00:06:30] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-22 00:06:30] [INFO ] Invariant cache hit.
[2023-03-22 00:06:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:06:31] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2023-03-22 00:06:31] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-22 00:06:31] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-22 00:06:31] [INFO ] Invariant cache hit.
[2023-03-22 00:06:31] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1140 ms. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 100000 steps, including 5221 resets, run finished after 423 ms. (steps per millisecond=236 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:06:32] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-22 00:06:32] [INFO ] Invariant cache hit.
[2023-03-22 00:06:32] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 00:06:32] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:06:32] [INFO ] After 97ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:06:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:06:32] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:06:32] [INFO ] After 44ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:06:32] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:06:32] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 00:06:32] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:06:32] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:06:32] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:06:32] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 0 ms to minimize.
[2023-03-22 00:06:32] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2023-03-22 00:06:32] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 1 ms to minimize.
[2023-03-22 00:06:32] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 0 ms to minimize.
[2023-03-22 00:06:32] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:06:33] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:06:33] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 1 ms to minimize.
[2023-03-22 00:06:33] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 1 ms to minimize.
[2023-03-22 00:06:33] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:06:33] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 0 ms to minimize.
[2023-03-22 00:06:33] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:06:33] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2023-03-22 00:06:33] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:06:34] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 1 ms to minimize.
[2023-03-22 00:06:34] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2023-03-22 00:06:34] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:06:34] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 1 ms to minimize.
[2023-03-22 00:06:34] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 1 ms to minimize.
[2023-03-22 00:06:34] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:06:34] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 1 ms to minimize.
[2023-03-22 00:06:34] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 0 ms to minimize.
[2023-03-22 00:06:34] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 0 ms to minimize.
[2023-03-22 00:06:35] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 1 ms to minimize.
[2023-03-22 00:06:35] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 0 ms to minimize.
[2023-03-22 00:06:35] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:06:35] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 1 ms to minimize.
[2023-03-22 00:06:35] [INFO ] Deduced a trap composed of 104 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:06:35] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 1 ms to minimize.
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 1 ms to minimize.
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 1 ms to minimize.
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 0 ms to minimize.
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 0 ms to minimize.
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 0 ms to minimize.
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 0 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 0 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 0 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 0 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 0 ms to minimize.
[2023-03-22 00:06:38] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:06:38] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 1 ms to minimize.
[2023-03-22 00:06:47] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 15157 ms
[2023-03-22 00:06:47] [INFO ] After 15264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:06:47] [INFO ] After 15431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52073 resets, run finished after 2856 ms. (steps per millisecond=350 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7002 resets, run finished after 845 ms. (steps per millisecond=1183 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3007998 steps, run timeout after 9001 ms. (steps per millisecond=334 ) properties seen :{}
Probabilistic random walk after 3007998 steps, saw 877133 distinct states, run finished after 9001 ms. (steps per millisecond=334 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:07:00] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-22 00:07:00] [INFO ] Invariant cache hit.
[2023-03-22 00:07:00] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 00:07:00] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:07:00] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:07:00] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 00:07:00] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:07:00] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:07:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:07:00] [INFO ] After 50ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:07:00] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 0 ms to minimize.
[2023-03-22 00:07:00] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:07:01] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 0 ms to minimize.
[2023-03-22 00:07:01] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:07:01] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 1 ms to minimize.
[2023-03-22 00:07:01] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 0 ms to minimize.
[2023-03-22 00:07:01] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 0 ms to minimize.
[2023-03-22 00:07:01] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:07:01] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 0 ms to minimize.
[2023-03-22 00:07:01] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 0 ms to minimize.
[2023-03-22 00:07:01] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 1 ms to minimize.
[2023-03-22 00:07:02] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 0 ms to minimize.
[2023-03-22 00:07:02] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 1 ms to minimize.
[2023-03-22 00:07:02] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 1 ms to minimize.
[2023-03-22 00:07:02] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 1 ms to minimize.
[2023-03-22 00:07:02] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:07:02] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:07:02] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:07:02] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 0 ms to minimize.
[2023-03-22 00:07:03] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:07:03] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 0 ms to minimize.
[2023-03-22 00:07:03] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 0 ms to minimize.
[2023-03-22 00:07:03] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 1 ms to minimize.
[2023-03-22 00:07:03] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2023-03-22 00:07:03] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 0 ms to minimize.
[2023-03-22 00:07:03] [INFO ] Deduced a trap composed of 104 places in 80 ms of which 0 ms to minimize.
[2023-03-22 00:07:04] [INFO ] Deduced a trap composed of 104 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:07:04] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 0 ms to minimize.
[2023-03-22 00:07:04] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 0 ms to minimize.
[2023-03-22 00:07:04] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 1 ms to minimize.
[2023-03-22 00:07:04] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 0 ms to minimize.
[2023-03-22 00:07:04] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 0 ms to minimize.
[2023-03-22 00:07:04] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:07:05] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 1 ms to minimize.
[2023-03-22 00:07:05] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 0 ms to minimize.
[2023-03-22 00:07:05] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 0 ms to minimize.
[2023-03-22 00:07:05] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 1 ms to minimize.
[2023-03-22 00:07:05] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 0 ms to minimize.
[2023-03-22 00:07:05] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 1 ms to minimize.
[2023-03-22 00:07:05] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 1 ms to minimize.
[2023-03-22 00:07:06] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 1 ms to minimize.
[2023-03-22 00:07:06] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:07:06] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:07:06] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 1 ms to minimize.
[2023-03-22 00:07:15] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 15164 ms
[2023-03-22 00:07:15] [INFO ] After 15272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:07:15] [INFO ] After 15471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 14 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 13 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-22 00:07:15] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-22 00:07:15] [INFO ] Invariant cache hit.
[2023-03-22 00:07:16] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-22 00:07:16] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-22 00:07:16] [INFO ] Invariant cache hit.
[2023-03-22 00:07:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:07:16] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
[2023-03-22 00:07:16] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-22 00:07:16] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-22 00:07:16] [INFO ] Invariant cache hit.
[2023-03-22 00:07:17] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1093 ms. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 100000 steps, including 5162 resets, run finished after 307 ms. (steps per millisecond=325 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:07:17] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-22 00:07:17] [INFO ] Invariant cache hit.
[2023-03-22 00:07:17] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 00:07:17] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-22 00:07:17] [INFO ] After 99ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:07:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:07:17] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:07:17] [INFO ] After 40ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:07:17] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:07:17] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 00:07:17] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-22 00:07:17] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:07:17] [INFO ] After 36ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:07:17] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:07:17] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:07:18] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 0 ms to minimize.
[2023-03-22 00:07:18] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 0 ms to minimize.
[2023-03-22 00:07:18] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:07:18] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:07:18] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 0 ms to minimize.
[2023-03-22 00:07:18] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:07:18] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:07:18] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 1 ms to minimize.
[2023-03-22 00:07:18] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:07:19] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 1 ms to minimize.
[2023-03-22 00:07:19] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:07:19] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:07:19] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:07:19] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:07:19] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 0 ms to minimize.
[2023-03-22 00:07:19] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 1 ms to minimize.
[2023-03-22 00:07:19] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 0 ms to minimize.
[2023-03-22 00:07:20] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 1 ms to minimize.
[2023-03-22 00:07:20] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:07:20] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 0 ms to minimize.
[2023-03-22 00:07:20] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:07:20] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 1 ms to minimize.
[2023-03-22 00:07:20] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:07:20] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 0 ms to minimize.
[2023-03-22 00:07:21] [INFO ] Deduced a trap composed of 104 places in 84 ms of which 0 ms to minimize.
[2023-03-22 00:07:21] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:07:21] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:07:21] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 1 ms to minimize.
[2023-03-22 00:07:21] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:07:21] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:07:21] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:07:22] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 1 ms to minimize.
[2023-03-22 00:07:22] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:07:22] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:07:22] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:07:22] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 1 ms to minimize.
[2023-03-22 00:07:22] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 1 ms to minimize.
[2023-03-22 00:07:22] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 1 ms to minimize.
[2023-03-22 00:07:23] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 0 ms to minimize.
[2023-03-22 00:07:23] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 0 ms to minimize.
[2023-03-22 00:07:23] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:07:23] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:07:32] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 15013 ms
[2023-03-22 00:07:32] [INFO ] After 15144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:07:32] [INFO ] After 15315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 533 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 879406 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :{}
Probabilistic random walk after 879406 steps, saw 275766 distinct states, run finished after 3001 ms. (steps per millisecond=293 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:07:35] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-22 00:07:35] [INFO ] Invariant cache hit.
[2023-03-22 00:07:35] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-22 00:07:35] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-22 00:07:35] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:07:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 00:07:36] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:07:36] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:07:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:07:36] [INFO ] After 74ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:07:36] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:07:36] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2023-03-22 00:07:36] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 0 ms to minimize.
[2023-03-22 00:07:36] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 1 ms to minimize.
[2023-03-22 00:07:36] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:07:36] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:07:37] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 1 ms to minimize.
[2023-03-22 00:07:37] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 1 ms to minimize.
[2023-03-22 00:07:37] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 0 ms to minimize.
[2023-03-22 00:07:37] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:07:37] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 0 ms to minimize.
[2023-03-22 00:07:37] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:07:37] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:07:37] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:07:38] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 0 ms to minimize.
[2023-03-22 00:07:38] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 1 ms to minimize.
[2023-03-22 00:07:38] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:07:38] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:07:38] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:07:38] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:07:38] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 1 ms to minimize.
[2023-03-22 00:07:38] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2023-03-22 00:07:38] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 1 ms to minimize.
[2023-03-22 00:07:39] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:07:39] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:07:39] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:07:39] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 0 ms to minimize.
[2023-03-22 00:07:39] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:07:39] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:07:39] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 1 ms to minimize.
[2023-03-22 00:07:40] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:07:40] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:07:40] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 0 ms to minimize.
[2023-03-22 00:07:40] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:07:41] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 1 ms to minimize.
[2023-03-22 00:07:50] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 13882 ms
[2023-03-22 00:07:50] [INFO ] After 13980ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:07:50] [INFO ] After 14175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 13 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-22 00:07:50] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-22 00:07:50] [INFO ] Invariant cache hit.
[2023-03-22 00:07:50] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 10000 steps, including 515 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 905089 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 905089 steps, saw 281987 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:07:53] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-22 00:07:53] [INFO ] Invariant cache hit.
[2023-03-22 00:07:53] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 00:07:53] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-22 00:07:53] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:07:53] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 00:07:53] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-22 00:07:53] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:07:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:07:53] [INFO ] After 70ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:07:53] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 1 ms to minimize.
[2023-03-22 00:07:53] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 0 ms to minimize.
[2023-03-22 00:07:54] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 0 ms to minimize.
[2023-03-22 00:07:54] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 0 ms to minimize.
[2023-03-22 00:07:54] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 1 ms to minimize.
[2023-03-22 00:07:54] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 1 ms to minimize.
[2023-03-22 00:07:54] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 1 ms to minimize.
[2023-03-22 00:07:54] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 1 ms to minimize.
[2023-03-22 00:07:54] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 1 ms to minimize.
[2023-03-22 00:07:54] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:07:54] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 1 ms to minimize.
[2023-03-22 00:07:55] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 0 ms to minimize.
[2023-03-22 00:07:55] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 0 ms to minimize.
[2023-03-22 00:07:55] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 0 ms to minimize.
[2023-03-22 00:07:55] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 0 ms to minimize.
[2023-03-22 00:07:55] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:07:55] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:07:55] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 1 ms to minimize.
[2023-03-22 00:07:56] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 1 ms to minimize.
[2023-03-22 00:07:56] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:07:56] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:07:56] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 1 ms to minimize.
[2023-03-22 00:07:56] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 1 ms to minimize.
[2023-03-22 00:07:56] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 0 ms to minimize.
[2023-03-22 00:07:56] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:07:56] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 1 ms to minimize.
[2023-03-22 00:07:57] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 0 ms to minimize.
[2023-03-22 00:07:57] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:07:57] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:07:57] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 0 ms to minimize.
[2023-03-22 00:07:57] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:07:57] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 1 ms to minimize.
[2023-03-22 00:07:57] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:07:58] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:07:58] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 0 ms to minimize.
[2023-03-22 00:08:07] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 13928 ms
[2023-03-22 00:08:07] [INFO ] After 14038ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:08:07] [INFO ] After 14221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 14 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 10 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-22 00:08:07] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-22 00:08:07] [INFO ] Invariant cache hit.
[2023-03-22 00:08:07] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-22 00:08:07] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-22 00:08:07] [INFO ] Invariant cache hit.
[2023-03-22 00:08:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:08:08] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
[2023-03-22 00:08:08] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 00:08:08] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-22 00:08:08] [INFO ] Invariant cache hit.
[2023-03-22 00:08:08] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1098 ms. Remains : 290/290 places, 406/406 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 290 transition count 401
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 38 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 395 rows 283 cols
[2023-03-22 00:08:08] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-22 00:08:08] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 00:08:08] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-22 00:08:08] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:08:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 00:08:08] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-22 00:08:09] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:08:09] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:08:09] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:08:09] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 1 ms to minimize.
[2023-03-22 00:08:09] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:08:09] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:08:09] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 1 ms to minimize.
[2023-03-22 00:08:09] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 0 ms to minimize.
[2023-03-22 00:08:10] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 0 ms to minimize.
[2023-03-22 00:08:10] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:08:10] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:08:10] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:08:10] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:08:10] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 1 ms to minimize.
[2023-03-22 00:08:10] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 1 ms to minimize.
[2023-03-22 00:08:10] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 0 ms to minimize.
[2023-03-22 00:08:10] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 0 ms to minimize.
[2023-03-22 00:08:11] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 0 ms to minimize.
[2023-03-22 00:08:11] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:08:11] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:08:11] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 1 ms to minimize.
[2023-03-22 00:08:11] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:08:11] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 1 ms to minimize.
[2023-03-22 00:08:11] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:08:11] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 0 ms to minimize.
[2023-03-22 00:08:12] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:08:12] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 0 ms to minimize.
[2023-03-22 00:08:12] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 1 ms to minimize.
[2023-03-22 00:08:12] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2023-03-22 00:08:12] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:08:12] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:08:12] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 1 ms to minimize.
[2023-03-22 00:08:13] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:08:13] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 0 ms to minimize.
[2023-03-22 00:08:13] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 1 ms to minimize.
[2023-03-22 00:08:13] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 1 ms to minimize.
[2023-03-22 00:08:13] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:08:13] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:08:13] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 0 ms to minimize.
[2023-03-22 00:08:13] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:08:14] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 1 ms to minimize.
[2023-03-22 00:08:14] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 1 ms to minimize.
[2023-03-22 00:08:14] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 1 ms to minimize.
[2023-03-22 00:08:14] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 1 ms to minimize.
[2023-03-22 00:08:14] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:08:14] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 0 ms to minimize.
[2023-03-22 00:08:15] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 1 ms to minimize.
[2023-03-22 00:08:15] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:08:15] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:08:17] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:08:17] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:08:18] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 1 ms to minimize.
[2023-03-22 00:08:18] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2023-03-22 00:08:18] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:08:19] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 1 ms to minimize.
[2023-03-22 00:08:19] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:08:19] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:08:19] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:08:28] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 19625 ms
[2023-03-22 00:08:28] [INFO ] After 19944ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:08:28] [INFO ] After 20009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 290 transition count 401
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 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 27 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:08:28] [INFO ] Invariant cache hit.
[2023-03-22 00:08:29] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 00:08:29] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-22 00:08:29] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:08:29] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 00:08:29] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-22 00:08:29] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:08:29] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:08:29] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2023-03-22 00:08:29] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 1 ms to minimize.
[2023-03-22 00:08:29] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:08:29] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:08:29] [INFO ] Deduced a trap composed of 96 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:08:29] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:08:30] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 1 ms to minimize.
[2023-03-22 00:08:30] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:08:30] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:08:30] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 1 ms to minimize.
[2023-03-22 00:08:30] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:08:30] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:08:30] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:08:30] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 0 ms to minimize.
[2023-03-22 00:08:31] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2023-03-22 00:08:31] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:08:31] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 1 ms to minimize.
[2023-03-22 00:08:31] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:08:31] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 1 ms to minimize.
[2023-03-22 00:08:31] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 0 ms to minimize.
[2023-03-22 00:08:31] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:08:31] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2023-03-22 00:08:32] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:08:32] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:08:32] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:08:32] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 1 ms to minimize.
[2023-03-22 00:08:32] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:08:32] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 0 ms to minimize.
[2023-03-22 00:08:32] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:08:32] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2023-03-22 00:08:32] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 0 ms to minimize.
[2023-03-22 00:08:33] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 1 ms to minimize.
[2023-03-22 00:08:33] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 0 ms to minimize.
[2023-03-22 00:08:33] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:08:33] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 0 ms to minimize.
[2023-03-22 00:08:33] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:08:33] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:08:33] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:08:33] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:08:34] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:08:34] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 1 ms to minimize.
[2023-03-22 00:08:34] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 0 ms to minimize.
[2023-03-22 00:08:34] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 0 ms to minimize.
[2023-03-22 00:08:35] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:08:35] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 1 ms to minimize.
[2023-03-22 00:08:35] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
[2023-03-22 00:08:37] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 0 ms to minimize.
[2023-03-22 00:08:37] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 1 ms to minimize.
[2023-03-22 00:08:38] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:08:39] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 1 ms to minimize.
[2023-03-22 00:08:41] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 1 ms to minimize.
[2023-03-22 00:08:48] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 1 ms to minimize.
[2023-03-22 00:08:48] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:08:48] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 0 ms to minimize.
[2023-03-22 00:08:50] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 0 ms to minimize.
[2023-03-22 00:08:55] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 1 ms to minimize.
[2023-03-22 00:08:56] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 0 ms to minimize.
[2023-03-22 00:09:05] [INFO ] Trap strengthening (SAT) tested/added 58/58 trap constraints in 36436 ms
[2023-03-22 00:09:05] [INFO ] After 36587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:09:05] [INFO ] After 36649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 235375 ms.
starting LoLA
BK_INPUT PolyORBNT-COL-S05J20
BK_EXAMINATION: QuasiLiveness
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
GlobalProperty: QuasiLiveness
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 12041908 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16155128 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 QuasiLiveness -timeout 180 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains High-Level net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: TR BINDINGS
lola: TR BINDINGS DONE
lola: Places: 369, Transitions: 1230
lola: @ trans NoJob
lola: @ trans fi1
lola: @ trans fi3
lola: @ trans trans_689
lola: @ trans DummyOR1
lola: @ trans fo3
lola: @ trans fi2
lola: @ trans trans_457
lola: @ trans WillPerformWork
lola: @ trans trans_461
lola: @ trans MustCheck
lola: @ trans trans_508
lola: @ trans trans_509
lola: @ trans trans_534
lola: @ trans fo2
lola: @ trans LeaveCSTCS
lola: @ trans trans_478
lola: @ trans trans_459
lola: @ trans trans_533
lola: @ trans trans_510
lola: @ trans GoPerformWork
lola: @ trans Run
lola: @ trans trans_685
lola: @ trans GoCheckSource
lola: @ trans fo1
lola: @ trans trans_486
lola: @ trans trans_511
lola: @ trans JobExist
lola: @ trans NotifyEventEndOfCheckSources
lola: @ trans EnterCSTCS
lola: @ trans trans_489
lola: @ trans IsEvt
lola: @ trans trans_463
lola: @ trans trans_776
lola: @ trans trans_488
lola: @ trans trans_487
lola: @ trans DummyOR2
lola: @ trans trans_376
lola: STATE EQUATION TRIES TRANSITION t209
lola: LAUNCH SYMM
sara: try reading problem file stateEquationProblem-QuasiLiveness-539.sara.
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: reporting
lola: not produced: 1
lola: find path: 29
lola: goal oriented search: 154
lola: symmetry: 2
lola: high level: 1044
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 1562 secs. Pages in use: 347

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="PolyORBNT-COL-S05J20"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is PolyORBNT-COL-S05J20, 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 r309-tall-167873962900397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J20.tgz
mv PolyORBNT-COL-S05J20 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 ;