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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.5K Jun 7 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 7 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 16:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 7 16:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Jun 7 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 7 16:47 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-q8m064-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654741222934

Running Version 0
[2022-06-09 02:20:24] [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 02:20:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 02:20:25] [INFO ] Load time of PNML (sax parser for PT used): 781 ms
[2022-06-09 02:20:25] [INFO ] Transformed 754 places.
[2022-06-09 02:20:25] [INFO ] Transformed 27370 transitions.
[2022-06-09 02:20:25] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 917 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 474 places in 124 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m064-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 02:20:25] [INFO ] Computed 10 place invariants in 58 ms
FORMULA BugTracking-PT-q8m064-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 6 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :1
FORMULA BugTracking-PT-q8m064-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
[2022-06-09 02:20:26] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 02:20:26] [INFO ] Computed 10 place invariants in 26 ms
[2022-06-09 02:20:26] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-06-09 02:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:26] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2022-06-09 02:20:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:20:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:27] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2022-06-09 02:20:27] [INFO ] State equation strengthened by 316 read => feed constraints.
[2022-06-09 02:20:27] [INFO ] [Nat]Added 316 Read/Feed constraints in 192 ms returned sat
[2022-06-09 02:20:28] [INFO ] Deduced a trap composed of 12 places in 448 ms of which 9 ms to minimize.
[2022-06-09 02:20:28] [INFO ] Deduced a trap composed of 17 places in 278 ms of which 2 ms to minimize.
[2022-06-09 02:20:28] [INFO ] Deduced a trap composed of 60 places in 287 ms of which 2 ms to minimize.
[2022-06-09 02:20:29] [INFO ] Deduced a trap composed of 60 places in 266 ms of which 2 ms to minimize.
[2022-06-09 02:20:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1801 ms
[2022-06-09 02:20:29] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 337 ms.
[2022-06-09 02:20:31] [INFO ] Added : 70 causal constraints over 14 iterations in 2435 ms. Result :unknown
[2022-06-09 02:20:31] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 02:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:32] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2022-06-09 02:20:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:20:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:33] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2022-06-09 02:20:33] [INFO ] [Nat]Added 316 Read/Feed constraints in 196 ms returned sat
[2022-06-09 02:20:33] [INFO ] Deduced a trap composed of 57 places in 445 ms of which 0 ms to minimize.
[2022-06-09 02:20:34] [INFO ] Deduced a trap composed of 56 places in 411 ms of which 1 ms to minimize.
[2022-06-09 02:20:34] [INFO ] Deduced a trap composed of 25 places in 447 ms of which 0 ms to minimize.
[2022-06-09 02:20:35] [INFO ] Deduced a trap composed of 23 places in 442 ms of which 1 ms to minimize.
[2022-06-09 02:20:35] [INFO ] Deduced a trap composed of 85 places in 410 ms of which 0 ms to minimize.
[2022-06-09 02:20:36] [INFO ] Deduced a trap composed of 57 places in 444 ms of which 0 ms to minimize.
[2022-06-09 02:20:36] [INFO ] Deduced a trap composed of 23 places in 427 ms of which 0 ms to minimize.
[2022-06-09 02:20:37] [INFO ] Deduced a trap composed of 23 places in 427 ms of which 1 ms to minimize.
[2022-06-09 02:20:37] [INFO ] Deduced a trap composed of 11 places in 439 ms of which 2 ms to minimize.
[2022-06-09 02:20:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 02:20:37] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:38] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2022-06-09 02:20:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:20:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:39] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2022-06-09 02:20:39] [INFO ] [Nat]Added 316 Read/Feed constraints in 192 ms returned sat
[2022-06-09 02:20:39] [INFO ] Deduced a trap composed of 38 places in 374 ms of which 0 ms to minimize.
[2022-06-09 02:20:40] [INFO ] Deduced a trap composed of 52 places in 348 ms of which 0 ms to minimize.
[2022-06-09 02:20:40] [INFO ] Deduced a trap composed of 36 places in 380 ms of which 0 ms to minimize.
[2022-06-09 02:20:41] [INFO ] Deduced a trap composed of 49 places in 367 ms of which 1 ms to minimize.
[2022-06-09 02:20:41] [INFO ] Deduced a trap composed of 31 places in 344 ms of which 0 ms to minimize.
[2022-06-09 02:20:41] [INFO ] Deduced a trap composed of 27 places in 366 ms of which 0 ms to minimize.
[2022-06-09 02:20:42] [INFO ] Deduced a trap composed of 37 places in 355 ms of which 1 ms to minimize.
[2022-06-09 02:20:42] [INFO ] Deduced a trap composed of 35 places in 365 ms of which 1 ms to minimize.
[2022-06-09 02:20:43] [INFO ] Deduced a trap composed of 43 places in 360 ms of which 1 ms to minimize.
[2022-06-09 02:20:43] [INFO ] Deduced a trap composed of 13 places in 359 ms of which 1 ms to minimize.
[2022-06-09 02:20:43] [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.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 02:20:43] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 02:20:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:44] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2022-06-09 02:20:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:20:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:44] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2022-06-09 02:20:45] [INFO ] [Nat]Added 316 Read/Feed constraints in 224 ms returned sat
[2022-06-09 02:20:45] [INFO ] Deduced a trap composed of 25 places in 466 ms of which 0 ms to minimize.
[2022-06-09 02:20:46] [INFO ] Deduced a trap composed of 16 places in 401 ms of which 1 ms to minimize.
[2022-06-09 02:20:46] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 1 ms to minimize.
[2022-06-09 02:20:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1402 ms
[2022-06-09 02:20:46] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 423 ms.
[2022-06-09 02:20:49] [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 02:20:49] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:49] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2022-06-09 02:20:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:20:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:50] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2022-06-09 02:20:50] [INFO ] [Nat]Added 316 Read/Feed constraints in 199 ms returned sat
[2022-06-09 02:20:51] [INFO ] Deduced a trap composed of 91 places in 366 ms of which 0 ms to minimize.
[2022-06-09 02:20:51] [INFO ] Deduced a trap composed of 90 places in 346 ms of which 0 ms to minimize.
[2022-06-09 02:20:51] [INFO ] Deduced a trap composed of 66 places in 347 ms of which 0 ms to minimize.
[2022-06-09 02:20:52] [INFO ] Deduced a trap composed of 94 places in 342 ms of which 0 ms to minimize.
[2022-06-09 02:20:52] [INFO ] Deduced a trap composed of 19 places in 352 ms of which 0 ms to minimize.
[2022-06-09 02:20:53] [INFO ] Deduced a trap composed of 97 places in 350 ms of which 1 ms to minimize.
[2022-06-09 02:20:53] [INFO ] Deduced a trap composed of 65 places in 334 ms of which 1 ms to minimize.
[2022-06-09 02:20:54] [INFO ] Deduced a trap composed of 64 places in 325 ms of which 1 ms to minimize.
[2022-06-09 02:20:54] [INFO ] Deduced a trap composed of 101 places in 333 ms of which 2 ms to minimize.
[2022-06-09 02:20:55] [INFO ] Deduced a trap composed of 48 places in 352 ms of which 0 ms to minimize.
[2022-06-09 02:20:55] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 02:20:55] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:55] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2022-06-09 02:20:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:20:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:56] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2022-06-09 02:20:56] [INFO ] [Nat]Added 316 Read/Feed constraints in 195 ms returned sat
[2022-06-09 02:20:56] [INFO ] Deduced a trap composed of 10 places in 282 ms of which 0 ms to minimize.
[2022-06-09 02:20:56] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 1 ms to minimize.
[2022-06-09 02:20:57] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 0 ms to minimize.
[2022-06-09 02:20:57] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 0 ms to minimize.
[2022-06-09 02:20:57] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 2 ms to minimize.
[2022-06-09 02:20:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1610 ms
[2022-06-09 02:20:58] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 222 ms.
[2022-06-09 02:21:01] [INFO ] Deduced a trap composed of 15 places in 530 ms of which 1 ms to minimize.
[2022-06-09 02:21:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 2140600 steps, including 1003 resets, run finished after 9238 ms. (steps per millisecond=231 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 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.19 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 393 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 02:21:10] [INFO ] Computed 8 place invariants in 27 ms
Incomplete random walk after 1000012 steps, including 2 resets, run finished after 993 ms. (steps per millisecond=1007 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1806 ms. (steps per millisecond=553 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1904 ms. (steps per millisecond=525 ) properties (out of 6) seen :1
FORMULA BugTracking-PT-q8m064-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1735 ms. (steps per millisecond=576 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1724 ms. (steps per millisecond=580 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1708 ms. (steps per millisecond=585 ) properties (out of 5) seen :0
[2022-06-09 02:21:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:21:20] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 02:21:20] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-06-09 02:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:21] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2022-06-09 02:21:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:21:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:21:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:21] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2022-06-09 02:21:21] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:21:22] [INFO ] [Nat]Added 296 Read/Feed constraints in 193 ms returned sat
[2022-06-09 02:21:22] [INFO ] Deduced a trap composed of 64 places in 341 ms of which 1 ms to minimize.
[2022-06-09 02:21:22] [INFO ] Deduced a trap composed of 91 places in 344 ms of which 1 ms to minimize.
[2022-06-09 02:21:23] [INFO ] Deduced a trap composed of 90 places in 327 ms of which 1 ms to minimize.
[2022-06-09 02:21:23] [INFO ] Deduced a trap composed of 63 places in 322 ms of which 1 ms to minimize.
[2022-06-09 02:21:24] [INFO ] Deduced a trap composed of 63 places in 338 ms of which 0 ms to minimize.
[2022-06-09 02:21:24] [INFO ] Deduced a trap composed of 63 places in 342 ms of which 1 ms to minimize.
[2022-06-09 02:21:24] [INFO ] Deduced a trap composed of 25 places in 316 ms of which 0 ms to minimize.
[2022-06-09 02:21:25] [INFO ] Deduced a trap composed of 22 places in 346 ms of which 0 ms to minimize.
[2022-06-09 02:21:25] [INFO ] Deduced a trap composed of 91 places in 336 ms of which 1 ms to minimize.
[2022-06-09 02:21:26] [INFO ] Deduced a trap composed of 89 places in 369 ms of which 0 ms to minimize.
[2022-06-09 02:21:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4338 ms
[2022-06-09 02:21:26] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 277 ms.
[2022-06-09 02:21:30] [INFO ] Deduced a trap composed of 70 places in 354 ms of which 1 ms to minimize.
[2022-06-09 02:21:30] [INFO ] Deduced a trap composed of 17 places in 346 ms of which 0 ms to minimize.
[2022-06-09 02:21:31] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 0 ms to minimize.
[2022-06-09 02:21:31] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 1 ms to minimize.
[2022-06-09 02:21:32] [INFO ] Deduced a trap composed of 63 places in 350 ms of which 8 ms to minimize.
[2022-06-09 02:21:32] [INFO ] Deduced a trap composed of 60 places in 369 ms of which 0 ms to minimize.
[2022-06-09 02:21:33] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 0 ms to minimize.
[2022-06-09 02:21:33] [INFO ] Deduced a trap composed of 63 places in 328 ms of which 1 ms to minimize.
[2022-06-09 02:21:33] [INFO ] Deduced a trap composed of 62 places in 333 ms of which 0 ms to minimize.
[2022-06-09 02:21:34] [INFO ] Deduced a trap composed of 64 places in 329 ms of which 1 ms to minimize.
[2022-06-09 02:21:34] [INFO ] Deduced a trap composed of 63 places in 333 ms of which 0 ms to minimize.
[2022-06-09 02:21:35] [INFO ] Deduced a trap composed of 64 places in 317 ms of which 0 ms to minimize.
[2022-06-09 02:21:35] [INFO ] Deduced a trap composed of 64 places in 320 ms of which 0 ms to minimize.
[2022-06-09 02:21:36] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 3 ms to minimize.
[2022-06-09 02:21:36] [INFO ] Deduced a trap composed of 57 places in 232 ms of which 2 ms to minimize.
[2022-06-09 02:21:36] [INFO ] Deduced a trap composed of 56 places in 224 ms of which 3 ms to minimize.
[2022-06-09 02:21:37] [INFO ] Deduced a trap composed of 58 places in 220 ms of which 1 ms to minimize.
[2022-06-09 02:21:37] [INFO ] Deduced a trap composed of 61 places in 222 ms of which 1 ms to minimize.
[2022-06-09 02:21:37] [INFO ] Deduced a trap composed of 60 places in 224 ms of which 1 ms to minimize.
[2022-06-09 02:21:38] [INFO ] Deduced a trap composed of 58 places in 221 ms of which 0 ms to minimize.
[2022-06-09 02:21:38] [INFO ] Deduced a trap composed of 60 places in 224 ms of which 0 ms to minimize.
[2022-06-09 02:21:39] [INFO ] Deduced a trap composed of 58 places in 221 ms of which 0 ms to minimize.
[2022-06-09 02:21:39] [INFO ] Deduced a trap composed of 60 places in 220 ms of which 0 ms to minimize.
[2022-06-09 02:21:39] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 0 ms to minimize.
[2022-06-09 02:21:40] [INFO ] Deduced a trap composed of 57 places in 254 ms of which 0 ms to minimize.
[2022-06-09 02:21:40] [INFO ] Deduced a trap composed of 60 places in 235 ms of which 0 ms to minimize.
[2022-06-09 02:21:40] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 1 ms to minimize.
[2022-06-09 02:21:41] [INFO ] Deduced a trap composed of 59 places in 210 ms of which 2 ms to minimize.
[2022-06-09 02:21:41] [INFO ] Deduced a trap composed of 57 places in 202 ms of which 1 ms to minimize.
[2022-06-09 02:21:41] [INFO ] Deduced a trap composed of 59 places in 201 ms of which 0 ms to minimize.
[2022-06-09 02:21:42] [INFO ] Deduced a trap composed of 58 places in 207 ms of which 0 ms to minimize.
[2022-06-09 02:21:42] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 0 ms to minimize.
[2022-06-09 02:21:42] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 0 ms to minimize.
[2022-06-09 02:21:43] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 0 ms to minimize.
[2022-06-09 02:21:43] [INFO ] Deduced a trap composed of 61 places in 210 ms of which 1 ms to minimize.
[2022-06-09 02:21:43] [INFO ] Deduced a trap composed of 55 places in 210 ms of which 0 ms to minimize.
[2022-06-09 02:21:44] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 0 ms to minimize.
[2022-06-09 02:21:44] [INFO ] Deduced a trap composed of 56 places in 217 ms of which 0 ms to minimize.
[2022-06-09 02:21:45] [INFO ] Deduced a trap composed of 55 places in 207 ms of which 1 ms to minimize.
[2022-06-09 02:21:45] [INFO ] Deduced a trap composed of 60 places in 223 ms of which 0 ms to minimize.
[2022-06-09 02:21:45] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 0 ms to minimize.
[2022-06-09 02:21:46] [INFO ] Deduced a trap composed of 61 places in 223 ms of which 0 ms to minimize.
[2022-06-09 02:21:46] [INFO ] Deduced a trap composed of 57 places in 214 ms of which 0 ms to minimize.
[2022-06-09 02:21:46] [INFO ] Deduced a trap composed of 55 places in 211 ms of which 1 ms to minimize.
[2022-06-09 02:21:47] [INFO ] Deduced a trap composed of 56 places in 205 ms of which 0 ms to minimize.
[2022-06-09 02:21:47] [INFO ] Deduced a trap composed of 62 places in 223 ms of which 0 ms to minimize.
[2022-06-09 02:21:47] [INFO ] Deduced a trap composed of 60 places in 206 ms of which 0 ms to minimize.
[2022-06-09 02:21:48] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 0 ms to minimize.
[2022-06-09 02:21:48] [INFO ] Deduced a trap composed of 60 places in 211 ms of which 0 ms to minimize.
[2022-06-09 02:21:49] [INFO ] Deduced a trap composed of 61 places in 307 ms of which 0 ms to minimize.
[2022-06-09 02:21:49] [INFO ] Deduced a trap composed of 59 places in 310 ms of which 1 ms to minimize.
[2022-06-09 02:21:49] [INFO ] Deduced a trap composed of 57 places in 313 ms of which 0 ms to minimize.
[2022-06-09 02:21:50] [INFO ] Deduced a trap composed of 63 places in 347 ms of which 0 ms to minimize.
[2022-06-09 02:21:50] [INFO ] Deduced a trap composed of 88 places in 330 ms of which 0 ms to minimize.
[2022-06-09 02:21:51] [INFO ] Deduced a trap composed of 88 places in 323 ms of which 0 ms to minimize.
[2022-06-09 02:21:51] [INFO ] Deduced a trap composed of 60 places in 227 ms of which 1 ms to minimize.
[2022-06-09 02:21:52] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 0 ms to minimize.
[2022-06-09 02:21:52] [INFO ] Deduced a trap composed of 60 places in 227 ms of which 0 ms to minimize.
[2022-06-09 02:21:52] [INFO ] Deduced a trap composed of 58 places in 235 ms of which 0 ms to minimize.
[2022-06-09 02:21:53] [INFO ] Deduced a trap composed of 58 places in 238 ms of which 0 ms to minimize.
[2022-06-09 02:21:53] [INFO ] Deduced a trap composed of 58 places in 239 ms of which 0 ms to minimize.
[2022-06-09 02:21:54] [INFO ] Deduced a trap composed of 64 places in 328 ms of which 1 ms to minimize.
[2022-06-09 02:21:54] [INFO ] Deduced a trap composed of 63 places in 329 ms of which 0 ms to minimize.
[2022-06-09 02:21:54] [INFO ] Deduced a trap composed of 62 places in 335 ms of which 0 ms to minimize.
[2022-06-09 02:21:55] [INFO ] Deduced a trap composed of 60 places in 220 ms of which 0 ms to minimize.
[2022-06-09 02:21:55] [INFO ] Deduced a trap composed of 59 places in 216 ms of which 1 ms to minimize.
[2022-06-09 02:21:56] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 0 ms to minimize.
[2022-06-09 02:21:56] [INFO ] Deduced a trap composed of 60 places in 250 ms of which 1 ms to minimize.
[2022-06-09 02:21:56] [INFO ] Deduced a trap composed of 59 places in 232 ms of which 0 ms to minimize.
[2022-06-09 02:21:57] [INFO ] Deduced a trap composed of 59 places in 233 ms of which 0 ms to minimize.
[2022-06-09 02:21:57] [INFO ] Deduced a trap composed of 97 places in 307 ms of which 1 ms to minimize.
[2022-06-09 02:21:58] [INFO ] Deduced a trap composed of 96 places in 307 ms of which 0 ms to minimize.
[2022-06-09 02:21:58] [INFO ] Deduced a trap composed of 61 places in 254 ms of which 0 ms to minimize.
[2022-06-09 02:21:58] [INFO ] Deduced a trap composed of 61 places in 235 ms of which 0 ms to minimize.
[2022-06-09 02:21:59] [INFO ] Deduced a trap composed of 67 places in 331 ms of which 0 ms to minimize.
[2022-06-09 02:21:59] [INFO ] Deduced a trap composed of 68 places in 326 ms of which 0 ms to minimize.
[2022-06-09 02:22:00] [INFO ] Deduced a trap composed of 59 places in 304 ms of which 0 ms to minimize.
[2022-06-09 02:22:00] [INFO ] Deduced a trap composed of 62 places in 215 ms of which 0 ms to minimize.
[2022-06-09 02:22:00] [INFO ] Deduced a trap composed of 62 places in 211 ms of which 0 ms to minimize.
[2022-06-09 02:22:01] [INFO ] Deduced a trap composed of 62 places in 242 ms of which 1 ms to minimize.
[2022-06-09 02:22:01] [INFO ] Deduced a trap composed of 62 places in 231 ms of which 0 ms to minimize.
[2022-06-09 02:22:02] [INFO ] Deduced a trap composed of 65 places in 323 ms of which 0 ms to minimize.
[2022-06-09 02:22:02] [INFO ] Deduced a trap composed of 94 places in 309 ms of which 0 ms to minimize.
[2022-06-09 02:22:02] [INFO ] Deduced a trap composed of 60 places in 242 ms of which 6 ms to minimize.
[2022-06-09 02:22:03] [INFO ] Deduced a trap composed of 60 places in 346 ms of which 1 ms to minimize.
[2022-06-09 02:22:03] [INFO ] Deduced a trap composed of 60 places in 339 ms of which 0 ms to minimize.
[2022-06-09 02:22:04] [INFO ] Deduced a trap composed of 60 places in 241 ms of which 0 ms to minimize.
[2022-06-09 02:22:04] [INFO ] Deduced a trap composed of 60 places in 231 ms of which 1 ms to minimize.
[2022-06-09 02:22:05] [INFO ] Deduced a trap composed of 60 places in 234 ms of which 1 ms to minimize.
[2022-06-09 02:22:05] [INFO ] Deduced a trap composed of 58 places in 234 ms of which 1 ms to minimize.
[2022-06-09 02:22:05] [INFO ] Deduced a trap composed of 60 places in 234 ms of which 1 ms to minimize.
[2022-06-09 02:22:06] [INFO ] Deduced a trap composed of 57 places in 238 ms of which 0 ms to minimize.
[2022-06-09 02:22:06] [INFO ] Deduced a trap composed of 57 places in 236 ms of which 0 ms to minimize.
[2022-06-09 02:22:06] [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 02:22:06] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:07] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2022-06-09 02:22:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:22:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:22:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:07] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2022-06-09 02:22:07] [INFO ] [Nat]Added 296 Read/Feed constraints in 218 ms returned sat
[2022-06-09 02:22:08] [INFO ] Deduced a trap composed of 57 places in 263 ms of which 0 ms to minimize.
[2022-06-09 02:22:08] [INFO ] Deduced a trap composed of 55 places in 265 ms of which 0 ms to minimize.
[2022-06-09 02:22:08] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 0 ms to minimize.
[2022-06-09 02:22:09] [INFO ] Deduced a trap composed of 63 places in 249 ms of which 0 ms to minimize.
[2022-06-09 02:22:09] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 0 ms to minimize.
[2022-06-09 02:22:09] [INFO ] Deduced a trap composed of 57 places in 240 ms of which 0 ms to minimize.
[2022-06-09 02:22:10] [INFO ] Deduced a trap composed of 58 places in 239 ms of which 0 ms to minimize.
[2022-06-09 02:22:10] [INFO ] Deduced a trap composed of 60 places in 245 ms of which 0 ms to minimize.
[2022-06-09 02:22:10] [INFO ] Deduced a trap composed of 61 places in 237 ms of which 0 ms to minimize.
[2022-06-09 02:22:11] [INFO ] Deduced a trap composed of 56 places in 237 ms of which 0 ms to minimize.
[2022-06-09 02:22:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3490 ms
[2022-06-09 02:22:11] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 225 ms.
[2022-06-09 02:22:15] [INFO ] Deduced a trap composed of 54 places in 257 ms of which 1 ms to minimize.
[2022-06-09 02:22:15] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 0 ms to minimize.
[2022-06-09 02:22:16] [INFO ] Deduced a trap composed of 39 places in 263 ms of which 1 ms to minimize.
[2022-06-09 02:22:16] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 0 ms to minimize.
[2022-06-09 02:22:16] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 0 ms to minimize.
[2022-06-09 02:22:17] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 1 ms to minimize.
[2022-06-09 02:22:17] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 0 ms to minimize.
[2022-06-09 02:22:17] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 0 ms to minimize.
[2022-06-09 02:22:18] [INFO ] Deduced a trap composed of 55 places in 256 ms of which 0 ms to minimize.
[2022-06-09 02:22:18] [INFO ] Deduced a trap composed of 61 places in 261 ms of which 0 ms to minimize.
[2022-06-09 02:22:19] [INFO ] Deduced a trap composed of 58 places in 239 ms of which 0 ms to minimize.
[2022-06-09 02:22:19] [INFO ] Deduced a trap composed of 56 places in 242 ms of which 0 ms to minimize.
[2022-06-09 02:22:19] [INFO ] Deduced a trap composed of 61 places in 268 ms of which 0 ms to minimize.
[2022-06-09 02:22:20] [INFO ] Deduced a trap composed of 61 places in 266 ms of which 0 ms to minimize.
[2022-06-09 02:22:20] [INFO ] Deduced a trap composed of 63 places in 258 ms of which 1 ms to minimize.
[2022-06-09 02:22:20] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5809 ms
[2022-06-09 02:22:20] [INFO ] Added : 107 causal constraints over 22 iterations in 9579 ms. Result :sat
[2022-06-09 02:22:21] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:21] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2022-06-09 02:22:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:22:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:22] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2022-06-09 02:22:22] [INFO ] [Nat]Added 296 Read/Feed constraints in 212 ms returned sat
[2022-06-09 02:22:22] [INFO ] Deduced a trap composed of 68 places in 451 ms of which 1 ms to minimize.
[2022-06-09 02:22:23] [INFO ] Deduced a trap composed of 22 places in 325 ms of which 0 ms to minimize.
[2022-06-09 02:22:23] [INFO ] Deduced a trap composed of 98 places in 284 ms of which 0 ms to minimize.
[2022-06-09 02:22:23] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 1 ms to minimize.
[2022-06-09 02:22:24] [INFO ] Deduced a trap composed of 23 places in 371 ms of which 0 ms to minimize.
[2022-06-09 02:22:24] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2022-06-09 02:22:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2299 ms
[2022-06-09 02:22:24] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 206 ms.
[2022-06-09 02:22:28] [INFO ] Added : 123 causal constraints over 25 iterations in 3842 ms. Result :sat
[2022-06-09 02:22:28] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:29] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2022-06-09 02:22:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:22:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:22:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:29] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2022-06-09 02:22:29] [INFO ] [Nat]Added 296 Read/Feed constraints in 198 ms returned sat
[2022-06-09 02:22:30] [INFO ] Deduced a trap composed of 10 places in 431 ms of which 0 ms to minimize.
[2022-06-09 02:22:30] [INFO ] Deduced a trap composed of 5 places in 391 ms of which 0 ms to minimize.
[2022-06-09 02:22:31] [INFO ] Deduced a trap composed of 19 places in 359 ms of which 0 ms to minimize.
[2022-06-09 02:22:31] [INFO ] Deduced a trap composed of 14 places in 368 ms of which 0 ms to minimize.
[2022-06-09 02:22:32] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 0 ms to minimize.
[2022-06-09 02:22:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2268 ms
[2022-06-09 02:22:32] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 210 ms.
[2022-06-09 02:22:35] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2022-06-09 02:22:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2022-06-09 02:22:35] [INFO ] Added : 93 causal constraints over 19 iterations in 3507 ms. Result :sat
[2022-06-09 02:22:35] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:22:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:36] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2022-06-09 02:22:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:22:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:22:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:36] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2022-06-09 02:22:36] [INFO ] [Nat]Added 296 Read/Feed constraints in 183 ms returned sat
[2022-06-09 02:22:37] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 0 ms to minimize.
[2022-06-09 02:22:37] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 0 ms to minimize.
[2022-06-09 02:22:37] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 0 ms to minimize.
[2022-06-09 02:22:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 916 ms
[2022-06-09 02:22:38] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 201 ms.
[2022-06-09 02:22:42] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 1 ms to minimize.
[2022-06-09 02:22:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2022-06-09 02:22:42] [INFO ] Added : 142 causal constraints over 30 iterations in 5051 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 1215600 steps, including 1000 resets, run finished after 9644 ms. (steps per millisecond=126 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 994700 steps, including 1000 resets, run finished after 7327 ms. (steps per millisecond=135 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1214700 steps, including 1000 resets, run finished after 9161 ms. (steps per millisecond=132 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1179700 steps, including 1000 resets, run finished after 9043 ms. (steps per millisecond=130 ) properties (out of 5) seen :0 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 93 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 02:23:18] [INFO ] Computed 8 place invariants in 20 ms
Incomplete random walk after 1000035 steps, including 2 resets, run finished after 899 ms. (steps per millisecond=1112 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1740 ms. (steps per millisecond=574 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1696 ms. (steps per millisecond=589 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1715 ms. (steps per millisecond=583 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1719 ms. (steps per millisecond=581 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1701 ms. (steps per millisecond=587 ) properties (out of 5) seen :0
[2022-06-09 02:23:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:23:27] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 02:23:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:23:28] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2022-06-09 02:23:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:23:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:23:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:23:28] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2022-06-09 02:23:28] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:23:29] [INFO ] [Nat]Added 296 Read/Feed constraints in 211 ms returned sat
[2022-06-09 02:23:29] [INFO ] Deduced a trap composed of 64 places in 323 ms of which 0 ms to minimize.
[2022-06-09 02:23:29] [INFO ] Deduced a trap composed of 91 places in 332 ms of which 1 ms to minimize.
[2022-06-09 02:23:30] [INFO ] Deduced a trap composed of 90 places in 332 ms of which 0 ms to minimize.
[2022-06-09 02:23:30] [INFO ] Deduced a trap composed of 63 places in 315 ms of which 0 ms to minimize.
[2022-06-09 02:23:31] [INFO ] Deduced a trap composed of 63 places in 332 ms of which 1 ms to minimize.
[2022-06-09 02:23:31] [INFO ] Deduced a trap composed of 63 places in 328 ms of which 1 ms to minimize.
[2022-06-09 02:23:32] [INFO ] Deduced a trap composed of 25 places in 334 ms of which 0 ms to minimize.
[2022-06-09 02:23:32] [INFO ] Deduced a trap composed of 22 places in 341 ms of which 0 ms to minimize.
[2022-06-09 02:23:32] [INFO ] Deduced a trap composed of 91 places in 330 ms of which 1 ms to minimize.
[2022-06-09 02:23:33] [INFO ] Deduced a trap composed of 89 places in 324 ms of which 0 ms to minimize.
[2022-06-09 02:23:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4262 ms
[2022-06-09 02:23:33] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 213 ms.
[2022-06-09 02:23:37] [INFO ] Deduced a trap composed of 70 places in 336 ms of which 1 ms to minimize.
[2022-06-09 02:23:37] [INFO ] Deduced a trap composed of 17 places in 334 ms of which 0 ms to minimize.
[2022-06-09 02:23:38] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 1 ms to minimize.
[2022-06-09 02:23:38] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 0 ms to minimize.
[2022-06-09 02:23:39] [INFO ] Deduced a trap composed of 63 places in 344 ms of which 1 ms to minimize.
[2022-06-09 02:23:39] [INFO ] Deduced a trap composed of 60 places in 349 ms of which 0 ms to minimize.
[2022-06-09 02:23:39] [INFO ] Deduced a trap composed of 19 places in 337 ms of which 1 ms to minimize.
[2022-06-09 02:23:40] [INFO ] Deduced a trap composed of 63 places in 335 ms of which 1 ms to minimize.
[2022-06-09 02:23:40] [INFO ] Deduced a trap composed of 62 places in 317 ms of which 1 ms to minimize.
[2022-06-09 02:23:41] [INFO ] Deduced a trap composed of 64 places in 335 ms of which 1 ms to minimize.
[2022-06-09 02:23:41] [INFO ] Deduced a trap composed of 63 places in 327 ms of which 1 ms to minimize.
[2022-06-09 02:23:42] [INFO ] Deduced a trap composed of 64 places in 330 ms of which 1 ms to minimize.
[2022-06-09 02:23:42] [INFO ] Deduced a trap composed of 64 places in 327 ms of which 0 ms to minimize.
[2022-06-09 02:23:43] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 0 ms to minimize.
[2022-06-09 02:23:43] [INFO ] Deduced a trap composed of 57 places in 224 ms of which 0 ms to minimize.
[2022-06-09 02:23:43] [INFO ] Deduced a trap composed of 56 places in 235 ms of which 0 ms to minimize.
[2022-06-09 02:23:44] [INFO ] Deduced a trap composed of 58 places in 237 ms of which 0 ms to minimize.
[2022-06-09 02:23:44] [INFO ] Deduced a trap composed of 61 places in 227 ms of which 0 ms to minimize.
[2022-06-09 02:23:44] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 0 ms to minimize.
[2022-06-09 02:23:45] [INFO ] Deduced a trap composed of 58 places in 221 ms of which 1 ms to minimize.
[2022-06-09 02:23:45] [INFO ] Deduced a trap composed of 60 places in 228 ms of which 0 ms to minimize.
[2022-06-09 02:23:45] [INFO ] Deduced a trap composed of 58 places in 225 ms of which 1 ms to minimize.
[2022-06-09 02:23:46] [INFO ] Deduced a trap composed of 60 places in 230 ms of which 0 ms to minimize.
[2022-06-09 02:23:46] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 0 ms to minimize.
[2022-06-09 02:23:47] [INFO ] Deduced a trap composed of 57 places in 234 ms of which 0 ms to minimize.
[2022-06-09 02:23:47] [INFO ] Deduced a trap composed of 60 places in 233 ms of which 0 ms to minimize.
[2022-06-09 02:23:47] [INFO ] Deduced a trap composed of 58 places in 215 ms of which 1 ms to minimize.
[2022-06-09 02:23:48] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 0 ms to minimize.
[2022-06-09 02:23:48] [INFO ] Deduced a trap composed of 57 places in 205 ms of which 0 ms to minimize.
[2022-06-09 02:23:48] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 1 ms to minimize.
[2022-06-09 02:23:49] [INFO ] Deduced a trap composed of 58 places in 233 ms of which 0 ms to minimize.
[2022-06-09 02:23:49] [INFO ] Deduced a trap composed of 59 places in 241 ms of which 0 ms to minimize.
[2022-06-09 02:23:49] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 1 ms to minimize.
[2022-06-09 02:23:50] [INFO ] Deduced a trap composed of 57 places in 218 ms of which 0 ms to minimize.
[2022-06-09 02:23:50] [INFO ] Deduced a trap composed of 61 places in 221 ms of which 0 ms to minimize.
[2022-06-09 02:23:50] [INFO ] Deduced a trap composed of 55 places in 222 ms of which 3 ms to minimize.
[2022-06-09 02:23:51] [INFO ] Deduced a trap composed of 57 places in 221 ms of which 0 ms to minimize.
[2022-06-09 02:23:51] [INFO ] Deduced a trap composed of 56 places in 217 ms of which 0 ms to minimize.
[2022-06-09 02:23:52] [INFO ] Deduced a trap composed of 55 places in 210 ms of which 0 ms to minimize.
[2022-06-09 02:23:52] [INFO ] Deduced a trap composed of 60 places in 231 ms of which 0 ms to minimize.
[2022-06-09 02:23:52] [INFO ] Deduced a trap composed of 60 places in 205 ms of which 0 ms to minimize.
[2022-06-09 02:23:53] [INFO ] Deduced a trap composed of 61 places in 229 ms of which 0 ms to minimize.
[2022-06-09 02:23:53] [INFO ] Deduced a trap composed of 57 places in 214 ms of which 0 ms to minimize.
[2022-06-09 02:23:53] [INFO ] Deduced a trap composed of 55 places in 215 ms of which 0 ms to minimize.
[2022-06-09 02:23:54] [INFO ] Deduced a trap composed of 56 places in 210 ms of which 0 ms to minimize.
[2022-06-09 02:23:54] [INFO ] Deduced a trap composed of 62 places in 237 ms of which 1 ms to minimize.
[2022-06-09 02:23:54] [INFO ] Deduced a trap composed of 60 places in 232 ms of which 0 ms to minimize.
[2022-06-09 02:23:55] [INFO ] Deduced a trap composed of 60 places in 234 ms of which 1 ms to minimize.
[2022-06-09 02:23:55] [INFO ] Deduced a trap composed of 60 places in 225 ms of which 0 ms to minimize.
[2022-06-09 02:23:56] [INFO ] Deduced a trap composed of 61 places in 344 ms of which 1 ms to minimize.
[2022-06-09 02:23:56] [INFO ] Deduced a trap composed of 59 places in 343 ms of which 1 ms to minimize.
[2022-06-09 02:23:57] [INFO ] Deduced a trap composed of 57 places in 333 ms of which 1 ms to minimize.
[2022-06-09 02:23:57] [INFO ] Deduced a trap composed of 63 places in 346 ms of which 2 ms to minimize.
[2022-06-09 02:23:57] [INFO ] Deduced a trap composed of 88 places in 336 ms of which 0 ms to minimize.
[2022-06-09 02:23:58] [INFO ] Deduced a trap composed of 88 places in 336 ms of which 0 ms to minimize.
[2022-06-09 02:23:58] [INFO ] Deduced a trap composed of 60 places in 232 ms of which 1 ms to minimize.
[2022-06-09 02:23:59] [INFO ] Deduced a trap composed of 58 places in 225 ms of which 1 ms to minimize.
[2022-06-09 02:23:59] [INFO ] Deduced a trap composed of 60 places in 235 ms of which 0 ms to minimize.
[2022-06-09 02:23:59] [INFO ] Deduced a trap composed of 58 places in 237 ms of which 5 ms to minimize.
[2022-06-09 02:24:00] [INFO ] Deduced a trap composed of 58 places in 213 ms of which 4 ms to minimize.
[2022-06-09 02:24:00] [INFO ] Deduced a trap composed of 58 places in 231 ms of which 0 ms to minimize.
[2022-06-09 02:24:01] [INFO ] Deduced a trap composed of 64 places in 331 ms of which 0 ms to minimize.
[2022-06-09 02:24:01] [INFO ] Deduced a trap composed of 63 places in 327 ms of which 0 ms to minimize.
[2022-06-09 02:24:01] [INFO ] Deduced a trap composed of 62 places in 328 ms of which 0 ms to minimize.
[2022-06-09 02:24:02] [INFO ] Deduced a trap composed of 60 places in 225 ms of which 1 ms to minimize.
[2022-06-09 02:24:02] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 1 ms to minimize.
[2022-06-09 02:24:03] [INFO ] Deduced a trap composed of 59 places in 235 ms of which 0 ms to minimize.
[2022-06-09 02:24:03] [INFO ] Deduced a trap composed of 60 places in 229 ms of which 0 ms to minimize.
[2022-06-09 02:24:03] [INFO ] Deduced a trap composed of 59 places in 217 ms of which 0 ms to minimize.
[2022-06-09 02:24:04] [INFO ] Deduced a trap composed of 59 places in 228 ms of which 1 ms to minimize.
[2022-06-09 02:24:04] [INFO ] Deduced a trap composed of 97 places in 338 ms of which 0 ms to minimize.
[2022-06-09 02:24:05] [INFO ] Deduced a trap composed of 96 places in 354 ms of which 1 ms to minimize.
[2022-06-09 02:24:05] [INFO ] Deduced a trap composed of 61 places in 234 ms of which 0 ms to minimize.
[2022-06-09 02:24:05] [INFO ] Deduced a trap composed of 61 places in 268 ms of which 0 ms to minimize.
[2022-06-09 02:24:06] [INFO ] Deduced a trap composed of 67 places in 371 ms of which 0 ms to minimize.
[2022-06-09 02:24:06] [INFO ] Deduced a trap composed of 68 places in 366 ms of which 0 ms to minimize.
[2022-06-09 02:24:07] [INFO ] Deduced a trap composed of 59 places in 368 ms of which 0 ms to minimize.
[2022-06-09 02:24:07] [INFO ] Deduced a trap composed of 62 places in 254 ms of which 0 ms to minimize.
[2022-06-09 02:24:08] [INFO ] Deduced a trap composed of 62 places in 260 ms of which 1 ms to minimize.
[2022-06-09 02:24:08] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 0 ms to minimize.
[2022-06-09 02:24:08] [INFO ] Deduced a trap composed of 62 places in 251 ms of which 1 ms to minimize.
[2022-06-09 02:24:09] [INFO ] Deduced a trap composed of 65 places in 368 ms of which 0 ms to minimize.
[2022-06-09 02:24:09] [INFO ] Deduced a trap composed of 94 places in 365 ms of which 1 ms to minimize.
[2022-06-09 02:24:10] [INFO ] Deduced a trap composed of 60 places in 259 ms of which 0 ms to minimize.
[2022-06-09 02:24:10] [INFO ] Deduced a trap composed of 60 places in 364 ms of which 0 ms to minimize.
[2022-06-09 02:24:11] [INFO ] Deduced a trap composed of 60 places in 361 ms of which 0 ms to minimize.
[2022-06-09 02:24:11] [INFO ] Deduced a trap composed of 60 places in 226 ms of which 0 ms to minimize.
[2022-06-09 02:24:12] [INFO ] Deduced a trap composed of 60 places in 232 ms of which 1 ms to minimize.
[2022-06-09 02:24:12] [INFO ] Deduced a trap composed of 60 places in 228 ms of which 0 ms to minimize.
[2022-06-09 02:24:12] [INFO ] Deduced a trap composed of 58 places in 226 ms of which 0 ms to minimize.
[2022-06-09 02:24:13] [INFO ] Deduced a trap composed of 60 places in 241 ms of which 0 ms to minimize.
[2022-06-09 02:24:13] [INFO ] Deduced a trap composed of 57 places in 227 ms of which 0 ms to minimize.
[2022-06-09 02:24:13] [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 02:24:13] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:14] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2022-06-09 02:24:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:24:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:24:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:14] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2022-06-09 02:24:14] [INFO ] [Nat]Added 296 Read/Feed constraints in 207 ms returned sat
[2022-06-09 02:24:15] [INFO ] Deduced a trap composed of 57 places in 247 ms of which 1 ms to minimize.
[2022-06-09 02:24:15] [INFO ] Deduced a trap composed of 55 places in 245 ms of which 0 ms to minimize.
[2022-06-09 02:24:15] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 0 ms to minimize.
[2022-06-09 02:24:16] [INFO ] Deduced a trap composed of 63 places in 252 ms of which 1 ms to minimize.
[2022-06-09 02:24:16] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 1 ms to minimize.
[2022-06-09 02:24:16] [INFO ] Deduced a trap composed of 57 places in 243 ms of which 1 ms to minimize.
[2022-06-09 02:24:17] [INFO ] Deduced a trap composed of 58 places in 233 ms of which 0 ms to minimize.
[2022-06-09 02:24:17] [INFO ] Deduced a trap composed of 60 places in 230 ms of which 1 ms to minimize.
[2022-06-09 02:24:17] [INFO ] Deduced a trap composed of 61 places in 234 ms of which 0 ms to minimize.
[2022-06-09 02:24:18] [INFO ] Deduced a trap composed of 56 places in 248 ms of which 1 ms to minimize.
[2022-06-09 02:24:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3371 ms
[2022-06-09 02:24:18] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 215 ms.
[2022-06-09 02:24:21] [INFO ] Deduced a trap composed of 54 places in 267 ms of which 0 ms to minimize.
[2022-06-09 02:24:22] [INFO ] Deduced a trap composed of 20 places in 264 ms of which 1 ms to minimize.
[2022-06-09 02:24:22] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 0 ms to minimize.
[2022-06-09 02:24:23] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 0 ms to minimize.
[2022-06-09 02:24:23] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 0 ms to minimize.
[2022-06-09 02:24:23] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 0 ms to minimize.
[2022-06-09 02:24:24] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 0 ms to minimize.
[2022-06-09 02:24:24] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 1 ms to minimize.
[2022-06-09 02:24:24] [INFO ] Deduced a trap composed of 55 places in 262 ms of which 0 ms to minimize.
[2022-06-09 02:24:25] [INFO ] Deduced a trap composed of 61 places in 248 ms of which 0 ms to minimize.
[2022-06-09 02:24:25] [INFO ] Deduced a trap composed of 58 places in 241 ms of which 0 ms to minimize.
[2022-06-09 02:24:26] [INFO ] Deduced a trap composed of 56 places in 247 ms of which 0 ms to minimize.
[2022-06-09 02:24:26] [INFO ] Deduced a trap composed of 61 places in 239 ms of which 1 ms to minimize.
[2022-06-09 02:24:26] [INFO ] Deduced a trap composed of 61 places in 263 ms of which 1 ms to minimize.
[2022-06-09 02:24:27] [INFO ] Deduced a trap composed of 63 places in 254 ms of which 0 ms to minimize.
[2022-06-09 02:24:27] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5702 ms
[2022-06-09 02:24:27] [INFO ] Added : 107 causal constraints over 22 iterations in 9352 ms. Result :sat
[2022-06-09 02:24:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:24:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:28] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2022-06-09 02:24:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:24:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:24:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:28] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2022-06-09 02:24:28] [INFO ] [Nat]Added 296 Read/Feed constraints in 210 ms returned sat
[2022-06-09 02:24:29] [INFO ] Deduced a trap composed of 68 places in 441 ms of which 1 ms to minimize.
[2022-06-09 02:24:29] [INFO ] Deduced a trap composed of 22 places in 342 ms of which 0 ms to minimize.
[2022-06-09 02:24:30] [INFO ] Deduced a trap composed of 98 places in 287 ms of which 0 ms to minimize.
[2022-06-09 02:24:30] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 0 ms to minimize.
[2022-06-09 02:24:30] [INFO ] Deduced a trap composed of 23 places in 375 ms of which 0 ms to minimize.
[2022-06-09 02:24:31] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2022-06-09 02:24:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2304 ms
[2022-06-09 02:24:31] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 213 ms.
[2022-06-09 02:24:35] [INFO ] Added : 123 causal constraints over 25 iterations in 4043 ms. Result :sat
[2022-06-09 02:24:35] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:24:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:35] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2022-06-09 02:24:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:24:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:24:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:36] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2022-06-09 02:24:36] [INFO ] [Nat]Added 296 Read/Feed constraints in 211 ms returned sat
[2022-06-09 02:24:37] [INFO ] Deduced a trap composed of 10 places in 437 ms of which 0 ms to minimize.
[2022-06-09 02:24:37] [INFO ] Deduced a trap composed of 5 places in 399 ms of which 0 ms to minimize.
[2022-06-09 02:24:38] [INFO ] Deduced a trap composed of 19 places in 377 ms of which 0 ms to minimize.
[2022-06-09 02:24:38] [INFO ] Deduced a trap composed of 14 places in 359 ms of which 1 ms to minimize.
[2022-06-09 02:24:38] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 1 ms to minimize.
[2022-06-09 02:24:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2279 ms
[2022-06-09 02:24:39] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 216 ms.
[2022-06-09 02:24:42] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2022-06-09 02:24:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2022-06-09 02:24:42] [INFO ] Added : 93 causal constraints over 19 iterations in 3521 ms. Result :sat
[2022-06-09 02:24:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:43] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2022-06-09 02:24:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:24:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:24:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:43] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2022-06-09 02:24:43] [INFO ] [Nat]Added 296 Read/Feed constraints in 179 ms returned sat
[2022-06-09 02:24:44] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 0 ms to minimize.
[2022-06-09 02:24:44] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 0 ms to minimize.
[2022-06-09 02:24:44] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 1 ms to minimize.
[2022-06-09 02:24:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 933 ms
[2022-06-09 02:24:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 213 ms.
[2022-06-09 02:24:49] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 0 ms to minimize.
[2022-06-09 02:24:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 422 ms
[2022-06-09 02:24:50] [INFO ] Added : 142 causal constraints over 30 iterations in 5346 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 1215600 steps, including 1000 resets, run finished after 9739 ms. (steps per millisecond=124 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 994700 steps, including 1000 resets, run finished after 7310 ms. (steps per millisecond=136 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1214700 steps, including 1000 resets, run finished after 9056 ms. (steps per millisecond=134 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1179700 steps, including 1000 resets, run finished after 8985 ms. (steps per millisecond=131 ) properties (out of 5) seen :0 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 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.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 54 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:25:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:25:25] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 02:25:25] [INFO ] Implicit Places using invariants in 488 ms returned []
[2022-06-09 02:25:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:25:25] [INFO ] Computed 8 place invariants in 20 ms
[2022-06-09 02:25:26] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:25:32] [INFO ] Implicit Places using invariants and state equation in 6954 ms returned []
Implicit Place search using SMT with State Equation took 7444 ms to find 0 implicit places.
[2022-06-09 02:25:33] [INFO ] Redundant transitions in 318 ms returned []
[2022-06-09 02:25:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:25:33] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 02:25:34] [INFO ] Dead Transitions using invariants and state equation in 1032 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m064-UpperBounds-03
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:25:34] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10024 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=771 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2022-06-09 02:25:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:25:34] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 02:25:34] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:25:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:34] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2022-06-09 02:25:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:25:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:25:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:35] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2022-06-09 02:25:35] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:25:35] [INFO ] [Nat]Added 296 Read/Feed constraints in 224 ms returned sat
[2022-06-09 02:25:36] [INFO ] Deduced a trap composed of 64 places in 353 ms of which 0 ms to minimize.
[2022-06-09 02:25:36] [INFO ] Deduced a trap composed of 91 places in 360 ms of which 0 ms to minimize.
[2022-06-09 02:25:36] [INFO ] Deduced a trap composed of 90 places in 350 ms of which 1 ms to minimize.
[2022-06-09 02:25:37] [INFO ] Deduced a trap composed of 63 places in 359 ms of which 0 ms to minimize.
[2022-06-09 02:25:37] [INFO ] Deduced a trap composed of 63 places in 361 ms of which 0 ms to minimize.
[2022-06-09 02:25:38] [INFO ] Deduced a trap composed of 63 places in 358 ms of which 0 ms to minimize.
[2022-06-09 02:25:38] [INFO ] Deduced a trap composed of 25 places in 357 ms of which 1 ms to minimize.
[2022-06-09 02:25:39] [INFO ] Deduced a trap composed of 22 places in 368 ms of which 0 ms to minimize.
[2022-06-09 02:25:39] [INFO ] Deduced a trap composed of 91 places in 333 ms of which 0 ms to minimize.
[2022-06-09 02:25:40] [INFO ] Deduced a trap composed of 89 places in 371 ms of which 0 ms to minimize.
[2022-06-09 02:25: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 60 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 02:25:40] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000024 steps, including 2 resets, run finished after 756 ms. (steps per millisecond=1322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1696 ms. (steps per millisecond=589 ) properties (out of 1) seen :0
[2022-06-09 02:25:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:25:42] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 02:25:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:43] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2022-06-09 02:25:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:25:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:25:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:43] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2022-06-09 02:25:43] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:25:43] [INFO ] [Nat]Added 296 Read/Feed constraints in 206 ms returned sat
[2022-06-09 02:25:44] [INFO ] Deduced a trap composed of 64 places in 333 ms of which 0 ms to minimize.
[2022-06-09 02:25:44] [INFO ] Deduced a trap composed of 91 places in 318 ms of which 0 ms to minimize.
[2022-06-09 02:25:45] [INFO ] Deduced a trap composed of 90 places in 342 ms of which 0 ms to minimize.
[2022-06-09 02:25:45] [INFO ] Deduced a trap composed of 63 places in 343 ms of which 0 ms to minimize.
[2022-06-09 02:25:45] [INFO ] Deduced a trap composed of 63 places in 350 ms of which 0 ms to minimize.
[2022-06-09 02:25:46] [INFO ] Deduced a trap composed of 63 places in 346 ms of which 0 ms to minimize.
[2022-06-09 02:25:46] [INFO ] Deduced a trap composed of 25 places in 348 ms of which 0 ms to minimize.
[2022-06-09 02:25:47] [INFO ] Deduced a trap composed of 22 places in 354 ms of which 0 ms to minimize.
[2022-06-09 02:25:47] [INFO ] Deduced a trap composed of 91 places in 371 ms of which 0 ms to minimize.
[2022-06-09 02:25:48] [INFO ] Deduced a trap composed of 89 places in 359 ms of which 0 ms to minimize.
[2022-06-09 02:25:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4438 ms
[2022-06-09 02:25:48] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 205 ms.
[2022-06-09 02:25:52] [INFO ] Deduced a trap composed of 70 places in 341 ms of which 0 ms to minimize.
[2022-06-09 02:25:52] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 0 ms to minimize.
[2022-06-09 02:25:53] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 0 ms to minimize.
[2022-06-09 02:25:53] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 0 ms to minimize.
[2022-06-09 02:25:53] [INFO ] Deduced a trap composed of 63 places in 346 ms of which 0 ms to minimize.
[2022-06-09 02:25:54] [INFO ] Deduced a trap composed of 60 places in 347 ms of which 0 ms to minimize.
[2022-06-09 02:25:54] [INFO ] Deduced a trap composed of 19 places in 335 ms of which 0 ms to minimize.
[2022-06-09 02:25:55] [INFO ] Deduced a trap composed of 63 places in 318 ms of which 0 ms to minimize.
[2022-06-09 02:25:55] [INFO ] Deduced a trap composed of 62 places in 340 ms of which 0 ms to minimize.
[2022-06-09 02:25:56] [INFO ] Deduced a trap composed of 64 places in 339 ms of which 0 ms to minimize.
[2022-06-09 02:25:56] [INFO ] Deduced a trap composed of 63 places in 334 ms of which 0 ms to minimize.
[2022-06-09 02:25:57] [INFO ] Deduced a trap composed of 64 places in 337 ms of which 0 ms to minimize.
[2022-06-09 02:25:57] [INFO ] Deduced a trap composed of 64 places in 335 ms of which 0 ms to minimize.
[2022-06-09 02:25:58] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 1 ms to minimize.
[2022-06-09 02:25:58] [INFO ] Deduced a trap composed of 57 places in 246 ms of which 0 ms to minimize.
[2022-06-09 02:25:58] [INFO ] Deduced a trap composed of 56 places in 226 ms of which 1 ms to minimize.
[2022-06-09 02:25:59] [INFO ] Deduced a trap composed of 58 places in 234 ms of which 0 ms to minimize.
[2022-06-09 02:25:59] [INFO ] Deduced a trap composed of 61 places in 239 ms of which 0 ms to minimize.
[2022-06-09 02:25:59] [INFO ] Deduced a trap composed of 60 places in 223 ms of which 0 ms to minimize.
[2022-06-09 02:26:00] [INFO ] Deduced a trap composed of 58 places in 220 ms of which 1 ms to minimize.
[2022-06-09 02:26:00] [INFO ] Deduced a trap composed of 60 places in 233 ms of which 0 ms to minimize.
[2022-06-09 02:26:00] [INFO ] Deduced a trap composed of 58 places in 221 ms of which 0 ms to minimize.
[2022-06-09 02:26:01] [INFO ] Deduced a trap composed of 60 places in 223 ms of which 0 ms to minimize.
[2022-06-09 02:26:01] [INFO ] Deduced a trap composed of 58 places in 235 ms of which 1 ms to minimize.
[2022-06-09 02:26:02] [INFO ] Deduced a trap composed of 57 places in 233 ms of which 0 ms to minimize.
[2022-06-09 02:26:02] [INFO ] Deduced a trap composed of 60 places in 231 ms of which 0 ms to minimize.
[2022-06-09 02:26:02] [INFO ] Deduced a trap composed of 58 places in 217 ms of which 0 ms to minimize.
[2022-06-09 02:26:03] [INFO ] Deduced a trap composed of 59 places in 226 ms of which 0 ms to minimize.
[2022-06-09 02:26:03] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 1 ms to minimize.
[2022-06-09 02:26:03] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 0 ms to minimize.
[2022-06-09 02:26:04] [INFO ] Deduced a trap composed of 58 places in 218 ms of which 0 ms to minimize.
[2022-06-09 02:26:04] [INFO ] Deduced a trap composed of 59 places in 221 ms of which 0 ms to minimize.
[2022-06-09 02:26:04] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 1 ms to minimize.
[2022-06-09 02:26:05] [INFO ] Deduced a trap composed of 57 places in 233 ms of which 0 ms to minimize.
[2022-06-09 02:26:05] [INFO ] Deduced a trap composed of 61 places in 230 ms of which 0 ms to minimize.
[2022-06-09 02:26:05] [INFO ] Deduced a trap composed of 55 places in 226 ms of which 1 ms to minimize.
[2022-06-09 02:26:06] [INFO ] Deduced a trap composed of 57 places in 235 ms of which 0 ms to minimize.
[2022-06-09 02:26:06] [INFO ] Deduced a trap composed of 56 places in 224 ms of which 1 ms to minimize.
[2022-06-09 02:26:07] [INFO ] Deduced a trap composed of 55 places in 233 ms of which 0 ms to minimize.
[2022-06-09 02:26:07] [INFO ] Deduced a trap composed of 60 places in 225 ms of which 0 ms to minimize.
[2022-06-09 02:26:07] [INFO ] Deduced a trap composed of 60 places in 232 ms of which 0 ms to minimize.
[2022-06-09 02:26:08] [INFO ] Deduced a trap composed of 61 places in 238 ms of which 1 ms to minimize.
[2022-06-09 02:26:08] [INFO ] Deduced a trap composed of 57 places in 231 ms of which 0 ms to minimize.
[2022-06-09 02:26:08] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 0 ms to minimize.
[2022-06-09 02:26:09] [INFO ] Deduced a trap composed of 56 places in 238 ms of which 0 ms to minimize.
[2022-06-09 02:26:09] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 0 ms to minimize.
[2022-06-09 02:26:09] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 0 ms to minimize.
[2022-06-09 02:26:10] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 0 ms to minimize.
[2022-06-09 02:26:10] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 0 ms to minimize.
[2022-06-09 02:26:11] [INFO ] Deduced a trap composed of 61 places in 343 ms of which 1 ms to minimize.
[2022-06-09 02:26:11] [INFO ] Deduced a trap composed of 59 places in 341 ms of which 1 ms to minimize.
[2022-06-09 02:26:12] [INFO ] Deduced a trap composed of 57 places in 346 ms of which 1 ms to minimize.
[2022-06-09 02:26:12] [INFO ] Deduced a trap composed of 63 places in 345 ms of which 0 ms to minimize.
[2022-06-09 02:26:13] [INFO ] Deduced a trap composed of 88 places in 343 ms of which 0 ms to minimize.
[2022-06-09 02:26:13] [INFO ] Deduced a trap composed of 88 places in 331 ms of which 1 ms to minimize.
[2022-06-09 02:26:13] [INFO ] Deduced a trap composed of 60 places in 238 ms of which 1 ms to minimize.
[2022-06-09 02:26:14] [INFO ] Deduced a trap composed of 58 places in 241 ms of which 1 ms to minimize.
[2022-06-09 02:26:14] [INFO ] Deduced a trap composed of 60 places in 240 ms of which 1 ms to minimize.
[2022-06-09 02:26:15] [INFO ] Deduced a trap composed of 58 places in 243 ms of which 0 ms to minimize.
[2022-06-09 02:26:15] [INFO ] Deduced a trap composed of 58 places in 236 ms of which 0 ms to minimize.
[2022-06-09 02:26:15] [INFO ] Deduced a trap composed of 58 places in 207 ms of which 0 ms to minimize.
[2022-06-09 02:26:16] [INFO ] Deduced a trap composed of 64 places in 317 ms of which 0 ms to minimize.
[2022-06-09 02:26:16] [INFO ] Deduced a trap composed of 63 places in 301 ms of which 0 ms to minimize.
[2022-06-09 02:26:17] [INFO ] Deduced a trap composed of 62 places in 347 ms of which 0 ms to minimize.
[2022-06-09 02:26:17] [INFO ] Deduced a trap composed of 60 places in 236 ms of which 0 ms to minimize.
[2022-06-09 02:26:17] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 0 ms to minimize.
[2022-06-09 02:26:18] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 0 ms to minimize.
[2022-06-09 02:26:18] [INFO ] Deduced a trap composed of 60 places in 228 ms of which 1 ms to minimize.
[2022-06-09 02:26:18] [INFO ] Deduced a trap composed of 59 places in 237 ms of which 0 ms to minimize.
[2022-06-09 02:26:19] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 1 ms to minimize.
[2022-06-09 02:26:19] [INFO ] Deduced a trap composed of 97 places in 333 ms of which 1 ms to minimize.
[2022-06-09 02:26:20] [INFO ] Deduced a trap composed of 96 places in 337 ms of which 0 ms to minimize.
[2022-06-09 02:26:20] [INFO ] Deduced a trap composed of 61 places in 221 ms of which 0 ms to minimize.
[2022-06-09 02:26:20] [INFO ] Deduced a trap composed of 61 places in 219 ms of which 0 ms to minimize.
[2022-06-09 02:26:21] [INFO ] Deduced a trap composed of 67 places in 318 ms of which 1 ms to minimize.
[2022-06-09 02:26:21] [INFO ] Deduced a trap composed of 68 places in 313 ms of which 1 ms to minimize.
[2022-06-09 02:26:22] [INFO ] Deduced a trap composed of 59 places in 313 ms of which 1 ms to minimize.
[2022-06-09 02:26:22] [INFO ] Deduced a trap composed of 62 places in 219 ms of which 0 ms to minimize.
[2022-06-09 02:26:22] [INFO ] Deduced a trap composed of 62 places in 222 ms of which 0 ms to minimize.
[2022-06-09 02:26:23] [INFO ] Deduced a trap composed of 62 places in 237 ms of which 0 ms to minimize.
[2022-06-09 02:26:23] [INFO ] Deduced a trap composed of 62 places in 235 ms of which 0 ms to minimize.
[2022-06-09 02:26:24] [INFO ] Deduced a trap composed of 65 places in 334 ms of which 1 ms to minimize.
[2022-06-09 02:26:24] [INFO ] Deduced a trap composed of 94 places in 337 ms of which 1 ms to minimize.
[2022-06-09 02:26:25] [INFO ] Deduced a trap composed of 60 places in 218 ms of which 1 ms to minimize.
[2022-06-09 02:26:25] [INFO ] Deduced a trap composed of 60 places in 308 ms of which 0 ms to minimize.
[2022-06-09 02:26:25] [INFO ] Deduced a trap composed of 60 places in 325 ms of which 0 ms to minimize.
[2022-06-09 02:26:26] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 1 ms to minimize.
[2022-06-09 02:26:26] [INFO ] Deduced a trap composed of 60 places in 220 ms of which 1 ms to minimize.
[2022-06-09 02:26:26] [INFO ] Deduced a trap composed of 60 places in 230 ms of which 0 ms to minimize.
[2022-06-09 02:26:27] [INFO ] Deduced a trap composed of 58 places in 222 ms of which 0 ms to minimize.
[2022-06-09 02:26:27] [INFO ] Deduced a trap composed of 60 places in 205 ms of which 1 ms to minimize.
[2022-06-09 02:26:28] [INFO ] Deduced a trap composed of 57 places in 224 ms of which 0 ms to minimize.
[2022-06-09 02:26:28] [INFO ] Deduced a trap composed of 57 places in 223 ms of which 1 ms to minimize.
[2022-06-09 02:26:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 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 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:26:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:26:28] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 02:26:28] [INFO ] Implicit Places using invariants in 427 ms returned []
[2022-06-09 02:26:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:26:28] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 02:26:29] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:26:36] [INFO ] Implicit Places using invariants and state equation in 7150 ms returned []
Implicit Place search using SMT with State Equation took 7583 ms to find 0 implicit places.
[2022-06-09 02:26:36] [INFO ] Redundant transitions in 261 ms returned []
[2022-06-09 02:26:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:26:36] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 02:26:37] [INFO ] Dead Transitions using invariants and state equation in 1000 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m064-UpperBounds-03 in 63090 ms.
Starting property specific reduction for BugTracking-PT-q8m064-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:26:37] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 10035 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1003 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2022-06-09 02:26:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:26:37] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 02:26:37] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:26:37] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2022-06-09 02:26:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:26:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:26:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:26:38] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2022-06-09 02:26:38] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:26:38] [INFO ] [Nat]Added 296 Read/Feed constraints in 203 ms returned sat
[2022-06-09 02:26:39] [INFO ] Deduced a trap composed of 57 places in 297 ms of which 0 ms to minimize.
[2022-06-09 02:26:39] [INFO ] Deduced a trap composed of 55 places in 254 ms of which 0 ms to minimize.
[2022-06-09 02:26:39] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 0 ms to minimize.
[2022-06-09 02:26:40] [INFO ] Deduced a trap composed of 63 places in 264 ms of which 0 ms to minimize.
[2022-06-09 02:26:40] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 0 ms to minimize.
[2022-06-09 02:26:40] [INFO ] Deduced a trap composed of 57 places in 241 ms of which 0 ms to minimize.
[2022-06-09 02:26:41] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 0 ms to minimize.
[2022-06-09 02:26:41] [INFO ] Deduced a trap composed of 60 places in 249 ms of which 1 ms to minimize.
[2022-06-09 02:26:41] [INFO ] Deduced a trap composed of 61 places in 241 ms of which 0 ms to minimize.
[2022-06-09 02:26:42] [INFO ] Deduced a trap composed of 56 places in 246 ms of which 0 ms to minimize.
[2022-06-09 02:26:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3496 ms
[2022-06-09 02:26:42] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 206 ms.
[2022-06-09 02:26:43] [INFO ] Deduced a trap composed of 7 places in 531 ms of which 1 ms to minimize.
[2022-06-09 02:26:43] [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 54 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:26:43] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 929 ms. (steps per millisecond=1076 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1755 ms. (steps per millisecond=569 ) properties (out of 1) seen :0
[2022-06-09 02:26:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:26:46] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 02:26:46] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:26:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:26:46] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2022-06-09 02:26:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:26:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:26:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:26:47] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2022-06-09 02:26:47] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:26:47] [INFO ] [Nat]Added 296 Read/Feed constraints in 213 ms returned sat
[2022-06-09 02:26:47] [INFO ] Deduced a trap composed of 57 places in 271 ms of which 0 ms to minimize.
[2022-06-09 02:26:48] [INFO ] Deduced a trap composed of 55 places in 269 ms of which 0 ms to minimize.
[2022-06-09 02:26:48] [INFO ] Deduced a trap composed of 10 places in 270 ms of which 0 ms to minimize.
[2022-06-09 02:26:49] [INFO ] Deduced a trap composed of 63 places in 266 ms of which 0 ms to minimize.
[2022-06-09 02:26:49] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 0 ms to minimize.
[2022-06-09 02:26:49] [INFO ] Deduced a trap composed of 57 places in 257 ms of which 0 ms to minimize.
[2022-06-09 02:26:50] [INFO ] Deduced a trap composed of 58 places in 255 ms of which 0 ms to minimize.
[2022-06-09 02:26:50] [INFO ] Deduced a trap composed of 60 places in 260 ms of which 0 ms to minimize.
[2022-06-09 02:26:50] [INFO ] Deduced a trap composed of 61 places in 256 ms of which 0 ms to minimize.
[2022-06-09 02:26:51] [INFO ] Deduced a trap composed of 56 places in 263 ms of which 1 ms to minimize.
[2022-06-09 02:26:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3585 ms
[2022-06-09 02:26:51] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 248 ms.
[2022-06-09 02:26:55] [INFO ] Deduced a trap composed of 54 places in 270 ms of which 0 ms to minimize.
[2022-06-09 02:26:55] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 1 ms to minimize.
[2022-06-09 02:26:55] [INFO ] Deduced a trap composed of 39 places in 263 ms of which 1 ms to minimize.
[2022-06-09 02:26:56] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 0 ms to minimize.
[2022-06-09 02:26:56] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 1 ms to minimize.
[2022-06-09 02:26:56] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 1 ms to minimize.
[2022-06-09 02:26:57] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 0 ms to minimize.
[2022-06-09 02:26:57] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2022-06-09 02:26:57] [INFO ] Deduced a trap composed of 55 places in 255 ms of which 0 ms to minimize.
[2022-06-09 02:26:58] [INFO ] Deduced a trap composed of 61 places in 252 ms of which 0 ms to minimize.
[2022-06-09 02:26:58] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 0 ms to minimize.
[2022-06-09 02:26:59] [INFO ] Deduced a trap composed of 56 places in 248 ms of which 0 ms to minimize.
[2022-06-09 02:26:59] [INFO ] Deduced a trap composed of 61 places in 249 ms of which 0 ms to minimize.
[2022-06-09 02:26:59] [INFO ] Deduced a trap composed of 61 places in 252 ms of which 1 ms to minimize.
[2022-06-09 02:27:00] [INFO ] Deduced a trap composed of 63 places in 270 ms of which 0 ms to minimize.
[2022-06-09 02:27:00] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5760 ms
[2022-06-09 02:27:00] [INFO ] Added : 107 causal constraints over 22 iterations in 9444 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1179700 steps, including 1000 resets, run finished after 9156 ms. (steps per millisecond=128 ) 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 51 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:27:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:10] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 02:27:10] [INFO ] Implicit Places using invariants in 413 ms returned []
[2022-06-09 02:27:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:10] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 02:27:10] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:27:17] [INFO ] Implicit Places using invariants and state equation in 7269 ms returned []
Implicit Place search using SMT with State Equation took 7684 ms to find 0 implicit places.
[2022-06-09 02:27:17] [INFO ] Redundant transitions in 127 ms returned []
[2022-06-09 02:27:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:17] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 02:27:18] [INFO ] Dead Transitions using invariants and state equation in 1062 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m064-UpperBounds-08 in 41540 ms.
Starting property specific reduction for BugTracking-PT-q8m064-UpperBounds-09
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:18] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10018 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=910 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2022-06-09 02:27:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:18] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 02:27:18] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-09 02:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:27:19] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2022-06-09 02:27:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:27:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:27:20] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2022-06-09 02:27:20] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:27:20] [INFO ] [Nat]Added 296 Read/Feed constraints in 214 ms returned sat
[2022-06-09 02:27:20] [INFO ] Deduced a trap composed of 68 places in 471 ms of which 1 ms to minimize.
[2022-06-09 02:27:21] [INFO ] Deduced a trap composed of 22 places in 365 ms of which 0 ms to minimize.
[2022-06-09 02:27:21] [INFO ] Deduced a trap composed of 98 places in 303 ms of which 0 ms to minimize.
[2022-06-09 02:27:21] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 0 ms to minimize.
[2022-06-09 02:27:22] [INFO ] Deduced a trap composed of 23 places in 388 ms of which 0 ms to minimize.
[2022-06-09 02:27:22] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2022-06-09 02:27:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2399 ms
[2022-06-09 02:27:22] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 245 ms.
[2022-06-09 02:27: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 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 51 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 02:27:24] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 1000023 steps, including 2 resets, run finished after 909 ms. (steps per millisecond=1100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1734 ms. (steps per millisecond=576 ) properties (out of 1) seen :0
[2022-06-09 02:27:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:27] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 02:27:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:27:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:27:27] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2022-06-09 02:27:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:27:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:27:28] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2022-06-09 02:27:28] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:27:28] [INFO ] [Nat]Added 296 Read/Feed constraints in 215 ms returned sat
[2022-06-09 02:27:29] [INFO ] Deduced a trap composed of 68 places in 459 ms of which 0 ms to minimize.
[2022-06-09 02:27:29] [INFO ] Deduced a trap composed of 22 places in 364 ms of which 1 ms to minimize.
[2022-06-09 02:27:30] [INFO ] Deduced a trap composed of 98 places in 318 ms of which 0 ms to minimize.
[2022-06-09 02:27:30] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 1 ms to minimize.
[2022-06-09 02:27:30] [INFO ] Deduced a trap composed of 23 places in 410 ms of which 1 ms to minimize.
[2022-06-09 02:27:30] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2022-06-09 02:27:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2445 ms
[2022-06-09 02:27:31] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 215 ms.
[2022-06-09 02:27:35] [INFO ] Added : 123 causal constraints over 25 iterations in 4078 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1214700 steps, including 1000 resets, run finished after 9153 ms. (steps per millisecond=132 ) 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 49 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 49 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:27:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:44] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 02:27:44] [INFO ] Implicit Places using invariants in 400 ms returned []
[2022-06-09 02:27:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:44] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 02:27:45] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:27:51] [INFO ] Implicit Places using invariants and state equation in 6793 ms returned []
Implicit Place search using SMT with State Equation took 7195 ms to find 0 implicit places.
[2022-06-09 02:27:51] [INFO ] Redundant transitions in 125 ms returned []
[2022-06-09 02:27:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:51] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 02:27:52] [INFO ] Dead Transitions using invariants and state equation in 1011 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m064-UpperBounds-09 in 33955 ms.
Starting property specific reduction for BugTracking-PT-q8m064-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:52] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2022-06-09 02:27:52] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:52] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 02:27:52] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:27:53] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2022-06-09 02:27:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:27:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:27:53] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2022-06-09 02:27:53] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:27:54] [INFO ] [Nat]Added 296 Read/Feed constraints in 208 ms returned sat
[2022-06-09 02:27:54] [INFO ] Deduced a trap composed of 10 places in 434 ms of which 1 ms to minimize.
[2022-06-09 02:27:55] [INFO ] Deduced a trap composed of 5 places in 374 ms of which 0 ms to minimize.
[2022-06-09 02:27:55] [INFO ] Deduced a trap composed of 19 places in 376 ms of which 1 ms to minimize.
[2022-06-09 02:27:56] [INFO ] Deduced a trap composed of 14 places in 376 ms of which 0 ms to minimize.
[2022-06-09 02:27:56] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 0 ms to minimize.
[2022-06-09 02:27:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2297 ms
[2022-06-09 02:27:56] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 216 ms.
[2022-06-09 02:27:58] [INFO ] Added : 65 causal constraints over 13 iterations in 1996 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 992700 steps, including 1000 resets, run finished after 7467 ms. (steps per millisecond=132 ) 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 66 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:28:06] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 1000042 steps, including 2 resets, run finished after 887 ms. (steps per millisecond=1127 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1720 ms. (steps per millisecond=581 ) properties (out of 1) seen :0
[2022-06-09 02:28:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:28:08] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 02:28:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:28:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:28:09] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2022-06-09 02:28:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:28:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:28:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:28:09] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2022-06-09 02:28:09] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:28:09] [INFO ] [Nat]Added 296 Read/Feed constraints in 203 ms returned sat
[2022-06-09 02:28:10] [INFO ] Deduced a trap composed of 10 places in 476 ms of which 1 ms to minimize.
[2022-06-09 02:28:11] [INFO ] Deduced a trap composed of 5 places in 413 ms of which 0 ms to minimize.
[2022-06-09 02:28:11] [INFO ] Deduced a trap composed of 19 places in 395 ms of which 0 ms to minimize.
[2022-06-09 02:28:11] [INFO ] Deduced a trap composed of 14 places in 391 ms of which 1 ms to minimize.
[2022-06-09 02:28:12] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 0 ms to minimize.
[2022-06-09 02:28:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2394 ms
[2022-06-09 02:28:12] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 214 ms.
[2022-06-09 02:28:15] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2022-06-09 02:28:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 321 ms
[2022-06-09 02:28:15] [INFO ] Added : 93 causal constraints over 19 iterations in 3491 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 994700 steps, including 1000 resets, run finished after 7251 ms. (steps per millisecond=137 ) 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 49 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 48 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:28:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:28:23] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 02:28:23] [INFO ] Implicit Places using invariants in 390 ms returned []
[2022-06-09 02:28:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:28:23] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 02:28:24] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:28:30] [INFO ] Implicit Places using invariants and state equation in 6679 ms returned []
Implicit Place search using SMT with State Equation took 7069 ms to find 0 implicit places.
[2022-06-09 02:28:30] [INFO ] Redundant transitions in 125 ms returned []
[2022-06-09 02:28:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:28:30] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 02:28:31] [INFO ] Dead Transitions using invariants and state equation in 1020 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m064-UpperBounds-12 in 38682 ms.
Starting property specific reduction for BugTracking-PT-q8m064-UpperBounds-14
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:28:31] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 10012 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2022-06-09 02:28:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:28:31] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 02:28:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:28:32] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2022-06-09 02:28:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:28:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:28:32] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2022-06-09 02:28:32] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:28:32] [INFO ] [Nat]Added 296 Read/Feed constraints in 184 ms returned sat
[2022-06-09 02:28:33] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 0 ms to minimize.
[2022-06-09 02:28:33] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 1 ms to minimize.
[2022-06-09 02:28:33] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 0 ms to minimize.
[2022-06-09 02:28:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 915 ms
[2022-06-09 02:28:33] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 216 ms.
[2022-06-09 02:28:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 49 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 02:28:37] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 1000038 steps, including 2 resets, run finished after 917 ms. (steps per millisecond=1090 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1698 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2022-06-09 02:28:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:28:39] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 02:28:39] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:28:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:28:40] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2022-06-09 02:28:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:28:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:28:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:28:40] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2022-06-09 02:28:40] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:28:41] [INFO ] [Nat]Added 296 Read/Feed constraints in 187 ms returned sat
[2022-06-09 02:28:41] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 0 ms to minimize.
[2022-06-09 02:28:41] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 0 ms to minimize.
[2022-06-09 02:28:41] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 0 ms to minimize.
[2022-06-09 02:28:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 908 ms
[2022-06-09 02:28:42] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 204 ms.
[2022-06-09 02:28:46] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 0 ms to minimize.
[2022-06-09 02:28:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2022-06-09 02:28:47] [INFO ] Added : 142 causal constraints over 30 iterations in 5179 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1215600 steps, including 1000 resets, run finished after 10041 ms. (steps per millisecond=121 ) 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 50 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 51 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:28:57] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:28:57] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 02:28:57] [INFO ] Implicit Places using invariants in 421 ms returned []
[2022-06-09 02:28:57] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:28:57] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 02:28:58] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:29:05] [INFO ] Implicit Places using invariants and state equation in 7129 ms returned []
Implicit Place search using SMT with State Equation took 7552 ms to find 0 implicit places.
[2022-06-09 02:29:05] [INFO ] Redundant transitions in 135 ms returned []
[2022-06-09 02:29:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:29:05] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 02:29:06] [INFO ] Dead Transitions using invariants and state equation in 1052 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m064-UpperBounds-14 in 34711 ms.
[2022-06-09 02:29:06] [INFO ] Flatten gal took : 390 ms
[2022-06-09 02:29:07] [INFO ] Applying decomposition
[2022-06-09 02:29:07] [INFO ] Flatten gal took : 219 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/graph5917155392426907454.txt, -o, /tmp/graph5917155392426907454.bin, -w, /tmp/graph5917155392426907454.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/graph5917155392426907454.bin, -l, -1, -v, -w, /tmp/graph5917155392426907454.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 02:29:07] [INFO ] Decomposing Gal with order
[2022-06-09 02:29:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 02:29:08] [INFO ] Removed a total of 424 redundant transitions.
[2022-06-09 02:29:08] [INFO ] Flatten gal took : 485 ms
[2022-06-09 02:29:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 30 ms.
[2022-06-09 02:29:08] [INFO ] Time to serialize gal into /tmp/UpperBounds6934634322157170596.gal : 36 ms
[2022-06-09 02:29:08] [INFO ] Time to serialize properties into /tmp/UpperBounds970210935172417401.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds6934634322157170596.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds970210935172417401.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/UpperBounds6934634322157170596.gal -t CGAL -reachable-file /tmp/UpperBounds970210935172417401.prop --nowitness
Loading property file /tmp/UpperBounds970210935172417401.prop.
Detected timeout of ITS tools.
[2022-06-09 02:52:16] [INFO ] Flatten gal took : 943 ms
[2022-06-09 02:52:16] [INFO ] Time to serialize gal into /tmp/UpperBounds16787814031725610261.gal : 58 ms
[2022-06-09 02:52:16] [INFO ] Time to serialize properties into /tmp/UpperBounds15745088295204421647.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/UpperBounds16787814031725610261.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15745088295204421647.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/UpperBounds16787814031725610261.gal -t CGAL -reachable-file /tmp/UpperBounds15745088295204421647.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds15745088295204421647.prop.
Detected timeout of ITS tools.
[2022-06-09 03:15:11] [INFO ] Flatten gal took : 590 ms
[2022-06-09 03:15:17] [INFO ] Input system was already deterministic with 3871 transitions.
[2022-06-09 03:15:18] [INFO ] Transformed 269 places.
[2022-06-09 03:15:18] [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 03:15:18] [INFO ] Time to serialize gal into /tmp/UpperBounds1370874214185445068.gal : 14 ms
[2022-06-09 03:15:18] [INFO ] Time to serialize properties into /tmp/UpperBounds4694057573548703653.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/UpperBounds1370874214185445068.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds4694057573548703653.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/UpperBounds1370874214185445068.gal -t CGAL -reachable-file /tmp/UpperBounds4694057573548703653.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/UpperBounds4694057573548703653.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-q8m064"
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-q8m064, 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-165472292600040"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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