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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.8K Feb 25 23:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 23:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 23:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 23:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 23:38 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 1679443576331

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-S05J60
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 00:06:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-22 00:06:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:06: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:06:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 00:06:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 499 ms
[2023-03-22 00:06:18] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 20 ms.
[2023-03-22 00:06:18] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 62 ms.
[2023-03-22 00:06:18] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-22 00:06:18] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-22 00:06:18] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-22 00:06:18] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 60 places in 11 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 675 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 36) seen :29
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 153 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 00:06:19] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2023-03-22 00:06:19] [INFO ] Computed 142 place invariants in 91 ms
[2023-03-22 00:06:20] [INFO ] [Real]Absence check using 135 positive place invariants in 45 ms returned sat
[2023-03-22 00:06:20] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-22 00:06:21] [INFO ] After 776ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-22 00:06:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:06:21] [INFO ] After 78ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-22 00:06:21] [INFO ] After 194ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-22 00:06:21] [INFO ] After 1841ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-22 00:06:21] [INFO ] [Nat]Absence check using 135 positive place invariants in 37 ms returned sat
[2023-03-22 00:06:21] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-22 00:06:22] [INFO ] After 1013ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:06:23] [INFO ] After 840ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 00:06:24] [INFO ] After 1348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 244 ms.
[2023-03-22 00:06:24] [INFO ] After 2958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 182 ms.
Support contains 11 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 904 transition count 1250
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 135 place count 839 transition count 1250
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 135 place count 839 transition count 1187
Deduced a syphon composed of 63 places in 5 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 261 place count 776 transition count 1187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 262 place count 775 transition count 1186
Iterating global reduction 2 with 1 rules applied. Total rules applied 263 place count 775 transition count 1186
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 267 place count 773 transition count 1184
Applied a total of 267 rules in 266 ms. Remains 773 /909 variables (removed 136) and now considering 1184/1315 (removed 131) transitions.
[2023-03-22 00:06:24] [INFO ] Flow matrix only has 1180 transitions (discarded 4 similar events)
// Phase 1: matrix 1180 rows 773 cols
[2023-03-22 00:06:24] [INFO ] Computed 137 place invariants in 36 ms
[2023-03-22 00:06:25] [INFO ] Dead Transitions using invariants and state equation in 896 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 : 773/909 places, 1089/1315 transitions.
Applied a total of 0 rules in 43 ms. Remains 773 /773 variables (removed 0) and now considering 1089/1089 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1210 ms. Remains : 773/909 places, 1089/1315 transitions.
Incomplete random walk after 1000000 steps, including 44386 resets, run finished after 4735 ms. (steps per millisecond=211 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000000 steps, including 3424 resets, run finished after 1316 ms. (steps per millisecond=759 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:06:31] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
// Phase 1: matrix 1085 rows 773 cols
[2023-03-22 00:06:31] [INFO ] Computed 137 place invariants in 25 ms
[2023-03-22 00:06:32] [INFO ] [Real]Absence check using 130 positive place invariants in 23 ms returned sat
[2023-03-22 00:06:32] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-22 00:06:32] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:06:32] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-22 00:06:32] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-22 00:06:32] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:06:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:06:32] [INFO ] After 283ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:06:33] [INFO ] Deduced a trap composed of 244 places in 241 ms of which 1 ms to minimize.
[2023-03-22 00:06:33] [INFO ] Deduced a trap composed of 265 places in 261 ms of which 2 ms to minimize.
[2023-03-22 00:06:33] [INFO ] Deduced a trap composed of 250 places in 266 ms of which 1 ms to minimize.
[2023-03-22 00:06:34] [INFO ] Deduced a trap composed of 244 places in 257 ms of which 1 ms to minimize.
[2023-03-22 00:06:34] [INFO ] Deduced a trap composed of 250 places in 251 ms of which 1 ms to minimize.
[2023-03-22 00:06:34] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 1 ms to minimize.
[2023-03-22 00:06:34] [INFO ] Deduced a trap composed of 265 places in 247 ms of which 1 ms to minimize.
[2023-03-22 00:06:35] [INFO ] Deduced a trap composed of 256 places in 249 ms of which 0 ms to minimize.
[2023-03-22 00:06:35] [INFO ] Deduced a trap composed of 253 places in 238 ms of which 0 ms to minimize.
[2023-03-22 00:06:35] [INFO ] Deduced a trap composed of 244 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 253 places in 246 ms of which 1 ms to minimize.
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 250 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 235 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 232 places in 236 ms of which 1 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 235 places in 229 ms of which 0 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 247 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 223 places in 220 ms of which 1 ms to minimize.
[2023-03-22 00:06:38] [INFO ] Deduced a trap composed of 238 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:06:38] [INFO ] Deduced a trap composed of 241 places in 247 ms of which 1 ms to minimize.
[2023-03-22 00:06:39] [INFO ] Deduced a trap composed of 238 places in 228 ms of which 1 ms to minimize.
[2023-03-22 00:06:40] [INFO ] Deduced a trap composed of 259 places in 249 ms of which 1 ms to minimize.
[2023-03-22 00:06:41] [INFO ] Deduced a trap composed of 253 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:06:41] [INFO ] Deduced a trap composed of 232 places in 221 ms of which 1 ms to minimize.
[2023-03-22 00:06:41] [INFO ] Deduced a trap composed of 250 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:06:42] [INFO ] Deduced a trap composed of 223 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:06:43] [INFO ] Deduced a trap composed of 220 places in 219 ms of which 0 ms to minimize.
[2023-03-22 00:06:44] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 0 ms to minimize.
[2023-03-22 00:06:45] [INFO ] Deduced a trap composed of 223 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:06:49] [INFO ] Deduced a trap composed of 250 places in 236 ms of which 2 ms to minimize.
[2023-03-22 00:06:58] [INFO ] Trap strengthening (SAT) tested/added 29/29 trap constraints in 25285 ms
[2023-03-22 00:06:58] [INFO ] After 25666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:06:58] [INFO ] After 26168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 773 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 773/773 places, 1089/1089 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 773 transition count 1088
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 772 transition count 1088
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 772 transition count 1086
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 6 place count 770 transition count 1086
Applied a total of 6 rules in 55 ms. Remains 770 /773 variables (removed 3) and now considering 1086/1089 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 770/773 places, 1086/1089 transitions.
Incomplete random walk after 1000000 steps, including 52109 resets, run finished after 5496 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3388 resets, run finished after 1429 ms. (steps per millisecond=699 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2160070 steps, run timeout after 18001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 2160070 steps, saw 671324 distinct states, run finished after 18003 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:07:23] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-22 00:07:23] [INFO ] Computed 137 place invariants in 17 ms
[2023-03-22 00:07:23] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-22 00:07:23] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-22 00:07:23] [INFO ] After 336ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:07:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:07:23] [INFO ] After 126ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:07:23] [INFO ] After 644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:07:24] [INFO ] [Nat]Absence check using 130 positive place invariants in 23 ms returned sat
[2023-03-22 00:07:24] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-22 00:07:24] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:07:24] [INFO ] After 346ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:07:25] [INFO ] Deduced a trap composed of 246 places in 261 ms of which 0 ms to minimize.
[2023-03-22 00:07:25] [INFO ] Deduced a trap composed of 240 places in 263 ms of which 1 ms to minimize.
[2023-03-22 00:07:25] [INFO ] Deduced a trap composed of 252 places in 252 ms of which 5 ms to minimize.
[2023-03-22 00:07:26] [INFO ] Deduced a trap composed of 239 places in 236 ms of which 2 ms to minimize.
[2023-03-22 00:07:26] [INFO ] Deduced a trap composed of 242 places in 344 ms of which 1 ms to minimize.
[2023-03-22 00:07:26] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 0 ms to minimize.
[2023-03-22 00:07:27] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 0 ms to minimize.
[2023-03-22 00:07:27] [INFO ] Deduced a trap composed of 248 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:07:27] [INFO ] Deduced a trap composed of 236 places in 270 ms of which 2 ms to minimize.
[2023-03-22 00:07:28] [INFO ] Deduced a trap composed of 233 places in 255 ms of which 0 ms to minimize.
[2023-03-22 00:07:28] [INFO ] Deduced a trap composed of 248 places in 233 ms of which 0 ms to minimize.
[2023-03-22 00:07:28] [INFO ] Deduced a trap composed of 248 places in 242 ms of which 1 ms to minimize.
[2023-03-22 00:07:29] [INFO ] Deduced a trap composed of 248 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:07:29] [INFO ] Deduced a trap composed of 248 places in 253 ms of which 0 ms to minimize.
[2023-03-22 00:07:29] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 1 ms to minimize.
[2023-03-22 00:07:30] [INFO ] Deduced a trap composed of 239 places in 228 ms of which 1 ms to minimize.
[2023-03-22 00:07:30] [INFO ] Deduced a trap composed of 254 places in 240 ms of which 1 ms to minimize.
[2023-03-22 00:07:31] [INFO ] Deduced a trap composed of 242 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:07:31] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:07:31] [INFO ] Deduced a trap composed of 245 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:07:32] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 1 ms to minimize.
[2023-03-22 00:07:32] [INFO ] Deduced a trap composed of 245 places in 242 ms of which 1 ms to minimize.
[2023-03-22 00:07:32] [INFO ] Deduced a trap composed of 236 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:07:33] [INFO ] Deduced a trap composed of 230 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:07:33] [INFO ] Deduced a trap composed of 230 places in 230 ms of which 0 ms to minimize.
[2023-03-22 00:07:33] [INFO ] Deduced a trap composed of 242 places in 220 ms of which 2 ms to minimize.
[2023-03-22 00:07:34] [INFO ] Deduced a trap composed of 248 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:07:34] [INFO ] Deduced a trap composed of 233 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:07:34] [INFO ] Deduced a trap composed of 227 places in 257 ms of which 0 ms to minimize.
[2023-03-22 00:07:35] [INFO ] Deduced a trap composed of 236 places in 235 ms of which 0 ms to minimize.
[2023-03-22 00:07:35] [INFO ] Deduced a trap composed of 215 places in 260 ms of which 0 ms to minimize.
[2023-03-22 00:07:36] [INFO ] Deduced a trap composed of 239 places in 219 ms of which 1 ms to minimize.
[2023-03-22 00:07:36] [INFO ] Deduced a trap composed of 242 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:07:36] [INFO ] Deduced a trap composed of 251 places in 235 ms of which 4 ms to minimize.
[2023-03-22 00:07:37] [INFO ] Deduced a trap composed of 248 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:07:37] [INFO ] Deduced a trap composed of 245 places in 222 ms of which 4 ms to minimize.
[2023-03-22 00:07:37] [INFO ] Deduced a trap composed of 233 places in 245 ms of which 1 ms to minimize.
[2023-03-22 00:07:38] [INFO ] Deduced a trap composed of 257 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:07:38] [INFO ] Deduced a trap composed of 227 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:07:39] [INFO ] Deduced a trap composed of 242 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:07:39] [INFO ] Deduced a trap composed of 227 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:07:39] [INFO ] Deduced a trap composed of 233 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:07:40] [INFO ] Deduced a trap composed of 227 places in 217 ms of which 1 ms to minimize.
[2023-03-22 00:07:41] [INFO ] Deduced a trap composed of 230 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:07:41] [INFO ] Deduced a trap composed of 236 places in 239 ms of which 0 ms to minimize.
[2023-03-22 00:07:42] [INFO ] Deduced a trap composed of 233 places in 236 ms of which 1 ms to minimize.
[2023-03-22 00:07:42] [INFO ] Deduced a trap composed of 263 places in 245 ms of which 1 ms to minimize.
[2023-03-22 00:07:42] [INFO ] Deduced a trap composed of 248 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:07:43] [INFO ] Deduced a trap composed of 230 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:07:44] [INFO ] Deduced a trap composed of 242 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:07:44] [INFO ] Deduced a trap composed of 242 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:07:45] [INFO ] Deduced a trap composed of 245 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:07:48] [INFO ] Deduced a trap composed of 248 places in 240 ms of which 1 ms to minimize.
[2023-03-22 00:07:49] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 0 ms to minimize.
[2023-03-22 00:07:49] [INFO ] Deduced a trap composed of 230 places in 244 ms of which 1 ms to minimize.
[2023-03-22 00:07:51] [INFO ] Deduced a trap composed of 248 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:07:51] [INFO ] Deduced a trap composed of 245 places in 259 ms of which 1 ms to minimize.
[2023-03-22 00:07:52] [INFO ] Deduced a trap composed of 245 places in 235 ms of which 0 ms to minimize.
[2023-03-22 00:07:54] [INFO ] Deduced a trap composed of 233 places in 250 ms of which 1 ms to minimize.
[2023-03-22 00:07:56] [INFO ] Deduced a trap composed of 257 places in 230 ms of which 0 ms to minimize.
[2023-03-22 00:07:56] [INFO ] Deduced a trap composed of 245 places in 273 ms of which 1 ms to minimize.
[2023-03-22 00:11:08] [INFO ] Trap strengthening (SAT) tested/added 61/61 trap constraints in 224113 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.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:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:11:08] [INFO ] After 225028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 28 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 26 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-22 00:11:09] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-22 00:11:09] [INFO ] Invariant cache hit.
[2023-03-22 00:11:09] [INFO ] Implicit Places using invariants in 977 ms returned []
[2023-03-22 00:11:09] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-22 00:11:09] [INFO ] Invariant cache hit.
[2023-03-22 00:11:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:11:13] [INFO ] Implicit Places using invariants and state equation in 3449 ms returned []
Implicit Place search using SMT with State Equation took 4428 ms to find 0 implicit places.
[2023-03-22 00:11:13] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-22 00:11:13] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-22 00:11:13] [INFO ] Invariant cache hit.
[2023-03-22 00:11:14] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5201 ms. Remains : 770/770 places, 1086/1086 transitions.
Incomplete random walk after 100000 steps, including 5230 resets, run finished after 714 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:11:14] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-22 00:11:14] [INFO ] Invariant cache hit.
[2023-03-22 00:11:15] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-22 00:11:15] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-22 00:11:15] [INFO ] After 302ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:11:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:11:15] [INFO ] After 118ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:11:15] [INFO ] After 191ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:11:15] [INFO ] After 634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:11:15] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-22 00:11:15] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-22 00:11:15] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:11:16] [INFO ] After 273ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:11:16] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 1 ms to minimize.
[2023-03-22 00:11:16] [INFO ] Deduced a trap composed of 260 places in 247 ms of which 1 ms to minimize.
[2023-03-22 00:11:17] [INFO ] Deduced a trap composed of 230 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:11:17] [INFO ] Deduced a trap composed of 255 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:11:17] [INFO ] Deduced a trap composed of 264 places in 231 ms of which 0 ms to minimize.
[2023-03-22 00:11:17] [INFO ] Deduced a trap composed of 249 places in 252 ms of which 1 ms to minimize.
[2023-03-22 00:11:18] [INFO ] Deduced a trap composed of 243 places in 243 ms of which 1 ms to minimize.
[2023-03-22 00:11:18] [INFO ] Deduced a trap composed of 239 places in 258 ms of which 1 ms to minimize.
[2023-03-22 00:11:18] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 0 ms to minimize.
[2023-03-22 00:11:19] [INFO ] Deduced a trap composed of 231 places in 245 ms of which 0 ms to minimize.
[2023-03-22 00:11:19] [INFO ] Deduced a trap composed of 245 places in 236 ms of which 1 ms to minimize.
[2023-03-22 00:11:19] [INFO ] Deduced a trap composed of 225 places in 247 ms of which 1 ms to minimize.
[2023-03-22 00:11:20] [INFO ] Deduced a trap composed of 258 places in 244 ms of which 1 ms to minimize.
[2023-03-22 00:11:20] [INFO ] Deduced a trap composed of 233 places in 249 ms of which 0 ms to minimize.
[2023-03-22 00:11:20] [INFO ] Deduced a trap composed of 239 places in 240 ms of which 1 ms to minimize.
[2023-03-22 00:11:21] [INFO ] Deduced a trap composed of 242 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:11:21] [INFO ] Deduced a trap composed of 242 places in 237 ms of which 0 ms to minimize.
[2023-03-22 00:11:21] [INFO ] Deduced a trap composed of 224 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:11:22] [INFO ] Deduced a trap composed of 239 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:11:22] [INFO ] Deduced a trap composed of 236 places in 237 ms of which 0 ms to minimize.
[2023-03-22 00:11:22] [INFO ] Deduced a trap composed of 263 places in 229 ms of which 0 ms to minimize.
[2023-03-22 00:11:22] [INFO ] Deduced a trap composed of 242 places in 229 ms of which 0 ms to minimize.
[2023-03-22 00:11:23] [INFO ] Deduced a trap composed of 239 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:11:23] [INFO ] Deduced a trap composed of 260 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:11:24] [INFO ] Deduced a trap composed of 245 places in 240 ms of which 1 ms to minimize.
[2023-03-22 00:11:24] [INFO ] Deduced a trap composed of 236 places in 245 ms of which 0 ms to minimize.
[2023-03-22 00:11:24] [INFO ] Deduced a trap composed of 224 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:11:25] [INFO ] Deduced a trap composed of 248 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:11:25] [INFO ] Deduced a trap composed of 230 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:11:25] [INFO ] Deduced a trap composed of 239 places in 211 ms of which 1 ms to minimize.
[2023-03-22 00:11:26] [INFO ] Deduced a trap composed of 245 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:11:26] [INFO ] Deduced a trap composed of 242 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:11:27] [INFO ] Deduced a trap composed of 233 places in 220 ms of which 1 ms to minimize.
[2023-03-22 00:11:28] [INFO ] Deduced a trap composed of 245 places in 236 ms of which 1 ms to minimize.
[2023-03-22 00:11:31] [INFO ] Deduced a trap composed of 251 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:11:31] [INFO ] Deduced a trap composed of 236 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:11:40] [INFO ] Trap strengthening (SAT) tested/added 36/36 trap constraints in 24239 ms
[2023-03-22 00:11:40] [INFO ] After 24572ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:11:40] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52014 resets, run finished after 5131 ms. (steps per millisecond=194 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3333 resets, run finished after 1296 ms. (steps per millisecond=771 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2212872 steps, run timeout after 18001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 2212872 steps, saw 688323 distinct states, run finished after 18001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:12:04] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-22 00:12:04] [INFO ] Invariant cache hit.
[2023-03-22 00:12:05] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-22 00:12:05] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-22 00:12:05] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:12:05] [INFO ] [Nat]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-22 00:12:05] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-22 00:12:05] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:12:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:12:05] [INFO ] After 308ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:12:06] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 0 ms to minimize.
[2023-03-22 00:12:06] [INFO ] Deduced a trap composed of 260 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:12:06] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 1 ms to minimize.
[2023-03-22 00:12:07] [INFO ] Deduced a trap composed of 255 places in 254 ms of which 1 ms to minimize.
[2023-03-22 00:12:07] [INFO ] Deduced a trap composed of 264 places in 240 ms of which 0 ms to minimize.
[2023-03-22 00:12:07] [INFO ] Deduced a trap composed of 249 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:12:08] [INFO ] Deduced a trap composed of 243 places in 240 ms of which 0 ms to minimize.
[2023-03-22 00:12:08] [INFO ] Deduced a trap composed of 239 places in 243 ms of which 1 ms to minimize.
[2023-03-22 00:12:08] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 1 ms to minimize.
[2023-03-22 00:12:08] [INFO ] Deduced a trap composed of 231 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:12:09] [INFO ] Deduced a trap composed of 245 places in 246 ms of which 1 ms to minimize.
[2023-03-22 00:12:09] [INFO ] Deduced a trap composed of 225 places in 243 ms of which 1 ms to minimize.
[2023-03-22 00:12:09] [INFO ] Deduced a trap composed of 258 places in 239 ms of which 0 ms to minimize.
[2023-03-22 00:12:10] [INFO ] Deduced a trap composed of 233 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:12:10] [INFO ] Deduced a trap composed of 239 places in 247 ms of which 2 ms to minimize.
[2023-03-22 00:12:10] [INFO ] Deduced a trap composed of 242 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:12:11] [INFO ] Deduced a trap composed of 242 places in 228 ms of which 1 ms to minimize.
[2023-03-22 00:12:11] [INFO ] Deduced a trap composed of 224 places in 236 ms of which 1 ms to minimize.
[2023-03-22 00:12:11] [INFO ] Deduced a trap composed of 239 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:12:11] [INFO ] Deduced a trap composed of 236 places in 216 ms of which 1 ms to minimize.
[2023-03-22 00:12:12] [INFO ] Deduced a trap composed of 263 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:12:12] [INFO ] Deduced a trap composed of 242 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:12:12] [INFO ] Deduced a trap composed of 239 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:12:13] [INFO ] Deduced a trap composed of 260 places in 230 ms of which 0 ms to minimize.
[2023-03-22 00:12:13] [INFO ] Deduced a trap composed of 245 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:12:14] [INFO ] Deduced a trap composed of 236 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:12:14] [INFO ] Deduced a trap composed of 224 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:12:14] [INFO ] Deduced a trap composed of 248 places in 219 ms of which 0 ms to minimize.
[2023-03-22 00:12:15] [INFO ] Deduced a trap composed of 230 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:12:15] [INFO ] Deduced a trap composed of 239 places in 230 ms of which 0 ms to minimize.
[2023-03-22 00:12:15] [INFO ] Deduced a trap composed of 245 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:12:16] [INFO ] Deduced a trap composed of 242 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:12:16] [INFO ] Deduced a trap composed of 233 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:12:18] [INFO ] Deduced a trap composed of 245 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:12:20] [INFO ] Deduced a trap composed of 251 places in 252 ms of which 0 ms to minimize.
[2023-03-22 00:12:21] [INFO ] Deduced a trap composed of 236 places in 220 ms of which 1 ms to minimize.
[2023-03-22 00:12:30] [INFO ] Trap strengthening (SAT) tested/added 36/36 trap constraints in 24195 ms
[2023-03-22 00:12:30] [INFO ] After 24580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:12:30] [INFO ] After 25087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 28 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 24 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-22 00:12:30] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-22 00:12:30] [INFO ] Invariant cache hit.
[2023-03-22 00:12:31] [INFO ] Implicit Places using invariants in 839 ms returned []
[2023-03-22 00:12:31] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-22 00:12:31] [INFO ] Invariant cache hit.
[2023-03-22 00:12:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:12:34] [INFO ] Implicit Places using invariants and state equation in 3829 ms returned []
Implicit Place search using SMT with State Equation took 4672 ms to find 0 implicit places.
[2023-03-22 00:12:35] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-22 00:12:35] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-22 00:12:35] [INFO ] Invariant cache hit.
[2023-03-22 00:12:35] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5409 ms. Remains : 770/770 places, 1086/1086 transitions.
Incomplete random walk after 100000 steps, including 5231 resets, run finished after 553 ms. (steps per millisecond=180 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:12:36] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-22 00:12:36] [INFO ] Invariant cache hit.
[2023-03-22 00:12:36] [INFO ] [Real]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-22 00:12:36] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-22 00:12:36] [INFO ] After 301ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:12:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:12:36] [INFO ] After 118ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:12:36] [INFO ] After 178ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:12:36] [INFO ] After 617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:12:36] [INFO ] [Nat]Absence check using 130 positive place invariants in 23 ms returned sat
[2023-03-22 00:12:37] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-22 00:12:37] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:12:37] [INFO ] After 269ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:12:37] [INFO ] Deduced a trap composed of 236 places in 225 ms of which 0 ms to minimize.
[2023-03-22 00:12:38] [INFO ] Deduced a trap composed of 260 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:12:38] [INFO ] Deduced a trap composed of 230 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:12:38] [INFO ] Deduced a trap composed of 255 places in 235 ms of which 0 ms to minimize.
[2023-03-22 00:12:38] [INFO ] Deduced a trap composed of 264 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:12:39] [INFO ] Deduced a trap composed of 249 places in 234 ms of which 0 ms to minimize.
[2023-03-22 00:12:39] [INFO ] Deduced a trap composed of 243 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:12:39] [INFO ] Deduced a trap composed of 239 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:12:40] [INFO ] Deduced a trap composed of 236 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:12:40] [INFO ] Deduced a trap composed of 231 places in 231 ms of which 0 ms to minimize.
[2023-03-22 00:12:40] [INFO ] Deduced a trap composed of 245 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:12:41] [INFO ] Deduced a trap composed of 225 places in 247 ms of which 1 ms to minimize.
[2023-03-22 00:12:41] [INFO ] Deduced a trap composed of 258 places in 240 ms of which 1 ms to minimize.
[2023-03-22 00:12:41] [INFO ] Deduced a trap composed of 233 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:12:41] [INFO ] Deduced a trap composed of 239 places in 247 ms of which 0 ms to minimize.
[2023-03-22 00:12:42] [INFO ] Deduced a trap composed of 242 places in 241 ms of which 0 ms to minimize.
[2023-03-22 00:12:42] [INFO ] Deduced a trap composed of 242 places in 240 ms of which 0 ms to minimize.
[2023-03-22 00:12:42] [INFO ] Deduced a trap composed of 224 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:12:43] [INFO ] Deduced a trap composed of 239 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:12:43] [INFO ] Deduced a trap composed of 236 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:12:43] [INFO ] Deduced a trap composed of 263 places in 228 ms of which 1 ms to minimize.
[2023-03-22 00:12:44] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 0 ms to minimize.
[2023-03-22 00:12:44] [INFO ] Deduced a trap composed of 239 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:12:44] [INFO ] Deduced a trap composed of 260 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:12:45] [INFO ] Deduced a trap composed of 245 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:12:45] [INFO ] Deduced a trap composed of 236 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:12:46] [INFO ] Deduced a trap composed of 224 places in 243 ms of which 1 ms to minimize.
[2023-03-22 00:12:46] [INFO ] Deduced a trap composed of 248 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:12:46] [INFO ] Deduced a trap composed of 230 places in 228 ms of which 1 ms to minimize.
[2023-03-22 00:12:47] [INFO ] Deduced a trap composed of 239 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:12:47] [INFO ] Deduced a trap composed of 245 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:12:47] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 4 ms to minimize.
[2023-03-22 00:12:48] [INFO ] Deduced a trap composed of 233 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:12:49] [INFO ] Deduced a trap composed of 245 places in 233 ms of which 0 ms to minimize.
[2023-03-22 00:12:52] [INFO ] Deduced a trap composed of 251 places in 242 ms of which 1 ms to minimize.
[2023-03-22 00:12:52] [INFO ] Deduced a trap composed of 236 places in 244 ms of which 1 ms to minimize.
[2023-03-22 00:13:01] [INFO ] Trap strengthening (SAT) tested/added 36/36 trap constraints in 24233 ms
[2023-03-22 00:13:01] [INFO ] After 24585ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:13:01] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 515 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 358588 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 358588 steps, saw 109098 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:13:05] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-22 00:13:05] [INFO ] Invariant cache hit.
[2023-03-22 00:13:05] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-22 00:13:05] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-22 00:13:05] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:13:05] [INFO ] [Nat]Absence check using 130 positive place invariants in 22 ms returned sat
[2023-03-22 00:13:05] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-22 00:13:05] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:13:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:13:05] [INFO ] After 239ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:13:06] [INFO ] Deduced a trap composed of 239 places in 239 ms of which 1 ms to minimize.
[2023-03-22 00:13:06] [INFO ] Deduced a trap composed of 242 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:13:06] [INFO ] Deduced a trap composed of 248 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:13:06] [INFO ] Deduced a trap composed of 227 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:13:07] [INFO ] Deduced a trap composed of 266 places in 217 ms of which 1 ms to minimize.
[2023-03-22 00:13:07] [INFO ] Deduced a trap composed of 248 places in 228 ms of which 1 ms to minimize.
[2023-03-22 00:13:07] [INFO ] Deduced a trap composed of 239 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:13:08] [INFO ] Deduced a trap composed of 239 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:13:08] [INFO ] Deduced a trap composed of 242 places in 240 ms of which 1 ms to minimize.
[2023-03-22 00:13:08] [INFO ] Deduced a trap composed of 254 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:13:09] [INFO ] Deduced a trap composed of 227 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:13:09] [INFO ] Deduced a trap composed of 242 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:13:09] [INFO ] Deduced a trap composed of 251 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:13:09] [INFO ] Deduced a trap composed of 227 places in 221 ms of which 1 ms to minimize.
[2023-03-22 00:13:10] [INFO ] Deduced a trap composed of 240 places in 241 ms of which 1 ms to minimize.
[2023-03-22 00:13:10] [INFO ] Deduced a trap composed of 236 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:13:11] [INFO ] Deduced a trap composed of 245 places in 235 ms of which 0 ms to minimize.
[2023-03-22 00:13:12] [INFO ] Deduced a trap composed of 233 places in 248 ms of which 0 ms to minimize.
[2023-03-22 00:13:12] [INFO ] Deduced a trap composed of 251 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:13:13] [INFO ] Deduced a trap composed of 239 places in 244 ms of which 0 ms to minimize.
[2023-03-22 00:13:13] [INFO ] Deduced a trap composed of 230 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:13:14] [INFO ] Deduced a trap composed of 227 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:13:14] [INFO ] Deduced a trap composed of 248 places in 238 ms of which 0 ms to minimize.
[2023-03-22 00:13:14] [INFO ] Deduced a trap composed of 233 places in 233 ms of which 0 ms to minimize.
[2023-03-22 00:13:15] [INFO ] Deduced a trap composed of 233 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:13:15] [INFO ] Deduced a trap composed of 227 places in 234 ms of which 0 ms to minimize.
[2023-03-22 00:13:15] [INFO ] Deduced a trap composed of 257 places in 234 ms of which 0 ms to minimize.
[2023-03-22 00:13:16] [INFO ] Deduced a trap composed of 236 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:13:16] [INFO ] Deduced a trap composed of 236 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:13:18] [INFO ] Deduced a trap composed of 227 places in 249 ms of which 0 ms to minimize.
[2023-03-22 00:13:18] [INFO ] Deduced a trap composed of 239 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:13:20] [INFO ] Deduced a trap composed of 233 places in 244 ms of which 1 ms to minimize.
[2023-03-22 00:13:29] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 23901 ms
[2023-03-22 00:13:29] [INFO ] After 24182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:13:29] [INFO ] After 24662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 29 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-22 00:13:29] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-22 00:13:29] [INFO ] Invariant cache hit.
[2023-03-22 00:13:30] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 730 ms. Remains : 770/770 places, 1086/1086 transitions.
Incomplete random walk after 10000 steps, including 528 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 355247 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 355247 steps, saw 108069 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:13:33] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-22 00:13:33] [INFO ] Invariant cache hit.
[2023-03-22 00:13:33] [INFO ] [Real]Absence check using 130 positive place invariants in 23 ms returned sat
[2023-03-22 00:13:33] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-22 00:13:33] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:13:33] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-22 00:13:33] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-22 00:13:34] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:13:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:13:34] [INFO ] After 236ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:13:34] [INFO ] Deduced a trap composed of 239 places in 242 ms of which 0 ms to minimize.
[2023-03-22 00:13:35] [INFO ] Deduced a trap composed of 242 places in 229 ms of which 0 ms to minimize.
[2023-03-22 00:13:35] [INFO ] Deduced a trap composed of 248 places in 243 ms of which 0 ms to minimize.
[2023-03-22 00:13:35] [INFO ] Deduced a trap composed of 227 places in 240 ms of which 1 ms to minimize.
[2023-03-22 00:13:35] [INFO ] Deduced a trap composed of 266 places in 249 ms of which 0 ms to minimize.
[2023-03-22 00:13:36] [INFO ] Deduced a trap composed of 248 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:13:36] [INFO ] Deduced a trap composed of 239 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:13:36] [INFO ] Deduced a trap composed of 239 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:13:37] [INFO ] Deduced a trap composed of 242 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:13:37] [INFO ] Deduced a trap composed of 254 places in 247 ms of which 0 ms to minimize.
[2023-03-22 00:13:37] [INFO ] Deduced a trap composed of 227 places in 240 ms of which 1 ms to minimize.
[2023-03-22 00:13:38] [INFO ] Deduced a trap composed of 242 places in 248 ms of which 1 ms to minimize.
[2023-03-22 00:13:38] [INFO ] Deduced a trap composed of 251 places in 242 ms of which 1 ms to minimize.
[2023-03-22 00:13:38] [INFO ] Deduced a trap composed of 227 places in 238 ms of which 0 ms to minimize.
[2023-03-22 00:13:39] [INFO ] Deduced a trap composed of 240 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:13:39] [INFO ] Deduced a trap composed of 236 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:13:39] [INFO ] Deduced a trap composed of 245 places in 214 ms of which 2 ms to minimize.
[2023-03-22 00:13:40] [INFO ] Deduced a trap composed of 233 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:13:40] [INFO ] Deduced a trap composed of 251 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:13:41] [INFO ] Deduced a trap composed of 239 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:13:42] [INFO ] Deduced a trap composed of 230 places in 228 ms of which 1 ms to minimize.
[2023-03-22 00:13:42] [INFO ] Deduced a trap composed of 227 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:13:43] [INFO ] Deduced a trap composed of 248 places in 217 ms of which 1 ms to minimize.
[2023-03-22 00:13:43] [INFO ] Deduced a trap composed of 233 places in 226 ms of which 4 ms to minimize.
[2023-03-22 00:13:43] [INFO ] Deduced a trap composed of 233 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:13:43] [INFO ] Deduced a trap composed of 227 places in 237 ms of which 0 ms to minimize.
[2023-03-22 00:13:44] [INFO ] Deduced a trap composed of 257 places in 217 ms of which 1 ms to minimize.
[2023-03-22 00:13:44] [INFO ] Deduced a trap composed of 236 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:13:45] [INFO ] Deduced a trap composed of 236 places in 220 ms of which 1 ms to minimize.
[2023-03-22 00:13:46] [INFO ] Deduced a trap composed of 227 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:13:46] [INFO ] Deduced a trap composed of 239 places in 221 ms of which 1 ms to minimize.
[2023-03-22 00:13:49] [INFO ] Deduced a trap composed of 233 places in 212 ms of which 1 ms to minimize.
[2023-03-22 00:13:58] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 23637 ms
[2023-03-22 00:13:58] [INFO ] After 23917ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:13:58] [INFO ] After 24396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 48 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 21 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-22 00:13:58] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-22 00:13:58] [INFO ] Invariant cache hit.
[2023-03-22 00:13:59] [INFO ] Implicit Places using invariants in 819 ms returned []
[2023-03-22 00:13:59] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-22 00:13:59] [INFO ] Invariant cache hit.
[2023-03-22 00:13:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:14:03] [INFO ] Implicit Places using invariants and state equation in 4569 ms returned []
Implicit Place search using SMT with State Equation took 5391 ms to find 0 implicit places.
[2023-03-22 00:14:03] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-22 00:14:03] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-22 00:14:03] [INFO ] Invariant cache hit.
[2023-03-22 00:14:04] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6125 ms. Remains : 770/770 places, 1086/1086 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 770 transition count 1082
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 770 transition count 1081
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 769 transition count 1081
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 769 transition count 1080
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 768 transition count 1080
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 768 transition count 1075
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 763 transition count 1075
Applied a total of 18 rules in 80 ms. Remains 763 /770 variables (removed 7) and now considering 1075/1086 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1075 rows 763 cols
[2023-03-22 00:14:04] [INFO ] Computed 137 place invariants in 23 ms
[2023-03-22 00:14:04] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-22 00:14:04] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-22 00:14:04] [INFO ] After 324ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:14:05] [INFO ] Deduced a trap composed of 234 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:14:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2023-03-22 00:14:05] [INFO ] After 684ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:14:05] [INFO ] After 843ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:14:05] [INFO ] [Nat]Absence check using 130 positive place invariants in 23 ms returned sat
[2023-03-22 00:14:05] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-22 00:14:05] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:14:06] [INFO ] Deduced a trap composed of 234 places in 237 ms of which 0 ms to minimize.
[2023-03-22 00:14:06] [INFO ] Deduced a trap composed of 249 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:14:06] [INFO ] Deduced a trap composed of 231 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:14:06] [INFO ] Deduced a trap composed of 243 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:14:07] [INFO ] Deduced a trap composed of 222 places in 252 ms of which 2 ms to minimize.
[2023-03-22 00:14:07] [INFO ] Deduced a trap composed of 243 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:14:08] [INFO ] Deduced a trap composed of 243 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:14:08] [INFO ] Deduced a trap composed of 234 places in 235 ms of which 0 ms to minimize.
[2023-03-22 00:14:08] [INFO ] Deduced a trap composed of 246 places in 237 ms of which 0 ms to minimize.
[2023-03-22 00:14:09] [INFO ] Deduced a trap composed of 252 places in 234 ms of which 0 ms to minimize.
[2023-03-22 00:14:09] [INFO ] Deduced a trap composed of 237 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:14:09] [INFO ] Deduced a trap composed of 234 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:14:09] [INFO ] Deduced a trap composed of 228 places in 228 ms of which 0 ms to minimize.
[2023-03-22 00:14:10] [INFO ] Deduced a trap composed of 237 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:14:10] [INFO ] Deduced a trap composed of 234 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:14:10] [INFO ] Deduced a trap composed of 237 places in 234 ms of which 0 ms to minimize.
[2023-03-22 00:14:11] [INFO ] Deduced a trap composed of 246 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:14:11] [INFO ] Deduced a trap composed of 231 places in 237 ms of which 0 ms to minimize.
[2023-03-22 00:14:11] [INFO ] Deduced a trap composed of 237 places in 237 ms of which 0 ms to minimize.
[2023-03-22 00:14:12] [INFO ] Deduced a trap composed of 237 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:14:12] [INFO ] Deduced a trap composed of 234 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:14:12] [INFO ] Deduced a trap composed of 240 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:14:13] [INFO ] Deduced a trap composed of 228 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:14:13] [INFO ] Deduced a trap composed of 231 places in 240 ms of which 1 ms to minimize.
[2023-03-22 00:14:13] [INFO ] Deduced a trap composed of 231 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:14:14] [INFO ] Deduced a trap composed of 243 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:14:14] [INFO ] Deduced a trap composed of 237 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:14:14] [INFO ] Deduced a trap composed of 240 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:14:14] [INFO ] Deduced a trap composed of 222 places in 240 ms of which 1 ms to minimize.
[2023-03-22 00:14:15] [INFO ] Deduced a trap composed of 231 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:14:15] [INFO ] Deduced a trap composed of 237 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:14:15] [INFO ] Deduced a trap composed of 234 places in 235 ms of which 0 ms to minimize.
[2023-03-22 00:14:16] [INFO ] Deduced a trap composed of 225 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:14:16] [INFO ] Deduced a trap composed of 231 places in 245 ms of which 0 ms to minimize.
[2023-03-22 00:14:16] [INFO ] Deduced a trap composed of 249 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:14:16] [INFO ] Deduced a trap composed of 222 places in 214 ms of which 0 ms to minimize.
[2023-03-22 00:14:17] [INFO ] Deduced a trap composed of 228 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:14:17] [INFO ] Deduced a trap composed of 240 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:14:17] [INFO ] Deduced a trap composed of 231 places in 231 ms of which 0 ms to minimize.
[2023-03-22 00:14:18] [INFO ] Deduced a trap composed of 237 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:14:18] [INFO ] Deduced a trap composed of 240 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:14:18] [INFO ] Deduced a trap composed of 225 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:14:19] [INFO ] Deduced a trap composed of 237 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:14:19] [INFO ] Deduced a trap composed of 231 places in 219 ms of which 1 ms to minimize.
[2023-03-22 00:14:19] [INFO ] Deduced a trap composed of 246 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:14:19] [INFO ] Deduced a trap composed of 240 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:14:20] [INFO ] Deduced a trap composed of 234 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:14:20] [INFO ] Deduced a trap composed of 225 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:14:21] [INFO ] Deduced a trap composed of 249 places in 235 ms of which 0 ms to minimize.
[2023-03-22 00:14:21] [INFO ] Deduced a trap composed of 207 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:14:21] [INFO ] Deduced a trap composed of 225 places in 230 ms of which 0 ms to minimize.
[2023-03-22 00:14:22] [INFO ] Deduced a trap composed of 246 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:14:22] [INFO ] Deduced a trap composed of 243 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:14:22] [INFO ] Deduced a trap composed of 240 places in 219 ms of which 1 ms to minimize.
[2023-03-22 00:14:23] [INFO ] Deduced a trap composed of 243 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:14:23] [INFO ] Deduced a trap composed of 237 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:14:23] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:14:23] [INFO ] Deduced a trap composed of 240 places in 220 ms of which 5 ms to minimize.
[2023-03-22 00:14:24] [INFO ] Deduced a trap composed of 237 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:14:25] [INFO ] Deduced a trap composed of 231 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:14:25] [INFO ] Deduced a trap composed of 225 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:14:25] [INFO ] Deduced a trap composed of 246 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:14:27] [INFO ] Deduced a trap composed of 246 places in 258 ms of which 1 ms to minimize.
[2023-03-22 00:14:36] [INFO ] Trap strengthening (SAT) tested/added 63/63 trap constraints in 30335 ms
[2023-03-22 00:14:36] [INFO ] After 30853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:14:36] [INFO ] After 31007ms 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 770 transition count 1082
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 770 transition count 1081
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 769 transition count 1081
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 769 transition count 1080
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 768 transition count 1080
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 768 transition count 1075
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 763 transition count 1075
Applied a total of 18 rules in 76 ms. Remains 763 /770 variables (removed 7) and now considering 1075/1086 (removed 11) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:14:36] [INFO ] Invariant cache hit.
[2023-03-22 00:14:36] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-22 00:14:36] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-22 00:14:36] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:14:36] [INFO ] [Nat]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-22 00:14:36] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-22 00:14:37] [INFO ] After 435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:14:37] [INFO ] Deduced a trap composed of 249 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:14:37] [INFO ] Deduced a trap composed of 267 places in 245 ms of which 0 ms to minimize.
[2023-03-22 00:14:38] [INFO ] Deduced a trap composed of 234 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:14:38] [INFO ] Deduced a trap composed of 243 places in 241 ms of which 0 ms to minimize.
[2023-03-22 00:14:38] [INFO ] Deduced a trap composed of 249 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:14:38] [INFO ] Deduced a trap composed of 240 places in 236 ms of which 1 ms to minimize.
[2023-03-22 00:14:39] [INFO ] Deduced a trap composed of 228 places in 239 ms of which 1 ms to minimize.
[2023-03-22 00:14:39] [INFO ] Deduced a trap composed of 294 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:14:39] [INFO ] Deduced a trap composed of 249 places in 245 ms of which 1 ms to minimize.
[2023-03-22 00:14:40] [INFO ] Deduced a trap composed of 240 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:14:40] [INFO ] Deduced a trap composed of 243 places in 237 ms of which 0 ms to minimize.
[2023-03-22 00:14:40] [INFO ] Deduced a trap composed of 252 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:14:40] [INFO ] Deduced a trap composed of 294 places in 239 ms of which 1 ms to minimize.
[2023-03-22 00:14:41] [INFO ] Deduced a trap composed of 243 places in 235 ms of which 0 ms to minimize.
[2023-03-22 00:14:41] [INFO ] Deduced a trap composed of 300 places in 243 ms of which 0 ms to minimize.
[2023-03-22 00:14:41] [INFO ] Deduced a trap composed of 237 places in 242 ms of which 1 ms to minimize.
[2023-03-22 00:14:42] [INFO ] Deduced a trap composed of 240 places in 241 ms of which 0 ms to minimize.
[2023-03-22 00:14:42] [INFO ] Deduced a trap composed of 252 places in 252 ms of which 1 ms to minimize.
[2023-03-22 00:14:43] [INFO ] Deduced a trap composed of 246 places in 236 ms of which 1 ms to minimize.
[2023-03-22 00:14:43] [INFO ] Deduced a trap composed of 249 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:14:43] [INFO ] Deduced a trap composed of 252 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:14:44] [INFO ] Deduced a trap composed of 243 places in 228 ms of which 1 ms to minimize.
[2023-03-22 00:14:44] [INFO ] Deduced a trap composed of 216 places in 233 ms of which 0 ms to minimize.
[2023-03-22 00:14:44] [INFO ] Deduced a trap composed of 237 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:14:45] [INFO ] Deduced a trap composed of 231 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:14:45] [INFO ] Deduced a trap composed of 237 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:14:45] [INFO ] Deduced a trap composed of 243 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:14:46] [INFO ] Deduced a trap composed of 234 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:14:46] [INFO ] Deduced a trap composed of 234 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:14:46] [INFO ] Deduced a trap composed of 237 places in 228 ms of which 1 ms to minimize.
[2023-03-22 00:14:47] [INFO ] Deduced a trap composed of 249 places in 231 ms of which 0 ms to minimize.
[2023-03-22 00:14:47] [INFO ] Deduced a trap composed of 246 places in 231 ms of which 0 ms to minimize.
[2023-03-22 00:14:47] [INFO ] Deduced a trap composed of 240 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:14:48] [INFO ] Deduced a trap composed of 225 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:14:48] [INFO ] Deduced a trap composed of 246 places in 220 ms of which 1 ms to minimize.
[2023-03-22 00:14:48] [INFO ] Deduced a trap composed of 228 places in 209 ms of which 1 ms to minimize.
[2023-03-22 00:14:49] [INFO ] Deduced a trap composed of 240 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:14:49] [INFO ] Deduced a trap composed of 234 places in 217 ms of which 0 ms to minimize.
[2023-03-22 00:14:50] [INFO ] Deduced a trap composed of 228 places in 211 ms of which 1 ms to minimize.
[2023-03-22 00:14:50] [INFO ] Deduced a trap composed of 243 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:14:50] [INFO ] Deduced a trap composed of 237 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:14:50] [INFO ] Deduced a trap composed of 243 places in 211 ms of which 1 ms to minimize.
[2023-03-22 00:14:51] [INFO ] Deduced a trap composed of 228 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:14:52] [INFO ] Deduced a trap composed of 231 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:14:52] [INFO ] Deduced a trap composed of 231 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:14:52] [INFO ] Deduced a trap composed of 222 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:14:53] [INFO ] Deduced a trap composed of 231 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:14:53] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:14:53] [INFO ] Deduced a trap composed of 246 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:14:54] [INFO ] Deduced a trap composed of 240 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:14:55] [INFO ] Deduced a trap composed of 243 places in 242 ms of which 0 ms to minimize.
[2023-03-22 00:14:55] [INFO ] Deduced a trap composed of 240 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:14:55] [INFO ] Deduced a trap composed of 234 places in 225 ms of which 0 ms to minimize.
[2023-03-22 00:14:55] [INFO ] Deduced a trap composed of 222 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:14:56] [INFO ] Deduced a trap composed of 225 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:14:56] [INFO ] Deduced a trap composed of 228 places in 213 ms of which 1 ms to minimize.
[2023-03-22 00:14:56] [INFO ] Deduced a trap composed of 243 places in 229 ms of which 0 ms to minimize.
[2023-03-22 00:14:57] [INFO ] Deduced a trap composed of 237 places in 240 ms of which 1 ms to minimize.
[2023-03-22 00:14:57] [INFO ] Deduced a trap composed of 255 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:14:57] [INFO ] Deduced a trap composed of 249 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:14:57] [INFO ] Deduced a trap composed of 240 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:14:58] [INFO ] Deduced a trap composed of 243 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:14:58] [INFO ] Deduced a trap composed of 240 places in 259 ms of which 0 ms to minimize.
[2023-03-22 00:14:59] [INFO ] Deduced a trap composed of 228 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:14:59] [INFO ] Deduced a trap composed of 222 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:15:00] [INFO ] Deduced a trap composed of 240 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:15:00] [INFO ] Deduced a trap composed of 243 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:15:01] [INFO ] Deduced a trap composed of 237 places in 247 ms of which 0 ms to minimize.
[2023-03-22 00:15:01] [INFO ] Deduced a trap composed of 228 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:15:01] [INFO ] Deduced a trap composed of 246 places in 209 ms of which 1 ms to minimize.
[2023-03-22 00:15:02] [INFO ] Deduced a trap composed of 234 places in 209 ms of which 1 ms to minimize.
[2023-03-22 00:15:02] [INFO ] Deduced a trap composed of 237 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:15:02] [INFO ] Deduced a trap composed of 237 places in 210 ms of which 0 ms to minimize.
[2023-03-22 00:15:03] [INFO ] Deduced a trap composed of 240 places in 212 ms of which 0 ms to minimize.
[2023-03-22 00:15:03] [INFO ] Deduced a trap composed of 225 places in 236 ms of which 1 ms to minimize.
[2023-03-22 00:15:04] [INFO ] Deduced a trap composed of 240 places in 209 ms of which 1 ms to minimize.
[2023-03-22 00:15:04] [INFO ] Deduced a trap composed of 234 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:15:05] [INFO ] Deduced a trap composed of 234 places in 228 ms of which 0 ms to minimize.
[2023-03-22 00:15:06] [INFO ] Deduced a trap composed of 246 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:15:06] [INFO ] Deduced a trap composed of 252 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:15:08] [INFO ] Deduced a trap composed of 249 places in 211 ms of which 0 ms to minimize.
[2023-03-22 00:15:08] [INFO ] Deduced a trap composed of 228 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:15:09] [INFO ] Deduced a trap composed of 237 places in 233 ms of which 0 ms to minimize.
[2023-03-22 00:15:09] [INFO ] Deduced a trap composed of 222 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:15:09] [INFO ] Deduced a trap composed of 231 places in 230 ms of which 0 ms to minimize.
[2023-03-22 00:15:10] [INFO ] Deduced a trap composed of 231 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:15:10] [INFO ] Deduced a trap composed of 240 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:15:11] [INFO ] Deduced a trap composed of 234 places in 239 ms of which 0 ms to minimize.
[2023-03-22 00:15:12] [INFO ] Deduced a trap composed of 237 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:15:12] [INFO ] Deduced a trap composed of 237 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:15:12] [INFO ] Deduced a trap composed of 240 places in 239 ms of which 1 ms to minimize.
[2023-03-22 00:15:14] [INFO ] Deduced a trap composed of 231 places in 223 ms of which 1 ms to minimize.
[2023-03-22 00:15:14] [INFO ] Deduced a trap composed of 246 places in 233 ms of which 0 ms to minimize.
[2023-03-22 00:15:14] [INFO ] Deduced a trap composed of 249 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:15:15] [INFO ] Deduced a trap composed of 249 places in 213 ms of which 0 ms to minimize.
[2023-03-22 00:15:16] [INFO ] Deduced a trap composed of 240 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:15:17] [INFO ] Deduced a trap composed of 237 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:15:17] [INFO ] Deduced a trap composed of 231 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:15:18] [INFO ] Deduced a trap composed of 264 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:15:19] [INFO ] Deduced a trap composed of 225 places in 236 ms of which 1 ms to minimize.
[2023-03-22 00:15:20] [INFO ] Deduced a trap composed of 240 places in 247 ms of which 0 ms to minimize.
[2023-03-22 00:15:20] [INFO ] Deduced a trap composed of 225 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:15:21] [INFO ] Deduced a trap composed of 246 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:15:22] [INFO ] Deduced a trap composed of 231 places in 234 ms of which 0 ms to minimize.
[2023-03-22 00:15:22] [INFO ] Deduced a trap composed of 237 places in 234 ms of which 0 ms to minimize.
[2023-03-22 00:15:22] [INFO ] Deduced a trap composed of 237 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:15:23] [INFO ] Deduced a trap composed of 228 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:15:23] [INFO ] Deduced a trap composed of 243 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:15:24] [INFO ] Deduced a trap composed of 231 places in 230 ms of which 0 ms to minimize.
[2023-03-22 00:15:24] [INFO ] Deduced a trap composed of 237 places in 236 ms of which 1 ms to minimize.
[2023-03-22 00:15:25] [INFO ] Deduced a trap composed of 237 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:15:26] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 1 ms to minimize.
[2023-03-22 00:15:26] [INFO ] Deduced a trap composed of 243 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:15:35] [INFO ] Deduced a trap composed of 246 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:15:44] [INFO ] Trap strengthening (SAT) tested/added 114/114 trap constraints in 67561 ms
[2023-03-22 00:15:44] [INFO ] After 68139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:15:44] [INFO ] After 68305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 567108 ms.
starting LoLA
BK_INPUT PolyORBNT-COL-S05J60
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: 13154444 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16155528 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: 969, Transitions: 2030
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 t1837
lola: LAUNCH SYMM
sara: try reading problem file stateEquationProblem-QuasiLiveness-1037.sara.
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: reporting
lola: not produced: 1
lola: find path: 325
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 1700
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 1231 secs. Pages in use: 232

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

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