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-165472292500001.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-q3m002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292500001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K Jun 7 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Jun 7 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Jun 6 15:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 8.6K Jun 7 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 7 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Jun 7 17:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Jun 7 17:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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-q3m002-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654726497457

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): 725 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 893 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 514 places in 198 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m002-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-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:02] [INFO ] Computed 10 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 193 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 7) seen :2
FORMULA BugTracking-PT-q3m002-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
[2022-06-08 22:15:02] [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 18 ms
[2022-06-08 22:15:03] [INFO ] [Real]Absence check using 10 positive place invariants in 43 ms returned sat
[2022-06-08 22:15:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:04] [INFO ] [Real]Absence check using state equation in 1335 ms returned sat
[2022-06-08 22:15:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:04] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2022-06-08 22:15:05] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-08 22:15:05] [INFO ] [Nat]Added 268 Read/Feed constraints in 136 ms returned sat
[2022-06-08 22:15:05] [INFO ] Deduced a trap composed of 19 places in 346 ms of which 4 ms to minimize.
[2022-06-08 22:15:05] [INFO ] Deduced a trap composed of 93 places in 344 ms of which 1 ms to minimize.
[2022-06-08 22:15:06] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 2 ms to minimize.
[2022-06-08 22:15:06] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 2 ms to minimize.
[2022-06-08 22:15:06] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 0 ms to minimize.
[2022-06-08 22:15:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1680 ms
[2022-06-08 22:15:07] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 224 ms.
[2022-06-08 22:15:08] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 1 ms to minimize.
[2022-06-08 22:15:09] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 1 ms to minimize.
[2022-06-08 22:15:09] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 1 ms to minimize.
[2022-06-08 22:15:09] [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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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)
[2022-06-08 22:15:09] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-08 22:15:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:09] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2022-06-08 22:15:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:10] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2022-06-08 22:15:10] [INFO ] [Nat]Added 268 Read/Feed constraints in 146 ms returned sat
[2022-06-08 22:15:10] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 0 ms to minimize.
[2022-06-08 22:15:11] [INFO ] Deduced a trap composed of 36 places in 337 ms of which 2 ms to minimize.
[2022-06-08 22:15:11] [INFO ] Deduced a trap composed of 52 places in 348 ms of which 0 ms to minimize.
[2022-06-08 22:15:12] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 1 ms to minimize.
[2022-06-08 22:15:12] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 0 ms to minimize.
[2022-06-08 22:15:12] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 1 ms to minimize.
[2022-06-08 22:15:12] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 0 ms to minimize.
[2022-06-08 22:15:13] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 0 ms to minimize.
[2022-06-08 22:15:13] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 0 ms to minimize.
[2022-06-08 22:15:13] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 0 ms to minimize.
[2022-06-08 22:15:13] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 1 ms to minimize.
[2022-06-08 22:15:13] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 0 ms to minimize.
[2022-06-08 22:15:14] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 1 ms to minimize.
[2022-06-08 22:15:14] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3760 ms
[2022-06-08 22:15:14] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 139 ms.
[2022-06-08 22:15:15] [INFO ] Added : 30 causal constraints over 6 iterations in 757 ms. Result :unknown
[2022-06-08 22:15:15] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:15] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2022-06-08 22:15:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:15] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2022-06-08 22:15:15] [INFO ] [Nat]Added 268 Read/Feed constraints in 131 ms returned sat
[2022-06-08 22:15:16] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 1 ms to minimize.
[2022-06-08 22:15:16] [INFO ] Deduced a trap composed of 68 places in 245 ms of which 0 ms to minimize.
[2022-06-08 22:15:16] [INFO ] Deduced a trap composed of 56 places in 239 ms of which 0 ms to minimize.
[2022-06-08 22:15:17] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2022-06-08 22:15:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1164 ms
[2022-06-08 22:15:17] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 186 ms.
[2022-06-08 22:15:19] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 0 ms to minimize.
[2022-06-08 22:15:19] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 1 ms to minimize.
[2022-06-08 22:15:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 689 ms
[2022-06-08 22:15:20] [INFO ] Added : 86 causal constraints over 18 iterations in 2981 ms. Result :sat
Minimization took 369 ms.
[2022-06-08 22:15:20] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:20] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2022-06-08 22:15:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:21] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2022-06-08 22:15:21] [INFO ] [Nat]Added 268 Read/Feed constraints in 136 ms returned sat
[2022-06-08 22:15:21] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 0 ms to minimize.
[2022-06-08 22:15:21] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 0 ms to minimize.
[2022-06-08 22:15:22] [INFO ] Deduced a trap composed of 75 places in 189 ms of which 0 ms to minimize.
[2022-06-08 22:15:22] [INFO ] Deduced a trap composed of 74 places in 197 ms of which 0 ms to minimize.
[2022-06-08 22:15:22] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 0 ms to minimize.
[2022-06-08 22:15:22] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 0 ms to minimize.
[2022-06-08 22:15:23] [INFO ] Deduced a trap composed of 74 places in 184 ms of which 1 ms to minimize.
[2022-06-08 22:15:23] [INFO ] Deduced a trap composed of 70 places in 204 ms of which 4 ms to minimize.
[2022-06-08 22:15:23] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 1 ms to minimize.
[2022-06-08 22:15:23] [INFO ] Deduced a trap composed of 76 places in 195 ms of which 0 ms to minimize.
[2022-06-08 22:15:24] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 0 ms to minimize.
[2022-06-08 22:15:24] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 0 ms to minimize.
[2022-06-08 22:15:24] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 1 ms to minimize.
[2022-06-08 22:15:24] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 1 ms to minimize.
[2022-06-08 22:15:25] [INFO ] Deduced a trap composed of 72 places in 187 ms of which 1 ms to minimize.
[2022-06-08 22:15:25] [INFO ] Deduced a trap composed of 72 places in 192 ms of which 1 ms to minimize.
[2022-06-08 22:15:25] [INFO ] Deduced a trap composed of 58 places in 188 ms of which 0 ms to minimize.
[2022-06-08 22:15:26] [INFO ] Deduced a trap composed of 52 places in 209 ms of which 0 ms to minimize.
[2022-06-08 22:15:26] [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: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)
[2022-06-08 22:15:26] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:26] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2022-06-08 22:15:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:26] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2022-06-08 22:15:27] [INFO ] [Nat]Added 268 Read/Feed constraints in 140 ms returned sat
[2022-06-08 22:15:27] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 0 ms to minimize.
[2022-06-08 22:15:27] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 1 ms to minimize.
[2022-06-08 22:15:27] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 1 ms to minimize.
[2022-06-08 22:15:28] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 0 ms to minimize.
[2022-06-08 22:15:28] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 1 ms to minimize.
[2022-06-08 22:15:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1308 ms
[2022-06-08 22:15:28] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 138 ms.
[2022-06-08 22:15:30] [INFO ] Deduced a trap composed of 57 places in 277 ms of which 1 ms to minimize.
[2022-06-08 22:15:31] [INFO ] Deduced a trap composed of 20 places in 279 ms of which 1 ms to minimize.
[2022-06-08 22:15:31] [INFO ] Deduced a trap composed of 58 places in 275 ms of which 0 ms to minimize.
[2022-06-08 22:15:31] [INFO ] Deduced a trap composed of 58 places in 307 ms of which 1 ms to minimize.
[2022-06-08 22:15:31] [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 4
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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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)
[2022-06-08 22:15:31] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:32] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2022-06-08 22:15:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:32] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2022-06-08 22:15:32] [INFO ] [Nat]Added 268 Read/Feed constraints in 126 ms returned sat
[2022-06-08 22:15:33] [INFO ] Deduced a trap composed of 90 places in 289 ms of which 1 ms to minimize.
[2022-06-08 22:15:33] [INFO ] Deduced a trap composed of 82 places in 291 ms of which 0 ms to minimize.
[2022-06-08 22:15:33] [INFO ] Deduced a trap composed of 17 places in 278 ms of which 2 ms to minimize.
[2022-06-08 22:15:34] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 0 ms to minimize.
[2022-06-08 22:15:34] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2022-06-08 22:15:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1537 ms
[2022-06-08 22:15:34] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 136 ms.
[2022-06-08 22:15:37] [INFO ] Deduced a trap composed of 55 places in 266 ms of which 0 ms to minimize.
[2022-06-08 22:15:37] [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 5
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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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, 1, 1, -1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 1441300 steps, including 48156 resets, run finished after 9227 ms. (steps per millisecond=156 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 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.13 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 246 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:46] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 8 resets, run finished after 7882 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 2232 ms. (steps per millisecond=448 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 2263 ms. (steps per millisecond=441 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 2268 ms. (steps per millisecond=440 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6 resets, run finished after 2450 ms. (steps per millisecond=408 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6 resets, run finished after 2372 ms. (steps per millisecond=421 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9 resets, run finished after 2249 ms. (steps per millisecond=444 ) properties (out of 6) seen :0
[2022-06-08 22:16:08] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:08] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-08 22:16:08] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-08 22:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:09] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2022-06-08 22:16:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:16:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:09] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2022-06-08 22:16:09] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:16:09] [INFO ] [Nat]Added 254 Read/Feed constraints in 131 ms returned sat
[2022-06-08 22:16:09] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 0 ms to minimize.
[2022-06-08 22:16:10] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 0 ms to minimize.
[2022-06-08 22:16:10] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2022-06-08 22:16:10] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2022-06-08 22:16:10] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 0 ms to minimize.
[2022-06-08 22:16:10] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 2 ms to minimize.
[2022-06-08 22:16:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1397 ms
[2022-06-08 22:16:11] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 171 ms.
[2022-06-08 22:16:13] [INFO ] Added : 86 causal constraints over 18 iterations in 2156 ms. Result :sat
Minimization took 375 ms.
[2022-06-08 22:16:13] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-08 22:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:13] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2022-06-08 22:16:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:16:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-08 22:16:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:14] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2022-06-08 22:16:14] [INFO ] [Nat]Added 254 Read/Feed constraints in 125 ms returned sat
[2022-06-08 22:16:14] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 0 ms to minimize.
[2022-06-08 22:16:15] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 4 ms to minimize.
[2022-06-08 22:16:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 609 ms
[2022-06-08 22:16:15] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 160 ms.
[2022-06-08 22:16:16] [INFO ] Deduced a trap composed of 57 places in 158 ms of which 0 ms to minimize.
[2022-06-08 22:16:17] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 0 ms to minimize.
[2022-06-08 22:16:17] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 1 ms to minimize.
[2022-06-08 22:16:17] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 0 ms to minimize.
[2022-06-08 22:16:17] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 0 ms to minimize.
[2022-06-08 22:16:18] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 1 ms to minimize.
[2022-06-08 22:16:18] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 0 ms to minimize.
[2022-06-08 22:16:18] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 0 ms to minimize.
[2022-06-08 22:16:18] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 0 ms to minimize.
[2022-06-08 22:16:19] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 0 ms to minimize.
[2022-06-08 22:16:19] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 1 ms to minimize.
[2022-06-08 22:16:19] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 3 ms to minimize.
[2022-06-08 22:16:19] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 1 ms to minimize.
[2022-06-08 22:16:20] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 0 ms to minimize.
[2022-06-08 22:16:20] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 0 ms to minimize.
[2022-06-08 22:16:20] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 1 ms to minimize.
[2022-06-08 22:16:21] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 0 ms to minimize.
[2022-06-08 22:16:21] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 0 ms to minimize.
[2022-06-08 22:16:21] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 0 ms to minimize.
[2022-06-08 22:16:21] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 1 ms to minimize.
[2022-06-08 22:16:21] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5156 ms
[2022-06-08 22:16:22] [INFO ] Added : 66 causal constraints over 15 iterations in 7104 ms. Result :sat
Minimization took 413 ms.
[2022-06-08 22:16:22] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 22:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:23] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2022-06-08 22:16:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:16:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:23] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2022-06-08 22:16:23] [INFO ] [Nat]Added 254 Read/Feed constraints in 140 ms returned sat
[2022-06-08 22:16:23] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 0 ms to minimize.
[2022-06-08 22:16:23] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 0 ms to minimize.
[2022-06-08 22:16:24] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2022-06-08 22:16:24] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2022-06-08 22:16:24] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 0 ms to minimize.
[2022-06-08 22:16:24] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 4 ms to minimize.
[2022-06-08 22:16:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1281 ms
[2022-06-08 22:16:24] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 135 ms.
[2022-06-08 22:16:26] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 0 ms to minimize.
[2022-06-08 22:16:27] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 0 ms to minimize.
[2022-06-08 22:16:27] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2022-06-08 22:16:27] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 1 ms to minimize.
[2022-06-08 22:16:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1086 ms
[2022-06-08 22:16:27] [INFO ] Added : 70 causal constraints over 14 iterations in 2861 ms. Result :sat
Minimization took 370 ms.
[2022-06-08 22:16:28] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 22:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:28] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2022-06-08 22:16:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:16:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:16:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:28] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2022-06-08 22:16:28] [INFO ] [Nat]Added 254 Read/Feed constraints in 126 ms returned sat
[2022-06-08 22:16:29] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 0 ms to minimize.
[2022-06-08 22:16:29] [INFO ] Deduced a trap composed of 77 places in 189 ms of which 1 ms to minimize.
[2022-06-08 22:16:29] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2022-06-08 22:16:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 745 ms
[2022-06-08 22:16:29] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 135 ms.
[2022-06-08 22:16:32] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 0 ms to minimize.
[2022-06-08 22:16:32] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 1 ms to minimize.
[2022-06-08 22:16:32] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 0 ms to minimize.
[2022-06-08 22:16:32] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 0 ms to minimize.
[2022-06-08 22:16:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1096 ms
[2022-06-08 22:16:33] [INFO ] Added : 99 causal constraints over 21 iterations in 3707 ms. Result :sat
Minimization took 307 ms.
[2022-06-08 22:16:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:16:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:34] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2022-06-08 22:16:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:16:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:16:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:34] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2022-06-08 22:16:34] [INFO ] [Nat]Added 254 Read/Feed constraints in 121 ms returned sat
[2022-06-08 22:16:34] [INFO ] Deduced a trap composed of 80 places in 193 ms of which 1 ms to minimize.
[2022-06-08 22:16:35] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 0 ms to minimize.
[2022-06-08 22:16:35] [INFO ] Deduced a trap composed of 72 places in 226 ms of which 0 ms to minimize.
[2022-06-08 22:16:35] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 0 ms to minimize.
[2022-06-08 22:16:35] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 0 ms to minimize.
[2022-06-08 22:16:36] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 0 ms to minimize.
[2022-06-08 22:16:36] [INFO ] Deduced a trap composed of 76 places in 198 ms of which 1 ms to minimize.
[2022-06-08 22:16:36] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 0 ms to minimize.
[2022-06-08 22:16:36] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 0 ms to minimize.
[2022-06-08 22:16:37] [INFO ] Deduced a trap composed of 72 places in 203 ms of which 1 ms to minimize.
[2022-06-08 22:16:37] [INFO ] Deduced a trap composed of 72 places in 218 ms of which 1 ms to minimize.
[2022-06-08 22:16:37] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 1 ms to minimize.
[2022-06-08 22:16:37] [INFO ] Deduced a trap composed of 70 places in 196 ms of which 0 ms to minimize.
[2022-06-08 22:16:38] [INFO ] Deduced a trap composed of 82 places in 201 ms of which 1 ms to minimize.
[2022-06-08 22:16:38] [INFO ] Deduced a trap composed of 84 places in 201 ms of which 1 ms to minimize.
[2022-06-08 22:16:38] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 0 ms to minimize.
[2022-06-08 22:16:39] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 1 ms to minimize.
[2022-06-08 22:16:39] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 0 ms to minimize.
[2022-06-08 22:16:39] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 0 ms to minimize.
[2022-06-08 22:16:39] [INFO ] Deduced a trap composed of 48 places in 186 ms of which 0 ms to minimize.
[2022-06-08 22:16:40] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 0 ms to minimize.
[2022-06-08 22:16:40] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 0 ms to minimize.
[2022-06-08 22:16:40] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 0 ms to minimize.
[2022-06-08 22:16:40] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 1 ms to minimize.
[2022-06-08 22:16:40] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 1 ms to minimize.
[2022-06-08 22:16:41] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 1 ms to minimize.
[2022-06-08 22:16:41] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 0 ms to minimize.
[2022-06-08 22:16:41] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 0 ms to minimize.
[2022-06-08 22:16:41] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 0 ms to minimize.
[2022-06-08 22:16:42] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 0 ms to minimize.
[2022-06-08 22:16:42] [INFO ] Deduced a trap composed of 53 places in 141 ms of which 1 ms to minimize.
[2022-06-08 22:16:42] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 0 ms to minimize.
[2022-06-08 22:16:42] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 0 ms to minimize.
[2022-06-08 22:16:42] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 0 ms to minimize.
[2022-06-08 22:16:43] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 0 ms to minimize.
[2022-06-08 22:16:43] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2022-06-08 22:16:43] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 0 ms to minimize.
[2022-06-08 22:16:43] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 0 ms to minimize.
[2022-06-08 22:16:43] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 0 ms to minimize.
[2022-06-08 22:16:43] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2022-06-08 22:16:43] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 9379 ms
[2022-06-08 22:16:44] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 138 ms.
[2022-06-08 22:16:45] [INFO ] Added : 72 causal constraints over 15 iterations in 1726 ms. Result :sat
Minimization took 460 ms.
[2022-06-08 22:16:46] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:16:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:46] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2022-06-08 22:16:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:16:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:16:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:46] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2022-06-08 22:16:47] [INFO ] [Nat]Added 254 Read/Feed constraints in 127 ms returned sat
[2022-06-08 22:16:47] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 0 ms to minimize.
[2022-06-08 22:16:47] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2022-06-08 22:16:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 531 ms
[2022-06-08 22:16:47] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 140 ms.
[2022-06-08 22:16:49] [INFO ] Added : 96 causal constraints over 20 iterations in 2312 ms. Result :sat
Minimization took 361 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, -1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 1090200 steps, including 1000 resets, run finished after 9466 ms. (steps per millisecond=115 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 655500 steps, including 1001 resets, run finished after 5437 ms. (steps per millisecond=120 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 534300 steps, including 1002 resets, run finished after 4412 ms. (steps per millisecond=121 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 624700 steps, including 1001 resets, run finished after 5415 ms. (steps per millisecond=115 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 630400 steps, including 1002 resets, run finished after 5176 ms. (steps per millisecond=121 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 748400 steps, including 1002 resets, run finished after 6135 ms. (steps per millisecond=121 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 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 42 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 47 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 22:17:26] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:26] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-08 22:17:26] [INFO ] Implicit Places using invariants in 331 ms returned []
[2022-06-08 22:17:26] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:26] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-08 22:17:27] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:17:30] [INFO ] Implicit Places using invariants and state equation in 3969 ms returned []
Implicit Place search using SMT with State Equation took 4303 ms to find 0 implicit places.
[2022-06-08 22:17:31] [INFO ] Redundant transitions in 225 ms returned []
[2022-06-08 22:17:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:31] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-08 22:17:31] [INFO ] Dead Transitions using invariants and state equation in 771 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m002-UpperBounds-00
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:31] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 8 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2022-06-08 22:17:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:31] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 22:17:32] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-06-08 22:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:32] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2022-06-08 22:17:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:17:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:32] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2022-06-08 22:17:32] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:17:32] [INFO ] [Nat]Added 254 Read/Feed constraints in 122 ms returned sat
[2022-06-08 22:17:33] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 0 ms to minimize.
[2022-06-08 22:17:33] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 1 ms to minimize.
[2022-06-08 22:17:33] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 0 ms to minimize.
[2022-06-08 22:17:33] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 0 ms to minimize.
[2022-06-08 22:17:34] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 0 ms to minimize.
[2022-06-08 22:17:34] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 0 ms to minimize.
[2022-06-08 22:17:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1515 ms
[2022-06-08 22:17:34] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 184 ms.
[2022-06-08 22:17:36] [INFO ] Added : 86 causal constraints over 18 iterations in 2243 ms. Result :sat
Minimization took 374 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 748400 steps, including 1001 resets, run finished after 6448 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:43] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 12 resets, run finished after 7701 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4 resets, run finished after 2389 ms. (steps per millisecond=418 ) properties (out of 1) seen :0
[2022-06-08 22:17:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:53] [INFO ] Computed 8 place invariants in 22 ms
[2022-06-08 22:17:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:54] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2022-06-08 22:17:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:17:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:17:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:54] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2022-06-08 22:17:54] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:17:54] [INFO ] [Nat]Added 254 Read/Feed constraints in 130 ms returned sat
[2022-06-08 22:17:54] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 0 ms to minimize.
[2022-06-08 22:17:55] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 0 ms to minimize.
[2022-06-08 22:17:55] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 0 ms to minimize.
[2022-06-08 22:17:55] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 1 ms to minimize.
[2022-06-08 22:17:55] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2022-06-08 22:17:55] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 0 ms to minimize.
[2022-06-08 22:17:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1439 ms
[2022-06-08 22:17:56] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 142 ms.
[2022-06-08 22:17:58] [INFO ] Added : 86 causal constraints over 18 iterations in 2123 ms. Result :sat
Minimization took 374 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 748400 steps, including 1000 resets, run finished after 6544 ms. (steps per millisecond=114 ) 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 34 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:05] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:05] [INFO ] Computed 8 place invariants in 19 ms
[2022-06-08 22:18:05] [INFO ] Implicit Places using invariants in 311 ms returned []
[2022-06-08 22:18:05] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:05] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-08 22:18:05] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:18:10] [INFO ] Implicit Places using invariants and state equation in 4706 ms returned []
Implicit Place search using SMT with State Equation took 5033 ms to find 0 implicit places.
[2022-06-08 22:18:10] [INFO ] Redundant transitions in 179 ms returned []
[2022-06-08 22:18:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:10] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 22:18:11] [INFO ] Dead Transitions using invariants and state equation in 706 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m002-UpperBounds-00 in 39329 ms.
Starting property specific reduction for BugTracking-PT-q3m002-UpperBounds-04
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:11] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 10000 steps, including 4 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 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2022-06-08 22:18:11] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:11] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 22:18:11] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 22:18:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:18:11] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2022-06-08 22:18:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:18:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:18:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:18:12] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2022-06-08 22:18:12] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:18:12] [INFO ] [Nat]Added 254 Read/Feed constraints in 130 ms returned sat
[2022-06-08 22:18:12] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 0 ms to minimize.
[2022-06-08 22:18:12] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 0 ms to minimize.
[2022-06-08 22:18:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 620 ms
[2022-06-08 22:18:12] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 153 ms.
[2022-06-08 22:18:14] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 1 ms to minimize.
[2022-06-08 22:18:15] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 0 ms to minimize.
[2022-06-08 22:18:15] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 0 ms to minimize.
[2022-06-08 22:18:15] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 1 ms to minimize.
[2022-06-08 22:18:15] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 0 ms to minimize.
[2022-06-08 22:18:16] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 1 ms to minimize.
[2022-06-08 22:18:16] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 0 ms to minimize.
[2022-06-08 22:18:16] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 1 ms to minimize.
[2022-06-08 22:18:16] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 1 ms to minimize.
[2022-06-08 22:18:16] [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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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:446)
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 :[0]
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 34 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:18:16] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 7 resets, run finished after 7900 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 2253 ms. (steps per millisecond=443 ) properties (out of 1) seen :0
[2022-06-08 22:18:27] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:27] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 22:18:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:18:27] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2022-06-08 22:18:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:18:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 22:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:18:27] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2022-06-08 22:18:27] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:18:27] [INFO ] [Nat]Added 254 Read/Feed constraints in 113 ms returned sat
[2022-06-08 22:18:28] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 0 ms to minimize.
[2022-06-08 22:18:28] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 1 ms to minimize.
[2022-06-08 22:18:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 586 ms
[2022-06-08 22:18:28] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 138 ms.
[2022-06-08 22:18:30] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 1 ms to minimize.
[2022-06-08 22:18:30] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 0 ms to minimize.
[2022-06-08 22:18:30] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 1 ms to minimize.
[2022-06-08 22:18:31] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2022-06-08 22:18:31] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 0 ms to minimize.
[2022-06-08 22:18:31] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 0 ms to minimize.
[2022-06-08 22:18:31] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 0 ms to minimize.
[2022-06-08 22:18:32] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 0 ms to minimize.
[2022-06-08 22:18:32] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 0 ms to minimize.
[2022-06-08 22:18:32] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 1 ms to minimize.
[2022-06-08 22:18:32] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 0 ms to minimize.
[2022-06-08 22:18:33] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 0 ms to minimize.
[2022-06-08 22:18:33] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 1 ms to minimize.
[2022-06-08 22:18:33] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 0 ms to minimize.
[2022-06-08 22:18:33] [INFO ] Deduced a trap composed of 59 places in 172 ms of which 0 ms to minimize.
[2022-06-08 22:18:34] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 0 ms to minimize.
[2022-06-08 22:18:34] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 0 ms to minimize.
[2022-06-08 22:18:34] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 0 ms to minimize.
[2022-06-08 22:18:35] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 0 ms to minimize.
[2022-06-08 22:18:35] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 0 ms to minimize.
[2022-06-08 22:18:35] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5231 ms
[2022-06-08 22:18:35] [INFO ] Added : 66 causal constraints over 15 iterations in 7149 ms. Result :sat
Minimization took 408 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 630400 steps, including 1000 resets, run finished after 5390 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 44 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:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:41] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-08 22:18:41] [INFO ] Implicit Places using invariants in 286 ms returned []
[2022-06-08 22:18:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:41] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 22:18:42] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:18:46] [INFO ] Implicit Places using invariants and state equation in 4848 ms returned []
Implicit Place search using SMT with State Equation took 5136 ms to find 0 implicit places.
[2022-06-08 22:18:46] [INFO ] Redundant transitions in 67 ms returned []
[2022-06-08 22:18:46] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:46] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-08 22:18:47] [INFO ] Dead Transitions using invariants and state equation in 754 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m002-UpperBounds-04 in 36456 ms.
Starting property specific reduction for BugTracking-PT-q3m002-UpperBounds-07
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:47] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
[2022-06-08 22:18:47] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:47] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-08 22:18:47] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:18:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:18:48] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2022-06-08 22:18:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:18:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:18:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:18:48] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2022-06-08 22:18:48] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:18:48] [INFO ] [Nat]Added 254 Read/Feed constraints in 132 ms returned sat
[2022-06-08 22:18:48] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 0 ms to minimize.
[2022-06-08 22:18:49] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 0 ms to minimize.
[2022-06-08 22:18:49] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2022-06-08 22:18:49] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2022-06-08 22:18:49] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2022-06-08 22:18:49] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
[2022-06-08 22:18:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1340 ms
[2022-06-08 22:18:50] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 162 ms.
[2022-06-08 22:18:52] [INFO ] Deduced a trap composed of 25 places in 299 ms of which 1 ms to minimize.
[2022-06-08 22:18:52] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 0 ms to minimize.
[2022-06-08 22:18:52] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 0 ms to minimize.
[2022-06-08 22:18:52] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 0 ms to minimize.
[2022-06-08 22:18:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1219 ms
[2022-06-08 22:18:53] [INFO ] Added : 70 causal constraints over 14 iterations in 3077 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
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 44 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:18:53] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 7468 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14 resets, run finished after 2282 ms. (steps per millisecond=438 ) properties (out of 1) seen :0
[2022-06-08 22:19:03] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:19:03] [INFO ] Computed 8 place invariants in 24 ms
[2022-06-08 22:19:03] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:19:03] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2022-06-08 22:19:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:19:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:19:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:19:03] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2022-06-08 22:19:03] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:19:03] [INFO ] [Nat]Added 254 Read/Feed constraints in 132 ms returned sat
[2022-06-08 22:19:04] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 0 ms to minimize.
[2022-06-08 22:19:04] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 0 ms to minimize.
[2022-06-08 22:19:04] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2022-06-08 22:19:04] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2022-06-08 22:19:04] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2022-06-08 22:19:05] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2022-06-08 22:19:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1252 ms
[2022-06-08 22:19:05] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 172 ms.
[2022-06-08 22:19:07] [INFO ] Deduced a trap composed of 25 places in 294 ms of which 1 ms to minimize.
[2022-06-08 22:19:07] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 0 ms to minimize.
[2022-06-08 22:19:07] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 0 ms to minimize.
[2022-06-08 22:19:08] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 1 ms to minimize.
[2022-06-08 22:19:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1310 ms
[2022-06-08 22:19:08] [INFO ] Added : 70 causal constraints over 14 iterations in 3186 ms. Result :sat
Minimization took 393 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 624700 steps, including 1000 resets, run finished after 5263 ms. (steps per millisecond=118 ) 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 36 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 32 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 22:19:14] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:19:14] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 22:19:14] [INFO ] Implicit Places using invariants in 277 ms returned []
[2022-06-08 22:19:14] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:19:14] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 22:19:14] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:19:18] [INFO ] Implicit Places using invariants and state equation in 4399 ms returned []
Implicit Place search using SMT with State Equation took 4679 ms to find 0 implicit places.
[2022-06-08 22:19:18] [INFO ] Redundant transitions in 61 ms returned []
[2022-06-08 22:19:18] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:19:18] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 22:19:19] [INFO ] Dead Transitions using invariants and state equation in 773 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m002-UpperBounds-07 in 32096 ms.
Starting property specific reduction for BugTracking-PT-q3m002-UpperBounds-08
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:19:19] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
[2022-06-08 22:19:19] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:19:19] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-08 22:19:19] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-08 22:19:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:19:20] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2022-06-08 22:19:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:19:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:19:20] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2022-06-08 22:19:20] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:19:20] [INFO ] [Nat]Added 254 Read/Feed constraints in 135 ms returned sat
[2022-06-08 22:19:21] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 0 ms to minimize.
[2022-06-08 22:19:21] [INFO ] Deduced a trap composed of 77 places in 211 ms of which 1 ms to minimize.
[2022-06-08 22:19:21] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2022-06-08 22:19:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 804 ms
[2022-06-08 22:19:21] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 142 ms.
[2022-06-08 22:19:24] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 0 ms to minimize.
[2022-06-08 22:19:24] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 0 ms to minimize.
[2022-06-08 22:19:24] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 1 ms to minimize.
[2022-06-08 22:19:24] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 0 ms to minimize.
[2022-06-08 22:19:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1187 ms
[2022-06-08 22:19:25] [INFO ] Deduced a trap composed of 9 places in 404 ms of which 0 ms to minimize.
[2022-06-08 22:19:25] [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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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:446)
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 :[0]
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 37 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:19:25] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 6 resets, run finished after 8194 ms. (steps per millisecond=122 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2630 ms. (steps per millisecond=380 ) properties (out of 1) seen :0
[2022-06-08 22:19:36] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:19:36] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 22:19:36] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:19:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:19:37] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2022-06-08 22:19:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:19:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:19:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:19:37] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2022-06-08 22:19:37] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:19:37] [INFO ] [Nat]Added 254 Read/Feed constraints in 146 ms returned sat
[2022-06-08 22:19:37] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 0 ms to minimize.
[2022-06-08 22:19:38] [INFO ] Deduced a trap composed of 77 places in 212 ms of which 0 ms to minimize.
[2022-06-08 22:19:38] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2022-06-08 22:19:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 808 ms
[2022-06-08 22:19:38] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 179 ms.
[2022-06-08 22:19:41] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 0 ms to minimize.
[2022-06-08 22:19:41] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 1 ms to minimize.
[2022-06-08 22:19:41] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 0 ms to minimize.
[2022-06-08 22:19:41] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 1 ms to minimize.
[2022-06-08 22:19:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1128 ms
[2022-06-08 22:19:42] [INFO ] Added : 99 causal constraints over 21 iterations in 3889 ms. Result :sat
Minimization took 327 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 534300 steps, including 1002 resets, run finished after 4530 ms. (steps per millisecond=117 ) 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 33 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 33 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 22:19:47] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:19:47] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-08 22:19:47] [INFO ] Implicit Places using invariants in 294 ms returned []
[2022-06-08 22:19:47] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:19:47] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 22:19:47] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:19:52] [INFO ] Implicit Places using invariants and state equation in 4929 ms returned []
Implicit Place search using SMT with State Equation took 5224 ms to find 0 implicit places.
[2022-06-08 22:19:52] [INFO ] Redundant transitions in 66 ms returned []
[2022-06-08 22:19:52] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:19:52] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 22:19:53] [INFO ] Dead Transitions using invariants and state equation in 764 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m002-UpperBounds-08 in 33636 ms.
Starting property specific reduction for BugTracking-PT-q3m002-UpperBounds-12
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:19:53] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 6 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2022-06-08 22:19:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:19:53] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-08 22:19:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:19:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:19:53] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2022-06-08 22:19:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:19:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:19:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:19:54] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2022-06-08 22:19:54] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:19:54] [INFO ] [Nat]Added 254 Read/Feed constraints in 134 ms returned sat
[2022-06-08 22:19:54] [INFO ] Deduced a trap composed of 80 places in 216 ms of which 0 ms to minimize.
[2022-06-08 22:19:54] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2022-06-08 22:19:55] [INFO ] Deduced a trap composed of 72 places in 227 ms of which 1 ms to minimize.
[2022-06-08 22:19:55] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 0 ms to minimize.
[2022-06-08 22:19:55] [INFO ] Deduced a trap composed of 72 places in 213 ms of which 3 ms to minimize.
[2022-06-08 22:19:56] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 0 ms to minimize.
[2022-06-08 22:19:56] [INFO ] Deduced a trap composed of 76 places in 213 ms of which 0 ms to minimize.
[2022-06-08 22:19:56] [INFO ] Deduced a trap composed of 51 places in 208 ms of which 1 ms to minimize.
[2022-06-08 22:19:56] [INFO ] Deduced a trap composed of 51 places in 249 ms of which 0 ms to minimize.
[2022-06-08 22:19:57] [INFO ] Deduced a trap composed of 72 places in 223 ms of which 1 ms to minimize.
[2022-06-08 22:19:57] [INFO ] Deduced a trap composed of 72 places in 215 ms of which 0 ms to minimize.
[2022-06-08 22:19:57] [INFO ] Deduced a trap composed of 76 places in 218 ms of which 0 ms to minimize.
[2022-06-08 22:19:58] [INFO ] Deduced a trap composed of 70 places in 216 ms of which 0 ms to minimize.
[2022-06-08 22:19:58] [INFO ] Deduced a trap composed of 82 places in 212 ms of which 0 ms to minimize.
[2022-06-08 22:19:58] [INFO ] Deduced a trap composed of 84 places in 212 ms of which 1 ms to minimize.
[2022-06-08 22:19:58] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 0 ms to minimize.
[2022-06-08 22:19:59] [INFO ] Deduced a trap composed of 9 places in 385 ms of which 0 ms to minimize.
[2022-06-08 22:19:59] [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:446)
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 :[0]
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 36 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:19:59] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 7987 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 2595 ms. (steps per millisecond=385 ) properties (out of 1) seen :0
[2022-06-08 22:20:09] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:20:09] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-08 22:20:10] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:20:10] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2022-06-08 22:20:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:20:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:20:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:20:10] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2022-06-08 22:20:10] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:20:10] [INFO ] [Nat]Added 254 Read/Feed constraints in 138 ms returned sat
[2022-06-08 22:20:11] [INFO ] Deduced a trap composed of 80 places in 209 ms of which 0 ms to minimize.
[2022-06-08 22:20:11] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2022-06-08 22:20:11] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 0 ms to minimize.
[2022-06-08 22:20:11] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 1 ms to minimize.
[2022-06-08 22:20:12] [INFO ] Deduced a trap composed of 72 places in 211 ms of which 1 ms to minimize.
[2022-06-08 22:20:12] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 1 ms to minimize.
[2022-06-08 22:20:12] [INFO ] Deduced a trap composed of 76 places in 208 ms of which 0 ms to minimize.
[2022-06-08 22:20:13] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 0 ms to minimize.
[2022-06-08 22:20:13] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 0 ms to minimize.
[2022-06-08 22:20:13] [INFO ] Deduced a trap composed of 72 places in 235 ms of which 0 ms to minimize.
[2022-06-08 22:20:13] [INFO ] Deduced a trap composed of 72 places in 224 ms of which 0 ms to minimize.
[2022-06-08 22:20:14] [INFO ] Deduced a trap composed of 76 places in 228 ms of which 1 ms to minimize.
[2022-06-08 22:20:14] [INFO ] Deduced a trap composed of 70 places in 230 ms of which 0 ms to minimize.
[2022-06-08 22:20:14] [INFO ] Deduced a trap composed of 82 places in 237 ms of which 1 ms to minimize.
[2022-06-08 22:20:15] [INFO ] Deduced a trap composed of 84 places in 220 ms of which 1 ms to minimize.
[2022-06-08 22:20:15] [INFO ] Deduced a trap composed of 47 places in 224 ms of which 1 ms to minimize.
[2022-06-08 22:20:15] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 0 ms to minimize.
[2022-06-08 22:20:15] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 0 ms to minimize.
[2022-06-08 22:20:16] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 0 ms to minimize.
[2022-06-08 22:20:16] [INFO ] Deduced a trap composed of 48 places in 204 ms of which 0 ms to minimize.
[2022-06-08 22:20:16] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 1 ms to minimize.
[2022-06-08 22:20:17] [INFO ] Deduced a trap composed of 51 places in 191 ms of which 1 ms to minimize.
[2022-06-08 22:20:17] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2022-06-08 22:20:17] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 0 ms to minimize.
[2022-06-08 22:20:17] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 0 ms to minimize.
[2022-06-08 22:20:18] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 0 ms to minimize.
[2022-06-08 22:20:18] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 0 ms to minimize.
[2022-06-08 22:20:18] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 0 ms to minimize.
[2022-06-08 22:20:18] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 1 ms to minimize.
[2022-06-08 22:20:19] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 1 ms to minimize.
[2022-06-08 22:20:19] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 0 ms to minimize.
[2022-06-08 22:20:19] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 0 ms to minimize.
[2022-06-08 22:20:19] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 0 ms to minimize.
[2022-06-08 22:20:19] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 0 ms to minimize.
[2022-06-08 22:20:20] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 0 ms to minimize.
[2022-06-08 22:20:20] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 1 ms to minimize.
[2022-06-08 22:20:20] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 0 ms to minimize.
[2022-06-08 22:20:20] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 0 ms to minimize.
[2022-06-08 22:20:21] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 1 ms to minimize.
[2022-06-08 22:20:21] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2022-06-08 22:20:21] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 10444 ms
[2022-06-08 22:20:21] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 171 ms.
[2022-06-08 22:20:23] [INFO ] Added : 72 causal constraints over 15 iterations in 1926 ms. Result :sat
Minimization took 521 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 655500 steps, including 1002 resets, run finished after 5717 ms. (steps per millisecond=114 ) 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 36 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 48 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 22:20:29] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:20:29] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-08 22:20:30] [INFO ] Implicit Places using invariants in 308 ms returned []
[2022-06-08 22:20:30] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:20:30] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-08 22:20:30] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:20:34] [INFO ] Implicit Places using invariants and state equation in 4965 ms returned []
Implicit Place search using SMT with State Equation took 5276 ms to find 0 implicit places.
[2022-06-08 22:20:35] [INFO ] Redundant transitions in 70 ms returned []
[2022-06-08 22:20:35] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:20:35] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-08 22:20:35] [INFO ] Dead Transitions using invariants and state equation in 749 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m002-UpperBounds-12 in 42472 ms.
Starting property specific reduction for BugTracking-PT-q3m002-UpperBounds-13
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:20:35] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10001 steps, including 7 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2022-06-08 22:20:35] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:20:35] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-08 22:20:35] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:20:36] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2022-06-08 22:20:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:20:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-08 22:20:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:20:36] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2022-06-08 22:20:36] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:20:36] [INFO ] [Nat]Added 254 Read/Feed constraints in 140 ms returned sat
[2022-06-08 22:20:37] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 0 ms to minimize.
[2022-06-08 22:20:37] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2022-06-08 22:20:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 554 ms
[2022-06-08 22:20:37] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 156 ms.
[2022-06-08 22:20:40] [INFO ] Added : 96 causal constraints over 20 iterations in 2564 ms. Result :sat
Minimization took 412 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1090200 steps, including 1000 resets, run finished after 9969 ms. (steps per millisecond=109 ) 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 43 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:20:50] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 7843 ms. (steps per millisecond=127 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5 resets, run finished after 2690 ms. (steps per millisecond=371 ) properties (out of 1) seen :0
[2022-06-08 22:21:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:21:01] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 22:21:01] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:21:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:21:01] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2022-06-08 22:21:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:21:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:21:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:21:01] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2022-06-08 22:21:01] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:21:02] [INFO ] [Nat]Added 254 Read/Feed constraints in 138 ms returned sat
[2022-06-08 22:21:02] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 0 ms to minimize.
[2022-06-08 22:21:02] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2022-06-08 22:21:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 567 ms
[2022-06-08 22:21:02] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 159 ms.
[2022-06-08 22:21:05] [INFO ] Added : 96 causal constraints over 20 iterations in 2508 ms. Result :sat
Minimization took 414 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1090200 steps, including 1000 resets, run finished after 10026 ms. (steps per millisecond=108 ) 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 34 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:21:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:21:15] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-08 22:21:16] [INFO ] Implicit Places using invariants in 315 ms returned []
[2022-06-08 22:21:16] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:21:16] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 22:21:16] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:21:21] [INFO ] Implicit Places using invariants and state equation in 5178 ms returned []
Implicit Place search using SMT with State Equation took 5495 ms to find 0 implicit places.
[2022-06-08 22:21:21] [INFO ] Redundant transitions in 64 ms returned []
[2022-06-08 22:21:21] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:21:21] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 22:21:22] [INFO ] Dead Transitions using invariants and state equation in 746 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m002-UpperBounds-13 in 46200 ms.
[2022-06-08 22:21:22] [INFO ] Flatten gal took : 307 ms
[2022-06-08 22:21:22] [INFO ] Applying decomposition
[2022-06-08 22:21:22] [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/graph14727665799131886474.txt, -o, /tmp/graph14727665799131886474.bin, -w, /tmp/graph14727665799131886474.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/graph14727665799131886474.bin, -l, -1, -v, -w, /tmp/graph14727665799131886474.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 22:21:23] [INFO ] Decomposing Gal with order
[2022-06-08 22:21:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 22:21:23] [INFO ] Removed a total of 280 redundant transitions.
[2022-06-08 22:21:23] [INFO ] Flatten gal took : 316 ms
[2022-06-08 22:21:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 44 ms.
[2022-06-08 22:21:23] [INFO ] Time to serialize gal into /tmp/UpperBounds13734225662843941724.gal : 85 ms
[2022-06-08 22:21:23] [INFO ] Time to serialize properties into /tmp/UpperBounds10320506168419237944.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/UpperBounds13734225662843941724.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10320506168419237944.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/UpperBounds13734225662843941724.gal -t CGAL -reachable-file /tmp/UpperBounds10320506168419237944.prop --nowitness
Loading property file /tmp/UpperBounds10320506168419237944.prop.
Detected timeout of ITS tools.
[2022-06-08 22:43:44] [INFO ] Flatten gal took : 580 ms
[2022-06-08 22:43:44] [INFO ] Time to serialize gal into /tmp/UpperBounds6985080500170641674.gal : 57 ms
[2022-06-08 22:43:44] [INFO ] Time to serialize properties into /tmp/UpperBounds11895821217483281884.prop : 1 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/UpperBounds6985080500170641674.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11895821217483281884.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/UpperBounds6985080500170641674.gal -t CGAL -reachable-file /tmp/UpperBounds11895821217483281884.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds11895821217483281884.prop.
Detected timeout of ITS tools.
[2022-06-08 23:05:52] [INFO ] Flatten gal took : 441 ms
[2022-06-08 23:05:56] [INFO ] Input system was already deterministic with 2747 transitions.
[2022-06-08 23:05:56] [INFO ] Transformed 229 places.
[2022-06-08 23:05:56] [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:05:56] [INFO ] Time to serialize gal into /tmp/UpperBounds6679328011252025021.gal : 26 ms
[2022-06-08 23:05:56] [INFO ] Time to serialize properties into /tmp/UpperBounds15496418609814028867.prop : 1 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/UpperBounds6679328011252025021.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15496418609814028867.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/UpperBounds6679328011252025021.gal -t CGAL -reachable-file /tmp/UpperBounds15496418609814028867.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/UpperBounds15496418609814028867.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-q3m002"
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-q3m002, 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-165472292500001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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