Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r323-tall-165472292500004.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BugTracking-PT-q3m004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292500004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.5K Jun 7 16:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 7 16:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 16:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 7 16:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Jun 6 15:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 16K Jun 7 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Jun 7 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 7 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Jun 7 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 6 15:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654726497254

Running Version 0
[2022-06-08 22:15:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-08 22:15:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 22:15:01] [INFO ] Load time of PNML (sax parser for PT used): 776 ms
[2022-06-08 22:15:01] [INFO ] Transformed 754 places.
[2022-06-08 22:15:01] [INFO ] Transformed 27370 transitions.
[2022-06-08 22:15:01] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 921 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 514 places in 138 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2642 out of 2769 initially.
// Phase 1: matrix 2642 rows 240 cols
[2022-06-08 22:15:01] [INFO ] Computed 10 place invariants in 48 ms
Incomplete random walk after 10000 steps, including 84 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :2
FORMULA BugTracking-PT-q3m004-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :1
[2022-06-08 22:15:01] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2022-06-08 22:15:02] [INFO ] Computed 10 place invariants in 16 ms
[2022-06-08 22:15:02] [INFO ] [Real]Absence check using 10 positive place invariants in 42 ms returned sat
[2022-06-08 22:15:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:03] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2022-06-08 22:15:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-08 22:15:03] [INFO ] [Real]Added 268 Read/Feed constraints in 129 ms returned sat
[2022-06-08 22:15:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-08 22:15:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:04] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2022-06-08 22:15:04] [INFO ] [Nat]Added 268 Read/Feed constraints in 137 ms returned sat
[2022-06-08 22:15:04] [INFO ] Deduced a trap composed of 72 places in 271 ms of which 5 ms to minimize.
[2022-06-08 22:15:04] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 2 ms to minimize.
[2022-06-08 22:15:05] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 1 ms to minimize.
[2022-06-08 22:15:05] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 3 ms to minimize.
[2022-06-08 22:15:05] [INFO ] Deduced a trap composed of 74 places in 337 ms of which 0 ms to minimize.
[2022-06-08 22:15:06] [INFO ] Deduced a trap composed of 77 places in 271 ms of which 0 ms to minimize.
[2022-06-08 22:15:06] [INFO ] Deduced a trap composed of 56 places in 203 ms of which 0 ms to minimize.
[2022-06-08 22:15:06] [INFO ] Deduced a trap composed of 53 places in 282 ms of which 32 ms to minimize.
[2022-06-08 22:15:07] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 0 ms to minimize.
[2022-06-08 22:15:07] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 0 ms to minimize.
[2022-06-08 22:15:07] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 1 ms to minimize.
[2022-06-08 22:15:08] [INFO ] Deduced a trap composed of 78 places in 192 ms of which 0 ms to minimize.
[2022-06-08 22:15:08] [INFO ] Deduced a trap composed of 77 places in 216 ms of which 1 ms to minimize.
[2022-06-08 22:15:08] [INFO ] Deduced a trap composed of 76 places in 191 ms of which 0 ms to minimize.
[2022-06-08 22:15:08] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 0 ms to minimize.
[2022-06-08 22:15:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.22 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 379 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/240 places, 2747/2769 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:15:09] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6069 ms. (steps per millisecond=164 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2181 ms. (steps per millisecond=458 ) properties (out of 1) seen :0
[2022-06-08 22:15:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:15:17] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-08 22:15:17] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:18] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2022-06-08 22:15:18] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:15:18] [INFO ] [Real]Added 254 Read/Feed constraints in 119 ms returned sat
[2022-06-08 22:15:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:18] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2022-06-08 22:15:18] [INFO ] [Nat]Added 254 Read/Feed constraints in 131 ms returned sat
[2022-06-08 22:15:18] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 0 ms to minimize.
[2022-06-08 22:15:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2022-06-08 22:15:19] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 217 ms.
[2022-06-08 22:15:21] [INFO ] Deduced a trap composed of 52 places in 311 ms of which 1 ms to minimize.
[2022-06-08 22:15:21] [INFO ] Deduced a trap composed of 70 places in 363 ms of which 0 ms to minimize.
[2022-06-08 22:15:22] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 0 ms to minimize.
[2022-06-08 22:15:22] [INFO ] Deduced a trap composed of 70 places in 351 ms of which 0 ms to minimize.
[2022-06-08 22:15:23] [INFO ] Deduced a trap composed of 30 places in 346 ms of which 0 ms to minimize.
[2022-06-08 22:15:23] [INFO ] Deduced a trap composed of 72 places in 324 ms of which 0 ms to minimize.
[2022-06-08 22:15:23] [INFO ] Deduced a trap composed of 109 places in 304 ms of which 1 ms to minimize.
[2022-06-08 22:15:24] [INFO ] Deduced a trap composed of 112 places in 312 ms of which 0 ms to minimize.
[2022-06-08 22:15:24] [INFO ] Deduced a trap composed of 78 places in 276 ms of which 1 ms to minimize.
[2022-06-08 22:15:25] [INFO ] Deduced a trap composed of 118 places in 263 ms of which 1 ms to minimize.
[2022-06-08 22:15:25] [INFO ] Deduced a trap composed of 73 places in 263 ms of which 1 ms to minimize.
[2022-06-08 22:15:25] [INFO ] Deduced a trap composed of 109 places in 299 ms of which 0 ms to minimize.
[2022-06-08 22:15:26] [INFO ] Deduced a trap composed of 69 places in 301 ms of which 0 ms to minimize.
[2022-06-08 22:15:26] [INFO ] Deduced a trap composed of 72 places in 311 ms of which 0 ms to minimize.
[2022-06-08 22:15:26] [INFO ] Deduced a trap composed of 69 places in 262 ms of which 1 ms to minimize.
[2022-06-08 22:15:27] [INFO ] Deduced a trap composed of 81 places in 276 ms of which 0 ms to minimize.
[2022-06-08 22:15:27] [INFO ] Deduced a trap composed of 102 places in 271 ms of which 1 ms to minimize.
[2022-06-08 22:15:28] [INFO ] Deduced a trap composed of 68 places in 278 ms of which 1 ms to minimize.
[2022-06-08 22:15:28] [INFO ] Deduced a trap composed of 72 places in 297 ms of which 5 ms to minimize.
[2022-06-08 22:15:28] [INFO ] Deduced a trap composed of 70 places in 272 ms of which 1 ms to minimize.
[2022-06-08 22:15:29] [INFO ] Deduced a trap composed of 109 places in 273 ms of which 0 ms to minimize.
[2022-06-08 22:15:29] [INFO ] Deduced a trap composed of 112 places in 269 ms of which 0 ms to minimize.
[2022-06-08 22:15:29] [INFO ] Deduced a trap composed of 106 places in 275 ms of which 1 ms to minimize.
[2022-06-08 22:15:30] [INFO ] Deduced a trap composed of 110 places in 297 ms of which 1 ms to minimize.
[2022-06-08 22:15:30] [INFO ] Deduced a trap composed of 71 places in 266 ms of which 1 ms to minimize.
[2022-06-08 22:15:31] [INFO ] Deduced a trap composed of 73 places in 268 ms of which 1 ms to minimize.
[2022-06-08 22:15:31] [INFO ] Deduced a trap composed of 110 places in 297 ms of which 0 ms to minimize.
[2022-06-08 22:15:31] [INFO ] Deduced a trap composed of 115 places in 271 ms of which 1 ms to minimize.
[2022-06-08 22:15:32] [INFO ] Deduced a trap composed of 69 places in 268 ms of which 0 ms to minimize.
[2022-06-08 22:15:32] [INFO ] Deduced a trap composed of 108 places in 305 ms of which 0 ms to minimize.
[2022-06-08 22:15:33] [INFO ] Deduced a trap composed of 73 places in 275 ms of which 1 ms to minimize.
[2022-06-08 22:15:33] [INFO ] Deduced a trap composed of 114 places in 272 ms of which 0 ms to minimize.
[2022-06-08 22:15:33] [INFO ] Deduced a trap composed of 118 places in 271 ms of which 1 ms to minimize.
[2022-06-08 22:15:34] [INFO ] Deduced a trap composed of 73 places in 272 ms of which 0 ms to minimize.
[2022-06-08 22:15:34] [INFO ] Deduced a trap composed of 115 places in 319 ms of which 2 ms to minimize.
[2022-06-08 22:15:35] [INFO ] Deduced a trap composed of 113 places in 295 ms of which 1 ms to minimize.
[2022-06-08 22:15:35] [INFO ] Deduced a trap composed of 112 places in 294 ms of which 0 ms to minimize.
[2022-06-08 22:15:35] [INFO ] Deduced a trap composed of 111 places in 304 ms of which 1 ms to minimize.
[2022-06-08 22:15:36] [INFO ] Deduced a trap composed of 74 places in 296 ms of which 1 ms to minimize.
[2022-06-08 22:15:36] [INFO ] Deduced a trap composed of 105 places in 325 ms of which 1 ms to minimize.
[2022-06-08 22:15:37] [INFO ] Deduced a trap composed of 73 places in 297 ms of which 0 ms to minimize.
[2022-06-08 22:15:37] [INFO ] Deduced a trap composed of 107 places in 297 ms of which 1 ms to minimize.
[2022-06-08 22:15:37] [INFO ] Deduced a trap composed of 112 places in 295 ms of which 1 ms to minimize.
[2022-06-08 22:15:38] [INFO ] Deduced a trap composed of 105 places in 264 ms of which 1 ms to minimize.
[2022-06-08 22:15:38] [INFO ] Deduced a trap composed of 70 places in 295 ms of which 1 ms to minimize.
[2022-06-08 22:15:39] [INFO ] Deduced a trap composed of 72 places in 271 ms of which 0 ms to minimize.
[2022-06-08 22:15:39] [INFO ] Deduced a trap composed of 72 places in 272 ms of which 0 ms to minimize.
[2022-06-08 22:15:39] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 0 ms to minimize.
[2022-06-08 22:15:40] [INFO ] Deduced a trap composed of 79 places in 267 ms of which 1 ms to minimize.
[2022-06-08 22:15:40] [INFO ] Deduced a trap composed of 73 places in 300 ms of which 1 ms to minimize.
[2022-06-08 22:15:40] [INFO ] Deduced a trap composed of 74 places in 276 ms of which 1 ms to minimize.
[2022-06-08 22:15:41] [INFO ] Deduced a trap composed of 74 places in 284 ms of which 12 ms to minimize.
[2022-06-08 22:15:41] [INFO ] Deduced a trap composed of 72 places in 279 ms of which 1 ms to minimize.
[2022-06-08 22:15:42] [INFO ] Deduced a trap composed of 73 places in 270 ms of which 1 ms to minimize.
[2022-06-08 22:15:42] [INFO ] Deduced a trap composed of 72 places in 281 ms of which 0 ms to minimize.
[2022-06-08 22:15:42] [INFO ] Deduced a trap composed of 73 places in 299 ms of which 1 ms to minimize.
[2022-06-08 22:15:43] [INFO ] Deduced a trap composed of 73 places in 258 ms of which 1 ms to minimize.
[2022-06-08 22:15:43] [INFO ] Deduced a trap composed of 74 places in 282 ms of which 0 ms to minimize.
[2022-06-08 22:15:44] [INFO ] Deduced a trap composed of 69 places in 276 ms of which 1 ms to minimize.
[2022-06-08 22:15:44] [INFO ] Deduced a trap composed of 72 places in 276 ms of which 1 ms to minimize.
[2022-06-08 22:15:44] [INFO ] Deduced a trap composed of 71 places in 277 ms of which 0 ms to minimize.
[2022-06-08 22:15:45] [INFO ] Deduced a trap composed of 73 places in 294 ms of which 13 ms to minimize.
[2022-06-08 22:15:45] [INFO ] Deduced a trap composed of 73 places in 276 ms of which 0 ms to minimize.
[2022-06-08 22:15:45] [INFO ] Deduced a trap composed of 74 places in 276 ms of which 1 ms to minimize.
[2022-06-08 22:15:46] [INFO ] Deduced a trap composed of 69 places in 295 ms of which 0 ms to minimize.
[2022-06-08 22:15:46] [INFO ] Deduced a trap composed of 70 places in 302 ms of which 0 ms to minimize.
[2022-06-08 22:15:47] [INFO ] Deduced a trap composed of 72 places in 315 ms of which 1 ms to minimize.
[2022-06-08 22:15:47] [INFO ] Deduced a trap composed of 105 places in 292 ms of which 0 ms to minimize.
[2022-06-08 22:15:47] [INFO ] Deduced a trap composed of 75 places in 302 ms of which 1 ms to minimize.
[2022-06-08 22:15:48] [INFO ] Deduced a trap composed of 105 places in 298 ms of which 1 ms to minimize.
[2022-06-08 22:15:48] [INFO ] Deduced a trap composed of 70 places in 296 ms of which 1 ms to minimize.
[2022-06-08 22:15:49] [INFO ] Deduced a trap composed of 72 places in 296 ms of which 0 ms to minimize.
[2022-06-08 22:15:49] [INFO ] Deduced a trap composed of 112 places in 299 ms of which 0 ms to minimize.
[2022-06-08 22:15:49] [INFO ] Deduced a trap composed of 108 places in 291 ms of which 0 ms to minimize.
[2022-06-08 22:15:50] [INFO ] Deduced a trap composed of 70 places in 271 ms of which 0 ms to minimize.
[2022-06-08 22:15:50] [INFO ] Deduced a trap composed of 72 places in 274 ms of which 1 ms to minimize.
[2022-06-08 22:15:51] [INFO ] Deduced a trap composed of 73 places in 264 ms of which 0 ms to minimize.
[2022-06-08 22:15:51] [INFO ] Deduced a trap composed of 118 places in 303 ms of which 1 ms to minimize.
[2022-06-08 22:15:51] [INFO ] Deduced a trap composed of 104 places in 304 ms of which 0 ms to minimize.
[2022-06-08 22:15:52] [INFO ] Deduced a trap composed of 106 places in 299 ms of which 0 ms to minimize.
[2022-06-08 22:15:52] [INFO ] Deduced a trap composed of 72 places in 302 ms of which 0 ms to minimize.
[2022-06-08 22:15:53] [INFO ] Deduced a trap composed of 107 places in 306 ms of which 1 ms to minimize.
[2022-06-08 22:15:53] [INFO ] Deduced a trap composed of 106 places in 324 ms of which 0 ms to minimize.
[2022-06-08 22:15:53] [INFO ] Deduced a trap composed of 74 places in 297 ms of which 0 ms to minimize.
[2022-06-08 22:15:54] [INFO ] Trap strengthening (SAT) tested/added 85/84 trap constraints in 33207 ms
[2022-06-08 22:15:54] [INFO ] Added : 67 causal constraints over 14 iterations in 35184 ms. Result :sat
Minimization took 779 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 209800 steps, including 1000 resets, run finished after 1812 ms. (steps per millisecond=115 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 53 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 58 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 22:15:57] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:15:57] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-08 22:15:57] [INFO ] Implicit Places using invariants in 329 ms returned []
[2022-06-08 22:15:57] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:15:57] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 22:15:57] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:16:01] [INFO ] Implicit Places using invariants and state equation in 4499 ms returned []
Implicit Place search using SMT with State Equation took 4831 ms to find 0 implicit places.
[2022-06-08 22:16:02] [INFO ] Redundant transitions in 217 ms returned []
[2022-06-08 22:16:02] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:02] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 22:16:02] [INFO ] Dead Transitions using invariants and state equation in 704 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:02] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 6212 ms. (steps per millisecond=160 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2127 ms. (steps per millisecond=470 ) properties (out of 1) seen :0
[2022-06-08 22:16:11] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:11] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 22:16:11] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:11] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2022-06-08 22:16:11] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:16:11] [INFO ] [Real]Added 254 Read/Feed constraints in 139 ms returned sat
[2022-06-08 22:16:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:16:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-08 22:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:12] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2022-06-08 22:16:12] [INFO ] [Nat]Added 254 Read/Feed constraints in 139 ms returned sat
[2022-06-08 22:16:12] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 0 ms to minimize.
[2022-06-08 22:16:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2022-06-08 22:16:12] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 158 ms.
[2022-06-08 22:16:14] [INFO ] Deduced a trap composed of 52 places in 333 ms of which 1 ms to minimize.
[2022-06-08 22:16:15] [INFO ] Deduced a trap composed of 70 places in 350 ms of which 1 ms to minimize.
[2022-06-08 22:16:15] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 1 ms to minimize.
[2022-06-08 22:16:16] [INFO ] Deduced a trap composed of 70 places in 312 ms of which 1 ms to minimize.
[2022-06-08 22:16:16] [INFO ] Deduced a trap composed of 30 places in 322 ms of which 0 ms to minimize.
[2022-06-08 22:16:16] [INFO ] Deduced a trap composed of 72 places in 314 ms of which 0 ms to minimize.
[2022-06-08 22:16:17] [INFO ] Deduced a trap composed of 109 places in 289 ms of which 1 ms to minimize.
[2022-06-08 22:16:17] [INFO ] Deduced a trap composed of 112 places in 291 ms of which 0 ms to minimize.
[2022-06-08 22:16:18] [INFO ] Deduced a trap composed of 78 places in 321 ms of which 1 ms to minimize.
[2022-06-08 22:16:18] [INFO ] Deduced a trap composed of 118 places in 295 ms of which 1 ms to minimize.
[2022-06-08 22:16:18] [INFO ] Deduced a trap composed of 73 places in 298 ms of which 0 ms to minimize.
[2022-06-08 22:16:19] [INFO ] Deduced a trap composed of 109 places in 309 ms of which 1 ms to minimize.
[2022-06-08 22:16:19] [INFO ] Deduced a trap composed of 69 places in 317 ms of which 1 ms to minimize.
[2022-06-08 22:16:20] [INFO ] Deduced a trap composed of 72 places in 278 ms of which 1 ms to minimize.
[2022-06-08 22:16:20] [INFO ] Deduced a trap composed of 69 places in 292 ms of which 1 ms to minimize.
[2022-06-08 22:16:20] [INFO ] Deduced a trap composed of 81 places in 284 ms of which 0 ms to minimize.
[2022-06-08 22:16:21] [INFO ] Deduced a trap composed of 102 places in 268 ms of which 0 ms to minimize.
[2022-06-08 22:16:21] [INFO ] Deduced a trap composed of 68 places in 329 ms of which 1 ms to minimize.
[2022-06-08 22:16:22] [INFO ] Deduced a trap composed of 72 places in 300 ms of which 0 ms to minimize.
[2022-06-08 22:16:22] [INFO ] Deduced a trap composed of 70 places in 308 ms of which 0 ms to minimize.
[2022-06-08 22:16:22] [INFO ] Deduced a trap composed of 109 places in 305 ms of which 1 ms to minimize.
[2022-06-08 22:16:23] [INFO ] Deduced a trap composed of 112 places in 286 ms of which 1 ms to minimize.
[2022-06-08 22:16:23] [INFO ] Deduced a trap composed of 106 places in 332 ms of which 0 ms to minimize.
[2022-06-08 22:16:24] [INFO ] Deduced a trap composed of 110 places in 267 ms of which 0 ms to minimize.
[2022-06-08 22:16:24] [INFO ] Deduced a trap composed of 71 places in 270 ms of which 0 ms to minimize.
[2022-06-08 22:16:24] [INFO ] Deduced a trap composed of 73 places in 304 ms of which 0 ms to minimize.
[2022-06-08 22:16:25] [INFO ] Deduced a trap composed of 110 places in 270 ms of which 1 ms to minimize.
[2022-06-08 22:16:25] [INFO ] Deduced a trap composed of 115 places in 267 ms of which 0 ms to minimize.
[2022-06-08 22:16:25] [INFO ] Deduced a trap composed of 69 places in 262 ms of which 0 ms to minimize.
[2022-06-08 22:16:26] [INFO ] Deduced a trap composed of 108 places in 271 ms of which 0 ms to minimize.
[2022-06-08 22:16:26] [INFO ] Deduced a trap composed of 73 places in 272 ms of which 0 ms to minimize.
[2022-06-08 22:16:27] [INFO ] Deduced a trap composed of 114 places in 268 ms of which 0 ms to minimize.
[2022-06-08 22:16:27] [INFO ] Deduced a trap composed of 118 places in 298 ms of which 0 ms to minimize.
[2022-06-08 22:16:27] [INFO ] Deduced a trap composed of 73 places in 297 ms of which 0 ms to minimize.
[2022-06-08 22:16:28] [INFO ] Deduced a trap composed of 115 places in 268 ms of which 1 ms to minimize.
[2022-06-08 22:16:28] [INFO ] Deduced a trap composed of 113 places in 266 ms of which 0 ms to minimize.
[2022-06-08 22:16:28] [INFO ] Deduced a trap composed of 112 places in 267 ms of which 0 ms to minimize.
[2022-06-08 22:16:29] [INFO ] Deduced a trap composed of 111 places in 297 ms of which 1 ms to minimize.
[2022-06-08 22:16:29] [INFO ] Deduced a trap composed of 74 places in 304 ms of which 0 ms to minimize.
[2022-06-08 22:16:30] [INFO ] Deduced a trap composed of 105 places in 296 ms of which 1 ms to minimize.
[2022-06-08 22:16:30] [INFO ] Deduced a trap composed of 73 places in 301 ms of which 0 ms to minimize.
[2022-06-08 22:16:30] [INFO ] Deduced a trap composed of 107 places in 307 ms of which 0 ms to minimize.
[2022-06-08 22:16:31] [INFO ] Deduced a trap composed of 112 places in 285 ms of which 0 ms to minimize.
[2022-06-08 22:16:31] [INFO ] Deduced a trap composed of 105 places in 287 ms of which 0 ms to minimize.
[2022-06-08 22:16:32] [INFO ] Deduced a trap composed of 70 places in 277 ms of which 0 ms to minimize.
[2022-06-08 22:16:32] [INFO ] Deduced a trap composed of 72 places in 295 ms of which 1 ms to minimize.
[2022-06-08 22:16:32] [INFO ] Deduced a trap composed of 72 places in 316 ms of which 0 ms to minimize.
[2022-06-08 22:16:33] [INFO ] Deduced a trap composed of 68 places in 297 ms of which 1 ms to minimize.
[2022-06-08 22:16:33] [INFO ] Deduced a trap composed of 79 places in 292 ms of which 0 ms to minimize.
[2022-06-08 22:16:34] [INFO ] Deduced a trap composed of 73 places in 297 ms of which 1 ms to minimize.
[2022-06-08 22:16:34] [INFO ] Deduced a trap composed of 74 places in 275 ms of which 0 ms to minimize.
[2022-06-08 22:16:34] [INFO ] Deduced a trap composed of 74 places in 314 ms of which 0 ms to minimize.
[2022-06-08 22:16:35] [INFO ] Deduced a trap composed of 72 places in 246 ms of which 1 ms to minimize.
[2022-06-08 22:16:35] [INFO ] Deduced a trap composed of 73 places in 272 ms of which 0 ms to minimize.
[2022-06-08 22:16:36] [INFO ] Deduced a trap composed of 72 places in 268 ms of which 0 ms to minimize.
[2022-06-08 22:16:36] [INFO ] Deduced a trap composed of 73 places in 275 ms of which 0 ms to minimize.
[2022-06-08 22:16:36] [INFO ] Deduced a trap composed of 73 places in 281 ms of which 0 ms to minimize.
[2022-06-08 22:16:37] [INFO ] Deduced a trap composed of 74 places in 256 ms of which 1 ms to minimize.
[2022-06-08 22:16:37] [INFO ] Deduced a trap composed of 69 places in 271 ms of which 0 ms to minimize.
[2022-06-08 22:16:37] [INFO ] Deduced a trap composed of 72 places in 273 ms of which 0 ms to minimize.
[2022-06-08 22:16:38] [INFO ] Deduced a trap composed of 71 places in 320 ms of which 0 ms to minimize.
[2022-06-08 22:16:38] [INFO ] Deduced a trap composed of 73 places in 272 ms of which 0 ms to minimize.
[2022-06-08 22:16:39] [INFO ] Deduced a trap composed of 73 places in 282 ms of which 1 ms to minimize.
[2022-06-08 22:16:39] [INFO ] Deduced a trap composed of 74 places in 279 ms of which 1 ms to minimize.
[2022-06-08 22:16:39] [INFO ] Deduced a trap composed of 69 places in 292 ms of which 0 ms to minimize.
[2022-06-08 22:16:40] [INFO ] Deduced a trap composed of 70 places in 322 ms of which 0 ms to minimize.
[2022-06-08 22:16:40] [INFO ] Deduced a trap composed of 72 places in 310 ms of which 1 ms to minimize.
[2022-06-08 22:16:41] [INFO ] Deduced a trap composed of 105 places in 307 ms of which 1 ms to minimize.
[2022-06-08 22:16:41] [INFO ] Deduced a trap composed of 75 places in 296 ms of which 0 ms to minimize.
[2022-06-08 22:16:41] [INFO ] Deduced a trap composed of 105 places in 297 ms of which 0 ms to minimize.
[2022-06-08 22:16:42] [INFO ] Deduced a trap composed of 70 places in 301 ms of which 1 ms to minimize.
[2022-06-08 22:16:42] [INFO ] Deduced a trap composed of 72 places in 299 ms of which 0 ms to minimize.
[2022-06-08 22:16:43] [INFO ] Deduced a trap composed of 112 places in 331 ms of which 1 ms to minimize.
[2022-06-08 22:16:43] [INFO ] Deduced a trap composed of 108 places in 281 ms of which 0 ms to minimize.
[2022-06-08 22:16:44] [INFO ] Deduced a trap composed of 70 places in 291 ms of which 1 ms to minimize.
[2022-06-08 22:16:44] [INFO ] Deduced a trap composed of 72 places in 281 ms of which 0 ms to minimize.
[2022-06-08 22:16:44] [INFO ] Deduced a trap composed of 73 places in 270 ms of which 0 ms to minimize.
[2022-06-08 22:16:45] [INFO ] Deduced a trap composed of 118 places in 301 ms of which 0 ms to minimize.
[2022-06-08 22:16:45] [INFO ] Deduced a trap composed of 104 places in 298 ms of which 1 ms to minimize.
[2022-06-08 22:16:45] [INFO ] Deduced a trap composed of 106 places in 284 ms of which 0 ms to minimize.
[2022-06-08 22:16:46] [INFO ] Deduced a trap composed of 72 places in 293 ms of which 0 ms to minimize.
[2022-06-08 22:16:46] [INFO ] Deduced a trap composed of 107 places in 280 ms of which 0 ms to minimize.
[2022-06-08 22:16:47] [INFO ] Deduced a trap composed of 106 places in 278 ms of which 0 ms to minimize.
[2022-06-08 22:16:47] [INFO ] Deduced a trap composed of 74 places in 302 ms of which 0 ms to minimize.
[2022-06-08 22:16:47] [INFO ] Trap strengthening (SAT) tested/added 85/84 trap constraints in 33348 ms
[2022-06-08 22:16:47] [INFO ] Added : 67 causal constraints over 14 iterations in 35189 ms. Result :sat
Minimization took 752 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 209800 steps, including 1001 resets, run finished after 1800 ms. (steps per millisecond=116 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 50 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 40 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 22:16:50] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:50] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 22:16:50] [INFO ] Implicit Places using invariants in 296 ms returned []
[2022-06-08 22:16:50] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:50] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-08 22:16:51] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:16:55] [INFO ] Implicit Places using invariants and state equation in 4686 ms returned []
Implicit Place search using SMT with State Equation took 4986 ms to find 0 implicit places.
[2022-06-08 22:16:55] [INFO ] Redundant transitions in 162 ms returned []
[2022-06-08 22:16:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:55] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 22:16:56] [INFO ] Dead Transitions using invariants and state equation in 769 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m004-UpperBounds-05
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:56] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
[2022-06-08 22:16:56] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:56] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 22:16:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:16:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:56] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2022-06-08 22:16:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:16:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:16:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:57] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2022-06-08 22:16:57] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:16:57] [INFO ] [Nat]Added 254 Read/Feed constraints in 135 ms returned sat
[2022-06-08 22:16:57] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 200 ms.
[2022-06-08 22:17:00] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 0 ms to minimize.
[2022-06-08 22:17:00] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2022-06-08 22:17:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 604 ms
[2022-06-08 22:17:00] [INFO ] Added : 98 causal constraints over 21 iterations in 3231 ms. Result :sat
Minimization took 317 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 693400 steps, including 1000 resets, run finished after 5953 ms. (steps per millisecond=116 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 62 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:07] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 1000001 steps, including 4 resets, run finished after 5989 ms. (steps per millisecond=166 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 2181 ms. (steps per millisecond=458 ) properties (out of 1) seen :0
[2022-06-08 22:17:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:15] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-08 22:17:15] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 22:17:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:15] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2022-06-08 22:17:15] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:17:15] [INFO ] [Real]Added 254 Read/Feed constraints in 120 ms returned sat
[2022-06-08 22:17:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:17:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-06-08 22:17:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:16] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2022-06-08 22:17:16] [INFO ] [Nat]Added 254 Read/Feed constraints in 137 ms returned sat
[2022-06-08 22:17:16] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 1 ms to minimize.
[2022-06-08 22:17:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2022-06-08 22:17:16] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 145 ms.
[2022-06-08 22:17:18] [INFO ] Deduced a trap composed of 52 places in 353 ms of which 0 ms to minimize.
[2022-06-08 22:17:19] [INFO ] Deduced a trap composed of 70 places in 346 ms of which 0 ms to minimize.
[2022-06-08 22:17:19] [INFO ] Deduced a trap composed of 10 places in 402 ms of which 1 ms to minimize.
[2022-06-08 22:17:20] [INFO ] Deduced a trap composed of 70 places in 348 ms of which 0 ms to minimize.
[2022-06-08 22:17:20] [INFO ] Deduced a trap composed of 30 places in 346 ms of which 1 ms to minimize.
[2022-06-08 22:17:21] [INFO ] Deduced a trap composed of 72 places in 314 ms of which 0 ms to minimize.
[2022-06-08 22:17:21] [INFO ] Deduced a trap composed of 109 places in 269 ms of which 0 ms to minimize.
[2022-06-08 22:17:21] [INFO ] Deduced a trap composed of 112 places in 316 ms of which 0 ms to minimize.
[2022-06-08 22:17:22] [INFO ] Deduced a trap composed of 78 places in 295 ms of which 0 ms to minimize.
[2022-06-08 22:17:22] [INFO ] Deduced a trap composed of 118 places in 283 ms of which 0 ms to minimize.
[2022-06-08 22:17:23] [INFO ] Deduced a trap composed of 73 places in 288 ms of which 1 ms to minimize.
[2022-06-08 22:17:23] [INFO ] Deduced a trap composed of 109 places in 303 ms of which 1 ms to minimize.
[2022-06-08 22:17:23] [INFO ] Deduced a trap composed of 69 places in 302 ms of which 0 ms to minimize.
[2022-06-08 22:17:24] [INFO ] Deduced a trap composed of 72 places in 292 ms of which 1 ms to minimize.
[2022-06-08 22:17:24] [INFO ] Deduced a trap composed of 69 places in 309 ms of which 0 ms to minimize.
[2022-06-08 22:17:25] [INFO ] Deduced a trap composed of 81 places in 282 ms of which 1 ms to minimize.
[2022-06-08 22:17:25] [INFO ] Deduced a trap composed of 102 places in 314 ms of which 1 ms to minimize.
[2022-06-08 22:17:25] [INFO ] Deduced a trap composed of 68 places in 297 ms of which 1 ms to minimize.
[2022-06-08 22:17:26] [INFO ] Deduced a trap composed of 72 places in 298 ms of which 0 ms to minimize.
[2022-06-08 22:17:26] [INFO ] Deduced a trap composed of 70 places in 305 ms of which 0 ms to minimize.
[2022-06-08 22:17:27] [INFO ] Deduced a trap composed of 109 places in 266 ms of which 1 ms to minimize.
[2022-06-08 22:17:27] [INFO ] Deduced a trap composed of 112 places in 274 ms of which 0 ms to minimize.
[2022-06-08 22:17:27] [INFO ] Deduced a trap composed of 106 places in 302 ms of which 0 ms to minimize.
[2022-06-08 22:17:28] [INFO ] Deduced a trap composed of 110 places in 304 ms of which 1 ms to minimize.
[2022-06-08 22:17:28] [INFO ] Deduced a trap composed of 71 places in 269 ms of which 0 ms to minimize.
[2022-06-08 22:17:29] [INFO ] Deduced a trap composed of 73 places in 307 ms of which 0 ms to minimize.
[2022-06-08 22:17:29] [INFO ] Deduced a trap composed of 110 places in 305 ms of which 0 ms to minimize.
[2022-06-08 22:17:29] [INFO ] Deduced a trap composed of 115 places in 308 ms of which 1 ms to minimize.
[2022-06-08 22:17:30] [INFO ] Deduced a trap composed of 69 places in 297 ms of which 0 ms to minimize.
[2022-06-08 22:17:30] [INFO ] Deduced a trap composed of 108 places in 304 ms of which 0 ms to minimize.
[2022-06-08 22:17:31] [INFO ] Deduced a trap composed of 73 places in 292 ms of which 0 ms to minimize.
[2022-06-08 22:17:31] [INFO ] Deduced a trap composed of 114 places in 309 ms of which 0 ms to minimize.
[2022-06-08 22:17:31] [INFO ] Deduced a trap composed of 118 places in 302 ms of which 1 ms to minimize.
[2022-06-08 22:17:32] [INFO ] Deduced a trap composed of 73 places in 289 ms of which 1 ms to minimize.
[2022-06-08 22:17:32] [INFO ] Deduced a trap composed of 115 places in 297 ms of which 0 ms to minimize.
[2022-06-08 22:17:33] [INFO ] Deduced a trap composed of 113 places in 304 ms of which 1 ms to minimize.
[2022-06-08 22:17:33] [INFO ] Deduced a trap composed of 112 places in 300 ms of which 0 ms to minimize.
[2022-06-08 22:17:33] [INFO ] Deduced a trap composed of 111 places in 300 ms of which 0 ms to minimize.
[2022-06-08 22:17:34] [INFO ] Deduced a trap composed of 74 places in 295 ms of which 0 ms to minimize.
[2022-06-08 22:17:34] [INFO ] Deduced a trap composed of 105 places in 290 ms of which 1 ms to minimize.
[2022-06-08 22:17:35] [INFO ] Deduced a trap composed of 73 places in 294 ms of which 0 ms to minimize.
[2022-06-08 22:17:35] [INFO ] Deduced a trap composed of 107 places in 275 ms of which 1 ms to minimize.
[2022-06-08 22:17:35] [INFO ] Deduced a trap composed of 112 places in 265 ms of which 0 ms to minimize.
[2022-06-08 22:17:36] [INFO ] Deduced a trap composed of 105 places in 263 ms of which 3 ms to minimize.
[2022-06-08 22:17:36] [INFO ] Deduced a trap composed of 70 places in 306 ms of which 1 ms to minimize.
[2022-06-08 22:17:36] [INFO ] Deduced a trap composed of 72 places in 291 ms of which 0 ms to minimize.
[2022-06-08 22:17:37] [INFO ] Deduced a trap composed of 72 places in 297 ms of which 0 ms to minimize.
[2022-06-08 22:17:37] [INFO ] Deduced a trap composed of 68 places in 299 ms of which 0 ms to minimize.
[2022-06-08 22:17:38] [INFO ] Deduced a trap composed of 79 places in 291 ms of which 1 ms to minimize.
[2022-06-08 22:17:38] [INFO ] Deduced a trap composed of 73 places in 291 ms of which 0 ms to minimize.
[2022-06-08 22:17:38] [INFO ] Deduced a trap composed of 74 places in 268 ms of which 0 ms to minimize.
[2022-06-08 22:17:39] [INFO ] Deduced a trap composed of 74 places in 271 ms of which 1 ms to minimize.
[2022-06-08 22:17:39] [INFO ] Deduced a trap composed of 72 places in 275 ms of which 0 ms to minimize.
[2022-06-08 22:17:40] [INFO ] Deduced a trap composed of 73 places in 277 ms of which 0 ms to minimize.
[2022-06-08 22:17:40] [INFO ] Deduced a trap composed of 72 places in 296 ms of which 1 ms to minimize.
[2022-06-08 22:17:40] [INFO ] Deduced a trap composed of 73 places in 273 ms of which 1 ms to minimize.
[2022-06-08 22:17:41] [INFO ] Deduced a trap composed of 73 places in 281 ms of which 0 ms to minimize.
[2022-06-08 22:17:41] [INFO ] Deduced a trap composed of 74 places in 280 ms of which 0 ms to minimize.
[2022-06-08 22:17:41] [INFO ] Deduced a trap composed of 69 places in 261 ms of which 0 ms to minimize.
[2022-06-08 22:17:42] [INFO ] Deduced a trap composed of 72 places in 269 ms of which 0 ms to minimize.
[2022-06-08 22:17:42] [INFO ] Deduced a trap composed of 71 places in 285 ms of which 1 ms to minimize.
[2022-06-08 22:17:43] [INFO ] Deduced a trap composed of 73 places in 268 ms of which 1 ms to minimize.
[2022-06-08 22:17:43] [INFO ] Deduced a trap composed of 73 places in 281 ms of which 1 ms to minimize.
[2022-06-08 22:17:43] [INFO ] Deduced a trap composed of 74 places in 280 ms of which 1 ms to minimize.
[2022-06-08 22:17:44] [INFO ] Deduced a trap composed of 69 places in 312 ms of which 0 ms to minimize.
[2022-06-08 22:17:44] [INFO ] Deduced a trap composed of 70 places in 290 ms of which 0 ms to minimize.
[2022-06-08 22:17:45] [INFO ] Deduced a trap composed of 72 places in 271 ms of which 0 ms to minimize.
[2022-06-08 22:17:45] [INFO ] Deduced a trap composed of 105 places in 264 ms of which 0 ms to minimize.
[2022-06-08 22:17:45] [INFO ] Deduced a trap composed of 75 places in 273 ms of which 0 ms to minimize.
[2022-06-08 22:17:46] [INFO ] Deduced a trap composed of 105 places in 271 ms of which 0 ms to minimize.
[2022-06-08 22:17:46] [INFO ] Deduced a trap composed of 70 places in 276 ms of which 0 ms to minimize.
[2022-06-08 22:17:46] [INFO ] Deduced a trap composed of 72 places in 289 ms of which 1 ms to minimize.
[2022-06-08 22:17:47] [INFO ] Deduced a trap composed of 112 places in 296 ms of which 0 ms to minimize.
[2022-06-08 22:17:47] [INFO ] Deduced a trap composed of 108 places in 304 ms of which 1 ms to minimize.
[2022-06-08 22:17:48] [INFO ] Deduced a trap composed of 70 places in 284 ms of which 0 ms to minimize.
[2022-06-08 22:17:48] [INFO ] Deduced a trap composed of 72 places in 268 ms of which 1 ms to minimize.
[2022-06-08 22:17:48] [INFO ] Deduced a trap composed of 73 places in 272 ms of which 0 ms to minimize.
[2022-06-08 22:17:49] [INFO ] Deduced a trap composed of 118 places in 296 ms of which 1 ms to minimize.
[2022-06-08 22:17:49] [INFO ] Deduced a trap composed of 104 places in 287 ms of which 0 ms to minimize.
[2022-06-08 22:17:50] [INFO ] Deduced a trap composed of 106 places in 298 ms of which 0 ms to minimize.
[2022-06-08 22:17:50] [INFO ] Deduced a trap composed of 72 places in 291 ms of which 0 ms to minimize.
[2022-06-08 22:17:50] [INFO ] Deduced a trap composed of 107 places in 296 ms of which 0 ms to minimize.
[2022-06-08 22:17:51] [INFO ] Deduced a trap composed of 106 places in 321 ms of which 0 ms to minimize.
[2022-06-08 22:17:51] [INFO ] Deduced a trap composed of 74 places in 298 ms of which 0 ms to minimize.
[2022-06-08 22:17:51] [INFO ] Trap strengthening (SAT) tested/added 85/84 trap constraints in 33268 ms
[2022-06-08 22:17:51] [INFO ] Added : 67 causal constraints over 14 iterations in 35092 ms. Result :sat
Minimization took 744 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 209800 steps, including 1000 resets, run finished after 1864 ms. (steps per millisecond=112 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 47 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 42 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 22:17:54] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:54] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-08 22:17:54] [INFO ] Implicit Places using invariants in 296 ms returned []
[2022-06-08 22:17:54] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:54] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 22:17:55] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:17:59] [INFO ] Implicit Places using invariants and state equation in 4507 ms returned []
Implicit Place search using SMT with State Equation took 4805 ms to find 0 implicit places.
[2022-06-08 22:17:59] [INFO ] Redundant transitions in 81 ms returned []
[2022-06-08 22:17:59] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:59] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 22:18:00] [INFO ] Dead Transitions using invariants and state equation in 760 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:00] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 6899 ms. (steps per millisecond=144 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2160 ms. (steps per millisecond=462 ) properties (out of 1) seen :0
[2022-06-08 22:18:09] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:09] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-08 22:18:09] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:18:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:18:09] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2022-06-08 22:18:09] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:18:09] [INFO ] [Real]Added 254 Read/Feed constraints in 121 ms returned sat
[2022-06-08 22:18:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:18:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:18:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:18:10] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2022-06-08 22:18:10] [INFO ] [Nat]Added 254 Read/Feed constraints in 136 ms returned sat
[2022-06-08 22:18:10] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 1 ms to minimize.
[2022-06-08 22:18:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2022-06-08 22:18:10] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 191 ms.
[2022-06-08 22:18:12] [INFO ] Deduced a trap composed of 52 places in 349 ms of which 0 ms to minimize.
[2022-06-08 22:18:13] [INFO ] Deduced a trap composed of 70 places in 350 ms of which 1 ms to minimize.
[2022-06-08 22:18:13] [INFO ] Deduced a trap composed of 10 places in 374 ms of which 0 ms to minimize.
[2022-06-08 22:18:14] [INFO ] Deduced a trap composed of 70 places in 341 ms of which 0 ms to minimize.
[2022-06-08 22:18:14] [INFO ] Deduced a trap composed of 30 places in 346 ms of which 1 ms to minimize.
[2022-06-08 22:18:15] [INFO ] Deduced a trap composed of 72 places in 306 ms of which 1 ms to minimize.
[2022-06-08 22:18:15] [INFO ] Deduced a trap composed of 109 places in 294 ms of which 1 ms to minimize.
[2022-06-08 22:18:15] [INFO ] Deduced a trap composed of 112 places in 304 ms of which 0 ms to minimize.
[2022-06-08 22:18:16] [INFO ] Deduced a trap composed of 78 places in 304 ms of which 0 ms to minimize.
[2022-06-08 22:18:16] [INFO ] Deduced a trap composed of 118 places in 287 ms of which 0 ms to minimize.
[2022-06-08 22:18:17] [INFO ] Deduced a trap composed of 73 places in 286 ms of which 1 ms to minimize.
[2022-06-08 22:18:17] [INFO ] Deduced a trap composed of 109 places in 305 ms of which 0 ms to minimize.
[2022-06-08 22:18:17] [INFO ] Deduced a trap composed of 69 places in 299 ms of which 0 ms to minimize.
[2022-06-08 22:18:18] [INFO ] Deduced a trap composed of 72 places in 299 ms of which 0 ms to minimize.
[2022-06-08 22:18:18] [INFO ] Deduced a trap composed of 69 places in 297 ms of which 0 ms to minimize.
[2022-06-08 22:18:19] [INFO ] Deduced a trap composed of 81 places in 298 ms of which 1 ms to minimize.
[2022-06-08 22:18:19] [INFO ] Deduced a trap composed of 102 places in 307 ms of which 1 ms to minimize.
[2022-06-08 22:18:19] [INFO ] Deduced a trap composed of 68 places in 312 ms of which 1 ms to minimize.
[2022-06-08 22:18:20] [INFO ] Deduced a trap composed of 72 places in 302 ms of which 1 ms to minimize.
[2022-06-08 22:18:20] [INFO ] Deduced a trap composed of 70 places in 304 ms of which 0 ms to minimize.
[2022-06-08 22:18:21] [INFO ] Deduced a trap composed of 109 places in 300 ms of which 0 ms to minimize.
[2022-06-08 22:18:21] [INFO ] Deduced a trap composed of 112 places in 306 ms of which 0 ms to minimize.
[2022-06-08 22:18:21] [INFO ] Deduced a trap composed of 106 places in 297 ms of which 0 ms to minimize.
[2022-06-08 22:18:22] [INFO ] Deduced a trap composed of 110 places in 297 ms of which 1 ms to minimize.
[2022-06-08 22:18:22] [INFO ] Deduced a trap composed of 71 places in 297 ms of which 0 ms to minimize.
[2022-06-08 22:18:23] [INFO ] Deduced a trap composed of 73 places in 306 ms of which 0 ms to minimize.
[2022-06-08 22:18:23] [INFO ] Deduced a trap composed of 110 places in 301 ms of which 1 ms to minimize.
[2022-06-08 22:18:24] [INFO ] Deduced a trap composed of 115 places in 303 ms of which 0 ms to minimize.
[2022-06-08 22:18:24] [INFO ] Deduced a trap composed of 69 places in 301 ms of which 0 ms to minimize.
[2022-06-08 22:18:24] [INFO ] Deduced a trap composed of 108 places in 297 ms of which 0 ms to minimize.
[2022-06-08 22:18:25] [INFO ] Deduced a trap composed of 73 places in 318 ms of which 0 ms to minimize.
[2022-06-08 22:18:25] [INFO ] Deduced a trap composed of 114 places in 295 ms of which 1 ms to minimize.
[2022-06-08 22:18:26] [INFO ] Deduced a trap composed of 118 places in 296 ms of which 0 ms to minimize.
[2022-06-08 22:18:26] [INFO ] Deduced a trap composed of 73 places in 297 ms of which 1 ms to minimize.
[2022-06-08 22:18:26] [INFO ] Deduced a trap composed of 115 places in 302 ms of which 1 ms to minimize.
[2022-06-08 22:18:27] [INFO ] Deduced a trap composed of 113 places in 301 ms of which 1 ms to minimize.
[2022-06-08 22:18:27] [INFO ] Deduced a trap composed of 112 places in 299 ms of which 1 ms to minimize.
[2022-06-08 22:18:28] [INFO ] Deduced a trap composed of 111 places in 300 ms of which 1 ms to minimize.
[2022-06-08 22:18:28] [INFO ] Deduced a trap composed of 74 places in 295 ms of which 1 ms to minimize.
[2022-06-08 22:18:28] [INFO ] Deduced a trap composed of 105 places in 304 ms of which 0 ms to minimize.
[2022-06-08 22:18:29] [INFO ] Deduced a trap composed of 73 places in 287 ms of which 0 ms to minimize.
[2022-06-08 22:18:29] [INFO ] Deduced a trap composed of 107 places in 289 ms of which 0 ms to minimize.
[2022-06-08 22:18:30] [INFO ] Deduced a trap composed of 112 places in 294 ms of which 0 ms to minimize.
[2022-06-08 22:18:30] [INFO ] Deduced a trap composed of 105 places in 294 ms of which 0 ms to minimize.
[2022-06-08 22:18:30] [INFO ] Deduced a trap composed of 70 places in 296 ms of which 1 ms to minimize.
[2022-06-08 22:18:31] [INFO ] Deduced a trap composed of 72 places in 300 ms of which 1 ms to minimize.
[2022-06-08 22:18:31] [INFO ] Deduced a trap composed of 72 places in 298 ms of which 1 ms to minimize.
[2022-06-08 22:18:32] [INFO ] Deduced a trap composed of 68 places in 305 ms of which 1 ms to minimize.
[2022-06-08 22:18:32] [INFO ] Deduced a trap composed of 79 places in 290 ms of which 0 ms to minimize.
[2022-06-08 22:18:32] [INFO ] Deduced a trap composed of 73 places in 304 ms of which 1 ms to minimize.
[2022-06-08 22:18:33] [INFO ] Deduced a trap composed of 74 places in 273 ms of which 0 ms to minimize.
[2022-06-08 22:18:33] [INFO ] Deduced a trap composed of 74 places in 274 ms of which 0 ms to minimize.
[2022-06-08 22:18:33] [INFO ] Deduced a trap composed of 72 places in 290 ms of which 0 ms to minimize.
[2022-06-08 22:18:34] [INFO ] Deduced a trap composed of 73 places in 254 ms of which 0 ms to minimize.
[2022-06-08 22:18:34] [INFO ] Deduced a trap composed of 72 places in 263 ms of which 0 ms to minimize.
[2022-06-08 22:18:35] [INFO ] Deduced a trap composed of 73 places in 255 ms of which 0 ms to minimize.
[2022-06-08 22:18:35] [INFO ] Deduced a trap composed of 73 places in 257 ms of which 0 ms to minimize.
[2022-06-08 22:18:35] [INFO ] Deduced a trap composed of 74 places in 248 ms of which 0 ms to minimize.
[2022-06-08 22:18:36] [INFO ] Deduced a trap composed of 69 places in 262 ms of which 0 ms to minimize.
[2022-06-08 22:18:36] [INFO ] Deduced a trap composed of 72 places in 257 ms of which 1 ms to minimize.
[2022-06-08 22:18:36] [INFO ] Deduced a trap composed of 71 places in 258 ms of which 0 ms to minimize.
[2022-06-08 22:18:37] [INFO ] Deduced a trap composed of 73 places in 257 ms of which 0 ms to minimize.
[2022-06-08 22:18:37] [INFO ] Deduced a trap composed of 73 places in 270 ms of which 0 ms to minimize.
[2022-06-08 22:18:37] [INFO ] Deduced a trap composed of 74 places in 271 ms of which 0 ms to minimize.
[2022-06-08 22:18:38] [INFO ] Deduced a trap composed of 69 places in 294 ms of which 0 ms to minimize.
[2022-06-08 22:18:38] [INFO ] Deduced a trap composed of 70 places in 277 ms of which 0 ms to minimize.
[2022-06-08 22:18:39] [INFO ] Deduced a trap composed of 72 places in 276 ms of which 0 ms to minimize.
[2022-06-08 22:18:39] [INFO ] Deduced a trap composed of 105 places in 280 ms of which 0 ms to minimize.
[2022-06-08 22:18:39] [INFO ] Deduced a trap composed of 75 places in 286 ms of which 1 ms to minimize.
[2022-06-08 22:18:40] [INFO ] Deduced a trap composed of 105 places in 290 ms of which 1 ms to minimize.
[2022-06-08 22:18:40] [INFO ] Deduced a trap composed of 70 places in 280 ms of which 1 ms to minimize.
[2022-06-08 22:18:41] [INFO ] Deduced a trap composed of 72 places in 282 ms of which 1 ms to minimize.
[2022-06-08 22:18:41] [INFO ] Deduced a trap composed of 112 places in 274 ms of which 1 ms to minimize.
[2022-06-08 22:18:41] [INFO ] Deduced a trap composed of 108 places in 263 ms of which 0 ms to minimize.
[2022-06-08 22:18:42] [INFO ] Deduced a trap composed of 70 places in 306 ms of which 0 ms to minimize.
[2022-06-08 22:18:42] [INFO ] Deduced a trap composed of 72 places in 269 ms of which 1 ms to minimize.
[2022-06-08 22:18:42] [INFO ] Deduced a trap composed of 73 places in 273 ms of which 1 ms to minimize.
[2022-06-08 22:18:43] [INFO ] Deduced a trap composed of 118 places in 299 ms of which 1 ms to minimize.
[2022-06-08 22:18:43] [INFO ] Deduced a trap composed of 104 places in 302 ms of which 0 ms to minimize.
[2022-06-08 22:18:44] [INFO ] Deduced a trap composed of 106 places in 315 ms of which 1 ms to minimize.
[2022-06-08 22:18:44] [INFO ] Deduced a trap composed of 72 places in 296 ms of which 1 ms to minimize.
[2022-06-08 22:18:44] [INFO ] Deduced a trap composed of 107 places in 296 ms of which 1 ms to minimize.
[2022-06-08 22:18:45] [INFO ] Deduced a trap composed of 106 places in 291 ms of which 0 ms to minimize.
[2022-06-08 22:18:45] [INFO ] Deduced a trap composed of 74 places in 295 ms of which 1 ms to minimize.
[2022-06-08 22:18:45] [INFO ] Trap strengthening (SAT) tested/added 85/84 trap constraints in 33336 ms
[2022-06-08 22:18:46] [INFO ] Added : 67 causal constraints over 14 iterations in 35228 ms. Result :sat
Minimization took 733 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 209800 steps, including 1000 resets, run finished after 1852 ms. (steps per millisecond=113 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 35 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 34 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 22:18:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:48] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 22:18:49] [INFO ] Implicit Places using invariants in 285 ms returned []
[2022-06-08 22:18:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:49] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 22:18:49] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:18:53] [INFO ] Implicit Places using invariants and state equation in 4134 ms returned []
Implicit Place search using SMT with State Equation took 4424 ms to find 0 implicit places.
[2022-06-08 22:18:53] [INFO ] Redundant transitions in 73 ms returned []
[2022-06-08 22:18:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:53] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 22:18:53] [INFO ] Dead Transitions using invariants and state equation in 694 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m004-UpperBounds-05 in 117496 ms.
[2022-06-08 22:18:54] [INFO ] Flatten gal took : 280 ms
[2022-06-08 22:18:54] [INFO ] Applying decomposition
[2022-06-08 22:18:54] [INFO ] Flatten gal took : 201 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10895502538710325549.txt, -o, /tmp/graph10895502538710325549.bin, -w, /tmp/graph10895502538710325549.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10895502538710325549.bin, -l, -1, -v, -w, /tmp/graph10895502538710325549.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 22:18:55] [INFO ] Decomposing Gal with order
[2022-06-08 22:18:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 22:18:55] [INFO ] Removed a total of 280 redundant transitions.
[2022-06-08 22:18:55] [INFO ] Flatten gal took : 306 ms
[2022-06-08 22:18:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 16 ms.
[2022-06-08 22:18:55] [INFO ] Time to serialize gal into /tmp/UpperBounds2758297600270808108.gal : 50 ms
[2022-06-08 22:18:55] [INFO ] Time to serialize properties into /tmp/UpperBounds9496105835830854542.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds2758297600270808108.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9496105835830854542.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds2758297600270808108.gal -t CGAL -reachable-file /tmp/UpperBounds9496105835830854542.prop --nowitness
Loading property file /tmp/UpperBounds9496105835830854542.prop.
Detected timeout of ITS tools.
[2022-06-08 22:40:16] [INFO ] Flatten gal took : 706 ms
[2022-06-08 22:40:16] [INFO ] Time to serialize gal into /tmp/UpperBounds12127019827694986592.gal : 94 ms
[2022-06-08 22:40:16] [INFO ] Time to serialize properties into /tmp/UpperBounds2558376476044540294.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds12127019827694986592.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds2558376476044540294.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds12127019827694986592.gal -t CGAL -reachable-file /tmp/UpperBounds2558376476044540294.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds2558376476044540294.prop.
Detected timeout of ITS tools.
[2022-06-08 23:01:34] [INFO ] Flatten gal took : 663 ms
[2022-06-08 23:01:38] [INFO ] Input system was already deterministic with 2747 transitions.
[2022-06-08 23:01:38] [INFO ] Transformed 229 places.
[2022-06-08 23:01:38] [INFO ] Transformed 2747 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-08 23:01:38] [INFO ] Time to serialize gal into /tmp/UpperBounds3697941256206235084.gal : 10 ms
[2022-06-08 23:01:38] [INFO ] Time to serialize properties into /tmp/UpperBounds18175217932672856863.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds3697941256206235084.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds18175217932672856863.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds3697941256206235084.gal -t CGAL -reachable-file /tmp/UpperBounds18175217932672856863.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds18175217932672856863.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="BugTracking-PT-q3m004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is BugTracking-PT-q3m004, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r323-tall-165472292500004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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