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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 00:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 00:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 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 1679443636966

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-S05J80
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 00:07:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-22 00:07:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:07:18] [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:07:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 00:07:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 659 ms
[2023-03-22 00:07:19] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 18 ms.
[2023-03-22 00:07:19] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 61 ms.
[2023-03-22 00:07:19] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-22 00:07:19] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-22 00:07:19] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-22 00:07:19] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 80 places in 11 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 689 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-22 00:07:19] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-22 00:07:19] [INFO ] Computed 182 place invariants in 126 ms
[2023-03-22 00:07:20] [INFO ] [Real]Absence check using 175 positive place invariants in 91 ms returned sat
[2023-03-22 00:07:20] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 38 ms returned sat
[2023-03-22 00:07:21] [INFO ] After 1097ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:07:21] [INFO ] [Nat]Absence check using 175 positive place invariants in 46 ms returned sat
[2023-03-22 00:07:21] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-22 00:07:24] [INFO ] After 3568ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:07:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:07:25] [INFO ] After 802ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:07:25] [INFO ] After 928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-22 00:07:25] [INFO ] After 4792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 1184 transition count 1609
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 177 place count 1098 transition count 1524
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 347 place count 1013 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 348 place count 1012 transition count 1523
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 1012 transition count 1523
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 353 place count 1010 transition count 1521
Applied a total of 353 rules in 413 ms. Remains 1010 /1189 variables (removed 179) and now considering 1521/1695 (removed 174) transitions.
[2023-03-22 00:07:26] [INFO ] Flow matrix only has 1517 transitions (discarded 4 similar events)
// Phase 1: matrix 1517 rows 1010 cols
[2023-03-22 00:07:26] [INFO ] Computed 177 place invariants in 89 ms
[2023-03-22 00:07:27] [INFO ] Dead Transitions using invariants and state equation in 1155 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1010/1189 places, 1426/1695 transitions.
Applied a total of 0 rules in 54 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1623 ms. Remains : 1010/1189 places, 1426/1695 transitions.
Incomplete random walk after 1000002 steps, including 52008 resets, run finished after 6983 ms. (steps per millisecond=143 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2716 resets, run finished after 1687 ms. (steps per millisecond=592 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2168216 steps, run timeout after 24001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 2168216 steps, saw 676114 distinct states, run finished after 24003 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:08:00] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-22 00:08:00] [INFO ] Computed 177 place invariants in 32 ms
[2023-03-22 00:08:00] [INFO ] [Real]Absence check using 170 positive place invariants in 38 ms returned sat
[2023-03-22 00:08:00] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-22 00:08:00] [INFO ] After 731ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:08:01] [INFO ] [Nat]Absence check using 170 positive place invariants in 32 ms returned sat
[2023-03-22 00:08:01] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-22 00:08:01] [INFO ] After 460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:08:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:08:01] [INFO ] After 380ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:08:02] [INFO ] Deduced a trap composed of 320 places in 343 ms of which 1 ms to minimize.
[2023-03-22 00:08:02] [INFO ] Deduced a trap composed of 320 places in 348 ms of which 1 ms to minimize.
[2023-03-22 00:08:03] [INFO ] Deduced a trap composed of 314 places in 309 ms of which 1 ms to minimize.
[2023-03-22 00:08:03] [INFO ] Deduced a trap composed of 317 places in 326 ms of which 4 ms to minimize.
[2023-03-22 00:08:04] [INFO ] Deduced a trap composed of 311 places in 311 ms of which 1 ms to minimize.
[2023-03-22 00:08:04] [INFO ] Deduced a trap composed of 320 places in 349 ms of which 1 ms to minimize.
[2023-03-22 00:08:04] [INFO ] Deduced a trap composed of 332 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:08:05] [INFO ] Deduced a trap composed of 314 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:08:05] [INFO ] Deduced a trap composed of 332 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:08:05] [INFO ] Deduced a trap composed of 323 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:08:06] [INFO ] Deduced a trap composed of 311 places in 293 ms of which 0 ms to minimize.
[2023-03-22 00:08:06] [INFO ] Deduced a trap composed of 326 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:08:06] [INFO ] Deduced a trap composed of 329 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:08:07] [INFO ] Deduced a trap composed of 332 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:08:07] [INFO ] Deduced a trap composed of 332 places in 312 ms of which 1 ms to minimize.
[2023-03-22 00:08:08] [INFO ] Deduced a trap composed of 314 places in 303 ms of which 0 ms to minimize.
[2023-03-22 00:08:08] [INFO ] Deduced a trap composed of 317 places in 293 ms of which 0 ms to minimize.
[2023-03-22 00:08:09] [INFO ] Deduced a trap composed of 329 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:08:09] [INFO ] Deduced a trap composed of 338 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:08:09] [INFO ] Deduced a trap composed of 338 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:08:10] [INFO ] Deduced a trap composed of 317 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:08:10] [INFO ] Deduced a trap composed of 308 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:08:10] [INFO ] Deduced a trap composed of 335 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:08:11] [INFO ] Deduced a trap composed of 317 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:08:11] [INFO ] Deduced a trap composed of 338 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:08:12] [INFO ] Deduced a trap composed of 329 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:08:13] [INFO ] Deduced a trap composed of 308 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:08:14] [INFO ] Deduced a trap composed of 326 places in 289 ms of which 1 ms to minimize.
[2023-03-22 00:08:14] [INFO ] Deduced a trap composed of 332 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:08:15] [INFO ] Deduced a trap composed of 329 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:08:15] [INFO ] Deduced a trap composed of 320 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:08:16] [INFO ] Deduced a trap composed of 335 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:08:16] [INFO ] Deduced a trap composed of 323 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:08:17] [INFO ] Deduced a trap composed of 320 places in 311 ms of which 4 ms to minimize.
[2023-03-22 00:08:17] [INFO ] Deduced a trap composed of 347 places in 288 ms of which 0 ms to minimize.
[2023-03-22 00:08:17] [INFO ] Deduced a trap composed of 329 places in 306 ms of which 2 ms to minimize.
[2023-03-22 00:08:18] [INFO ] Deduced a trap composed of 320 places in 286 ms of which 1 ms to minimize.
[2023-03-22 00:08:27] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 25488 ms
[2023-03-22 00:08:27] [INFO ] After 26209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:08:27] [INFO ] After 26862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 60 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 44 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-22 00:08:27] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 00:08:27] [INFO ] Invariant cache hit.
[2023-03-22 00:08:29] [INFO ] Implicit Places using invariants in 1408 ms returned []
[2023-03-22 00:08:29] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 00:08:29] [INFO ] Invariant cache hit.
[2023-03-22 00:08:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:08:33] [INFO ] Implicit Places using invariants and state equation in 4598 ms returned []
Implicit Place search using SMT with State Equation took 6009 ms to find 0 implicit places.
[2023-03-22 00:08:33] [INFO ] Redundant transitions in 86 ms returned []
[2023-03-22 00:08:34] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 00:08:34] [INFO ] Invariant cache hit.
[2023-03-22 00:08:35] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7161 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Incomplete random walk after 100000 steps, including 5235 resets, run finished after 789 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:08:35] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 00:08:35] [INFO ] Invariant cache hit.
[2023-03-22 00:08:35] [INFO ] [Real]Absence check using 170 positive place invariants in 32 ms returned sat
[2023-03-22 00:08:35] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-22 00:08:36] [INFO ] After 407ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:08:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:08:36] [INFO ] After 49ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:08:36] [INFO ] After 126ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:08:36] [INFO ] After 699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:08:36] [INFO ] [Nat]Absence check using 170 positive place invariants in 29 ms returned sat
[2023-03-22 00:08:36] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-22 00:08:37] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:08:37] [INFO ] After 478ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:08:37] [INFO ] Deduced a trap composed of 308 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:08:38] [INFO ] Deduced a trap composed of 311 places in 314 ms of which 1 ms to minimize.
[2023-03-22 00:08:38] [INFO ] Deduced a trap composed of 326 places in 331 ms of which 1 ms to minimize.
[2023-03-22 00:08:39] [INFO ] Deduced a trap composed of 323 places in 316 ms of which 1 ms to minimize.
[2023-03-22 00:08:39] [INFO ] Deduced a trap composed of 320 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:08:39] [INFO ] Deduced a trap composed of 320 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:08:40] [INFO ] Deduced a trap composed of 320 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:08:40] [INFO ] Deduced a trap composed of 311 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:08:40] [INFO ] Deduced a trap composed of 326 places in 290 ms of which 1 ms to minimize.
[2023-03-22 00:08:41] [INFO ] Deduced a trap composed of 320 places in 307 ms of which 1 ms to minimize.
[2023-03-22 00:08:41] [INFO ] Deduced a trap composed of 335 places in 307 ms of which 1 ms to minimize.
[2023-03-22 00:08:42] [INFO ] Deduced a trap composed of 332 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:08:42] [INFO ] Deduced a trap composed of 317 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:08:42] [INFO ] Deduced a trap composed of 347 places in 295 ms of which 0 ms to minimize.
[2023-03-22 00:08:43] [INFO ] Deduced a trap composed of 341 places in 304 ms of which 0 ms to minimize.
[2023-03-22 00:08:43] [INFO ] Deduced a trap composed of 326 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:08:44] [INFO ] Deduced a trap composed of 326 places in 307 ms of which 0 ms to minimize.
[2023-03-22 00:08:45] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:08:45] [INFO ] Deduced a trap composed of 332 places in 303 ms of which 2 ms to minimize.
[2023-03-22 00:08:47] [INFO ] Deduced a trap composed of 314 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:08:47] [INFO ] Deduced a trap composed of 308 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:08:47] [INFO ] Deduced a trap composed of 323 places in 308 ms of which 0 ms to minimize.
[2023-03-22 00:08:48] [INFO ] Deduced a trap composed of 338 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:08:48] [INFO ] Deduced a trap composed of 323 places in 301 ms of which 2 ms to minimize.
[2023-03-22 00:08:49] [INFO ] Deduced a trap composed of 341 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:08:49] [INFO ] Deduced a trap composed of 341 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:08:49] [INFO ] Deduced a trap composed of 332 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:08:50] [INFO ] Deduced a trap composed of 305 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:08:50] [INFO ] Deduced a trap composed of 317 places in 306 ms of which 3 ms to minimize.
[2023-03-22 00:08:52] [INFO ] Deduced a trap composed of 320 places in 308 ms of which 6 ms to minimize.
[2023-03-22 00:08:53] [INFO ] Deduced a trap composed of 335 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:08:53] [INFO ] Deduced a trap composed of 335 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:08:53] [INFO ] Deduced a trap composed of 308 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:08:54] [INFO ] Deduced a trap composed of 326 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:08:57] [INFO ] Deduced a trap composed of 323 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:08:58] [INFO ] Deduced a trap composed of 308 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:08:58] [INFO ] Deduced a trap composed of 317 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:08:59] [INFO ] Deduced a trap composed of 344 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:09:08] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 31035 ms
[2023-03-22 00:09:08] [INFO ] After 31825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:09:08] [INFO ] After 32339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 51957 resets, run finished after 6505 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2595 resets, run finished after 1562 ms. (steps per millisecond=640 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2203014 steps, run timeout after 24001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 2203014 steps, saw 687122 distinct states, run finished after 24001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:09:40] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 00:09:40] [INFO ] Invariant cache hit.
[2023-03-22 00:09:41] [INFO ] [Real]Absence check using 170 positive place invariants in 34 ms returned sat
[2023-03-22 00:09:41] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-22 00:09:41] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:09:41] [INFO ] [Nat]Absence check using 170 positive place invariants in 33 ms returned sat
[2023-03-22 00:09:41] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-22 00:09:41] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:09:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:09:42] [INFO ] After 529ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:09:42] [INFO ] Deduced a trap composed of 308 places in 294 ms of which 0 ms to minimize.
[2023-03-22 00:09:42] [INFO ] Deduced a trap composed of 311 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:09:43] [INFO ] Deduced a trap composed of 326 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:09:43] [INFO ] Deduced a trap composed of 323 places in 302 ms of which 0 ms to minimize.
[2023-03-22 00:09:44] [INFO ] Deduced a trap composed of 320 places in 289 ms of which 0 ms to minimize.
[2023-03-22 00:09:44] [INFO ] Deduced a trap composed of 320 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:09:44] [INFO ] Deduced a trap composed of 320 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:09:45] [INFO ] Deduced a trap composed of 311 places in 307 ms of which 1 ms to minimize.
[2023-03-22 00:09:45] [INFO ] Deduced a trap composed of 326 places in 289 ms of which 1 ms to minimize.
[2023-03-22 00:09:45] [INFO ] Deduced a trap composed of 320 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:09:46] [INFO ] Deduced a trap composed of 335 places in 302 ms of which 0 ms to minimize.
[2023-03-22 00:09:46] [INFO ] Deduced a trap composed of 332 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:09:47] [INFO ] Deduced a trap composed of 317 places in 297 ms of which 0 ms to minimize.
[2023-03-22 00:09:47] [INFO ] Deduced a trap composed of 347 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:09:48] [INFO ] Deduced a trap composed of 341 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:09:48] [INFO ] Deduced a trap composed of 326 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:09:48] [INFO ] Deduced a trap composed of 326 places in 297 ms of which 0 ms to minimize.
[2023-03-22 00:09:50] [INFO ] Deduced a trap composed of 302 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:09:50] [INFO ] Deduced a trap composed of 332 places in 294 ms of which 0 ms to minimize.
[2023-03-22 00:09:51] [INFO ] Deduced a trap composed of 314 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:09:52] [INFO ] Deduced a trap composed of 308 places in 313 ms of which 1 ms to minimize.
[2023-03-22 00:09:52] [INFO ] Deduced a trap composed of 323 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:09:52] [INFO ] Deduced a trap composed of 338 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:09:53] [INFO ] Deduced a trap composed of 323 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:09:53] [INFO ] Deduced a trap composed of 341 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:09:53] [INFO ] Deduced a trap composed of 341 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:09:54] [INFO ] Deduced a trap composed of 332 places in 305 ms of which 1 ms to minimize.
[2023-03-22 00:09:54] [INFO ] Deduced a trap composed of 305 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:09:55] [INFO ] Deduced a trap composed of 317 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:09:56] [INFO ] Deduced a trap composed of 320 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:09:57] [INFO ] Deduced a trap composed of 335 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:09:57] [INFO ] Deduced a trap composed of 335 places in 298 ms of which 0 ms to minimize.
[2023-03-22 00:09:58] [INFO ] Deduced a trap composed of 308 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:09:58] [INFO ] Deduced a trap composed of 326 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:10:01] [INFO ] Deduced a trap composed of 323 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:10:02] [INFO ] Deduced a trap composed of 308 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:10:03] [INFO ] Deduced a trap composed of 317 places in 290 ms of which 1 ms to minimize.
[2023-03-22 00:10:03] [INFO ] Deduced a trap composed of 344 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:10:12] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 30663 ms
[2023-03-22 00:10:13] [INFO ] After 31387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:10:13] [INFO ] After 31991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 40 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 46 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-22 00:10:13] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 00:10:13] [INFO ] Invariant cache hit.
[2023-03-22 00:10:14] [INFO ] Implicit Places using invariants in 1457 ms returned []
[2023-03-22 00:10:14] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 00:10:14] [INFO ] Invariant cache hit.
[2023-03-22 00:10:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:10:19] [INFO ] Implicit Places using invariants and state equation in 4379 ms returned []
Implicit Place search using SMT with State Equation took 5844 ms to find 0 implicit places.
[2023-03-22 00:10:19] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-22 00:10:19] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 00:10:19] [INFO ] Invariant cache hit.
[2023-03-22 00:10:20] [INFO ] Dead Transitions using invariants and state equation in 976 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6939 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Incomplete random walk after 100000 steps, including 5196 resets, run finished after 650 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:10:20] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 00:10:20] [INFO ] Invariant cache hit.
[2023-03-22 00:10:20] [INFO ] [Real]Absence check using 170 positive place invariants in 45 ms returned sat
[2023-03-22 00:10:20] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-22 00:10:21] [INFO ] After 393ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:10:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:10:21] [INFO ] After 50ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:10:21] [INFO ] After 121ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:10:21] [INFO ] After 683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:10:21] [INFO ] [Nat]Absence check using 170 positive place invariants in 31 ms returned sat
[2023-03-22 00:10:21] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-22 00:10:21] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:10:22] [INFO ] After 477ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:10:22] [INFO ] Deduced a trap composed of 308 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:10:23] [INFO ] Deduced a trap composed of 311 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:10:23] [INFO ] Deduced a trap composed of 326 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:10:23] [INFO ] Deduced a trap composed of 323 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:10:24] [INFO ] Deduced a trap composed of 320 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:10:24] [INFO ] Deduced a trap composed of 320 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:10:25] [INFO ] Deduced a trap composed of 320 places in 304 ms of which 0 ms to minimize.
[2023-03-22 00:10:25] [INFO ] Deduced a trap composed of 311 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:10:25] [INFO ] Deduced a trap composed of 326 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:10:26] [INFO ] Deduced a trap composed of 320 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:10:26] [INFO ] Deduced a trap composed of 335 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:10:26] [INFO ] Deduced a trap composed of 332 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:10:27] [INFO ] Deduced a trap composed of 317 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:10:27] [INFO ] Deduced a trap composed of 347 places in 286 ms of which 1 ms to minimize.
[2023-03-22 00:10:28] [INFO ] Deduced a trap composed of 341 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:10:28] [INFO ] Deduced a trap composed of 326 places in 316 ms of which 0 ms to minimize.
[2023-03-22 00:10:29] [INFO ] Deduced a trap composed of 326 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:10:30] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:10:30] [INFO ] Deduced a trap composed of 332 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:10:32] [INFO ] Deduced a trap composed of 314 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:10:32] [INFO ] Deduced a trap composed of 308 places in 289 ms of which 1 ms to minimize.
[2023-03-22 00:10:32] [INFO ] Deduced a trap composed of 323 places in 309 ms of which 0 ms to minimize.
[2023-03-22 00:10:33] [INFO ] Deduced a trap composed of 338 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:10:33] [INFO ] Deduced a trap composed of 323 places in 302 ms of which 0 ms to minimize.
[2023-03-22 00:10:33] [INFO ] Deduced a trap composed of 341 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:10:34] [INFO ] Deduced a trap composed of 341 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:10:34] [INFO ] Deduced a trap composed of 332 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:10:35] [INFO ] Deduced a trap composed of 305 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:10:35] [INFO ] Deduced a trap composed of 317 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:10:37] [INFO ] Deduced a trap composed of 320 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:10:37] [INFO ] Deduced a trap composed of 335 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:10:38] [INFO ] Deduced a trap composed of 335 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:10:38] [INFO ] Deduced a trap composed of 308 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:10:39] [INFO ] Deduced a trap composed of 326 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:10:42] [INFO ] Deduced a trap composed of 323 places in 289 ms of which 0 ms to minimize.
[2023-03-22 00:10:42] [INFO ] Deduced a trap composed of 308 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:10:43] [INFO ] Deduced a trap composed of 317 places in 295 ms of which 0 ms to minimize.
[2023-03-22 00:10:44] [INFO ] Deduced a trap composed of 344 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:10:53] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 30823 ms
[2023-03-22 00:10:53] [INFO ] After 31560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:10:53] [INFO ] After 32108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 510 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 277603 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 277603 steps, saw 83611 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:10:56] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 00:10:56] [INFO ] Invariant cache hit.
[2023-03-22 00:10:56] [INFO ] [Real]Absence check using 170 positive place invariants in 33 ms returned sat
[2023-03-22 00:10:56] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-22 00:10:56] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:10:56] [INFO ] [Nat]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-22 00:10:57] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-22 00:10:57] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:10:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:10:57] [INFO ] After 330ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:10:58] [INFO ] Deduced a trap composed of 341 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:10:58] [INFO ] Deduced a trap composed of 314 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:10:58] [INFO ] Deduced a trap composed of 311 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:10:59] [INFO ] Deduced a trap composed of 326 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:10:59] [INFO ] Deduced a trap composed of 311 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:11:00] [INFO ] Deduced a trap composed of 305 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:11:00] [INFO ] Deduced a trap composed of 332 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:11:01] [INFO ] Deduced a trap composed of 314 places in 303 ms of which 0 ms to minimize.
[2023-03-22 00:11:01] [INFO ] Deduced a trap composed of 326 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:11:01] [INFO ] Deduced a trap composed of 324 places in 313 ms of which 1 ms to minimize.
[2023-03-22 00:11:02] [INFO ] Deduced a trap composed of 320 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:11:02] [INFO ] Deduced a trap composed of 326 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:11:02] [INFO ] Deduced a trap composed of 326 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:11:03] [INFO ] Deduced a trap composed of 320 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:11:03] [INFO ] Deduced a trap composed of 347 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:11:04] [INFO ] Deduced a trap composed of 332 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:11:04] [INFO ] Deduced a trap composed of 314 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:11:04] [INFO ] Deduced a trap composed of 305 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:11:05] [INFO ] Deduced a trap composed of 299 places in 292 ms of which 0 ms to minimize.
[2023-03-22 00:11:05] [INFO ] Deduced a trap composed of 326 places in 287 ms of which 1 ms to minimize.
[2023-03-22 00:11:05] [INFO ] Deduced a trap composed of 323 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:11:06] [INFO ] Deduced a trap composed of 311 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:11:06] [INFO ] Deduced a trap composed of 326 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:11:07] [INFO ] Deduced a trap composed of 332 places in 309 ms of which 1 ms to minimize.
[2023-03-22 00:11:08] [INFO ] Deduced a trap composed of 326 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:11:08] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:11:09] [INFO ] Deduced a trap composed of 332 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:11:09] [INFO ] Deduced a trap composed of 302 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:11:10] [INFO ] Deduced a trap composed of 326 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:11:10] [INFO ] Deduced a trap composed of 353 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:11:10] [INFO ] Deduced a trap composed of 317 places in 293 ms of which 0 ms to minimize.
[2023-03-22 00:11:12] [INFO ] Deduced a trap composed of 311 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:11:12] [INFO ] Deduced a trap composed of 311 places in 309 ms of which 0 ms to minimize.
[2023-03-22 00:11:13] [INFO ] Deduced a trap composed of 335 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:11:13] [INFO ] Deduced a trap composed of 311 places in 307 ms of which 1 ms to minimize.
[2023-03-22 00:11:14] [INFO ] Deduced a trap composed of 317 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:11:14] [INFO ] Deduced a trap composed of 311 places in 313 ms of which 1 ms to minimize.
[2023-03-22 00:11:14] [INFO ] Deduced a trap composed of 317 places in 286 ms of which 1 ms to minimize.
[2023-03-22 00:11:15] [INFO ] Deduced a trap composed of 335 places in 305 ms of which 1 ms to minimize.
[2023-03-22 00:11:15] [INFO ] Deduced a trap composed of 311 places in 302 ms of which 0 ms to minimize.
[2023-03-22 00:11:16] [INFO ] Deduced a trap composed of 344 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:11:16] [INFO ] Deduced a trap composed of 341 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:11:16] [INFO ] Deduced a trap composed of 305 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:11:17] [INFO ] Deduced a trap composed of 311 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:11:21] [INFO ] Deduced a trap composed of 317 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:11:21] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 24070 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.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:11:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:11:21] [INFO ] After 25025ms 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 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 52 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-22 00:11:21] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 00:11:21] [INFO ] Invariant cache hit.
[2023-03-22 00:11:22] [INFO ] Dead Transitions using invariants and state equation in 991 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1044 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Incomplete random walk after 10000 steps, including 516 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 277461 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 277461 steps, saw 83561 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:11:26] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 00:11:26] [INFO ] Invariant cache hit.
[2023-03-22 00:11:26] [INFO ] [Real]Absence check using 170 positive place invariants in 33 ms returned sat
[2023-03-22 00:11:26] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-22 00:11:26] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:11:26] [INFO ] [Nat]Absence check using 170 positive place invariants in 34 ms returned sat
[2023-03-22 00:11:26] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-22 00:11:26] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:11:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:11:27] [INFO ] After 333ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:11:27] [INFO ] Deduced a trap composed of 341 places in 300 ms of which 0 ms to minimize.
[2023-03-22 00:11:27] [INFO ] Deduced a trap composed of 314 places in 297 ms of which 0 ms to minimize.
[2023-03-22 00:11:28] [INFO ] Deduced a trap composed of 311 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:11:28] [INFO ] Deduced a trap composed of 326 places in 297 ms of which 0 ms to minimize.
[2023-03-22 00:11:29] [INFO ] Deduced a trap composed of 311 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:11:29] [INFO ] Deduced a trap composed of 305 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:11:29] [INFO ] Deduced a trap composed of 332 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:11:30] [INFO ] Deduced a trap composed of 314 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:11:30] [INFO ] Deduced a trap composed of 326 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:11:31] [INFO ] Deduced a trap composed of 324 places in 309 ms of which 1 ms to minimize.
[2023-03-22 00:11:31] [INFO ] Deduced a trap composed of 320 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:11:31] [INFO ] Deduced a trap composed of 326 places in 286 ms of which 0 ms to minimize.
[2023-03-22 00:11:32] [INFO ] Deduced a trap composed of 326 places in 307 ms of which 1 ms to minimize.
[2023-03-22 00:11:32] [INFO ] Deduced a trap composed of 320 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:11:33] [INFO ] Deduced a trap composed of 347 places in 287 ms of which 1 ms to minimize.
[2023-03-22 00:11:33] [INFO ] Deduced a trap composed of 332 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:11:33] [INFO ] Deduced a trap composed of 314 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:11:34] [INFO ] Deduced a trap composed of 305 places in 308 ms of which 0 ms to minimize.
[2023-03-22 00:11:34] [INFO ] Deduced a trap composed of 299 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:11:34] [INFO ] Deduced a trap composed of 326 places in 289 ms of which 1 ms to minimize.
[2023-03-22 00:11:35] [INFO ] Deduced a trap composed of 323 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:11:35] [INFO ] Deduced a trap composed of 311 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:11:36] [INFO ] Deduced a trap composed of 326 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:11:36] [INFO ] Deduced a trap composed of 332 places in 303 ms of which 0 ms to minimize.
[2023-03-22 00:11:37] [INFO ] Deduced a trap composed of 326 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:11:38] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:11:38] [INFO ] Deduced a trap composed of 332 places in 297 ms of which 0 ms to minimize.
[2023-03-22 00:11:39] [INFO ] Deduced a trap composed of 302 places in 308 ms of which 1 ms to minimize.
[2023-03-22 00:11:39] [INFO ] Deduced a trap composed of 326 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:11:39] [INFO ] Deduced a trap composed of 353 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:11:40] [INFO ] Deduced a trap composed of 317 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:11:41] [INFO ] Deduced a trap composed of 311 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:11:41] [INFO ] Deduced a trap composed of 311 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:11:42] [INFO ] Deduced a trap composed of 335 places in 308 ms of which 0 ms to minimize.
[2023-03-22 00:11:42] [INFO ] Deduced a trap composed of 311 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:11:43] [INFO ] Deduced a trap composed of 317 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:11:43] [INFO ] Deduced a trap composed of 311 places in 295 ms of which 0 ms to minimize.
[2023-03-22 00:11:44] [INFO ] Deduced a trap composed of 317 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:11:44] [INFO ] Deduced a trap composed of 335 places in 303 ms of which 0 ms to minimize.
[2023-03-22 00:11:45] [INFO ] Deduced a trap composed of 311 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:11:45] [INFO ] Deduced a trap composed of 344 places in 298 ms of which 0 ms to minimize.
[2023-03-22 00:11:45] [INFO ] Deduced a trap composed of 341 places in 310 ms of which 1 ms to minimize.
[2023-03-22 00:11:46] [INFO ] Deduced a trap composed of 305 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:11:46] [INFO ] Deduced a trap composed of 311 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:11:51] [INFO ] Deduced a trap composed of 317 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:11:51] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 24071 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.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:11:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:11:51] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 38 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 33 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-22 00:11:51] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 00:11:51] [INFO ] Invariant cache hit.
[2023-03-22 00:11:52] [INFO ] Implicit Places using invariants in 1350 ms returned []
[2023-03-22 00:11:52] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 00:11:52] [INFO ] Invariant cache hit.
[2023-03-22 00:11:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:11:57] [INFO ] Implicit Places using invariants and state equation in 5102 ms returned []
Implicit Place search using SMT with State Equation took 6480 ms to find 0 implicit places.
[2023-03-22 00:11:57] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-22 00:11:57] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 00:11:57] [INFO ] Invariant cache hit.
[2023-03-22 00:11:58] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7538 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1010 transition count 1422
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1010 transition count 1421
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1009 transition count 1421
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1009 transition count 1420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1008 transition count 1420
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1008 transition count 1415
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1003 transition count 1415
Applied a total of 18 rules in 216 ms. Remains 1003 /1010 variables (removed 7) and now considering 1415/1426 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1415 rows 1003 cols
[2023-03-22 00:11:59] [INFO ] Computed 177 place invariants in 30 ms
[2023-03-22 00:11:59] [INFO ] [Real]Absence check using 170 positive place invariants in 32 ms returned sat
[2023-03-22 00:11:59] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-22 00:11:59] [INFO ] After 411ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:11:59] [INFO ] Deduced a trap composed of 327 places in 281 ms of which 1 ms to minimize.
[2023-03-22 00:12:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2023-03-22 00:12:00] [INFO ] After 819ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:12:00] [INFO ] After 1005ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:12:00] [INFO ] [Nat]Absence check using 170 positive place invariants in 31 ms returned sat
[2023-03-22 00:12:00] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-22 00:12:00] [INFO ] After 406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:12:01] [INFO ] Deduced a trap composed of 327 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:12:01] [INFO ] Deduced a trap composed of 312 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:12:01] [INFO ] Deduced a trap composed of 330 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:12:02] [INFO ] Deduced a trap composed of 327 places in 288 ms of which 1 ms to minimize.
[2023-03-22 00:12:02] [INFO ] Deduced a trap composed of 309 places in 289 ms of which 1 ms to minimize.
[2023-03-22 00:12:03] [INFO ] Deduced a trap composed of 300 places in 293 ms of which 2 ms to minimize.
[2023-03-22 00:12:03] [INFO ] Deduced a trap composed of 330 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:12:03] [INFO ] Deduced a trap composed of 312 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:12:04] [INFO ] Deduced a trap composed of 333 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:12:04] [INFO ] Deduced a trap composed of 324 places in 292 ms of which 0 ms to minimize.
[2023-03-22 00:12:04] [INFO ] Deduced a trap composed of 330 places in 293 ms of which 0 ms to minimize.
[2023-03-22 00:12:05] [INFO ] Deduced a trap composed of 324 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:12:05] [INFO ] Deduced a trap composed of 321 places in 303 ms of which 2 ms to minimize.
[2023-03-22 00:12:06] [INFO ] Deduced a trap composed of 312 places in 294 ms of which 0 ms to minimize.
[2023-03-22 00:12:06] [INFO ] Deduced a trap composed of 327 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:12:06] [INFO ] Deduced a trap composed of 324 places in 289 ms of which 1 ms to minimize.
[2023-03-22 00:12:07] [INFO ] Deduced a trap composed of 324 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:12:07] [INFO ] Deduced a trap composed of 324 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:12:08] [INFO ] Deduced a trap composed of 321 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:12:08] [INFO ] Deduced a trap composed of 318 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:12:08] [INFO ] Deduced a trap composed of 312 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:12:09] [INFO ] Deduced a trap composed of 330 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:12:09] [INFO ] Deduced a trap composed of 321 places in 297 ms of which 0 ms to minimize.
[2023-03-22 00:12:09] [INFO ] Deduced a trap composed of 309 places in 294 ms of which 0 ms to minimize.
[2023-03-22 00:12:10] [INFO ] Deduced a trap composed of 342 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:12:10] [INFO ] Deduced a trap composed of 330 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:12:10] [INFO ] Deduced a trap composed of 321 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:12:11] [INFO ] Deduced a trap composed of 336 places in 313 ms of which 1 ms to minimize.
[2023-03-22 00:12:11] [INFO ] Deduced a trap composed of 306 places in 286 ms of which 1 ms to minimize.
[2023-03-22 00:12:12] [INFO ] Deduced a trap composed of 327 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:12:12] [INFO ] Deduced a trap composed of 324 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:12:12] [INFO ] Deduced a trap composed of 330 places in 294 ms of which 0 ms to minimize.
[2023-03-22 00:12:13] [INFO ] Deduced a trap composed of 333 places in 286 ms of which 0 ms to minimize.
[2023-03-22 00:12:13] [INFO ] Deduced a trap composed of 291 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:12:14] [INFO ] Deduced a trap composed of 306 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:12:14] [INFO ] Deduced a trap composed of 300 places in 289 ms of which 0 ms to minimize.
[2023-03-22 00:12:15] [INFO ] Deduced a trap composed of 315 places in 297 ms of which 0 ms to minimize.
[2023-03-22 00:12:15] [INFO ] Deduced a trap composed of 330 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:12:15] [INFO ] Deduced a trap composed of 321 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:12:16] [INFO ] Deduced a trap composed of 327 places in 290 ms of which 1 ms to minimize.
[2023-03-22 00:12:16] [INFO ] Deduced a trap composed of 339 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:12:17] [INFO ] Deduced a trap composed of 315 places in 289 ms of which 1 ms to minimize.
[2023-03-22 00:12:17] [INFO ] Deduced a trap composed of 333 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:12:18] [INFO ] Deduced a trap composed of 339 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:12:18] [INFO ] Deduced a trap composed of 324 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:12:19] [INFO ] Deduced a trap composed of 330 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:12:19] [INFO ] Deduced a trap composed of 336 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:12:19] [INFO ] Deduced a trap composed of 312 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:12:20] [INFO ] Deduced a trap composed of 333 places in 292 ms of which 0 ms to minimize.
[2023-03-22 00:12:20] [INFO ] Deduced a trap composed of 327 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:12:21] [INFO ] Deduced a trap composed of 315 places in 292 ms of which 0 ms to minimize.
[2023-03-22 00:12:21] [INFO ] Deduced a trap composed of 300 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:12:22] [INFO ] Deduced a trap composed of 306 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:12:22] [INFO ] Deduced a trap composed of 336 places in 294 ms of which 0 ms to minimize.
[2023-03-22 00:12:22] [INFO ] Deduced a trap composed of 330 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:12:23] [INFO ] Deduced a trap composed of 318 places in 290 ms of which 1 ms to minimize.
[2023-03-22 00:12:23] [INFO ] Deduced a trap composed of 321 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:12:24] [INFO ] Deduced a trap composed of 312 places in 292 ms of which 0 ms to minimize.
[2023-03-22 00:12:24] [INFO ] Deduced a trap composed of 327 places in 292 ms of which 0 ms to minimize.
[2023-03-22 00:12:25] [INFO ] Deduced a trap composed of 330 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:12:26] [INFO ] Deduced a trap composed of 324 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:12:26] [INFO ] Deduced a trap composed of 318 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:12:27] [INFO ] Deduced a trap composed of 300 places in 291 ms of which 0 ms to minimize.
[2023-03-22 00:12:28] [INFO ] Deduced a trap composed of 312 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:12:28] [INFO ] Deduced a trap composed of 324 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:12:32] [INFO ] Deduced a trap composed of 321 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:12:35] [INFO ] Deduced a trap composed of 324 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:12:35] [INFO ] Deduced a trap composed of 333 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:12:36] [INFO ] Deduced a trap composed of 300 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:12:38] [INFO ] Deduced a trap composed of 318 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:12:39] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:12:41] [INFO ] Deduced a trap composed of 303 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:12:50] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 50307 ms
[2023-03-22 00:12:51] [INFO ] After 50861ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:12:51] [INFO ] After 51040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1010 transition count 1422
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1010 transition count 1421
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1009 transition count 1421
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1009 transition count 1420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1008 transition count 1420
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1008 transition count 1415
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1003 transition count 1415
Applied a total of 18 rules in 139 ms. Remains 1003 /1010 variables (removed 7) and now considering 1415/1426 (removed 11) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:12:51] [INFO ] Invariant cache hit.
[2023-03-22 00:12:51] [INFO ] [Real]Absence check using 170 positive place invariants in 33 ms returned sat
[2023-03-22 00:12:51] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-22 00:12:51] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:12:51] [INFO ] [Nat]Absence check using 170 positive place invariants in 33 ms returned sat
[2023-03-22 00:12:51] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-22 00:12:52] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:12:52] [INFO ] Deduced a trap composed of 294 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:12:52] [INFO ] Deduced a trap composed of 306 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:12:53] [INFO ] Deduced a trap composed of 336 places in 298 ms of which 0 ms to minimize.
[2023-03-22 00:12:53] [INFO ] Deduced a trap composed of 333 places in 297 ms of which 0 ms to minimize.
[2023-03-22 00:12:53] [INFO ] Deduced a trap composed of 303 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:12:54] [INFO ] Deduced a trap composed of 327 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:12:54] [INFO ] Deduced a trap composed of 312 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:12:54] [INFO ] Deduced a trap composed of 315 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:12:55] [INFO ] Deduced a trap composed of 315 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:12:56] [INFO ] Deduced a trap composed of 327 places in 290 ms of which 1 ms to minimize.
[2023-03-22 00:12:56] [INFO ] Deduced a trap composed of 318 places in 300 ms of which 0 ms to minimize.
[2023-03-22 00:12:56] [INFO ] Deduced a trap composed of 324 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:12:57] [INFO ] Deduced a trap composed of 318 places in 293 ms of which 0 ms to minimize.
[2023-03-22 00:12:57] [INFO ] Deduced a trap composed of 318 places in 291 ms of which 0 ms to minimize.
[2023-03-22 00:12:58] [INFO ] Deduced a trap composed of 330 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:12:58] [INFO ] Deduced a trap composed of 318 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:12:58] [INFO ] Deduced a trap composed of 315 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:12:59] [INFO ] Deduced a trap composed of 309 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:13:00] [INFO ] Deduced a trap composed of 306 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:13:00] [INFO ] Deduced a trap composed of 330 places in 302 ms of which 0 ms to minimize.
[2023-03-22 00:13:00] [INFO ] Deduced a trap composed of 342 places in 293 ms of which 0 ms to minimize.
[2023-03-22 00:13:01] [INFO ] Deduced a trap composed of 318 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:13:01] [INFO ] Deduced a trap composed of 309 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:13:02] [INFO ] Deduced a trap composed of 315 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:13:02] [INFO ] Deduced a trap composed of 327 places in 290 ms of which 1 ms to minimize.
[2023-03-22 00:13:03] [INFO ] Deduced a trap composed of 321 places in 289 ms of which 1 ms to minimize.
[2023-03-22 00:13:03] [INFO ] Deduced a trap composed of 333 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:13:04] [INFO ] Deduced a trap composed of 321 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:13:04] [INFO ] Deduced a trap composed of 315 places in 307 ms of which 1 ms to minimize.
[2023-03-22 00:13:04] [INFO ] Deduced a trap composed of 318 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:13:05] [INFO ] Deduced a trap composed of 318 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:13:05] [INFO ] Deduced a trap composed of 312 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:13:06] [INFO ] Deduced a trap composed of 330 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:13:06] [INFO ] Deduced a trap composed of 318 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:13:06] [INFO ] Deduced a trap composed of 336 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:13:07] [INFO ] Deduced a trap composed of 315 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:13:07] [INFO ] Deduced a trap composed of 339 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:13:08] [INFO ] Deduced a trap composed of 309 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:13:09] [INFO ] Deduced a trap composed of 333 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:13:10] [INFO ] Deduced a trap composed of 327 places in 317 ms of which 1 ms to minimize.
[2023-03-22 00:13:10] [INFO ] Deduced a trap composed of 306 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:13:10] [INFO ] Deduced a trap composed of 312 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:13:11] [INFO ] Deduced a trap composed of 309 places in 303 ms of which 0 ms to minimize.
[2023-03-22 00:13:11] [INFO ] Deduced a trap composed of 333 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:13:11] [INFO ] Deduced a trap composed of 306 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:13:12] [INFO ] Deduced a trap composed of 321 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:13:12] [INFO ] Deduced a trap composed of 324 places in 313 ms of which 1 ms to minimize.
[2023-03-22 00:13:13] [INFO ] Deduced a trap composed of 327 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:13:14] [INFO ] Deduced a trap composed of 309 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:13:14] [INFO ] Deduced a trap composed of 327 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:13:15] [INFO ] Deduced a trap composed of 315 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:13:15] [INFO ] Deduced a trap composed of 330 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:13:15] [INFO ] Deduced a trap composed of 324 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:13:16] [INFO ] Deduced a trap composed of 312 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:13:16] [INFO ] Deduced a trap composed of 324 places in 290 ms of which 1 ms to minimize.
[2023-03-22 00:13:17] [INFO ] Deduced a trap composed of 298 places in 287 ms of which 0 ms to minimize.
[2023-03-22 00:13:23] [INFO ] Deduced a trap composed of 300 places in 312 ms of which 1 ms to minimize.
[2023-03-22 00:13:32] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 40101 ms
[2023-03-22 00:13:32] [INFO ] After 40587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:13:32] [INFO ] After 40777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 3 ms.
Working with output stream class java.io.PrintStream
Total runtime 373997 ms.
starting LoLA
BK_INPUT PolyORBNT-COL-S05J80
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: 16393216 kB
MemFree: 14379556 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16154092 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: 1269, Transitions: 2430
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 t190
lola: LAUNCH SYMM
sara: try reading problem file stateEquationProblem-QuasiLiveness-1320.sara.
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019

lola: SARA FINISHED
lola: STATE EQUATION TRIES TRANSITION t1638
sara: try reading problem file stateEquationProblem-QuasiLiveness-868.sara.
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: reporting
lola: not produced: 1
lola: find path: 401
lola: goal oriented search: 7
lola: symmetry: 2
lola: high level: 2019
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 1424 secs. Pages in use: 106

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

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