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-167873963000437.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-S10J60, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r309-tall-167873963000437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 00:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:12 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 28K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 00:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 94K 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 1679445409986

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-S10J60
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 00:36:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-22 00:36:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:36:51] [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:36:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 00:36:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 710 ms
[2023-03-22 00:36:52] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 19 ms.
[2023-03-22 00:36:52] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 205 ms.
[2023-03-22 00:36:52] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-22 00:36:52] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-22 00:36:52] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-22 00:36:52] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 60 places in 27 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 1290 ms. (steps per millisecond=7 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=9 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :10
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 89 ms. (steps per millisecond=11 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-22 00:36:54] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2023-03-22 00:36:54] [INFO ] Computed 152 place invariants in 155 ms
[2023-03-22 00:36:57] [INFO ] [Real]Absence check using 145 positive place invariants in 57 ms returned sat
[2023-03-22 00:36:57] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-22 00:37:02] [INFO ] After 4404ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:15
[2023-03-22 00:37:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:37:02] [INFO ] After 295ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:15
[2023-03-22 00:37:03] [INFO ] After 628ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:15
Attempting to minimize the solution found.
Minimization took 206 ms.
[2023-03-22 00:37:03] [INFO ] After 6530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:15
[2023-03-22 00:37:03] [INFO ] [Nat]Absence check using 145 positive place invariants in 59 ms returned sat
[2023-03-22 00:37:03] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 39 ms returned sat
[2023-03-22 00:37:26] [INFO ] After 22156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-22 00:37:28] [INFO ] After 1793ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-22 00:37:28] [INFO ] After 1798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 00:37:28] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 798 ms.
Support contains 1065 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1224 transition count 2806
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 18 place count 1220 transition count 2806
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 1220 transition count 2805
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 1219 transition count 2805
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 1217 transition count 2803
Applied a total of 24 rules in 405 ms. Remains 1217 /1234 variables (removed 17) and now considering 2803/2810 (removed 7) transitions.
[2023-03-22 00:37:29] [INFO ] Flow matrix only has 2794 transitions (discarded 9 similar events)
// Phase 1: matrix 2794 rows 1217 cols
[2023-03-22 00:37:29] [INFO ] Computed 142 place invariants in 194 ms
[2023-03-22 00:37:31] [INFO ] Dead Transitions using invariants and state equation in 1739 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2166 ms. Remains : 1217/1234 places, 2803/2810 transitions.
Incomplete random walk after 1000000 steps, including 67122 resets, run finished after 13318 ms. (steps per millisecond=75 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 1000001 steps, including 9420 resets, run finished after 2711 ms. (steps per millisecond=368 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:37:47] [INFO ] Flow matrix only has 2794 transitions (discarded 9 similar events)
[2023-03-22 00:37:47] [INFO ] Invariant cache hit.
[2023-03-22 00:37:47] [INFO ] [Real]Absence check using 136 positive place invariants in 40 ms returned sat
[2023-03-22 00:37:47] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 33 ms returned sat
[2023-03-22 00:37:47] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:37:47] [INFO ] [Nat]Absence check using 136 positive place invariants in 37 ms returned sat
[2023-03-22 00:37:47] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 45 ms returned sat
[2023-03-22 00:37:50] [INFO ] After 2420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:37:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:37:51] [INFO ] After 859ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:37:51] [INFO ] After 986ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-22 00:37:51] [INFO ] After 3773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 1217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1217/1217 places, 2803/2803 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 1217 transition count 2741
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 1155 transition count 2741
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 124 place count 1155 transition count 2677
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 252 place count 1091 transition count 2677
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 254 place count 1090 transition count 2676
Applied a total of 254 rules in 538 ms. Remains 1090 /1217 variables (removed 127) and now considering 2676/2803 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 556 ms. Remains : 1090/1217 places, 2676/2803 transitions.
Incomplete random walk after 1000000 steps, including 72834 resets, run finished after 15923 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7161 resets, run finished after 2586 ms. (steps per millisecond=386 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4490644 steps, run timeout after 54001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 4490644 steps, saw 759083 distinct states, run finished after 54005 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:39:04] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
// Phase 1: matrix 2667 rows 1090 cols
[2023-03-22 00:39:04] [INFO ] Computed 142 place invariants in 88 ms
[2023-03-22 00:39:04] [INFO ] [Real]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-22 00:39:04] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-22 00:39:04] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:39:05] [INFO ] [Nat]Absence check using 135 positive place invariants in 57 ms returned sat
[2023-03-22 00:39:05] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 49 ms returned sat
[2023-03-22 00:39:12] [INFO ] After 7808ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:39:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:39:16] [INFO ] After 3162ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:39:16] [INFO ] After 3284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-22 00:39:16] [INFO ] After 11469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2676/2676 transitions.
Applied a total of 0 rules in 91 ms. Remains 1090 /1090 variables (removed 0) and now considering 2676/2676 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 1090/1090 places, 2676/2676 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2676/2676 transitions.
Applied a total of 0 rules in 110 ms. Remains 1090 /1090 variables (removed 0) and now considering 2676/2676 (removed 0) transitions.
[2023-03-22 00:39:16] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
[2023-03-22 00:39:16] [INFO ] Invariant cache hit.
[2023-03-22 00:39:17] [INFO ] Implicit Places using invariants in 1284 ms returned []
[2023-03-22 00:39:17] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
[2023-03-22 00:39:17] [INFO ] Invariant cache hit.
[2023-03-22 00:39:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:39:24] [INFO ] Implicit Places using invariants and state equation in 6776 ms returned []
Implicit Place search using SMT with State Equation took 8082 ms to find 0 implicit places.
[2023-03-22 00:39:24] [INFO ] Redundant transitions in 144 ms returned []
[2023-03-22 00:39:24] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
[2023-03-22 00:39:24] [INFO ] Invariant cache hit.
[2023-03-22 00:39:26] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 1090/1090 places, 2061/2676 transitions.
Applied a total of 0 rules in 61 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-22 00:39:26] [INFO ] Redundant transitions in 129 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10029 ms. Remains : 1090/1090 places, 2061/2676 transitions.
Incomplete random walk after 1000000 steps, including 72529 resets, run finished after 10217 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7217 resets, run finished after 1947 ms. (steps per millisecond=513 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3867091 steps, run timeout after 36001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 3867091 steps, saw 648370 distinct states, run finished after 36001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:40:14] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-22 00:40:14] [INFO ] Computed 142 place invariants in 45 ms
[2023-03-22 00:40:14] [INFO ] [Real]Absence check using 135 positive place invariants in 47 ms returned sat
[2023-03-22 00:40:14] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-22 00:40:14] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:40:15] [INFO ] [Nat]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-22 00:40:15] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-22 00:40:15] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:40:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:40:16] [INFO ] After 1174ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:40:17] [INFO ] Deduced a trap composed of 434 places in 479 ms of which 7 ms to minimize.
[2023-03-22 00:40:17] [INFO ] Deduced a trap composed of 440 places in 479 ms of which 1 ms to minimize.
[2023-03-22 00:40:18] [INFO ] Deduced a trap composed of 434 places in 515 ms of which 1 ms to minimize.
[2023-03-22 00:40:19] [INFO ] Deduced a trap composed of 438 places in 748 ms of which 1 ms to minimize.
[2023-03-22 00:40:20] [INFO ] Deduced a trap composed of 440 places in 705 ms of which 4 ms to minimize.
[2023-03-22 00:40:20] [INFO ] Deduced a trap composed of 444 places in 471 ms of which 1 ms to minimize.
[2023-03-22 00:40:21] [INFO ] Deduced a trap composed of 442 places in 448 ms of which 1 ms to minimize.
[2023-03-22 00:40:21] [INFO ] Deduced a trap composed of 438 places in 492 ms of which 1 ms to minimize.
[2023-03-22 00:40:22] [INFO ] Deduced a trap composed of 446 places in 426 ms of which 1 ms to minimize.
[2023-03-22 00:40:23] [INFO ] Deduced a trap composed of 430 places in 456 ms of which 1 ms to minimize.
[2023-03-22 00:40:23] [INFO ] Deduced a trap composed of 442 places in 472 ms of which 0 ms to minimize.
[2023-03-22 00:40:24] [INFO ] Deduced a trap composed of 444 places in 454 ms of which 1 ms to minimize.
[2023-03-22 00:40:24] [INFO ] Deduced a trap composed of 442 places in 433 ms of which 1 ms to minimize.
[2023-03-22 00:40:25] [INFO ] Deduced a trap composed of 442 places in 435 ms of which 0 ms to minimize.
[2023-03-22 00:40:26] [INFO ] Deduced a trap composed of 442 places in 429 ms of which 1 ms to minimize.
[2023-03-22 00:40:27] [INFO ] Deduced a trap composed of 438 places in 439 ms of which 1 ms to minimize.
[2023-03-22 00:40:27] [INFO ] Deduced a trap composed of 442 places in 446 ms of which 1 ms to minimize.
[2023-03-22 00:40:28] [INFO ] Deduced a trap composed of 436 places in 487 ms of which 1 ms to minimize.
[2023-03-22 00:40:28] [INFO ] Deduced a trap composed of 434 places in 448 ms of which 1 ms to minimize.
[2023-03-22 00:40:29] [INFO ] Deduced a trap composed of 446 places in 471 ms of which 2 ms to minimize.
[2023-03-22 00:40:30] [INFO ] Deduced a trap composed of 448 places in 480 ms of which 1 ms to minimize.
[2023-03-22 00:40:30] [INFO ] Deduced a trap composed of 432 places in 456 ms of which 0 ms to minimize.
[2023-03-22 00:40:31] [INFO ] Deduced a trap composed of 444 places in 487 ms of which 1 ms to minimize.
[2023-03-22 00:40:32] [INFO ] Deduced a trap composed of 438 places in 463 ms of which 1 ms to minimize.
[2023-03-22 00:40:32] [INFO ] Deduced a trap composed of 444 places in 475 ms of which 1 ms to minimize.
[2023-03-22 00:40:33] [INFO ] Deduced a trap composed of 432 places in 438 ms of which 1 ms to minimize.
[2023-03-22 00:40:33] [INFO ] Deduced a trap composed of 436 places in 447 ms of which 1 ms to minimize.
[2023-03-22 00:40:34] [INFO ] Deduced a trap composed of 442 places in 463 ms of which 1 ms to minimize.
[2023-03-22 00:40:35] [INFO ] Deduced a trap composed of 446 places in 451 ms of which 1 ms to minimize.
[2023-03-22 00:40:35] [INFO ] Deduced a trap composed of 442 places in 443 ms of which 1 ms to minimize.
[2023-03-22 00:40:36] [INFO ] Deduced a trap composed of 440 places in 473 ms of which 17 ms to minimize.
[2023-03-22 00:40:37] [INFO ] Deduced a trap composed of 430 places in 436 ms of which 4 ms to minimize.
[2023-03-22 00:40:38] [INFO ] Deduced a trap composed of 451 places in 453 ms of which 1 ms to minimize.
[2023-03-22 00:40:38] [INFO ] Deduced a trap composed of 446 places in 433 ms of which 0 ms to minimize.
[2023-03-22 00:40:39] [INFO ] Deduced a trap composed of 446 places in 440 ms of which 0 ms to minimize.
[2023-03-22 00:40:41] [INFO ] Deduced a trap composed of 438 places in 442 ms of which 1 ms to minimize.
[2023-03-22 00:40:41] [INFO ] Deduced a trap composed of 438 places in 465 ms of which 1 ms to minimize.
[2023-03-22 00:40:42] [INFO ] Deduced a trap composed of 432 places in 445 ms of which 0 ms to minimize.
[2023-03-22 00:40:42] [INFO ] Deduced a trap composed of 444 places in 461 ms of which 1 ms to minimize.
[2023-03-22 00:40:43] [INFO ] Deduced a trap composed of 444 places in 462 ms of which 1 ms to minimize.
[2023-03-22 00:40:43] [INFO ] Deduced a trap composed of 438 places in 447 ms of which 0 ms to minimize.
[2023-03-22 00:40:45] [INFO ] Deduced a trap composed of 440 places in 462 ms of which 1 ms to minimize.
[2023-03-22 00:40:45] [INFO ] Deduced a trap composed of 450 places in 462 ms of which 0 ms to minimize.
[2023-03-22 00:40:48] [INFO ] Deduced a trap composed of 434 places in 457 ms of which 1 ms to minimize.
[2023-03-22 00:40:48] [INFO ] Deduced a trap composed of 432 places in 440 ms of which 1 ms to minimize.
[2023-03-22 00:40:49] [INFO ] Deduced a trap composed of 428 places in 471 ms of which 1 ms to minimize.
[2023-03-22 00:40:53] [INFO ] Deduced a trap composed of 444 places in 435 ms of which 1 ms to minimize.
[2023-03-22 00:40:55] [INFO ] Deduced a trap composed of 460 places in 447 ms of which 1 ms to minimize.
[2023-03-22 00:40:58] [INFO ] Deduced a trap composed of 438 places in 474 ms of which 0 ms to minimize.
[2023-03-22 00:41:07] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 50720 ms
[2023-03-22 00:41:07] [INFO ] After 52134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:41:07] [INFO ] After 52886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 75 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 71 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-22 00:41:08] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-22 00:41:08] [INFO ] Invariant cache hit.
[2023-03-22 00:41:08] [INFO ] Implicit Places using invariants in 900 ms returned []
[2023-03-22 00:41:08] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-22 00:41:08] [INFO ] Invariant cache hit.
[2023-03-22 00:41:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:41:15] [INFO ] Implicit Places using invariants and state equation in 7014 ms returned []
Implicit Place search using SMT with State Equation took 7929 ms to find 0 implicit places.
[2023-03-22 00:41:15] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-22 00:41:16] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-22 00:41:16] [INFO ] Invariant cache hit.
[2023-03-22 00:41:17] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9158 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 100000 steps, including 7278 resets, run finished after 1212 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:41:18] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-22 00:41:18] [INFO ] Invariant cache hit.
[2023-03-22 00:41:18] [INFO ] [Real]Absence check using 135 positive place invariants in 49 ms returned sat
[2023-03-22 00:41:18] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 46 ms returned sat
[2023-03-22 00:41:19] [INFO ] After 686ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:41:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:41:19] [INFO ] After 170ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:41:19] [INFO ] After 285ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:41:19] [INFO ] After 1183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:41:19] [INFO ] [Nat]Absence check using 135 positive place invariants in 27 ms returned sat
[2023-03-22 00:41:19] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-22 00:41:20] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:41:20] [INFO ] After 387ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:41:21] [INFO ] Deduced a trap composed of 442 places in 453 ms of which 1 ms to minimize.
[2023-03-22 00:41:21] [INFO ] Deduced a trap composed of 442 places in 578 ms of which 1 ms to minimize.
[2023-03-22 00:41:22] [INFO ] Deduced a trap composed of 446 places in 718 ms of which 1 ms to minimize.
[2023-03-22 00:41:23] [INFO ] Deduced a trap composed of 446 places in 460 ms of which 12 ms to minimize.
[2023-03-22 00:41:23] [INFO ] Deduced a trap composed of 454 places in 443 ms of which 1 ms to minimize.
[2023-03-22 00:41:24] [INFO ] Deduced a trap composed of 442 places in 455 ms of which 1 ms to minimize.
[2023-03-22 00:41:24] [INFO ] Deduced a trap composed of 442 places in 460 ms of which 1 ms to minimize.
[2023-03-22 00:41:25] [INFO ] Deduced a trap composed of 438 places in 435 ms of which 1 ms to minimize.
[2023-03-22 00:41:25] [INFO ] Deduced a trap composed of 444 places in 455 ms of which 1 ms to minimize.
[2023-03-22 00:41:26] [INFO ] Deduced a trap composed of 442 places in 464 ms of which 1 ms to minimize.
[2023-03-22 00:41:26] [INFO ] Deduced a trap composed of 452 places in 457 ms of which 1 ms to minimize.
[2023-03-22 00:41:27] [INFO ] Deduced a trap composed of 440 places in 459 ms of which 2 ms to minimize.
[2023-03-22 00:41:27] [INFO ] Deduced a trap composed of 452 places in 461 ms of which 4 ms to minimize.
[2023-03-22 00:41:28] [INFO ] Deduced a trap composed of 432 places in 454 ms of which 1 ms to minimize.
[2023-03-22 00:41:28] [INFO ] Deduced a trap composed of 444 places in 473 ms of which 16 ms to minimize.
[2023-03-22 00:41:29] [INFO ] Deduced a trap composed of 442 places in 435 ms of which 2 ms to minimize.
[2023-03-22 00:41:30] [INFO ] Deduced a trap composed of 440 places in 455 ms of which 1 ms to minimize.
[2023-03-22 00:41:30] [INFO ] Deduced a trap composed of 424 places in 450 ms of which 1 ms to minimize.
[2023-03-22 00:41:31] [INFO ] Deduced a trap composed of 432 places in 477 ms of which 1 ms to minimize.
[2023-03-22 00:41:32] [INFO ] Deduced a trap composed of 436 places in 480 ms of which 1 ms to minimize.
[2023-03-22 00:41:32] [INFO ] Deduced a trap composed of 440 places in 446 ms of which 0 ms to minimize.
[2023-03-22 00:41:34] [INFO ] Deduced a trap composed of 440 places in 440 ms of which 0 ms to minimize.
[2023-03-22 00:41:34] [INFO ] Deduced a trap composed of 442 places in 445 ms of which 1 ms to minimize.
[2023-03-22 00:41:35] [INFO ] Deduced a trap composed of 450 places in 439 ms of which 1 ms to minimize.
[2023-03-22 00:41:35] [INFO ] Deduced a trap composed of 444 places in 457 ms of which 1 ms to minimize.
[2023-03-22 00:41:36] [INFO ] Deduced a trap composed of 434 places in 452 ms of which 1 ms to minimize.
[2023-03-22 00:41:37] [INFO ] Deduced a trap composed of 438 places in 437 ms of which 0 ms to minimize.
[2023-03-22 00:41:37] [INFO ] Deduced a trap composed of 448 places in 448 ms of which 1 ms to minimize.
[2023-03-22 00:41:38] [INFO ] Deduced a trap composed of 450 places in 452 ms of which 1 ms to minimize.
[2023-03-22 00:41:38] [INFO ] Deduced a trap composed of 452 places in 453 ms of which 1 ms to minimize.
[2023-03-22 00:41:39] [INFO ] Deduced a trap composed of 454 places in 461 ms of which 1 ms to minimize.
[2023-03-22 00:41:40] [INFO ] Deduced a trap composed of 444 places in 468 ms of which 1 ms to minimize.
[2023-03-22 00:41:40] [INFO ] Deduced a trap composed of 440 places in 480 ms of which 1 ms to minimize.
[2023-03-22 00:41:41] [INFO ] Deduced a trap composed of 438 places in 436 ms of which 1 ms to minimize.
[2023-03-22 00:41:41] [INFO ] Deduced a trap composed of 446 places in 463 ms of which 1 ms to minimize.
[2023-03-22 00:41:43] [INFO ] Deduced a trap composed of 445 places in 482 ms of which 1 ms to minimize.
[2023-03-22 00:41:43] [INFO ] Deduced a trap composed of 447 places in 470 ms of which 1 ms to minimize.
[2023-03-22 00:41:44] [INFO ] Deduced a trap composed of 439 places in 487 ms of which 1 ms to minimize.
[2023-03-22 00:41:45] [INFO ] Deduced a trap composed of 453 places in 482 ms of which 1 ms to minimize.
[2023-03-22 00:41:46] [INFO ] Deduced a trap composed of 442 places in 453 ms of which 0 ms to minimize.
[2023-03-22 00:41:47] [INFO ] Deduced a trap composed of 438 places in 440 ms of which 1 ms to minimize.
[2023-03-22 00:41:47] [INFO ] Deduced a trap composed of 448 places in 436 ms of which 1 ms to minimize.
[2023-03-22 00:41:48] [INFO ] Deduced a trap composed of 446 places in 464 ms of which 1 ms to minimize.
[2023-03-22 00:41:49] [INFO ] Deduced a trap composed of 448 places in 454 ms of which 1 ms to minimize.
[2023-03-22 00:41:49] [INFO ] Deduced a trap composed of 452 places in 485 ms of which 0 ms to minimize.
[2023-03-22 00:41:50] [INFO ] Deduced a trap composed of 440 places in 450 ms of which 1 ms to minimize.
[2023-03-22 00:41:50] [INFO ] Deduced a trap composed of 455 places in 452 ms of which 1 ms to minimize.
[2023-03-22 00:41:51] [INFO ] Deduced a trap composed of 447 places in 464 ms of which 1 ms to minimize.
[2023-03-22 00:42:00] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 39573 ms
[2023-03-22 00:42:00] [INFO ] After 40028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:42:00] [INFO ] After 40730ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72585 resets, run finished after 10983 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7351 resets, run finished after 2011 ms. (steps per millisecond=497 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3848887 steps, run timeout after 36001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 3848887 steps, saw 645103 distinct states, run finished after 36001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:42:49] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-22 00:42:49] [INFO ] Invariant cache hit.
[2023-03-22 00:42:49] [INFO ] [Real]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-22 00:42:49] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-22 00:42:49] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:42:49] [INFO ] [Nat]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-22 00:42:49] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-22 00:42:50] [INFO ] After 580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:42:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:42:50] [INFO ] After 667ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:42:51] [INFO ] Deduced a trap composed of 446 places in 495 ms of which 1 ms to minimize.
[2023-03-22 00:42:51] [INFO ] Deduced a trap composed of 444 places in 465 ms of which 1 ms to minimize.
[2023-03-22 00:42:52] [INFO ] Deduced a trap composed of 444 places in 452 ms of which 1 ms to minimize.
[2023-03-22 00:42:53] [INFO ] Deduced a trap composed of 444 places in 464 ms of which 1 ms to minimize.
[2023-03-22 00:42:53] [INFO ] Deduced a trap composed of 446 places in 432 ms of which 1 ms to minimize.
[2023-03-22 00:42:54] [INFO ] Deduced a trap composed of 438 places in 448 ms of which 1 ms to minimize.
[2023-03-22 00:42:54] [INFO ] Deduced a trap composed of 436 places in 447 ms of which 1 ms to minimize.
[2023-03-22 00:42:55] [INFO ] Deduced a trap composed of 448 places in 436 ms of which 1 ms to minimize.
[2023-03-22 00:42:56] [INFO ] Deduced a trap composed of 444 places in 439 ms of which 2 ms to minimize.
[2023-03-22 00:42:56] [INFO ] Deduced a trap composed of 436 places in 426 ms of which 1 ms to minimize.
[2023-03-22 00:42:57] [INFO ] Deduced a trap composed of 442 places in 481 ms of which 1 ms to minimize.
[2023-03-22 00:42:57] [INFO ] Deduced a trap composed of 442 places in 461 ms of which 1 ms to minimize.
[2023-03-22 00:42:58] [INFO ] Deduced a trap composed of 434 places in 455 ms of which 1 ms to minimize.
[2023-03-22 00:42:59] [INFO ] Deduced a trap composed of 442 places in 531 ms of which 1 ms to minimize.
[2023-03-22 00:42:59] [INFO ] Deduced a trap composed of 442 places in 455 ms of which 1 ms to minimize.
[2023-03-22 00:43:00] [INFO ] Deduced a trap composed of 452 places in 442 ms of which 1 ms to minimize.
[2023-03-22 00:43:00] [INFO ] Deduced a trap composed of 446 places in 447 ms of which 1 ms to minimize.
[2023-03-22 00:43:01] [INFO ] Deduced a trap composed of 444 places in 447 ms of which 1 ms to minimize.
[2023-03-22 00:43:02] [INFO ] Deduced a trap composed of 456 places in 461 ms of which 1 ms to minimize.
[2023-03-22 00:43:03] [INFO ] Deduced a trap composed of 454 places in 451 ms of which 1 ms to minimize.
[2023-03-22 00:43:04] [INFO ] Deduced a trap composed of 430 places in 433 ms of which 1 ms to minimize.
[2023-03-22 00:43:04] [INFO ] Deduced a trap composed of 446 places in 437 ms of which 1 ms to minimize.
[2023-03-22 00:43:04] [INFO ] Deduced a trap composed of 448 places in 416 ms of which 0 ms to minimize.
[2023-03-22 00:43:05] [INFO ] Deduced a trap composed of 453 places in 495 ms of which 1 ms to minimize.
[2023-03-22 00:43:06] [INFO ] Deduced a trap composed of 442 places in 464 ms of which 1 ms to minimize.
[2023-03-22 00:43:06] [INFO ] Deduced a trap composed of 442 places in 465 ms of which 1 ms to minimize.
[2023-03-22 00:43:07] [INFO ] Deduced a trap composed of 440 places in 460 ms of which 1 ms to minimize.
[2023-03-22 00:43:09] [INFO ] Deduced a trap composed of 444 places in 471 ms of which 1 ms to minimize.
[2023-03-22 00:43:10] [INFO ] Deduced a trap composed of 442 places in 437 ms of which 1 ms to minimize.
[2023-03-22 00:43:12] [INFO ] Deduced a trap composed of 442 places in 474 ms of which 1 ms to minimize.
[2023-03-22 00:43:12] [INFO ] Deduced a trap composed of 446 places in 513 ms of which 1 ms to minimize.
[2023-03-22 00:43:14] [INFO ] Deduced a trap composed of 446 places in 448 ms of which 1 ms to minimize.
[2023-03-22 00:43:16] [INFO ] Deduced a trap composed of 446 places in 438 ms of which 1 ms to minimize.
[2023-03-22 00:43:16] [INFO ] Deduced a trap composed of 443 places in 477 ms of which 2 ms to minimize.
[2023-03-22 00:43:19] [INFO ] Deduced a trap composed of 428 places in 437 ms of which 0 ms to minimize.
[2023-03-22 00:43:21] [INFO ] Deduced a trap composed of 432 places in 457 ms of which 0 ms to minimize.
[2023-03-22 00:43:30] [INFO ] Trap strengthening (SAT) tested/added 36/36 trap constraints in 39842 ms
[2023-03-22 00:43:30] [INFO ] After 40605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:43:30] [INFO ] After 41396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 65 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 48 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-22 00:43:30] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-22 00:43:30] [INFO ] Invariant cache hit.
[2023-03-22 00:43:31] [INFO ] Implicit Places using invariants in 853 ms returned []
[2023-03-22 00:43:31] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-22 00:43:31] [INFO ] Invariant cache hit.
[2023-03-22 00:43:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:43:39] [INFO ] Implicit Places using invariants and state equation in 7325 ms returned []
Implicit Place search using SMT with State Equation took 8197 ms to find 0 implicit places.
[2023-03-22 00:43:39] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-22 00:43:39] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-22 00:43:39] [INFO ] Invariant cache hit.
[2023-03-22 00:43:40] [INFO ] Dead Transitions using invariants and state equation in 1137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9432 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 100000 steps, including 7251 resets, run finished after 1123 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:43:41] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-22 00:43:41] [INFO ] Invariant cache hit.
[2023-03-22 00:43:41] [INFO ] [Real]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-22 00:43:41] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-22 00:43:42] [INFO ] After 515ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:43:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:43:42] [INFO ] After 168ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:43:42] [INFO ] After 274ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:43:42] [INFO ] After 948ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:43:42] [INFO ] [Nat]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-22 00:43:42] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-22 00:43:43] [INFO ] After 589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:43:43] [INFO ] After 398ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:43:44] [INFO ] Deduced a trap composed of 442 places in 463 ms of which 1 ms to minimize.
[2023-03-22 00:43:44] [INFO ] Deduced a trap composed of 442 places in 456 ms of which 0 ms to minimize.
[2023-03-22 00:43:45] [INFO ] Deduced a trap composed of 446 places in 461 ms of which 1 ms to minimize.
[2023-03-22 00:43:45] [INFO ] Deduced a trap composed of 446 places in 464 ms of which 1 ms to minimize.
[2023-03-22 00:43:46] [INFO ] Deduced a trap composed of 454 places in 463 ms of which 1 ms to minimize.
[2023-03-22 00:43:46] [INFO ] Deduced a trap composed of 442 places in 463 ms of which 1 ms to minimize.
[2023-03-22 00:43:47] [INFO ] Deduced a trap composed of 442 places in 460 ms of which 2 ms to minimize.
[2023-03-22 00:43:47] [INFO ] Deduced a trap composed of 438 places in 460 ms of which 1 ms to minimize.
[2023-03-22 00:43:48] [INFO ] Deduced a trap composed of 444 places in 440 ms of which 1 ms to minimize.
[2023-03-22 00:43:48] [INFO ] Deduced a trap composed of 442 places in 437 ms of which 1 ms to minimize.
[2023-03-22 00:43:49] [INFO ] Deduced a trap composed of 452 places in 482 ms of which 1 ms to minimize.
[2023-03-22 00:43:50] [INFO ] Deduced a trap composed of 440 places in 436 ms of which 2 ms to minimize.
[2023-03-22 00:43:50] [INFO ] Deduced a trap composed of 452 places in 464 ms of which 1 ms to minimize.
[2023-03-22 00:43:51] [INFO ] Deduced a trap composed of 432 places in 433 ms of which 0 ms to minimize.
[2023-03-22 00:43:51] [INFO ] Deduced a trap composed of 444 places in 458 ms of which 1 ms to minimize.
[2023-03-22 00:43:52] [INFO ] Deduced a trap composed of 442 places in 455 ms of which 1 ms to minimize.
[2023-03-22 00:43:52] [INFO ] Deduced a trap composed of 440 places in 467 ms of which 1 ms to minimize.
[2023-03-22 00:43:53] [INFO ] Deduced a trap composed of 424 places in 469 ms of which 1 ms to minimize.
[2023-03-22 00:43:54] [INFO ] Deduced a trap composed of 432 places in 485 ms of which 1 ms to minimize.
[2023-03-22 00:43:55] [INFO ] Deduced a trap composed of 436 places in 461 ms of which 1 ms to minimize.
[2023-03-22 00:43:55] [INFO ] Deduced a trap composed of 440 places in 467 ms of which 1 ms to minimize.
[2023-03-22 00:43:56] [INFO ] Deduced a trap composed of 440 places in 457 ms of which 1 ms to minimize.
[2023-03-22 00:43:57] [INFO ] Deduced a trap composed of 442 places in 462 ms of which 1 ms to minimize.
[2023-03-22 00:43:58] [INFO ] Deduced a trap composed of 450 places in 455 ms of which 0 ms to minimize.
[2023-03-22 00:43:58] [INFO ] Deduced a trap composed of 444 places in 431 ms of which 1 ms to minimize.
[2023-03-22 00:43:59] [INFO ] Deduced a trap composed of 434 places in 432 ms of which 1 ms to minimize.
[2023-03-22 00:44:00] [INFO ] Deduced a trap composed of 438 places in 435 ms of which 1 ms to minimize.
[2023-03-22 00:44:00] [INFO ] Deduced a trap composed of 448 places in 457 ms of which 1 ms to minimize.
[2023-03-22 00:44:01] [INFO ] Deduced a trap composed of 450 places in 439 ms of which 1 ms to minimize.
[2023-03-22 00:44:01] [INFO ] Deduced a trap composed of 452 places in 430 ms of which 1 ms to minimize.
[2023-03-22 00:44:02] [INFO ] Deduced a trap composed of 454 places in 475 ms of which 1 ms to minimize.
[2023-03-22 00:44:03] [INFO ] Deduced a trap composed of 444 places in 436 ms of which 1 ms to minimize.
[2023-03-22 00:44:03] [INFO ] Deduced a trap composed of 440 places in 476 ms of which 1 ms to minimize.
[2023-03-22 00:44:04] [INFO ] Deduced a trap composed of 438 places in 467 ms of which 1 ms to minimize.
[2023-03-22 00:44:04] [INFO ] Deduced a trap composed of 446 places in 443 ms of which 1 ms to minimize.
[2023-03-22 00:44:06] [INFO ] Deduced a trap composed of 445 places in 480 ms of which 1 ms to minimize.
[2023-03-22 00:44:07] [INFO ] Deduced a trap composed of 447 places in 488 ms of which 1 ms to minimize.
[2023-03-22 00:44:07] [INFO ] Deduced a trap composed of 439 places in 492 ms of which 1 ms to minimize.
[2023-03-22 00:44:08] [INFO ] Deduced a trap composed of 453 places in 490 ms of which 1 ms to minimize.
[2023-03-22 00:44:09] [INFO ] Deduced a trap composed of 442 places in 468 ms of which 1 ms to minimize.
[2023-03-22 00:44:10] [INFO ] Deduced a trap composed of 438 places in 464 ms of which 1 ms to minimize.
[2023-03-22 00:44:11] [INFO ] Deduced a trap composed of 448 places in 465 ms of which 1 ms to minimize.
[2023-03-22 00:44:11] [INFO ] Deduced a trap composed of 446 places in 467 ms of which 1 ms to minimize.
[2023-03-22 00:44:12] [INFO ] Deduced a trap composed of 448 places in 467 ms of which 1 ms to minimize.
[2023-03-22 00:44:12] [INFO ] Deduced a trap composed of 452 places in 458 ms of which 1 ms to minimize.
[2023-03-22 00:44:13] [INFO ] Deduced a trap composed of 440 places in 448 ms of which 0 ms to minimize.
[2023-03-22 00:44:13] [INFO ] Deduced a trap composed of 455 places in 439 ms of which 1 ms to minimize.
[2023-03-22 00:44:14] [INFO ] Deduced a trap composed of 447 places in 497 ms of which 1 ms to minimize.
[2023-03-22 00:44:23] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 39821 ms
[2023-03-22 00:44:23] [INFO ] After 40308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:44:23] [INFO ] After 41076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 713 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 316544 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 316544 steps, saw 51619 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:44:26] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-22 00:44:26] [INFO ] Invariant cache hit.
[2023-03-22 00:44:26] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-22 00:44:26] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-22 00:44:26] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:44:27] [INFO ] [Nat]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-22 00:44:27] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-22 00:44:27] [INFO ] After 548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:44:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:44:28] [INFO ] After 613ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:44:28] [INFO ] Deduced a trap composed of 446 places in 453 ms of which 1 ms to minimize.
[2023-03-22 00:44:29] [INFO ] Deduced a trap composed of 442 places in 466 ms of which 1 ms to minimize.
[2023-03-22 00:44:29] [INFO ] Deduced a trap composed of 442 places in 476 ms of which 1 ms to minimize.
[2023-03-22 00:44:30] [INFO ] Deduced a trap composed of 442 places in 469 ms of which 1 ms to minimize.
[2023-03-22 00:44:31] [INFO ] Deduced a trap composed of 436 places in 475 ms of which 1 ms to minimize.
[2023-03-22 00:44:31] [INFO ] Deduced a trap composed of 442 places in 476 ms of which 1 ms to minimize.
[2023-03-22 00:44:32] [INFO ] Deduced a trap composed of 438 places in 462 ms of which 1 ms to minimize.
[2023-03-22 00:44:32] [INFO ] Deduced a trap composed of 444 places in 447 ms of which 1 ms to minimize.
[2023-03-22 00:44:33] [INFO ] Deduced a trap composed of 452 places in 476 ms of which 1 ms to minimize.
[2023-03-22 00:44:34] [INFO ] Deduced a trap composed of 434 places in 507 ms of which 1 ms to minimize.
[2023-03-22 00:44:34] [INFO ] Deduced a trap composed of 434 places in 470 ms of which 1 ms to minimize.
[2023-03-22 00:44:35] [INFO ] Deduced a trap composed of 444 places in 441 ms of which 1 ms to minimize.
[2023-03-22 00:44:35] [INFO ] Deduced a trap composed of 432 places in 451 ms of which 1 ms to minimize.
[2023-03-22 00:44:36] [INFO ] Deduced a trap composed of 436 places in 449 ms of which 3 ms to minimize.
[2023-03-22 00:44:36] [INFO ] Deduced a trap composed of 444 places in 473 ms of which 1 ms to minimize.
[2023-03-22 00:44:37] [INFO ] Deduced a trap composed of 438 places in 472 ms of which 1 ms to minimize.
[2023-03-22 00:44:38] [INFO ] Deduced a trap composed of 438 places in 467 ms of which 1 ms to minimize.
[2023-03-22 00:44:38] [INFO ] Deduced a trap composed of 438 places in 472 ms of which 1 ms to minimize.
[2023-03-22 00:44:39] [INFO ] Deduced a trap composed of 446 places in 460 ms of which 0 ms to minimize.
[2023-03-22 00:44:40] [INFO ] Deduced a trap composed of 454 places in 462 ms of which 0 ms to minimize.
[2023-03-22 00:44:40] [INFO ] Deduced a trap composed of 440 places in 461 ms of which 1 ms to minimize.
[2023-03-22 00:44:41] [INFO ] Deduced a trap composed of 436 places in 468 ms of which 1 ms to minimize.
[2023-03-22 00:44:41] [INFO ] Deduced a trap composed of 432 places in 456 ms of which 1 ms to minimize.
[2023-03-22 00:44:42] [INFO ] Deduced a trap composed of 444 places in 469 ms of which 1 ms to minimize.
[2023-03-22 00:44:44] [INFO ] Deduced a trap composed of 444 places in 464 ms of which 1 ms to minimize.
[2023-03-22 00:44:45] [INFO ] Deduced a trap composed of 452 places in 476 ms of which 1 ms to minimize.
[2023-03-22 00:44:45] [INFO ] Deduced a trap composed of 448 places in 420 ms of which 1 ms to minimize.
[2023-03-22 00:44:46] [INFO ] Deduced a trap composed of 452 places in 465 ms of which 1 ms to minimize.
[2023-03-22 00:44:47] [INFO ] Deduced a trap composed of 446 places in 505 ms of which 1 ms to minimize.
[2023-03-22 00:44:48] [INFO ] Deduced a trap composed of 440 places in 487 ms of which 1 ms to minimize.
[2023-03-22 00:44:49] [INFO ] Deduced a trap composed of 434 places in 462 ms of which 1 ms to minimize.
[2023-03-22 00:44:49] [INFO ] Deduced a trap composed of 432 places in 473 ms of which 1 ms to minimize.
[2023-03-22 00:44:50] [INFO ] Deduced a trap composed of 438 places in 475 ms of which 1 ms to minimize.
[2023-03-22 00:44:50] [INFO ] Deduced a trap composed of 446 places in 479 ms of which 1 ms to minimize.
[2023-03-22 00:44:51] [INFO ] Deduced a trap composed of 440 places in 488 ms of which 3 ms to minimize.
[2023-03-22 00:44:52] [INFO ] Deduced a trap composed of 3 places in 672 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 00:44:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:44:52] [INFO ] After 25704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 50 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-22 00:44:52] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-22 00:44:52] [INFO ] Invariant cache hit.
[2023-03-22 00:44:53] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1221 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 10000 steps, including 741 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 317342 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 317342 steps, saw 51751 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:44:56] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-22 00:44:56] [INFO ] Invariant cache hit.
[2023-03-22 00:44:57] [INFO ] [Real]Absence check using 135 positive place invariants in 40 ms returned sat
[2023-03-22 00:44:57] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-22 00:44:57] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:44:57] [INFO ] [Nat]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-22 00:44:57] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-22 00:44:57] [INFO ] After 593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:44:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:44:58] [INFO ] After 618ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:44:59] [INFO ] Deduced a trap composed of 446 places in 491 ms of which 1 ms to minimize.
[2023-03-22 00:44:59] [INFO ] Deduced a trap composed of 442 places in 471 ms of which 1 ms to minimize.
[2023-03-22 00:45:00] [INFO ] Deduced a trap composed of 442 places in 463 ms of which 1 ms to minimize.
[2023-03-22 00:45:00] [INFO ] Deduced a trap composed of 442 places in 447 ms of which 0 ms to minimize.
[2023-03-22 00:45:01] [INFO ] Deduced a trap composed of 436 places in 461 ms of which 0 ms to minimize.
[2023-03-22 00:45:02] [INFO ] Deduced a trap composed of 442 places in 467 ms of which 1 ms to minimize.
[2023-03-22 00:45:02] [INFO ] Deduced a trap composed of 438 places in 469 ms of which 1 ms to minimize.
[2023-03-22 00:45:03] [INFO ] Deduced a trap composed of 444 places in 457 ms of which 1 ms to minimize.
[2023-03-22 00:45:03] [INFO ] Deduced a trap composed of 452 places in 448 ms of which 1 ms to minimize.
[2023-03-22 00:45:04] [INFO ] Deduced a trap composed of 434 places in 465 ms of which 0 ms to minimize.
[2023-03-22 00:45:04] [INFO ] Deduced a trap composed of 434 places in 443 ms of which 1 ms to minimize.
[2023-03-22 00:45:05] [INFO ] Deduced a trap composed of 444 places in 443 ms of which 1 ms to minimize.
[2023-03-22 00:45:05] [INFO ] Deduced a trap composed of 432 places in 477 ms of which 1 ms to minimize.
[2023-03-22 00:45:06] [INFO ] Deduced a trap composed of 436 places in 461 ms of which 1 ms to minimize.
[2023-03-22 00:45:07] [INFO ] Deduced a trap composed of 444 places in 436 ms of which 1 ms to minimize.
[2023-03-22 00:45:07] [INFO ] Deduced a trap composed of 438 places in 448 ms of which 0 ms to minimize.
[2023-03-22 00:45:08] [INFO ] Deduced a trap composed of 438 places in 448 ms of which 1 ms to minimize.
[2023-03-22 00:45:08] [INFO ] Deduced a trap composed of 438 places in 464 ms of which 1 ms to minimize.
[2023-03-22 00:45:09] [INFO ] Deduced a trap composed of 446 places in 474 ms of which 0 ms to minimize.
[2023-03-22 00:45:10] [INFO ] Deduced a trap composed of 454 places in 442 ms of which 1 ms to minimize.
[2023-03-22 00:45:10] [INFO ] Deduced a trap composed of 440 places in 460 ms of which 1 ms to minimize.
[2023-03-22 00:45:11] [INFO ] Deduced a trap composed of 436 places in 476 ms of which 1 ms to minimize.
[2023-03-22 00:45:11] [INFO ] Deduced a trap composed of 432 places in 445 ms of which 1 ms to minimize.
[2023-03-22 00:45:12] [INFO ] Deduced a trap composed of 444 places in 451 ms of which 1 ms to minimize.
[2023-03-22 00:45:14] [INFO ] Deduced a trap composed of 444 places in 446 ms of which 1 ms to minimize.
[2023-03-22 00:45:15] [INFO ] Deduced a trap composed of 452 places in 434 ms of which 0 ms to minimize.
[2023-03-22 00:45:15] [INFO ] Deduced a trap composed of 448 places in 479 ms of which 1 ms to minimize.
[2023-03-22 00:45:16] [INFO ] Deduced a trap composed of 452 places in 437 ms of which 1 ms to minimize.
[2023-03-22 00:45:17] [INFO ] Deduced a trap composed of 446 places in 481 ms of which 10 ms to minimize.
[2023-03-22 00:45:18] [INFO ] Deduced a trap composed of 440 places in 502 ms of which 8 ms to minimize.
[2023-03-22 00:45:18] [INFO ] Deduced a trap composed of 434 places in 441 ms of which 0 ms to minimize.
[2023-03-22 00:45:19] [INFO ] Deduced a trap composed of 432 places in 453 ms of which 1 ms to minimize.
[2023-03-22 00:45:19] [INFO ] Deduced a trap composed of 438 places in 450 ms of which 0 ms to minimize.
[2023-03-22 00:45:20] [INFO ] Deduced a trap composed of 446 places in 440 ms of which 1 ms to minimize.
[2023-03-22 00:45:21] [INFO ] Deduced a trap composed of 440 places in 435 ms of which 3 ms to minimize.
[2023-03-22 00:45:21] [INFO ] Deduced a trap composed of 444 places in 441 ms of which 2 ms to minimize.
[2023-03-22 00:45:22] [INFO ] Deduced a trap composed of 448 places in 463 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 00:45:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:45:22] [INFO ] After 25263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 48 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 45 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-22 00:45:22] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-22 00:45:22] [INFO ] Invariant cache hit.
[2023-03-22 00:45:23] [INFO ] Implicit Places using invariants in 853 ms returned []
[2023-03-22 00:45:23] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-22 00:45:23] [INFO ] Invariant cache hit.
[2023-03-22 00:45:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:45:30] [INFO ] Implicit Places using invariants and state equation in 7118 ms returned []
Implicit Place search using SMT with State Equation took 7998 ms to find 0 implicit places.
[2023-03-22 00:45:30] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-22 00:45:30] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-22 00:45:30] [INFO ] Invariant cache hit.
[2023-03-22 00:45:31] [INFO ] Dead Transitions using invariants and state equation in 1105 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9188 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1090 transition count 2052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1090 transition count 2051
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 11 place count 1089 transition count 2051
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1089 transition count 2050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1088 transition count 2050
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1088 transition count 2040
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1078 transition count 2040
Applied a total of 33 rules in 200 ms. Remains 1078 /1090 variables (removed 12) and now considering 2040/2061 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2040 rows 1078 cols
[2023-03-22 00:45:31] [INFO ] Computed 142 place invariants in 40 ms
[2023-03-22 00:45:32] [INFO ] [Real]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-22 00:45:32] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-22 00:45:32] [INFO ] After 573ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:45:33] [INFO ] Deduced a trap composed of 438 places in 433 ms of which 1 ms to minimize.
[2023-03-22 00:45:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 549 ms
[2023-03-22 00:45:33] [INFO ] After 1162ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:45:33] [INFO ] After 1340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:45:33] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-22 00:45:33] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-22 00:45:34] [INFO ] After 566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:45:34] [INFO ] Deduced a trap composed of 438 places in 427 ms of which 1 ms to minimize.
[2023-03-22 00:45:35] [INFO ] Deduced a trap composed of 438 places in 428 ms of which 0 ms to minimize.
[2023-03-22 00:45:35] [INFO ] Deduced a trap composed of 438 places in 423 ms of which 1 ms to minimize.
[2023-03-22 00:45:35] [INFO ] Deduced a trap composed of 436 places in 419 ms of which 0 ms to minimize.
[2023-03-22 00:45:36] [INFO ] Deduced a trap composed of 430 places in 422 ms of which 0 ms to minimize.
[2023-03-22 00:45:36] [INFO ] Deduced a trap composed of 446 places in 428 ms of which 1 ms to minimize.
[2023-03-22 00:45:37] [INFO ] Deduced a trap composed of 434 places in 431 ms of which 1 ms to minimize.
[2023-03-22 00:45:37] [INFO ] Deduced a trap composed of 444 places in 384 ms of which 2 ms to minimize.
[2023-03-22 00:45:38] [INFO ] Deduced a trap composed of 444 places in 389 ms of which 1 ms to minimize.
[2023-03-22 00:45:38] [INFO ] Deduced a trap composed of 444 places in 388 ms of which 1 ms to minimize.
[2023-03-22 00:45:39] [INFO ] Deduced a trap composed of 442 places in 390 ms of which 1 ms to minimize.
[2023-03-22 00:45:39] [INFO ] Deduced a trap composed of 434 places in 425 ms of which 1 ms to minimize.
[2023-03-22 00:45:40] [INFO ] Deduced a trap composed of 440 places in 424 ms of which 1 ms to minimize.
[2023-03-22 00:45:40] [INFO ] Deduced a trap composed of 424 places in 400 ms of which 1 ms to minimize.
[2023-03-22 00:45:41] [INFO ] Deduced a trap composed of 438 places in 405 ms of which 1 ms to minimize.
[2023-03-22 00:45:41] [INFO ] Deduced a trap composed of 440 places in 412 ms of which 0 ms to minimize.
[2023-03-22 00:45:42] [INFO ] Deduced a trap composed of 446 places in 408 ms of which 1 ms to minimize.
[2023-03-22 00:45:42] [INFO ] Deduced a trap composed of 440 places in 411 ms of which 1 ms to minimize.
[2023-03-22 00:45:43] [INFO ] Deduced a trap composed of 458 places in 397 ms of which 1 ms to minimize.
[2023-03-22 00:45:43] [INFO ] Deduced a trap composed of 442 places in 429 ms of which 1 ms to minimize.
[2023-03-22 00:45:44] [INFO ] Deduced a trap composed of 444 places in 389 ms of which 1 ms to minimize.
[2023-03-22 00:45:44] [INFO ] Deduced a trap composed of 446 places in 390 ms of which 1 ms to minimize.
[2023-03-22 00:45:45] [INFO ] Deduced a trap composed of 444 places in 391 ms of which 1 ms to minimize.
[2023-03-22 00:45:45] [INFO ] Deduced a trap composed of 434 places in 396 ms of which 1 ms to minimize.
[2023-03-22 00:45:45] [INFO ] Deduced a trap composed of 440 places in 395 ms of which 1 ms to minimize.
[2023-03-22 00:45:46] [INFO ] Deduced a trap composed of 438 places in 391 ms of which 0 ms to minimize.
[2023-03-22 00:45:46] [INFO ] Deduced a trap composed of 438 places in 390 ms of which 1 ms to minimize.
[2023-03-22 00:45:47] [INFO ] Deduced a trap composed of 436 places in 435 ms of which 1 ms to minimize.
[2023-03-22 00:45:47] [INFO ] Deduced a trap composed of 436 places in 397 ms of which 1 ms to minimize.
[2023-03-22 00:45:48] [INFO ] Deduced a trap composed of 442 places in 395 ms of which 1 ms to minimize.
[2023-03-22 00:45:48] [INFO ] Deduced a trap composed of 438 places in 389 ms of which 1 ms to minimize.
[2023-03-22 00:45:49] [INFO ] Deduced a trap composed of 438 places in 400 ms of which 0 ms to minimize.
[2023-03-22 00:45:49] [INFO ] Deduced a trap composed of 442 places in 392 ms of which 1 ms to minimize.
[2023-03-22 00:45:50] [INFO ] Deduced a trap composed of 436 places in 387 ms of which 0 ms to minimize.
[2023-03-22 00:45:50] [INFO ] Deduced a trap composed of 438 places in 395 ms of which 1 ms to minimize.
[2023-03-22 00:45:51] [INFO ] Deduced a trap composed of 444 places in 383 ms of which 1 ms to minimize.
[2023-03-22 00:45:51] [INFO ] Deduced a trap composed of 444 places in 389 ms of which 1 ms to minimize.
[2023-03-22 00:45:52] [INFO ] Deduced a trap composed of 448 places in 397 ms of which 0 ms to minimize.
[2023-03-22 00:45:52] [INFO ] Deduced a trap composed of 448 places in 426 ms of which 1 ms to minimize.
[2023-03-22 00:45:53] [INFO ] Deduced a trap composed of 434 places in 424 ms of which 1 ms to minimize.
[2023-03-22 00:45:53] [INFO ] Deduced a trap composed of 434 places in 390 ms of which 1 ms to minimize.
[2023-03-22 00:45:54] [INFO ] Deduced a trap composed of 442 places in 426 ms of which 1 ms to minimize.
[2023-03-22 00:45:54] [INFO ] Deduced a trap composed of 440 places in 398 ms of which 1 ms to minimize.
[2023-03-22 00:45:54] [INFO ] Deduced a trap composed of 434 places in 388 ms of which 1 ms to minimize.
[2023-03-22 00:45:55] [INFO ] Deduced a trap composed of 444 places in 384 ms of which 0 ms to minimize.
[2023-03-22 00:45:55] [INFO ] Deduced a trap composed of 450 places in 393 ms of which 1 ms to minimize.
[2023-03-22 00:45:56] [INFO ] Deduced a trap composed of 436 places in 392 ms of which 1 ms to minimize.
[2023-03-22 00:45:56] [INFO ] Deduced a trap composed of 442 places in 404 ms of which 1 ms to minimize.
[2023-03-22 00:45:57] [INFO ] Deduced a trap composed of 430 places in 398 ms of which 1 ms to minimize.
[2023-03-22 00:45:57] [INFO ] Deduced a trap composed of 436 places in 394 ms of which 1 ms to minimize.
[2023-03-22 00:45:58] [INFO ] Deduced a trap composed of 454 places in 405 ms of which 1 ms to minimize.
[2023-03-22 00:45:58] [INFO ] Deduced a trap composed of 426 places in 389 ms of which 1 ms to minimize.
[2023-03-22 00:45:59] [INFO ] Deduced a trap composed of 442 places in 400 ms of which 1 ms to minimize.
[2023-03-22 00:45:59] [INFO ] Deduced a trap composed of 440 places in 432 ms of which 0 ms to minimize.
[2023-03-22 00:46:04] [INFO ] Deduced a trap composed of 438 places in 429 ms of which 0 ms to minimize.
[2023-03-22 00:46:04] [INFO ] Deduced a trap composed of 454 places in 432 ms of which 1 ms to minimize.
[2023-03-22 00:46:05] [INFO ] Deduced a trap composed of 436 places in 458 ms of which 0 ms to minimize.
[2023-03-22 00:46:05] [INFO ] Deduced a trap composed of 438 places in 425 ms of which 1 ms to minimize.
[2023-03-22 00:46:06] [INFO ] Deduced a trap composed of 440 places in 433 ms of which 1 ms to minimize.
[2023-03-22 00:46:07] [INFO ] Deduced a trap composed of 450 places in 429 ms of which 1 ms to minimize.
[2023-03-22 00:46:08] [INFO ] Deduced a trap composed of 446 places in 423 ms of which 1 ms to minimize.
[2023-03-22 00:46:17] [INFO ] Trap strengthening (SAT) tested/added 61/61 trap constraints in 43524 ms
[2023-03-22 00:46:17] [INFO ] After 44257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:46:17] [INFO ] After 44467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1090 transition count 2052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1090 transition count 2051
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 11 place count 1089 transition count 2051
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1089 transition count 2050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1088 transition count 2050
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1088 transition count 2040
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1078 transition count 2040
Applied a total of 33 rules in 191 ms. Remains 1078 /1090 variables (removed 12) and now considering 2040/2061 (removed 21) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:46:17] [INFO ] Invariant cache hit.
[2023-03-22 00:46:18] [INFO ] [Real]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-22 00:46:18] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-22 00:46:18] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:46:18] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-22 00:46:18] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-22 00:46:18] [INFO ] After 572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:46:19] [INFO ] Deduced a trap composed of 420 places in 420 ms of which 1 ms to minimize.
[2023-03-22 00:46:19] [INFO ] Deduced a trap composed of 440 places in 426 ms of which 1 ms to minimize.
[2023-03-22 00:46:20] [INFO ] Deduced a trap composed of 438 places in 419 ms of which 1 ms to minimize.
[2023-03-22 00:46:20] [INFO ] Deduced a trap composed of 446 places in 439 ms of which 1 ms to minimize.
[2023-03-22 00:46:21] [INFO ] Deduced a trap composed of 438 places in 422 ms of which 1 ms to minimize.
[2023-03-22 00:46:21] [INFO ] Deduced a trap composed of 436 places in 433 ms of which 0 ms to minimize.
[2023-03-22 00:46:22] [INFO ] Deduced a trap composed of 440 places in 435 ms of which 1 ms to minimize.
[2023-03-22 00:46:22] [INFO ] Deduced a trap composed of 432 places in 441 ms of which 1 ms to minimize.
[2023-03-22 00:46:23] [INFO ] Deduced a trap composed of 430 places in 425 ms of which 1 ms to minimize.
[2023-03-22 00:46:24] [INFO ] Deduced a trap composed of 442 places in 395 ms of which 1 ms to minimize.
[2023-03-22 00:46:24] [INFO ] Deduced a trap composed of 432 places in 393 ms of which 1 ms to minimize.
[2023-03-22 00:46:25] [INFO ] Deduced a trap composed of 440 places in 389 ms of which 1 ms to minimize.
[2023-03-22 00:46:25] [INFO ] Deduced a trap composed of 436 places in 400 ms of which 1 ms to minimize.
[2023-03-22 00:46:26] [INFO ] Deduced a trap composed of 434 places in 414 ms of which 1 ms to minimize.
[2023-03-22 00:46:26] [INFO ] Deduced a trap composed of 444 places in 392 ms of which 1 ms to minimize.
[2023-03-22 00:46:27] [INFO ] Deduced a trap composed of 436 places in 430 ms of which 0 ms to minimize.
[2023-03-22 00:46:27] [INFO ] Deduced a trap composed of 426 places in 424 ms of which 0 ms to minimize.
[2023-03-22 00:46:28] [INFO ] Deduced a trap composed of 434 places in 429 ms of which 1 ms to minimize.
[2023-03-22 00:46:28] [INFO ] Deduced a trap composed of 428 places in 425 ms of which 1 ms to minimize.
[2023-03-22 00:46:29] [INFO ] Deduced a trap composed of 442 places in 435 ms of which 1 ms to minimize.
[2023-03-22 00:46:29] [INFO ] Deduced a trap composed of 436 places in 424 ms of which 1 ms to minimize.
[2023-03-22 00:46:30] [INFO ] Deduced a trap composed of 440 places in 392 ms of which 1 ms to minimize.
[2023-03-22 00:46:30] [INFO ] Deduced a trap composed of 440 places in 391 ms of which 1 ms to minimize.
[2023-03-22 00:46:31] [INFO ] Deduced a trap composed of 438 places in 438 ms of which 1 ms to minimize.
[2023-03-22 00:46:31] [INFO ] Deduced a trap composed of 424 places in 423 ms of which 1 ms to minimize.
[2023-03-22 00:46:32] [INFO ] Deduced a trap composed of 434 places in 425 ms of which 0 ms to minimize.
[2023-03-22 00:46:32] [INFO ] Deduced a trap composed of 436 places in 417 ms of which 1 ms to minimize.
[2023-03-22 00:46:33] [INFO ] Deduced a trap composed of 436 places in 414 ms of which 1 ms to minimize.
[2023-03-22 00:46:33] [INFO ] Deduced a trap composed of 448 places in 418 ms of which 0 ms to minimize.
[2023-03-22 00:46:34] [INFO ] Deduced a trap composed of 432 places in 452 ms of which 0 ms to minimize.
[2023-03-22 00:46:35] [INFO ] Deduced a trap composed of 424 places in 439 ms of which 1 ms to minimize.
[2023-03-22 00:46:35] [INFO ] Deduced a trap composed of 440 places in 428 ms of which 1 ms to minimize.
[2023-03-22 00:46:35] [INFO ] Deduced a trap composed of 440 places in 420 ms of which 1 ms to minimize.
[2023-03-22 00:46:36] [INFO ] Deduced a trap composed of 438 places in 444 ms of which 1 ms to minimize.
[2023-03-22 00:46:37] [INFO ] Deduced a trap composed of 448 places in 416 ms of which 1 ms to minimize.
[2023-03-22 00:46:37] [INFO ] Deduced a trap composed of 434 places in 414 ms of which 1 ms to minimize.
[2023-03-22 00:46:38] [INFO ] Deduced a trap composed of 442 places in 421 ms of which 0 ms to minimize.
[2023-03-22 00:46:38] [INFO ] Deduced a trap composed of 436 places in 420 ms of which 1 ms to minimize.
[2023-03-22 00:46:39] [INFO ] Deduced a trap composed of 430 places in 417 ms of which 1 ms to minimize.
[2023-03-22 00:46:39] [INFO ] Deduced a trap composed of 450 places in 418 ms of which 1 ms to minimize.
[2023-03-22 00:46:40] [INFO ] Deduced a trap composed of 428 places in 431 ms of which 1 ms to minimize.
[2023-03-22 00:46:40] [INFO ] Deduced a trap composed of 434 places in 423 ms of which 1 ms to minimize.
[2023-03-22 00:46:41] [INFO ] Deduced a trap composed of 422 places in 457 ms of which 1 ms to minimize.
[2023-03-22 00:46:41] [INFO ] Deduced a trap composed of 444 places in 437 ms of which 1 ms to minimize.
[2023-03-22 00:46:42] [INFO ] Deduced a trap composed of 420 places in 452 ms of which 1 ms to minimize.
[2023-03-22 00:46:42] [INFO ] Deduced a trap composed of 440 places in 427 ms of which 1 ms to minimize.
[2023-03-22 00:46:43] [INFO ] Deduced a trap composed of 430 places in 430 ms of which 1 ms to minimize.
[2023-03-22 00:46:44] [INFO ] Deduced a trap composed of 436 places in 411 ms of which 1 ms to minimize.
[2023-03-22 00:46:44] [INFO ] Deduced a trap composed of 454 places in 424 ms of which 0 ms to minimize.
[2023-03-22 00:46:45] [INFO ] Deduced a trap composed of 440 places in 430 ms of which 1 ms to minimize.
[2023-03-22 00:46:45] [INFO ] Deduced a trap composed of 442 places in 422 ms of which 1 ms to minimize.
[2023-03-22 00:46:46] [INFO ] Deduced a trap composed of 442 places in 417 ms of which 1 ms to minimize.
[2023-03-22 00:46:46] [INFO ] Deduced a trap composed of 446 places in 443 ms of which 1 ms to minimize.
[2023-03-22 00:46:47] [INFO ] Deduced a trap composed of 446 places in 447 ms of which 1 ms to minimize.
[2023-03-22 00:46:47] [INFO ] Deduced a trap composed of 446 places in 416 ms of which 0 ms to minimize.
[2023-03-22 00:46:48] [INFO ] Deduced a trap composed of 440 places in 497 ms of which 1 ms to minimize.
[2023-03-22 00:46:49] [INFO ] Deduced a trap composed of 428 places in 424 ms of which 0 ms to minimize.
[2023-03-22 00:46:49] [INFO ] Deduced a trap composed of 426 places in 420 ms of which 1 ms to minimize.
[2023-03-22 00:46:50] [INFO ] Deduced a trap composed of 430 places in 437 ms of which 1 ms to minimize.
[2023-03-22 00:46:50] [INFO ] Deduced a trap composed of 426 places in 422 ms of which 1 ms to minimize.
[2023-03-22 00:46:50] [INFO ] Deduced a trap composed of 440 places in 425 ms of which 0 ms to minimize.
[2023-03-22 00:46:51] [INFO ] Deduced a trap composed of 438 places in 422 ms of which 1 ms to minimize.
[2023-03-22 00:46:52] [INFO ] Deduced a trap composed of 446 places in 435 ms of which 0 ms to minimize.
[2023-03-22 00:46:52] [INFO ] Deduced a trap composed of 448 places in 405 ms of which 1 ms to minimize.
[2023-03-22 00:46:53] [INFO ] Deduced a trap composed of 444 places in 431 ms of which 1 ms to minimize.
[2023-03-22 00:46:53] [INFO ] Deduced a trap composed of 448 places in 418 ms of which 1 ms to minimize.
[2023-03-22 00:46:54] [INFO ] Deduced a trap composed of 448 places in 437 ms of which 1 ms to minimize.
[2023-03-22 00:46:54] [INFO ] Deduced a trap composed of 438 places in 426 ms of which 1 ms to minimize.
[2023-03-22 00:46:55] [INFO ] Deduced a trap composed of 442 places in 423 ms of which 1 ms to minimize.
[2023-03-22 00:46:55] [INFO ] Deduced a trap composed of 444 places in 420 ms of which 1 ms to minimize.
[2023-03-22 00:46:56] [INFO ] Deduced a trap composed of 444 places in 421 ms of which 1 ms to minimize.
[2023-03-22 00:46:56] [INFO ] Deduced a trap composed of 450 places in 424 ms of which 1 ms to minimize.
[2023-03-22 00:46:57] [INFO ] Deduced a trap composed of 444 places in 423 ms of which 0 ms to minimize.
[2023-03-22 00:46:57] [INFO ] Deduced a trap composed of 438 places in 423 ms of which 1 ms to minimize.
[2023-03-22 00:46:58] [INFO ] Deduced a trap composed of 442 places in 424 ms of which 1 ms to minimize.
[2023-03-22 00:46:58] [INFO ] Deduced a trap composed of 430 places in 425 ms of which 0 ms to minimize.
[2023-03-22 00:46:59] [INFO ] Deduced a trap composed of 444 places in 414 ms of which 0 ms to minimize.
[2023-03-22 00:46:59] [INFO ] Deduced a trap composed of 444 places in 427 ms of which 1 ms to minimize.
[2023-03-22 00:47:00] [INFO ] Deduced a trap composed of 454 places in 428 ms of which 1 ms to minimize.
[2023-03-22 00:47:00] [INFO ] Deduced a trap composed of 440 places in 415 ms of which 1 ms to minimize.
[2023-03-22 00:47:01] [INFO ] Deduced a trap composed of 442 places in 416 ms of which 0 ms to minimize.
[2023-03-22 00:47:01] [INFO ] Deduced a trap composed of 446 places in 430 ms of which 1 ms to minimize.
[2023-03-22 00:47:02] [INFO ] Deduced a trap composed of 436 places in 429 ms of which 0 ms to minimize.
[2023-03-22 00:47:02] [INFO ] Deduced a trap composed of 444 places in 436 ms of which 1 ms to minimize.
[2023-03-22 00:47:03] [INFO ] Deduced a trap composed of 432 places in 431 ms of which 1 ms to minimize.
[2023-03-22 00:47:03] [INFO ] Deduced a trap composed of 446 places in 431 ms of which 1 ms to minimize.
[2023-03-22 00:47:04] [INFO ] Deduced a trap composed of 434 places in 432 ms of which 1 ms to minimize.
[2023-03-22 00:47:04] [INFO ] Deduced a trap composed of 442 places in 425 ms of which 0 ms to minimize.
[2023-03-22 00:47:05] [INFO ] Deduced a trap composed of 434 places in 434 ms of which 0 ms to minimize.
[2023-03-22 00:47:05] [INFO ] Deduced a trap composed of 440 places in 429 ms of which 1 ms to minimize.
[2023-03-22 00:47:06] [INFO ] Deduced a trap composed of 444 places in 428 ms of which 1 ms to minimize.
[2023-03-22 00:47:06] [INFO ] Deduced a trap composed of 444 places in 428 ms of which 1 ms to minimize.
[2023-03-22 00:47:07] [INFO ] Deduced a trap composed of 440 places in 436 ms of which 1 ms to minimize.
[2023-03-22 00:47:07] [INFO ] Deduced a trap composed of 444 places in 440 ms of which 1 ms to minimize.
[2023-03-22 00:47:08] [INFO ] Deduced a trap composed of 438 places in 417 ms of which 1 ms to minimize.
[2023-03-22 00:47:08] [INFO ] Deduced a trap composed of 440 places in 430 ms of which 1 ms to minimize.
[2023-03-22 00:47:09] [INFO ] Deduced a trap composed of 428 places in 437 ms of which 1 ms to minimize.
[2023-03-22 00:47:09] [INFO ] Deduced a trap composed of 452 places in 428 ms of which 1 ms to minimize.
[2023-03-22 00:47:10] [INFO ] Deduced a trap composed of 446 places in 432 ms of which 1 ms to minimize.
[2023-03-22 00:47:10] [INFO ] Deduced a trap composed of 440 places in 432 ms of which 1 ms to minimize.
[2023-03-22 00:47:11] [INFO ] Deduced a trap composed of 440 places in 441 ms of which 1 ms to minimize.
[2023-03-22 00:47:11] [INFO ] Deduced a trap composed of 438 places in 435 ms of which 1 ms to minimize.
[2023-03-22 00:47:12] [INFO ] Deduced a trap composed of 440 places in 416 ms of which 1 ms to minimize.
[2023-03-22 00:47:12] [INFO ] Deduced a trap composed of 448 places in 422 ms of which 1 ms to minimize.
[2023-03-22 00:47:13] [INFO ] Deduced a trap composed of 436 places in 436 ms of which 1 ms to minimize.
[2023-03-22 00:47:13] [INFO ] Deduced a trap composed of 444 places in 436 ms of which 1 ms to minimize.
[2023-03-22 00:47:14] [INFO ] Deduced a trap composed of 430 places in 430 ms of which 1 ms to minimize.
[2023-03-22 00:47:14] [INFO ] Deduced a trap composed of 440 places in 427 ms of which 1 ms to minimize.
[2023-03-22 00:47:15] [INFO ] Deduced a trap composed of 436 places in 440 ms of which 1 ms to minimize.
[2023-03-22 00:47:15] [INFO ] Deduced a trap composed of 436 places in 428 ms of which 1 ms to minimize.
[2023-03-22 00:47:16] [INFO ] Deduced a trap composed of 442 places in 436 ms of which 1 ms to minimize.
[2023-03-22 00:47:16] [INFO ] Deduced a trap composed of 438 places in 426 ms of which 1 ms to minimize.
[2023-03-22 00:47:17] [INFO ] Deduced a trap composed of 438 places in 431 ms of which 1 ms to minimize.
[2023-03-22 00:50:03] [INFO ] Trap strengthening (SAT) tested/added 113/113 trap constraints in 224233 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 00:50:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:50:03] [INFO ] After 225017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
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 791693 ms.
starting LoLA
BK_INPUT PolyORBNT-COL-S10J60
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: 16393228 kB
MemFree: 15317480 kB
After kill :
MemTotal: 16393228 kB
MemFree: 16110864 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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: 1294, Transitions: 12980
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 t2474
lola: LAUNCH SYMM
sara: try reading problem file stateEquationProblem-QuasiLiveness-217.sara.
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
sara: place or transition ordering is non-deterministic

lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: SARA FINISHED
lola: STATE EQUATION TRIES TRANSITION t12895
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
sara: try reading problem file stateEquationProblem-QuasiLiveness-6172.sara.
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
sara: place or transition ordering is non-deterministic

lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: reporting
lola: not produced: 1227
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11440
lola: SARA FINISHED
lola: STATE EQUATION TRIES TRANSITION t1046
sara: try reading problem file stateEquationProblem-QuasiLiveness-12404.sara.
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1127
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11539
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: reporting
lola: not produced: 1064
lola: state equation: 1
lola: find path: 299
lola: goal oriented search: 16
lola: symmetry: 1
lola: high level: 11599
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 1006 secs. Pages in use: 5

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-S10J60"
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-S10J60, 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-167873963000437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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