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.r312-tall-165472281800125.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 itstools
Input is BugTracking-PT-q8m256, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281800125
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K Jun 7 16:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 7 16:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 16:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 16:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 20K Jun 7 16:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Jun 7 16:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 7 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:23 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-q8m256-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654770964811

Running Version 202205111006
[2022-06-09 10:36:06] [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-09 10:36:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 10:36:07] [INFO ] Load time of PNML (sax parser for PT used): 964 ms
[2022-06-09 10:36:07] [INFO ] Transformed 754 places.
[2022-06-09 10:36:07] [INFO ] Transformed 27370 transitions.
[2022-06-09 10:36:07] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 1174 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 474 places in 122 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m256-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 10:36:07] [INFO ] Computed 10 place invariants in 53 ms
Incomplete random walk after 10161 steps, including 6 resets, run finished after 81 ms. (steps per millisecond=125 ) properties (out of 6) seen :1
FORMULA BugTracking-PT-q8m256-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
[2022-06-09 10:36:07] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 10:36:07] [INFO ] Computed 10 place invariants in 19 ms
[2022-06-09 10:36:08] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2022-06-09 10:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:08] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2022-06-09 10:36:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:36:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 10:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:09] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2022-06-09 10:36:09] [INFO ] State equation strengthened by 303 read => feed constraints.
[2022-06-09 10:36:09] [INFO ] [Nat]Added 303 Read/Feed constraints in 281 ms returned sat
[2022-06-09 10:36:10] [INFO ] Deduced a trap composed of 26 places in 479 ms of which 3 ms to minimize.
[2022-06-09 10:36:10] [INFO ] Deduced a trap composed of 14 places in 483 ms of which 5 ms to minimize.
[2022-06-09 10:36:11] [INFO ] Deduced a trap composed of 92 places in 406 ms of which 2 ms to minimize.
[2022-06-09 10:36:11] [INFO ] Deduced a trap composed of 91 places in 377 ms of which 3 ms to minimize.
[2022-06-09 10:36:12] [INFO ] Deduced a trap composed of 85 places in 368 ms of which 1 ms to minimize.
[2022-06-09 10:36:12] [INFO ] Deduced a trap composed of 67 places in 405 ms of which 1 ms to minimize.
[2022-06-09 10:36:13] [INFO ] Deduced a trap composed of 14 places in 363 ms of which 1 ms to minimize.
[2022-06-09 10:36:13] [INFO ] Deduced a trap composed of 86 places in 359 ms of which 1 ms to minimize.
[2022-06-09 10:36:14] [INFO ] Deduced a trap composed of 12 places in 395 ms of which 0 ms to minimize.
[2022-06-09 10:36:14] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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: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)
[2022-06-09 10:36:14] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 10:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:14] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2022-06-09 10:36:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:36:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 10:36:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:15] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2022-06-09 10:36:15] [INFO ] [Nat]Added 303 Read/Feed constraints in 167 ms returned sat
[2022-06-09 10:36:15] [INFO ] Deduced a trap composed of 72 places in 407 ms of which 1 ms to minimize.
[2022-06-09 10:36:16] [INFO ] Deduced a trap composed of 46 places in 347 ms of which 1 ms to minimize.
[2022-06-09 10:36:16] [INFO ] Deduced a trap composed of 45 places in 351 ms of which 0 ms to minimize.
[2022-06-09 10:36:17] [INFO ] Deduced a trap composed of 17 places in 415 ms of which 0 ms to minimize.
[2022-06-09 10:36:17] [INFO ] Deduced a trap composed of 44 places in 378 ms of which 1 ms to minimize.
[2022-06-09 10:36:18] [INFO ] Deduced a trap composed of 41 places in 396 ms of which 0 ms to minimize.
[2022-06-09 10:36:18] [INFO ] Deduced a trap composed of 45 places in 345 ms of which 0 ms to minimize.
[2022-06-09 10:36:19] [INFO ] Deduced a trap composed of 43 places in 363 ms of which 0 ms to minimize.
[2022-06-09 10:36:19] [INFO ] Deduced a trap composed of 43 places in 364 ms of which 0 ms to minimize.
[2022-06-09 10:36:20] [INFO ] Deduced a trap composed of 40 places in 364 ms of which 0 ms to minimize.
[2022-06-09 10:36:20] [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 1
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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: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)
[2022-06-09 10:36:20] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 10:36:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:20] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2022-06-09 10:36:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:36:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 10:36:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:21] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2022-06-09 10:36:21] [INFO ] [Nat]Added 303 Read/Feed constraints in 206 ms returned sat
[2022-06-09 10:36:21] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 254 ms.
[2022-06-09 10:36:22] [INFO ] Added : 10 causal constraints over 2 iterations in 703 ms. Result :sat
[2022-06-09 10:36:22] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-09 10:36:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:22] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2022-06-09 10:36:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:36:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 10:36:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:23] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2022-06-09 10:36:23] [INFO ] [Nat]Added 303 Read/Feed constraints in 197 ms returned sat
[2022-06-09 10:36:24] [INFO ] Deduced a trap composed of 30 places in 536 ms of which 1 ms to minimize.
[2022-06-09 10:36:24] [INFO ] Deduced a trap composed of 55 places in 509 ms of which 0 ms to minimize.
[2022-06-09 10:36:25] [INFO ] Deduced a trap composed of 11 places in 492 ms of which 0 ms to minimize.
[2022-06-09 10:36:25] [INFO ] Deduced a trap composed of 58 places in 427 ms of which 1 ms to minimize.
[2022-06-09 10:36:26] [INFO ] Deduced a trap composed of 122 places in 491 ms of which 0 ms to minimize.
[2022-06-09 10:36:27] [INFO ] Deduced a trap composed of 91 places in 437 ms of which 1 ms to minimize.
[2022-06-09 10:36:27] [INFO ] Deduced a trap composed of 23 places in 428 ms of which 0 ms to minimize.
[2022-06-09 10:36:28] [INFO ] Deduced a trap composed of 52 places in 482 ms of which 0 ms to minimize.
[2022-06-09 10:36:28] [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 3
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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: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)
[2022-06-09 10:36:28] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 10:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:28] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2022-06-09 10:36:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:36:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 10:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:29] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2022-06-09 10:36:29] [INFO ] [Nat]Added 303 Read/Feed constraints in 160 ms returned sat
[2022-06-09 10:36:29] [INFO ] Deduced a trap composed of 28 places in 298 ms of which 1 ms to minimize.
[2022-06-09 10:36:30] [INFO ] Deduced a trap composed of 14 places in 334 ms of which 3 ms to minimize.
[2022-06-09 10:36:30] [INFO ] Deduced a trap composed of 26 places in 293 ms of which 1 ms to minimize.
[2022-06-09 10:36:30] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2022-06-09 10:36:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1566 ms
[2022-06-09 10:36:31] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 474 ms.
[2022-06-09 10:36:31] [INFO ] Added : 13 causal constraints over 3 iterations in 995 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, 1, 1, -1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 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 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 340 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:36:32] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 1000072 steps, including 2 resets, run finished after 535 ms. (steps per millisecond=1869 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1929 ms. (steps per millisecond=518 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1964 ms. (steps per millisecond=509 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1830 ms. (steps per millisecond=546 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1858 ms. (steps per millisecond=538 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1797 ms. (steps per millisecond=556 ) properties (out of 5) seen :0
[2022-06-09 10:36:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:36:42] [INFO ] Computed 8 place invariants in 25 ms
[2022-06-09 10:36:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:36:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:43] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2022-06-09 10:36:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:36:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:36:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:44] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2022-06-09 10:36:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:36:44] [INFO ] [Nat]Added 283 Read/Feed constraints in 243 ms returned sat
[2022-06-09 10:36:44] [INFO ] Deduced a trap composed of 49 places in 344 ms of which 1 ms to minimize.
[2022-06-09 10:36:45] [INFO ] Deduced a trap composed of 16 places in 386 ms of which 0 ms to minimize.
[2022-06-09 10:36:45] [INFO ] Deduced a trap composed of 52 places in 450 ms of which 2 ms to minimize.
[2022-06-09 10:36:46] [INFO ] Deduced a trap composed of 55 places in 426 ms of which 1 ms to minimize.
[2022-06-09 10:36:46] [INFO ] Deduced a trap composed of 14 places in 409 ms of which 1 ms to minimize.
[2022-06-09 10:36:47] [INFO ] Deduced a trap composed of 63 places in 414 ms of which 1 ms to minimize.
[2022-06-09 10:36:48] [INFO ] Deduced a trap composed of 15 places in 388 ms of which 1 ms to minimize.
[2022-06-09 10:36:48] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 0 ms to minimize.
[2022-06-09 10:36:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4230 ms
[2022-06-09 10:36:48] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 226 ms.
[2022-06-09 10:36:49] [INFO ] Added : 5 causal constraints over 1 iterations in 523 ms. Result :sat
[2022-06-09 10:36:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:49] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2022-06-09 10:36:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:36:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:36:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:50] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2022-06-09 10:36:50] [INFO ] [Nat]Added 283 Read/Feed constraints in 182 ms returned sat
[2022-06-09 10:36:50] [INFO ] Deduced a trap composed of 13 places in 440 ms of which 0 ms to minimize.
[2022-06-09 10:36:51] [INFO ] Deduced a trap composed of 23 places in 474 ms of which 0 ms to minimize.
[2022-06-09 10:36:51] [INFO ] Deduced a trap composed of 64 places in 389 ms of which 0 ms to minimize.
[2022-06-09 10:36:52] [INFO ] Deduced a trap composed of 36 places in 387 ms of which 0 ms to minimize.
[2022-06-09 10:36:52] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 0 ms to minimize.
[2022-06-09 10:36:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2456 ms
[2022-06-09 10:36:53] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 225 ms.
[2022-06-09 10:36:53] [INFO ] Added : 3 causal constraints over 1 iterations in 518 ms. Result :sat
[2022-06-09 10:36:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:53] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2022-06-09 10:36:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:36:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:36:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:54] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2022-06-09 10:36:54] [INFO ] [Nat]Added 283 Read/Feed constraints in 161 ms returned sat
[2022-06-09 10:36:55] [INFO ] Deduced a trap composed of 7 places in 409 ms of which 0 ms to minimize.
[2022-06-09 10:36:55] [INFO ] Deduced a trap composed of 40 places in 402 ms of which 1 ms to minimize.
[2022-06-09 10:36:56] [INFO ] Deduced a trap composed of 55 places in 390 ms of which 0 ms to minimize.
[2022-06-09 10:36:56] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 1 ms to minimize.
[2022-06-09 10:36:56] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 1 ms to minimize.
[2022-06-09 10:36:57] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 1 ms to minimize.
[2022-06-09 10:36:57] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2022-06-09 10:36:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2691 ms
[2022-06-09 10:36:57] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 252 ms.
[2022-06-09 10:36:58] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 0 ms to minimize.
[2022-06-09 10:36:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2022-06-09 10:36:58] [INFO ] Added : 7 causal constraints over 3 iterations in 1318 ms. Result :sat
[2022-06-09 10:36:58] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 10:36:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:59] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2022-06-09 10:36:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:36:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:36:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:59] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2022-06-09 10:37:00] [INFO ] [Nat]Added 283 Read/Feed constraints in 166 ms returned sat
[2022-06-09 10:37:00] [INFO ] Deduced a trap composed of 35 places in 361 ms of which 1 ms to minimize.
[2022-06-09 10:37:00] [INFO ] Deduced a trap composed of 17 places in 357 ms of which 1 ms to minimize.
[2022-06-09 10:37:01] [INFO ] Deduced a trap composed of 52 places in 321 ms of which 0 ms to minimize.
[2022-06-09 10:37:01] [INFO ] Deduced a trap composed of 44 places in 327 ms of which 1 ms to minimize.
[2022-06-09 10:37:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1758 ms
[2022-06-09 10:37:02] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 250 ms.
[2022-06-09 10:37:02] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2022-06-09 10:37:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2022-06-09 10:37:03] [INFO ] Added : 9 causal constraints over 3 iterations in 1198 ms. Result :sat
[2022-06-09 10:37:03] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:37:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:37:03] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2022-06-09 10:37:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:37:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:37:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:37:04] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2022-06-09 10:37:04] [INFO ] [Nat]Added 283 Read/Feed constraints in 168 ms returned sat
[2022-06-09 10:37:04] [INFO ] Deduced a trap composed of 64 places in 376 ms of which 0 ms to minimize.
[2022-06-09 10:37:05] [INFO ] Deduced a trap composed of 99 places in 355 ms of which 0 ms to minimize.
[2022-06-09 10:37:05] [INFO ] Deduced a trap composed of 23 places in 380 ms of which 0 ms to minimize.
[2022-06-09 10:37:06] [INFO ] Deduced a trap composed of 57 places in 387 ms of which 0 ms to minimize.
[2022-06-09 10:37:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1937 ms
[2022-06-09 10:37:06] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 197 ms.
[2022-06-09 10:37:06] [INFO ] Added : 3 causal constraints over 1 iterations in 501 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, 1, 1, -1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 10:37:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:07] [INFO ] Computed 8 place invariants in 19 ms
[2022-06-09 10:37:08] [INFO ] Implicit Places using invariants in 456 ms returned []
[2022-06-09 10:37:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:08] [INFO ] Computed 8 place invariants in 22 ms
[2022-06-09 10:37:08] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:37:10] [INFO ] Implicit Places using invariants and state equation in 2064 ms returned []
Implicit Place search using SMT with State Equation took 2524 ms to find 0 implicit places.
[2022-06-09 10:37:10] [INFO ] Redundant transitions in 318 ms returned []
[2022-06-09 10:37:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:10] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 10:37:11] [INFO ] Dead Transitions using invariants and state equation in 1100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-01
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:11] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 10108 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1684 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2022-06-09 10:37:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:11] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 10:37:11] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:37:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:37:12] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2022-06-09 10:37:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:37:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 10:37:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:37:12] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2022-06-09 10:37:12] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:37:13] [INFO ] [Nat]Added 283 Read/Feed constraints in 258 ms returned sat
[2022-06-09 10:37:13] [INFO ] Deduced a trap composed of 49 places in 392 ms of which 1 ms to minimize.
[2022-06-09 10:37:13] [INFO ] Deduced a trap composed of 16 places in 391 ms of which 1 ms to minimize.
[2022-06-09 10:37:14] [INFO ] Deduced a trap composed of 52 places in 429 ms of which 0 ms to minimize.
[2022-06-09 10:37:15] [INFO ] Deduced a trap composed of 55 places in 421 ms of which 1 ms to minimize.
[2022-06-09 10:37:15] [INFO ] Deduced a trap composed of 14 places in 419 ms of which 0 ms to minimize.
[2022-06-09 10:37:16] [INFO ] Deduced a trap composed of 63 places in 404 ms of which 0 ms to minimize.
[2022-06-09 10:37:16] [INFO ] Deduced a trap composed of 15 places in 418 ms of which 0 ms to minimize.
[2022-06-09 10:37:17] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 0 ms to minimize.
[2022-06-09 10:37:17] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 4178 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 59 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:17] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 1000027 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=2132 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1973 ms. (steps per millisecond=506 ) properties (out of 1) seen :0
[2022-06-09 10:37:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:19] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 10:37:19] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:37:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:37:20] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2022-06-09 10:37:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:37:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:37:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:37:20] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2022-06-09 10:37:20] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:37:21] [INFO ] [Nat]Added 283 Read/Feed constraints in 260 ms returned sat
[2022-06-09 10:37:21] [INFO ] Deduced a trap composed of 49 places in 346 ms of which 0 ms to minimize.
[2022-06-09 10:37:22] [INFO ] Deduced a trap composed of 16 places in 376 ms of which 0 ms to minimize.
[2022-06-09 10:37:22] [INFO ] Deduced a trap composed of 52 places in 423 ms of which 0 ms to minimize.
[2022-06-09 10:37:23] [INFO ] Deduced a trap composed of 55 places in 424 ms of which 1 ms to minimize.
[2022-06-09 10:37:23] [INFO ] Deduced a trap composed of 14 places in 402 ms of which 0 ms to minimize.
[2022-06-09 10:37:24] [INFO ] Deduced a trap composed of 63 places in 422 ms of which 1 ms to minimize.
[2022-06-09 10:37:24] [INFO ] Deduced a trap composed of 15 places in 411 ms of which 0 ms to minimize.
[2022-06-09 10:37:25] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 0 ms to minimize.
[2022-06-09 10:37:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4227 ms
[2022-06-09 10:37:25] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 224 ms.
[2022-06-09 10:37:25] [INFO ] Added : 5 causal constraints over 1 iterations in 531 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 66 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 62 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 10:37:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:26] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 10:37:26] [INFO ] Implicit Places using invariants in 427 ms returned []
[2022-06-09 10:37:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:26] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 10:37:27] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:37:28] [INFO ] Implicit Places using invariants and state equation in 2028 ms returned []
Implicit Place search using SMT with State Equation took 2459 ms to find 0 implicit places.
[2022-06-09 10:37:28] [INFO ] Redundant transitions in 215 ms returned []
[2022-06-09 10:37:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:28] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 10:37:30] [INFO ] Dead Transitions using invariants and state equation in 1097 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-01 in 18558 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-02
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:30] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 10153 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1269 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2022-06-09 10:37:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:30] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 10:37:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:37:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:37:30] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2022-06-09 10:37:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:37:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:37:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:37:31] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2022-06-09 10:37:31] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:37:31] [INFO ] [Nat]Added 283 Read/Feed constraints in 183 ms returned sat
[2022-06-09 10:37:32] [INFO ] Deduced a trap composed of 13 places in 472 ms of which 1 ms to minimize.
[2022-06-09 10:37:32] [INFO ] Deduced a trap composed of 23 places in 446 ms of which 1 ms to minimize.
[2022-06-09 10:37:32] [INFO ] Deduced a trap composed of 64 places in 369 ms of which 0 ms to minimize.
[2022-06-09 10:37:33] [INFO ] Deduced a trap composed of 36 places in 347 ms of which 0 ms to minimize.
[2022-06-09 10:37:33] [INFO ] Deduced a trap composed of 23 places in 379 ms of which 0 ms to minimize.
[2022-06-09 10:37:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2441 ms
[2022-06-09 10:37:34] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 234 ms.
[2022-06-09 10:37:34] [INFO ] Added : 3 causal constraints over 1 iterations in 529 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 74 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:34] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 1000054 steps, including 2 resets, run finished after 536 ms. (steps per millisecond=1865 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1940 ms. (steps per millisecond=515 ) properties (out of 1) seen :0
[2022-06-09 10:37:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:37] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 10:37:37] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:37:37] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2022-06-09 10:37:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:37:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:37:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:37:38] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2022-06-09 10:37:38] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:37:38] [INFO ] [Nat]Added 283 Read/Feed constraints in 190 ms returned sat
[2022-06-09 10:37:39] [INFO ] Deduced a trap composed of 13 places in 484 ms of which 1 ms to minimize.
[2022-06-09 10:37:39] [INFO ] Deduced a trap composed of 23 places in 451 ms of which 0 ms to minimize.
[2022-06-09 10:37:40] [INFO ] Deduced a trap composed of 64 places in 361 ms of which 1 ms to minimize.
[2022-06-09 10:37:40] [INFO ] Deduced a trap composed of 36 places in 351 ms of which 0 ms to minimize.
[2022-06-09 10:37:40] [INFO ] Deduced a trap composed of 23 places in 344 ms of which 1 ms to minimize.
[2022-06-09 10:37:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2435 ms
[2022-06-09 10:37:41] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 230 ms.
[2022-06-09 10:37:41] [INFO ] Added : 3 causal constraints over 1 iterations in 544 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 73 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 56 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 10:37:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:41] [INFO ] Computed 8 place invariants in 20 ms
[2022-06-09 10:37:42] [INFO ] Implicit Places using invariants in 449 ms returned []
[2022-06-09 10:37:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:42] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 10:37:42] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:37:44] [INFO ] Implicit Places using invariants and state equation in 1990 ms returned []
Implicit Place search using SMT with State Equation took 2440 ms to find 0 implicit places.
[2022-06-09 10:37:44] [INFO ] Redundant transitions in 120 ms returned []
[2022-06-09 10:37:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:44] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 10:37:45] [INFO ] Dead Transitions using invariants and state equation in 1044 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-02 in 15467 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-04
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:45] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 10099 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1442 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2022-06-09 10:37:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:45] [INFO ] Computed 8 place invariants in 21 ms
[2022-06-09 10:37:45] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:37:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:37:46] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2022-06-09 10:37:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:37:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 10:37:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:37:46] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2022-06-09 10:37:46] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:37:46] [INFO ] [Nat]Added 283 Read/Feed constraints in 162 ms returned sat
[2022-06-09 10:37:47] [INFO ] Deduced a trap composed of 7 places in 421 ms of which 0 ms to minimize.
[2022-06-09 10:37:47] [INFO ] Deduced a trap composed of 40 places in 397 ms of which 0 ms to minimize.
[2022-06-09 10:37:48] [INFO ] Deduced a trap composed of 55 places in 409 ms of which 0 ms to minimize.
[2022-06-09 10:37:48] [INFO ] Deduced a trap composed of 10 places in 287 ms of which 1 ms to minimize.
[2022-06-09 10:37:49] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 1 ms to minimize.
[2022-06-09 10:37:49] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 0 ms to minimize.
[2022-06-09 10:37:49] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2022-06-09 10:37:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2767 ms
[2022-06-09 10:37:49] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 244 ms.
[2022-06-09 10:37:50] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 1 ms to minimize.
[2022-06-09 10:37:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2022-06-09 10:37:51] [INFO ] Added : 7 causal constraints over 3 iterations in 1301 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 69 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:51] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000183 steps, including 2 resets, run finished after 507 ms. (steps per millisecond=1972 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1940 ms. (steps per millisecond=515 ) properties (out of 1) seen :0
[2022-06-09 10:37:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:53] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 10:37:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:37:54] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2022-06-09 10:37:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:37:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 10:37:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:37:54] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2022-06-09 10:37:54] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:37:55] [INFO ] [Nat]Added 283 Read/Feed constraints in 174 ms returned sat
[2022-06-09 10:37:55] [INFO ] Deduced a trap composed of 7 places in 431 ms of which 1 ms to minimize.
[2022-06-09 10:37:56] [INFO ] Deduced a trap composed of 40 places in 401 ms of which 0 ms to minimize.
[2022-06-09 10:37:56] [INFO ] Deduced a trap composed of 55 places in 417 ms of which 1 ms to minimize.
[2022-06-09 10:37:57] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 0 ms to minimize.
[2022-06-09 10:37:57] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 0 ms to minimize.
[2022-06-09 10:37:57] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 0 ms to minimize.
[2022-06-09 10:37:57] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2022-06-09 10:37:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2808 ms
[2022-06-09 10:37:58] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 239 ms.
[2022-06-09 10:37:58] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 0 ms to minimize.
[2022-06-09 10:37:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
[2022-06-09 10:37:59] [INFO ] Added : 7 causal constraints over 3 iterations in 1290 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 54 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 56 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 10:37:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:59] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 10:37:59] [INFO ] Implicit Places using invariants in 434 ms returned []
[2022-06-09 10:37:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:37:59] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 10:38:00] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:38:02] [INFO ] Implicit Places using invariants and state equation in 2122 ms returned []
Implicit Place search using SMT with State Equation took 2557 ms to find 0 implicit places.
[2022-06-09 10:38:02] [INFO ] Redundant transitions in 124 ms returned []
[2022-06-09 10:38:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:38:02] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 10:38:03] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-04 in 17686 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-05
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:38:03] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 10122 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1446 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 10:38:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:38:03] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 10:38:03] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:38:03] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2022-06-09 10:38:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:38:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:38:04] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2022-06-09 10:38:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:38:04] [INFO ] [Nat]Added 283 Read/Feed constraints in 170 ms returned sat
[2022-06-09 10:38:04] [INFO ] Deduced a trap composed of 35 places in 365 ms of which 0 ms to minimize.
[2022-06-09 10:38:05] [INFO ] Deduced a trap composed of 17 places in 354 ms of which 0 ms to minimize.
[2022-06-09 10:38:05] [INFO ] Deduced a trap composed of 52 places in 363 ms of which 1 ms to minimize.
[2022-06-09 10:38:06] [INFO ] Deduced a trap composed of 44 places in 353 ms of which 1 ms to minimize.
[2022-06-09 10:38:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1816 ms
[2022-06-09 10:38:06] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 246 ms.
[2022-06-09 10:38:07] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2022-06-09 10:38:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2022-06-09 10:38:07] [INFO ] Added : 9 causal constraints over 3 iterations in 1183 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 59 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:38:07] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 1000236 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=2128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1819 ms. (steps per millisecond=549 ) properties (out of 1) seen :0
[2022-06-09 10:38:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:38:10] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 10:38:10] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:38:10] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2022-06-09 10:38:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:38:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:38:11] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2022-06-09 10:38:11] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:38:11] [INFO ] [Nat]Added 283 Read/Feed constraints in 171 ms returned sat
[2022-06-09 10:38:11] [INFO ] Deduced a trap composed of 35 places in 362 ms of which 0 ms to minimize.
[2022-06-09 10:38:12] [INFO ] Deduced a trap composed of 17 places in 361 ms of which 1 ms to minimize.
[2022-06-09 10:38:12] [INFO ] Deduced a trap composed of 52 places in 381 ms of which 0 ms to minimize.
[2022-06-09 10:38:13] [INFO ] Deduced a trap composed of 44 places in 355 ms of which 0 ms to minimize.
[2022-06-09 10:38:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1836 ms
[2022-06-09 10:38:13] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 203 ms.
[2022-06-09 10:38:14] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2022-06-09 10:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2022-06-09 10:38:14] [INFO ] Added : 9 causal constraints over 3 iterations in 1145 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 51 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 10:38:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:38:14] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 10:38:15] [INFO ] Implicit Places using invariants in 429 ms returned []
[2022-06-09 10:38:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:38:15] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 10:38:15] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:38:16] [INFO ] Implicit Places using invariants and state equation in 1856 ms returned []
Implicit Place search using SMT with State Equation took 2287 ms to find 0 implicit places.
[2022-06-09 10:38:17] [INFO ] Redundant transitions in 121 ms returned []
[2022-06-09 10:38:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:38:17] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 10:38:18] [INFO ] Dead Transitions using invariants and state equation in 1111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-05 in 15027 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:38:18] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 10105 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1122 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2022-06-09 10:38:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:38:18] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 10:38:18] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 10:38:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:38:18] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2022-06-09 10:38:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:38:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 10:38:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:38:19] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2022-06-09 10:38:19] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:38:19] [INFO ] [Nat]Added 283 Read/Feed constraints in 177 ms returned sat
[2022-06-09 10:38:20] [INFO ] Deduced a trap composed of 64 places in 417 ms of which 1 ms to minimize.
[2022-06-09 10:38:20] [INFO ] Deduced a trap composed of 99 places in 407 ms of which 1 ms to minimize.
[2022-06-09 10:38:21] [INFO ] Deduced a trap composed of 23 places in 385 ms of which 1 ms to minimize.
[2022-06-09 10:38:21] [INFO ] Deduced a trap composed of 57 places in 404 ms of which 1 ms to minimize.
[2022-06-09 10:38:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2063 ms
[2022-06-09 10:38:21] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 214 ms.
[2022-06-09 10:38:22] [INFO ] Added : 3 causal constraints over 1 iterations in 512 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:38:22] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 1000127 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=2062 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1815 ms. (steps per millisecond=550 ) properties (out of 1) seen :0
[2022-06-09 10:38:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:38:24] [INFO ] Computed 8 place invariants in 19 ms
[2022-06-09 10:38:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:38:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:38:25] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2022-06-09 10:38:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:38:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:38:25] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2022-06-09 10:38:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:38:26] [INFO ] [Nat]Added 283 Read/Feed constraints in 171 ms returned sat
[2022-06-09 10:38:26] [INFO ] Deduced a trap composed of 64 places in 397 ms of which 0 ms to minimize.
[2022-06-09 10:38:27] [INFO ] Deduced a trap composed of 99 places in 405 ms of which 0 ms to minimize.
[2022-06-09 10:38:27] [INFO ] Deduced a trap composed of 23 places in 379 ms of which 0 ms to minimize.
[2022-06-09 10:38:27] [INFO ] Deduced a trap composed of 57 places in 368 ms of which 1 ms to minimize.
[2022-06-09 10:38:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1980 ms
[2022-06-09 10:38:28] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 219 ms.
[2022-06-09 10:38:28] [INFO ] Added : 3 causal constraints over 1 iterations in 531 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 59 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 10:38:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:38:28] [INFO ] Computed 8 place invariants in 19 ms
[2022-06-09 10:38:29] [INFO ] Implicit Places using invariants in 429 ms returned []
[2022-06-09 10:38:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:38:29] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 10:38:29] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:38:31] [INFO ] Implicit Places using invariants and state equation in 2091 ms returned []
Implicit Place search using SMT with State Equation took 2522 ms to find 0 implicit places.
[2022-06-09 10:38:31] [INFO ] Redundant transitions in 124 ms returned []
[2022-06-09 10:38:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:38:31] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 10:38:32] [INFO ] Dead Transitions using invariants and state equation in 1152 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-12 in 14447 ms.
[2022-06-09 10:38:33] [INFO ] Flatten gal took : 377 ms
[2022-06-09 10:38:33] [INFO ] Applying decomposition
[2022-06-09 10:38:33] [INFO ] Flatten gal took : 195 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17820594949196389078.txt' '-o' '/tmp/graph17820594949196389078.bin' '-w' '/tmp/graph17820594949196389078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17820594949196389078.bin' '-l' '-1' '-v' '-w' '/tmp/graph17820594949196389078.weights' '-q' '0' '-e' '0.001'
[2022-06-09 10:38:34] [INFO ] Decomposing Gal with order
[2022-06-09 10:38:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:38:34] [INFO ] Removed a total of 424 redundant transitions.
[2022-06-09 10:38:34] [INFO ] Flatten gal took : 454 ms
[2022-06-09 10:38:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 46 ms.
[2022-06-09 10:38:35] [INFO ] Time to serialize gal into /tmp/UpperBounds5329612483089432168.gal : 67 ms
[2022-06-09 10:38:35] [INFO ] Time to serialize properties into /tmp/UpperBounds16856431263179898026.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5329612483089432168.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16856431263179898026.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds16856431263179898026.prop.
Detected timeout of ITS tools.
[2022-06-09 10:59:31] [INFO ] Flatten gal took : 1074 ms
[2022-06-09 10:59:31] [INFO ] Time to serialize gal into /tmp/UpperBounds13782082214496484130.gal : 100 ms
[2022-06-09 10:59:31] [INFO ] Time to serialize properties into /tmp/UpperBounds3553684208660410754.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13782082214496484130.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3553684208660410754.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds3553684208660410754.prop.
Detected timeout of ITS tools.
[2022-06-09 11:20:22] [INFO ] Flatten gal took : 725 ms
[2022-06-09 11:20:27] [INFO ] Input system was already deterministic with 3871 transitions.
[2022-06-09 11:20:27] [INFO ] Transformed 269 places.
[2022-06-09 11:20:27] [INFO ] Transformed 3871 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 11:20:27] [INFO ] Time to serialize gal into /tmp/UpperBounds12575119704932197468.gal : 13 ms
[2022-06-09 11:20:27] [INFO ] Time to serialize properties into /tmp/UpperBounds50458754221835314.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12575119704932197468.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds50458754221835314.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...339
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds50458754221835314.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-q8m256"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BugTracking-PT-q8m256, 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 r312-tall-165472281800125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m256.tgz
mv BugTracking-PT-q8m256 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 ;