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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.2K Jun 7 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 7 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 7 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Jun 7 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Jun 7 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 7 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Jun 7 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654733878150

Running Version 0
[2022-06-09 00:17:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 00:17:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 00:18:00] [INFO ] Load time of PNML (sax parser for PT used): 754 ms
[2022-06-09 00:18:00] [INFO ] Transformed 754 places.
[2022-06-09 00:18:00] [INFO ] Transformed 27370 transitions.
[2022-06-09 00:18:00] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 892 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 474 places in 120 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m002-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 00:18:01] [INFO ] Computed 10 place invariants in 55 ms
Incomplete random walk after 10000 steps, including 151 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :1
[2022-06-09 00:18:01] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 00:18:01] [INFO ] Computed 10 place invariants in 23 ms
[2022-06-09 00:18:01] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-06-09 00:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:02] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2022-06-09 00:18:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:18:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 00:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:02] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2022-06-09 00:18:02] [INFO ] State equation strengthened by 316 read => feed constraints.
[2022-06-09 00:18:02] [INFO ] [Nat]Added 316 Read/Feed constraints in 194 ms returned sat
[2022-06-09 00:18:03] [INFO ] Deduced a trap composed of 56 places in 436 ms of which 4 ms to minimize.
[2022-06-09 00:18:03] [INFO ] Deduced a trap composed of 11 places in 345 ms of which 4 ms to minimize.
[2022-06-09 00:18:04] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 2 ms to minimize.
[2022-06-09 00:18:04] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 0 ms to minimize.
[2022-06-09 00:18:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1707 ms
[2022-06-09 00:18:04] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 313 ms.
[2022-06-09 00:18:07] [INFO ] Deduced a trap composed of 15 places in 608 ms of which 1 ms to minimize.
[2022-06-09 00:18:07] [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-09 00:18:07] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 00:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:08] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2022-06-09 00:18:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:18:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 00:18:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:08] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2022-06-09 00:18:09] [INFO ] [Nat]Added 316 Read/Feed constraints in 183 ms returned sat
[2022-06-09 00:18:09] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 1 ms to minimize.
[2022-06-09 00:18:09] [INFO ] Deduced a trap composed of 58 places in 287 ms of which 0 ms to minimize.
[2022-06-09 00:18:10] [INFO ] Deduced a trap composed of 14 places in 289 ms of which 2 ms to minimize.
[2022-06-09 00:18:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1371 ms
[2022-06-09 00:18:10] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 215 ms.
[2022-06-09 00:18:13] [INFO ] Added : 95 causal constraints over 19 iterations in 2947 ms. Result :unknown
[2022-06-09 00:18:13] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-06-09 00:18:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:13] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2022-06-09 00:18:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:18:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 00:18:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:14] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2022-06-09 00:18:14] [INFO ] [Nat]Added 316 Read/Feed constraints in 200 ms returned sat
[2022-06-09 00:18:15] [INFO ] Deduced a trap composed of 19 places in 386 ms of which 0 ms to minimize.
[2022-06-09 00:18:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 560 ms
[2022-06-09 00:18:15] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 257 ms.
[2022-06-09 00:18:19] [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 2
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.refineWithCausalOrder(DeadlockTester.java:858)
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-09 00:18:19] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 00:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:19] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2022-06-09 00:18:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:18:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-06-09 00:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:20] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2022-06-09 00:18:20] [INFO ] [Nat]Added 316 Read/Feed constraints in 191 ms returned sat
[2022-06-09 00:18:20] [INFO ] Deduced a trap composed of 36 places in 289 ms of which 1 ms to minimize.
[2022-06-09 00:18:21] [INFO ] Deduced a trap composed of 35 places in 267 ms of which 0 ms to minimize.
[2022-06-09 00:18:21] [INFO ] Deduced a trap composed of 69 places in 292 ms of which 0 ms to minimize.
[2022-06-09 00:18:21] [INFO ] Deduced a trap composed of 68 places in 287 ms of which 0 ms to minimize.
[2022-06-09 00:18:22] [INFO ] Deduced a trap composed of 15 places in 291 ms of which 0 ms to minimize.
[2022-06-09 00:18:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1948 ms
[2022-06-09 00:18:22] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 221 ms.
[2022-06-09 00:18:24] [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.refineWithCausalOrder(DeadlockTester.java:858)
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-09 00:18:24] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 00:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:25] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2022-06-09 00:18:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:18:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 00:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:25] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2022-06-09 00:18:25] [INFO ] [Nat]Added 316 Read/Feed constraints in 189 ms returned sat
[2022-06-09 00:18:26] [INFO ] Deduced a trap composed of 20 places in 422 ms of which 0 ms to minimize.
[2022-06-09 00:18:26] [INFO ] Deduced a trap composed of 105 places in 425 ms of which 1 ms to minimize.
[2022-06-09 00:18:27] [INFO ] Deduced a trap composed of 64 places in 404 ms of which 1 ms to minimize.
[2022-06-09 00:18:27] [INFO ] Deduced a trap composed of 107 places in 409 ms of which 0 ms to minimize.
[2022-06-09 00:18:28] [INFO ] Deduced a trap composed of 105 places in 434 ms of which 0 ms to minimize.
[2022-06-09 00:18:28] [INFO ] Deduced a trap composed of 133 places in 419 ms of which 1 ms to minimize.
[2022-06-09 00:18:29] [INFO ] Deduced a trap composed of 135 places in 461 ms of which 0 ms to minimize.
[2022-06-09 00:18:30] [INFO ] Deduced a trap composed of 134 places in 444 ms of which 1 ms to minimize.
[2022-06-09 00:18:30] [INFO ] Deduced a trap composed of 143 places in 433 ms of which 0 ms to minimize.
[2022-06-09 00:18:30] [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.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 1]
Incomplete Parikh walk after 2113200 steps, including 59313 resets, run finished after 16047 ms. (steps per millisecond=131 ) properties (out of 5) seen :1 could not realise parikh vector
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 336 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:18:46] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 11 resets, run finished after 6869 ms. (steps per millisecond=145 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2167 ms. (steps per millisecond=461 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2057 ms. (steps per millisecond=486 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9 resets, run finished after 2029 ms. (steps per millisecond=492 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 2010 ms. (steps per millisecond=497 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2284 ms. (steps per millisecond=437 ) properties (out of 5) seen :0
[2022-06-09 00:19:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:19:04] [INFO ] Computed 8 place invariants in 21 ms
[2022-06-09 00:19:04] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:05] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2022-06-09 00:19:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:19:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:19:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:05] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2022-06-09 00:19:05] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:19:05] [INFO ] [Nat]Added 296 Read/Feed constraints in 204 ms returned sat
[2022-06-09 00:19:06] [INFO ] Deduced a trap composed of 42 places in 484 ms of which 1 ms to minimize.
[2022-06-09 00:19:07] [INFO ] Deduced a trap composed of 72 places in 486 ms of which 1 ms to minimize.
[2022-06-09 00:19:07] [INFO ] Deduced a trap composed of 17 places in 483 ms of which 1 ms to minimize.
[2022-06-09 00:19:08] [INFO ] Deduced a trap composed of 64 places in 481 ms of which 0 ms to minimize.
[2022-06-09 00:19:08] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 0 ms to minimize.
[2022-06-09 00:19:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2682 ms
[2022-06-09 00:19:08] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 266 ms.
[2022-06-09 00:19:12] [INFO ] Deduced a trap composed of 59 places in 233 ms of which 0 ms to minimize.
[2022-06-09 00:19:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 473 ms
[2022-06-09 00:19:12] [INFO ] Added : 112 causal constraints over 23 iterations in 4343 ms. Result :sat
[2022-06-09 00:19:13] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-09 00:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:13] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2022-06-09 00:19:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:19:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:14] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2022-06-09 00:19:14] [INFO ] [Nat]Added 296 Read/Feed constraints in 215 ms returned sat
[2022-06-09 00:19:14] [INFO ] Deduced a trap composed of 89 places in 362 ms of which 0 ms to minimize.
[2022-06-09 00:19:15] [INFO ] Deduced a trap composed of 60 places in 360 ms of which 0 ms to minimize.
[2022-06-09 00:19:15] [INFO ] Deduced a trap composed of 90 places in 380 ms of which 0 ms to minimize.
[2022-06-09 00:19:16] [INFO ] Deduced a trap composed of 58 places in 366 ms of which 1 ms to minimize.
[2022-06-09 00:19:16] [INFO ] Deduced a trap composed of 59 places in 357 ms of which 0 ms to minimize.
[2022-06-09 00:19:17] [INFO ] Deduced a trap composed of 90 places in 363 ms of which 0 ms to minimize.
[2022-06-09 00:19:17] [INFO ] Deduced a trap composed of 59 places in 367 ms of which 1 ms to minimize.
[2022-06-09 00:19:18] [INFO ] Deduced a trap composed of 49 places in 368 ms of which 1 ms to minimize.
[2022-06-09 00:19:18] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 0 ms to minimize.
[2022-06-09 00:19:18] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 1 ms to minimize.
[2022-06-09 00:19:18] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 1 ms to minimize.
[2022-06-09 00:19:19] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 0 ms to minimize.
[2022-06-09 00:19:19] [INFO ] Deduced a trap composed of 66 places in 355 ms of which 0 ms to minimize.
[2022-06-09 00:19:20] [INFO ] Deduced a trap composed of 10 places in 366 ms of which 1 ms to minimize.
[2022-06-09 00:19:20] [INFO ] Deduced a trap composed of 62 places in 366 ms of which 1 ms to minimize.
[2022-06-09 00:19:21] [INFO ] Deduced a trap composed of 29 places in 367 ms of which 1 ms to minimize.
[2022-06-09 00:19:21] [INFO ] Deduced a trap composed of 57 places in 368 ms of which 0 ms to minimize.
[2022-06-09 00:19:22] [INFO ] Deduced a trap composed of 64 places in 365 ms of which 1 ms to minimize.
[2022-06-09 00:19:22] [INFO ] Deduced a trap composed of 63 places in 376 ms of which 0 ms to minimize.
[2022-06-09 00:19:22] [INFO ] Deduced a trap composed of 64 places in 364 ms of which 0 ms to minimize.
[2022-06-09 00:19:23] [INFO ] Deduced a trap composed of 87 places in 389 ms of which 0 ms to minimize.
[2022-06-09 00:19:23] [INFO ] Deduced a trap composed of 17 places in 358 ms of which 1 ms to minimize.
[2022-06-09 00:19:24] [INFO ] Deduced a trap composed of 14 places in 404 ms of which 0 ms to minimize.
[2022-06-09 00:19:24] [INFO ] Deduced a trap composed of 55 places in 357 ms of which 1 ms to minimize.
[2022-06-09 00:19:25] [INFO ] Deduced a trap composed of 56 places in 366 ms of which 1 ms to minimize.
[2022-06-09 00:19:25] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 11016 ms
[2022-06-09 00:19:25] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 223 ms.
[2022-06-09 00:19:29] [INFO ] Deduced a trap composed of 100 places in 389 ms of which 0 ms to minimize.
[2022-06-09 00:19:30] [INFO ] Deduced a trap composed of 63 places in 382 ms of which 1 ms to minimize.
[2022-06-09 00:19:30] [INFO ] Deduced a trap composed of 38 places in 384 ms of which 0 ms to minimize.
[2022-06-09 00:19:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1655 ms
[2022-06-09 00:19:31] [INFO ] Added : 110 causal constraints over 23 iterations in 5627 ms. Result :sat
[2022-06-09 00:19:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:19:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:31] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2022-06-09 00:19:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:19:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:19:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:32] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2022-06-09 00:19:32] [INFO ] [Nat]Added 296 Read/Feed constraints in 203 ms returned sat
[2022-06-09 00:19:32] [INFO ] Deduced a trap composed of 17 places in 381 ms of which 1 ms to minimize.
[2022-06-09 00:19:33] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 2 ms to minimize.
[2022-06-09 00:19:33] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 1 ms to minimize.
[2022-06-09 00:19:33] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 0 ms to minimize.
[2022-06-09 00:19:34] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 0 ms to minimize.
[2022-06-09 00:19:34] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 0 ms to minimize.
[2022-06-09 00:19:34] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 1 ms to minimize.
[2022-06-09 00:19:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2396 ms
[2022-06-09 00:19:35] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 261 ms.
[2022-06-09 00:19:38] [INFO ] Deduced a trap composed of 61 places in 335 ms of which 0 ms to minimize.
[2022-06-09 00:19:39] [INFO ] Deduced a trap composed of 59 places in 344 ms of which 6 ms to minimize.
[2022-06-09 00:19:39] [INFO ] Deduced a trap composed of 59 places in 339 ms of which 1 ms to minimize.
[2022-06-09 00:19:39] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2022-06-09 00:19:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1708 ms
[2022-06-09 00:19:40] [INFO ] Added : 103 causal constraints over 21 iterations in 5207 ms. Result :sat
[2022-06-09 00:19:40] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:19:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:40] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2022-06-09 00:19:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:19:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:19:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:41] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2022-06-09 00:19:41] [INFO ] [Nat]Added 296 Read/Feed constraints in 213 ms returned sat
[2022-06-09 00:19:41] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 1 ms to minimize.
[2022-06-09 00:19:42] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 1 ms to minimize.
[2022-06-09 00:19:42] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 0 ms to minimize.
[2022-06-09 00:19:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 927 ms
[2022-06-09 00:19:42] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 201 ms.
[2022-06-09 00:19:45] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 0 ms to minimize.
[2022-06-09 00:19:46] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 0 ms to minimize.
[2022-06-09 00:19:46] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 0 ms to minimize.
[2022-06-09 00:19:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1123 ms
[2022-06-09 00:19:47] [INFO ] Added : 101 causal constraints over 21 iterations in 4708 ms. Result :sat
[2022-06-09 00:19:47] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:19:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:47] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2022-06-09 00:19:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:19:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:19:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:48] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2022-06-09 00:19:48] [INFO ] [Nat]Added 296 Read/Feed constraints in 193 ms returned sat
[2022-06-09 00:19:48] [INFO ] Deduced a trap composed of 16 places in 366 ms of which 1 ms to minimize.
[2022-06-09 00:19:49] [INFO ] Deduced a trap composed of 17 places in 352 ms of which 0 ms to minimize.
[2022-06-09 00:19:49] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 0 ms to minimize.
[2022-06-09 00:19:49] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 0 ms to minimize.
[2022-06-09 00:19:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1499 ms
[2022-06-09 00:19:50] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 217 ms.
[2022-06-09 00:19:53] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 0 ms to minimize.
[2022-06-09 00:19:53] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 0 ms to minimize.
[2022-06-09 00:19:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 722 ms
[2022-06-09 00:19:54] [INFO ] Added : 108 causal constraints over 23 iterations in 4478 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 1]
Incomplete Parikh walk after 1580600 steps, including 1001 resets, run finished after 12749 ms. (steps per millisecond=123 ) properties (out of 5) seen :1 could not realise parikh vector
Incomplete Parikh walk after 998700 steps, including 1002 resets, run finished after 7751 ms. (steps per millisecond=128 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 971300 steps, including 1002 resets, run finished after 7513 ms. (steps per millisecond=129 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1200000 steps, including 1001 resets, run finished after 9373 ms. (steps per millisecond=128 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1230600 steps, including 1000 resets, run finished after 10304 ms. (steps per millisecond=119 ) properties (out of 5) seen :1 could not realise parikh vector
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 88 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 00:20:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:20:42] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 00:20:42] [INFO ] Implicit Places using invariants in 474 ms returned []
[2022-06-09 00:20:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:20:42] [INFO ] Computed 8 place invariants in 35 ms
[2022-06-09 00:20:43] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:20:50] [INFO ] Implicit Places using invariants and state equation in 7572 ms returned []
Implicit Place search using SMT with State Equation took 8047 ms to find 0 implicit places.
[2022-06-09 00:20:50] [INFO ] Redundant transitions in 296 ms returned []
[2022-06-09 00:20:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:20:50] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 00:20:51] [INFO ] Dead Transitions using invariants and state equation in 999 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m002-UpperBounds-04
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:20:51] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
[2022-06-09 00:20:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:20:51] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 00:20:51] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:20:52] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2022-06-09 00:20:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:20:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:20:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:20:53] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2022-06-09 00:20:53] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:20:53] [INFO ] [Nat]Added 296 Read/Feed constraints in 222 ms returned sat
[2022-06-09 00:20:53] [INFO ] Deduced a trap composed of 42 places in 456 ms of which 1 ms to minimize.
[2022-06-09 00:20:54] [INFO ] Deduced a trap composed of 72 places in 493 ms of which 0 ms to minimize.
[2022-06-09 00:20:54] [INFO ] Deduced a trap composed of 17 places in 455 ms of which 1 ms to minimize.
[2022-06-09 00:20:55] [INFO ] Deduced a trap composed of 64 places in 494 ms of which 0 ms to minimize.
[2022-06-09 00:20:55] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 0 ms to minimize.
[2022-06-09 00:20:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2663 ms
[2022-06-09 00:20:56] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 266 ms.
[2022-06-09 00:20:57] [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.refineWithCausalOrder(DeadlockTester.java:858)
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 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 83 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:20:57] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 7330 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2259 ms. (steps per millisecond=442 ) properties (out of 1) seen :0
[2022-06-09 00:21:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:21:07] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 00:21:07] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:21:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:21:07] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2022-06-09 00:21:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:21:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:21:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:21:08] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2022-06-09 00:21:08] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:21:08] [INFO ] [Nat]Added 296 Read/Feed constraints in 222 ms returned sat
[2022-06-09 00:21:09] [INFO ] Deduced a trap composed of 42 places in 483 ms of which 1 ms to minimize.
[2022-06-09 00:21:09] [INFO ] Deduced a trap composed of 72 places in 463 ms of which 0 ms to minimize.
[2022-06-09 00:21:10] [INFO ] Deduced a trap composed of 17 places in 492 ms of which 1 ms to minimize.
[2022-06-09 00:21:10] [INFO ] Deduced a trap composed of 64 places in 481 ms of which 0 ms to minimize.
[2022-06-09 00:21:11] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 0 ms to minimize.
[2022-06-09 00:21:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2681 ms
[2022-06-09 00:21:11] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 248 ms.
[2022-06-09 00:21:15] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 0 ms to minimize.
[2022-06-09 00:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 440 ms
[2022-06-09 00:21:15] [INFO ] Added : 112 causal constraints over 23 iterations in 4397 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1230600 steps, including 1002 resets, run finished after 9177 ms. (steps per millisecond=134 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 68 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 60 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 00:21:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:21:25] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 00:21:25] [INFO ] Implicit Places using invariants in 413 ms returned []
[2022-06-09 00:21:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:21:25] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 00:21:26] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:21:32] [INFO ] Implicit Places using invariants and state equation in 7273 ms returned []
Implicit Place search using SMT with State Equation took 7690 ms to find 0 implicit places.
[2022-06-09 00:21:33] [INFO ] Redundant transitions in 226 ms returned []
[2022-06-09 00:21:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:21:33] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 00:21:34] [INFO ] Dead Transitions using invariants and state equation in 1109 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-04 in 42451 ms.
Starting property specific reduction for BugTracking-PT-q8m002-UpperBounds-06
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:21:34] [INFO ] Computed 8 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
[2022-06-09 00:21:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:21:34] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 00:21:34] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:21:34] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2022-06-09 00:21:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:21:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:21:35] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2022-06-09 00:21:35] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:21:35] [INFO ] [Nat]Added 296 Read/Feed constraints in 220 ms returned sat
[2022-06-09 00:21:36] [INFO ] Deduced a trap composed of 89 places in 394 ms of which 0 ms to minimize.
[2022-06-09 00:21:36] [INFO ] Deduced a trap composed of 60 places in 374 ms of which 0 ms to minimize.
[2022-06-09 00:21:37] [INFO ] Deduced a trap composed of 90 places in 374 ms of which 1 ms to minimize.
[2022-06-09 00:21:37] [INFO ] Deduced a trap composed of 58 places in 374 ms of which 0 ms to minimize.
[2022-06-09 00:21:38] [INFO ] Deduced a trap composed of 59 places in 373 ms of which 0 ms to minimize.
[2022-06-09 00:21:38] [INFO ] Deduced a trap composed of 90 places in 365 ms of which 0 ms to minimize.
[2022-06-09 00:21:39] [INFO ] Deduced a trap composed of 59 places in 370 ms of which 1 ms to minimize.
[2022-06-09 00:21:39] [INFO ] Deduced a trap composed of 49 places in 362 ms of which 1 ms to minimize.
[2022-06-09 00:21:39] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 0 ms to minimize.
[2022-06-09 00:21:40] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 1 ms to minimize.
[2022-06-09 00:21:40] [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 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 55 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:21:40] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 6723 ms. (steps per millisecond=148 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 2099 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2022-06-09 00:21:48] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:21:49] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 00:21:49] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:21:49] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2022-06-09 00:21:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:21:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:21:50] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2022-06-09 00:21:50] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:21:50] [INFO ] [Nat]Added 296 Read/Feed constraints in 215 ms returned sat
[2022-06-09 00:21:50] [INFO ] Deduced a trap composed of 89 places in 362 ms of which 1 ms to minimize.
[2022-06-09 00:21:51] [INFO ] Deduced a trap composed of 60 places in 350 ms of which 0 ms to minimize.
[2022-06-09 00:21:51] [INFO ] Deduced a trap composed of 90 places in 350 ms of which 1 ms to minimize.
[2022-06-09 00:21:52] [INFO ] Deduced a trap composed of 58 places in 370 ms of which 0 ms to minimize.
[2022-06-09 00:21:52] [INFO ] Deduced a trap composed of 59 places in 384 ms of which 0 ms to minimize.
[2022-06-09 00:21:53] [INFO ] Deduced a trap composed of 90 places in 396 ms of which 0 ms to minimize.
[2022-06-09 00:21:53] [INFO ] Deduced a trap composed of 59 places in 356 ms of which 1 ms to minimize.
[2022-06-09 00:21:54] [INFO ] Deduced a trap composed of 49 places in 346 ms of which 0 ms to minimize.
[2022-06-09 00:21:54] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 1 ms to minimize.
[2022-06-09 00:21:54] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 0 ms to minimize.
[2022-06-09 00:21:54] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 0 ms to minimize.
[2022-06-09 00:21:55] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 0 ms to minimize.
[2022-06-09 00:21:55] [INFO ] Deduced a trap composed of 66 places in 343 ms of which 0 ms to minimize.
[2022-06-09 00:21:56] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 0 ms to minimize.
[2022-06-09 00:21:56] [INFO ] Deduced a trap composed of 62 places in 345 ms of which 0 ms to minimize.
[2022-06-09 00:21:56] [INFO ] Deduced a trap composed of 29 places in 345 ms of which 0 ms to minimize.
[2022-06-09 00:21:57] [INFO ] Deduced a trap composed of 57 places in 342 ms of which 0 ms to minimize.
[2022-06-09 00:21:57] [INFO ] Deduced a trap composed of 64 places in 349 ms of which 1 ms to minimize.
[2022-06-09 00:21:58] [INFO ] Deduced a trap composed of 63 places in 347 ms of which 0 ms to minimize.
[2022-06-09 00:21:58] [INFO ] Deduced a trap composed of 64 places in 342 ms of which 0 ms to minimize.
[2022-06-09 00:21:59] [INFO ] Deduced a trap composed of 87 places in 339 ms of which 1 ms to minimize.
[2022-06-09 00:21:59] [INFO ] Deduced a trap composed of 17 places in 337 ms of which 1 ms to minimize.
[2022-06-09 00:22:00] [INFO ] Deduced a trap composed of 14 places in 403 ms of which 0 ms to minimize.
[2022-06-09 00:22:00] [INFO ] Deduced a trap composed of 55 places in 370 ms of which 0 ms to minimize.
[2022-06-09 00:22:00] [INFO ] Deduced a trap composed of 56 places in 360 ms of which 0 ms to minimize.
[2022-06-09 00:22:01] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 10701 ms
[2022-06-09 00:22:01] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 208 ms.
[2022-06-09 00:22:05] [INFO ] Deduced a trap composed of 100 places in 363 ms of which 0 ms to minimize.
[2022-06-09 00:22:05] [INFO ] Deduced a trap composed of 63 places in 337 ms of which 0 ms to minimize.
[2022-06-09 00:22:06] [INFO ] Deduced a trap composed of 38 places in 338 ms of which 0 ms to minimize.
[2022-06-09 00:22:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1526 ms
[2022-06-09 00:22:06] [INFO ] Added : 110 causal constraints over 23 iterations in 5403 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 1200000 steps, including 1000 resets, run finished after 8788 ms. (steps per millisecond=136 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 00:22:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:22:15] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 00:22:15] [INFO ] Implicit Places using invariants in 414 ms returned []
[2022-06-09 00:22:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:22:15] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 00:22:16] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:22:22] [INFO ] Implicit Places using invariants and state equation in 7050 ms returned []
Implicit Place search using SMT with State Equation took 7465 ms to find 0 implicit places.
[2022-06-09 00:22:23] [INFO ] Redundant transitions in 167 ms returned []
[2022-06-09 00:22:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:22:23] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 00:22:24] [INFO ] Dead Transitions using invariants and state equation in 1034 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-06 in 49960 ms.
Starting property specific reduction for BugTracking-PT-q8m002-UpperBounds-07
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:22:24] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
[2022-06-09 00:22:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:22:24] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 00:22:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:22:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:22:24] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2022-06-09 00:22:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:22:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:22:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:22:25] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2022-06-09 00:22:25] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:22:25] [INFO ] [Nat]Added 296 Read/Feed constraints in 217 ms returned sat
[2022-06-09 00:22:26] [INFO ] Deduced a trap composed of 17 places in 334 ms of which 0 ms to minimize.
[2022-06-09 00:22:26] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 0 ms to minimize.
[2022-06-09 00:22:26] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 0 ms to minimize.
[2022-06-09 00:22:26] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 1 ms to minimize.
[2022-06-09 00:22:27] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 0 ms to minimize.
[2022-06-09 00:22:27] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 0 ms to minimize.
[2022-06-09 00:22:27] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 0 ms to minimize.
[2022-06-09 00:22:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2180 ms
[2022-06-09 00:22:28] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 219 ms.
[2022-06-09 00:22:29] [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.refineWithCausalOrder(DeadlockTester.java:858)
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 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:22:29] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 5 resets, run finished after 6633 ms. (steps per millisecond=150 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 2067 ms. (steps per millisecond=483 ) properties (out of 1) seen :0
[2022-06-09 00:22:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:22:38] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 00:22:38] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:22:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:22:39] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2022-06-09 00:22:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:22:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:22:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:22:39] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2022-06-09 00:22:39] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:22:39] [INFO ] [Nat]Added 296 Read/Feed constraints in 207 ms returned sat
[2022-06-09 00:22:40] [INFO ] Deduced a trap composed of 17 places in 359 ms of which 0 ms to minimize.
[2022-06-09 00:22:40] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 1 ms to minimize.
[2022-06-09 00:22:40] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 0 ms to minimize.
[2022-06-09 00:22:41] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 0 ms to minimize.
[2022-06-09 00:22:41] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 0 ms to minimize.
[2022-06-09 00:22:41] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 1 ms to minimize.
[2022-06-09 00:22:42] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 0 ms to minimize.
[2022-06-09 00:22:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2248 ms
[2022-06-09 00:22:42] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 239 ms.
[2022-06-09 00:22:46] [INFO ] Deduced a trap composed of 61 places in 346 ms of which 0 ms to minimize.
[2022-06-09 00:22:46] [INFO ] Deduced a trap composed of 59 places in 345 ms of which 1 ms to minimize.
[2022-06-09 00:22:47] [INFO ] Deduced a trap composed of 59 places in 354 ms of which 1 ms to minimize.
[2022-06-09 00:22:47] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2022-06-09 00:22:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1784 ms
[2022-06-09 00:22:47] [INFO ] Added : 103 causal constraints over 21 iterations in 5527 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 971300 steps, including 1002 resets, run finished after 7242 ms. (steps per millisecond=134 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 68 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 00:22:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:22:55] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 00:22:55] [INFO ] Implicit Places using invariants in 454 ms returned []
[2022-06-09 00:22:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:22:55] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 00:22:56] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:23:02] [INFO ] Implicit Places using invariants and state equation in 7298 ms returned []
Implicit Place search using SMT with State Equation took 7753 ms to find 0 implicit places.
[2022-06-09 00:23:03] [INFO ] Redundant transitions in 129 ms returned []
[2022-06-09 00:23:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:23:03] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 00:23:04] [INFO ] Dead Transitions using invariants and state equation in 1009 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-07 in 39983 ms.
Starting property specific reduction for BugTracking-PT-q8m002-UpperBounds-11
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:23:04] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2022-06-09 00:23:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:23:04] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-09 00:23:04] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:04] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2022-06-09 00:23:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:23:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:05] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2022-06-09 00:23:05] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:23:05] [INFO ] [Nat]Added 296 Read/Feed constraints in 238 ms returned sat
[2022-06-09 00:23:05] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 1 ms to minimize.
[2022-06-09 00:23:06] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 1 ms to minimize.
[2022-06-09 00:23:06] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 0 ms to minimize.
[2022-06-09 00:23:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 982 ms
[2022-06-09 00:23:06] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 241 ms.
[2022-06-09 00:23:10] [INFO ] Deduced a trap composed of 7 places in 554 ms of which 0 ms to minimize.
[2022-06-09 00:23:10] [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 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:23:10] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7042 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1995 ms. (steps per millisecond=501 ) properties (out of 1) seen :0
[2022-06-09 00:23:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:23:19] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 00:23:19] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:23:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:20] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2022-06-09 00:23:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:23:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:20] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2022-06-09 00:23:20] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:23:20] [INFO ] [Nat]Added 296 Read/Feed constraints in 237 ms returned sat
[2022-06-09 00:23:21] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 0 ms to minimize.
[2022-06-09 00:23:21] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 0 ms to minimize.
[2022-06-09 00:23:21] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 0 ms to minimize.
[2022-06-09 00:23:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 962 ms
[2022-06-09 00:23:22] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 215 ms.
[2022-06-09 00:23:25] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 1 ms to minimize.
[2022-06-09 00:23:26] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 0 ms to minimize.
[2022-06-09 00:23:26] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 2 ms to minimize.
[2022-06-09 00:23:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1164 ms
[2022-06-09 00:23:26] [INFO ] Added : 101 causal constraints over 21 iterations in 5031 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 998700 steps, including 1002 resets, run finished after 7043 ms. (steps per millisecond=141 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 00:23:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:23:34] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 00:23:34] [INFO ] Implicit Places using invariants in 428 ms returned []
[2022-06-09 00:23:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:23:34] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 00:23:35] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:23:42] [INFO ] Implicit Places using invariants and state equation in 7598 ms returned []
Implicit Place search using SMT with State Equation took 8029 ms to find 0 implicit places.
[2022-06-09 00:23:42] [INFO ] Redundant transitions in 131 ms returned []
[2022-06-09 00:23:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:23:42] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 00:23:43] [INFO ] Dead Transitions using invariants and state equation in 1094 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-11 in 39330 ms.
Starting property specific reduction for BugTracking-PT-q8m002-UpperBounds-15
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:23:43] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2022-06-09 00:23:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:23:43] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 00:23:43] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:44] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2022-06-09 00:23:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:23:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:44] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2022-06-09 00:23:44] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:23:44] [INFO ] [Nat]Added 296 Read/Feed constraints in 205 ms returned sat
[2022-06-09 00:23:45] [INFO ] Deduced a trap composed of 67 places in 346 ms of which 0 ms to minimize.
[2022-06-09 00:23:45] [INFO ] Deduced a trap composed of 88 places in 340 ms of which 0 ms to minimize.
[2022-06-09 00:23:46] [INFO ] Deduced a trap composed of 87 places in 366 ms of which 0 ms to minimize.
[2022-06-09 00:23:46] [INFO ] Deduced a trap composed of 56 places in 358 ms of which 0 ms to minimize.
[2022-06-09 00:23:47] [INFO ] Deduced a trap composed of 81 places in 358 ms of which 1 ms to minimize.
[2022-06-09 00:23:47] [INFO ] Deduced a trap composed of 80 places in 360 ms of which 0 ms to minimize.
[2022-06-09 00:23:48] [INFO ] Deduced a trap composed of 80 places in 357 ms of which 1 ms to minimize.
[2022-06-09 00:23:48] [INFO ] Deduced a trap composed of 80 places in 349 ms of which 1 ms to minimize.
[2022-06-09 00:23:48] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 0 ms to minimize.
[2022-06-09 00:23:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4100 ms
[2022-06-09 00:23:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:671)
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 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:23:49] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 6826 ms. (steps per millisecond=146 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2067 ms. (steps per millisecond=483 ) properties (out of 1) seen :0
[2022-06-09 00:23:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:23:58] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 00:23:58] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:23:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:58] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2022-06-09 00:23:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:23:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:23:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:59] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2022-06-09 00:23:59] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:23:59] [INFO ] [Nat]Added 296 Read/Feed constraints in 206 ms returned sat
[2022-06-09 00:24:00] [INFO ] Deduced a trap composed of 67 places in 392 ms of which 0 ms to minimize.
[2022-06-09 00:24:00] [INFO ] Deduced a trap composed of 88 places in 397 ms of which 1 ms to minimize.
[2022-06-09 00:24:01] [INFO ] Deduced a trap composed of 87 places in 393 ms of which 1 ms to minimize.
[2022-06-09 00:24:01] [INFO ] Deduced a trap composed of 56 places in 372 ms of which 0 ms to minimize.
[2022-06-09 00:24:02] [INFO ] Deduced a trap composed of 81 places in 380 ms of which 0 ms to minimize.
[2022-06-09 00:24:02] [INFO ] Deduced a trap composed of 80 places in 388 ms of which 0 ms to minimize.
[2022-06-09 00:24:03] [INFO ] Deduced a trap composed of 80 places in 373 ms of which 1 ms to minimize.
[2022-06-09 00:24:03] [INFO ] Deduced a trap composed of 80 places in 370 ms of which 1 ms to minimize.
[2022-06-09 00:24:03] [INFO ] Deduced a trap composed of 19 places in 376 ms of which 0 ms to minimize.
[2022-06-09 00:24:04] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4450 ms
[2022-06-09 00:24:04] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 282 ms.
[2022-06-09 00:24:08] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 0 ms to minimize.
[2022-06-09 00:24:08] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 0 ms to minimize.
[2022-06-09 00:24:08] [INFO ] Deduced a trap composed of 56 places in 247 ms of which 0 ms to minimize.
[2022-06-09 00:24:09] [INFO ] Deduced a trap composed of 60 places in 255 ms of which 0 ms to minimize.
[2022-06-09 00:24:09] [INFO ] Deduced a trap composed of 60 places in 269 ms of which 0 ms to minimize.
[2022-06-09 00:24:10] [INFO ] Deduced a trap composed of 60 places in 236 ms of which 0 ms to minimize.
[2022-06-09 00:24:10] [INFO ] Deduced a trap composed of 60 places in 247 ms of which 0 ms to minimize.
[2022-06-09 00:24:10] [INFO ] Deduced a trap composed of 60 places in 248 ms of which 0 ms to minimize.
[2022-06-09 00:24:11] [INFO ] Deduced a trap composed of 61 places in 234 ms of which 0 ms to minimize.
[2022-06-09 00:24:11] [INFO ] Deduced a trap composed of 61 places in 244 ms of which 0 ms to minimize.
[2022-06-09 00:24:12] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 1 ms to minimize.
[2022-06-09 00:24:12] [INFO ] Deduced a trap composed of 30 places in 255 ms of which 1 ms to minimize.
[2022-06-09 00:24:12] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 1 ms to minimize.
[2022-06-09 00:24:13] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5290 ms
[2022-06-09 00:24:13] [INFO ] Added : 100 causal constraints over 20 iterations in 9179 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 936900 steps, including 1000 resets, run finished after 7409 ms. (steps per millisecond=126 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 00:24:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:24:20] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 00:24:21] [INFO ] Implicit Places using invariants in 459 ms returned []
[2022-06-09 00:24:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:24:21] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 00:24:21] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 00:24:28] [INFO ] Implicit Places using invariants and state equation in 7625 ms returned []
Implicit Place search using SMT with State Equation took 8092 ms to find 0 implicit places.
[2022-06-09 00:24:29] [INFO ] Redundant transitions in 128 ms returned []
[2022-06-09 00:24:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 00:24:29] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 00:24:30] [INFO ] Dead Transitions using invariants and state equation in 1045 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-15 in 46680 ms.
[2022-06-09 00:24:30] [INFO ] Flatten gal took : 386 ms
[2022-06-09 00:24:30] [INFO ] Applying decomposition
[2022-06-09 00:24:31] [INFO ] Flatten gal took : 239 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/graph685490758386925586.txt, -o, /tmp/graph685490758386925586.bin, -w, /tmp/graph685490758386925586.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/graph685490758386925586.bin, -l, -1, -v, -w, /tmp/graph685490758386925586.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 00:24:31] [INFO ] Decomposing Gal with order
[2022-06-09 00:24:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 00:24:32] [INFO ] Removed a total of 424 redundant transitions.
[2022-06-09 00:24:32] [INFO ] Flatten gal took : 496 ms
[2022-06-09 00:24:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 33 ms.
[2022-06-09 00:24:32] [INFO ] Time to serialize gal into /tmp/UpperBounds9136772103807516820.gal : 45 ms
[2022-06-09 00:24:32] [INFO ] Time to serialize properties into /tmp/UpperBounds12258943999949623374.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/UpperBounds9136772103807516820.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12258943999949623374.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/UpperBounds9136772103807516820.gal -t CGAL -reachable-file /tmp/UpperBounds12258943999949623374.prop --nowitness
Loading property file /tmp/UpperBounds12258943999949623374.prop.
Detected timeout of ITS tools.
[2022-06-09 00:46:56] [INFO ] Flatten gal took : 11534 ms
[2022-06-09 00:46:56] [INFO ] Time to serialize gal into /tmp/UpperBounds3767975398428612897.gal : 112 ms
[2022-06-09 00:46:56] [INFO ] Time to serialize properties into /tmp/UpperBounds9245599254858596722.prop : 5 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/UpperBounds3767975398428612897.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9245599254858596722.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/UpperBounds3767975398428612897.gal -t CGAL -reachable-file /tmp/UpperBounds9245599254858596722.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds9245599254858596722.prop.
Detected timeout of ITS tools.
[2022-06-09 01:09:08] [INFO ] Flatten gal took : 621 ms
[2022-06-09 01:09:13] [INFO ] Input system was already deterministic with 3871 transitions.
[2022-06-09 01:09:13] [INFO ] Transformed 269 places.
[2022-06-09 01:09:13] [INFO ] Transformed 3871 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-09 01:09:13] [INFO ] Time to serialize gal into /tmp/UpperBounds11753478179424192837.gal : 14 ms
[2022-06-09 01:09:13] [INFO ] Time to serialize properties into /tmp/UpperBounds1408853137603524721.prop : 26 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/UpperBounds11753478179424192837.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds1408853137603524721.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/UpperBounds11753478179424192837.gal -t CGAL -reachable-file /tmp/UpperBounds1408853137603524721.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/UpperBounds1408853137603524721.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-q8m002"
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-q8m002, 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-165472292500025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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