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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.4K Jun 7 16:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 7 16:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 7 16:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 16:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 13K Jun 7 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 7 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 7 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 16:26 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-q8m004-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654737512051

Running Version 0
[2022-06-09 01:18:33] [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 01:18:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 01:18:34] [INFO ] Load time of PNML (sax parser for PT used): 839 ms
[2022-06-09 01:18:34] [INFO ] Transformed 754 places.
[2022-06-09 01:18:34] [INFO ] Transformed 27370 transitions.
[2022-06-09 01:18:34] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 974 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 474 places in 131 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 01:18:35] [INFO ] Computed 10 place invariants in 57 ms
Incomplete random walk after 10000 steps, including 115 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :7
FORMULA BugTracking-PT-q8m004-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q8m004-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :3
FORMULA BugTracking-PT-q8m004-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-06-09 01:18:35] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 01:18:35] [INFO ] Computed 10 place invariants in 36 ms
[2022-06-09 01:18:35] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-09 01:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:18:36] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2022-06-09 01:18:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:18:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:18:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:18:36] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2022-06-09 01:18:36] [INFO ] State equation strengthened by 316 read => feed constraints.
[2022-06-09 01:18:37] [INFO ] [Nat]Added 316 Read/Feed constraints in 194 ms returned sat
[2022-06-09 01:18:37] [INFO ] Deduced a trap composed of 31 places in 572 ms of which 6 ms to minimize.
[2022-06-09 01:18:38] [INFO ] Deduced a trap composed of 107 places in 544 ms of which 2 ms to minimize.
[2022-06-09 01:18:38] [INFO ] Deduced a trap composed of 91 places in 442 ms of which 1 ms to minimize.
[2022-06-09 01:18:39] [INFO ] Deduced a trap composed of 91 places in 409 ms of which 2 ms to minimize.
[2022-06-09 01:18:39] [INFO ] Deduced a trap composed of 18 places in 371 ms of which 2 ms to minimize.
[2022-06-09 01:18:40] [INFO ] Deduced a trap composed of 65 places in 426 ms of which 1 ms to minimize.
[2022-06-09 01:18:40] [INFO ] Deduced a trap composed of 63 places in 404 ms of which 1 ms to minimize.
[2022-06-09 01:18:41] [INFO ] Deduced a trap composed of 63 places in 477 ms of which 1 ms to minimize.
[2022-06-09 01:18:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 01:18:41] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:18:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:18:41] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2022-06-09 01:18:42] [INFO ] [Real]Added 316 Read/Feed constraints in 177 ms returned sat
[2022-06-09 01:18:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:18:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 01:18:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:18:42] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2022-06-09 01:18:43] [INFO ] [Nat]Added 316 Read/Feed constraints in 183 ms returned sat
[2022-06-09 01:18:43] [INFO ] Deduced a trap composed of 48 places in 487 ms of which 0 ms to minimize.
[2022-06-09 01:18:44] [INFO ] Deduced a trap composed of 86 places in 436 ms of which 0 ms to minimize.
[2022-06-09 01:18:44] [INFO ] Deduced a trap composed of 47 places in 446 ms of which 0 ms to minimize.
[2022-06-09 01:18:45] [INFO ] Deduced a trap composed of 14 places in 447 ms of which 3 ms to minimize.
[2022-06-09 01:18:45] [INFO ] Deduced a trap composed of 14 places in 255 ms of which 2 ms to minimize.
[2022-06-09 01:18:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2620 ms
[2022-06-09 01:18:45] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 297 ms.
[2022-06-09 01:18:47] [INFO ] Deduced a trap composed of 15 places in 492 ms of which 0 ms to minimize.
[2022-06-09 01:18:47] [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.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 01:18:47] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:18:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:18:48] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2022-06-09 01:18:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:18:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:18:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:18:48] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2022-06-09 01:18:49] [INFO ] [Nat]Added 316 Read/Feed constraints in 191 ms returned sat
[2022-06-09 01:18:49] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 0 ms to minimize.
[2022-06-09 01:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2022-06-09 01:18:49] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 214 ms.
[2022-06-09 01:18:54] [INFO ] Deduced a trap composed of 15 places in 501 ms of which 1 ms to minimize.
[2022-06-09 01:18:54] [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.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 01:18:54] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:18:54] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2022-06-09 01:18:54] [INFO ] [Real]Added 316 Read/Feed constraints in 158 ms returned sat
[2022-06-09 01:18:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:18:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:18:55] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2022-06-09 01:18:55] [INFO ] [Nat]Added 316 Read/Feed constraints in 168 ms returned sat
[2022-06-09 01:18:55] [INFO ] Deduced a trap composed of 57 places in 430 ms of which 0 ms to minimize.
[2022-06-09 01:18:56] [INFO ] Deduced a trap composed of 56 places in 416 ms of which 0 ms to minimize.
[2022-06-09 01:18:56] [INFO ] Deduced a trap composed of 14 places in 419 ms of which 2 ms to minimize.
[2022-06-09 01:18:57] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 0 ms to minimize.
[2022-06-09 01:18:57] [INFO ] Deduced a trap composed of 14 places in 278 ms of which 0 ms to minimize.
[2022-06-09 01:18:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2482 ms
[2022-06-09 01:18:58] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 250 ms.
[2022-06-09 01:18:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[0, 1, 0, 1]
Support contains 4 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.18 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 345 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 01:19:00] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 5368 ms. (steps per millisecond=186 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1936 ms. (steps per millisecond=516 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 2028 ms. (steps per millisecond=493 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1880 ms. (steps per millisecond=531 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1825 ms. (steps per millisecond=547 ) properties (out of 4) seen :3
[2022-06-09 01:19:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:19:13] [INFO ] Computed 8 place invariants in 19 ms
[2022-06-09 01:19:13] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:13] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2022-06-09 01:19:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:14] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2022-06-09 01:19:14] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:19:14] [INFO ] [Nat]Added 296 Read/Feed constraints in 199 ms returned sat
[2022-06-09 01:19:14] [INFO ] Deduced a trap composed of 96 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:19:15] [INFO ] Deduced a trap composed of 95 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:19:15] [INFO ] Deduced a trap composed of 97 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:19:16] [INFO ] Deduced a trap composed of 92 places in 347 ms of which 0 ms to minimize.
[2022-06-09 01:19:16] [INFO ] Deduced a trap composed of 53 places in 349 ms of which 0 ms to minimize.
[2022-06-09 01:19:17] [INFO ] Deduced a trap composed of 19 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:19:17] [INFO ] Deduced a trap composed of 5 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:19:17] [INFO ] Deduced a trap composed of 54 places in 326 ms of which 1 ms to minimize.
[2022-06-09 01:19:18] [INFO ] Deduced a trap composed of 54 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:19:18] [INFO ] Deduced a trap composed of 101 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:19:19] [INFO ] Deduced a trap composed of 96 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:19:19] [INFO ] Deduced a trap composed of 97 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:19:19] [INFO ] Deduced a trap composed of 57 places in 321 ms of which 2 ms to minimize.
[2022-06-09 01:19:20] [INFO ] Deduced a trap composed of 54 places in 352 ms of which 0 ms to minimize.
[2022-06-09 01:19:20] [INFO ] Deduced a trap composed of 54 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:19:21] [INFO ] Deduced a trap composed of 57 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:19:21] [INFO ] Deduced a trap composed of 61 places in 323 ms of which 1 ms to minimize.
[2022-06-09 01:19:21] [INFO ] Deduced a trap composed of 62 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:19:22] [INFO ] Deduced a trap composed of 96 places in 317 ms of which 0 ms to minimize.
[2022-06-09 01:19:22] [INFO ] Deduced a trap composed of 97 places in 334 ms of which 1 ms to minimize.
[2022-06-09 01:19:23] [INFO ] Deduced a trap composed of 62 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:19:23] [INFO ] Deduced a trap composed of 41 places in 323 ms of which 1 ms to minimize.
[2022-06-09 01:19:24] [INFO ] Deduced a trap composed of 10 places in 350 ms of which 0 ms to minimize.
[2022-06-09 01:19:24] [INFO ] Deduced a trap composed of 100 places in 319 ms of which 0 ms to minimize.
[2022-06-09 01:19:24] [INFO ] Deduced a trap composed of 65 places in 316 ms of which 1 ms to minimize.
[2022-06-09 01:19:25] [INFO ] Deduced a trap composed of 64 places in 324 ms of which 1 ms to minimize.
[2022-06-09 01:19:25] [INFO ] Deduced a trap composed of 66 places in 319 ms of which 0 ms to minimize.
[2022-06-09 01:19:26] [INFO ] Deduced a trap composed of 65 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:19:26] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 11708 ms
[2022-06-09 01:19:26] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 230 ms.
[2022-06-09 01:19:29] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 1 ms to minimize.
[2022-06-09 01:19:29] [INFO ] Deduced a trap composed of 40 places in 281 ms of which 1 ms to minimize.
[2022-06-09 01:19:30] [INFO ] Deduced a trap composed of 39 places in 298 ms of which 0 ms to minimize.
[2022-06-09 01:19:30] [INFO ] Deduced a trap composed of 17 places in 293 ms of which 1 ms to minimize.
[2022-06-09 01:19:31] [INFO ] Deduced a trap composed of 37 places in 280 ms of which 0 ms to minimize.
[2022-06-09 01:19:31] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 0 ms to minimize.
[2022-06-09 01:19:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2588 ms
[2022-06-09 01:19:32] [INFO ] Added : 87 causal constraints over 19 iterations in 5836 ms. Result :sat
[2022-06-09 01:19:32] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:32] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2022-06-09 01:19:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:33] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2022-06-09 01:19:33] [INFO ] [Nat]Added 296 Read/Feed constraints in 195 ms returned sat
[2022-06-09 01:19:33] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 0 ms to minimize.
[2022-06-09 01:19:33] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 5 ms to minimize.
[2022-06-09 01:19:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 696 ms
[2022-06-09 01:19:34] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 240 ms.
[2022-06-09 01:19:37] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 0 ms to minimize.
[2022-06-09 01:19:37] [INFO ] Deduced a trap composed of 20 places in 217 ms of which 0 ms to minimize.
[2022-06-09 01:19:37] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 0 ms to minimize.
[2022-06-09 01:19:38] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 0 ms to minimize.
[2022-06-09 01:19:38] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 0 ms to minimize.
[2022-06-09 01:19:39] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 0 ms to minimize.
[2022-06-09 01:19:39] [INFO ] Deduced a trap composed of 57 places in 225 ms of which 1 ms to minimize.
[2022-06-09 01:19:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2523 ms
[2022-06-09 01:19:39] [INFO ] Added : 92 causal constraints over 19 iterations in 5612 ms. Result :sat
[2022-06-09 01:19:39] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-09 01:19:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:40] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2022-06-09 01:19:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:19:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:40] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2022-06-09 01:19:41] [INFO ] [Nat]Added 296 Read/Feed constraints in 207 ms returned sat
[2022-06-09 01:19:41] [INFO ] Deduced a trap composed of 25 places in 317 ms of which 0 ms to minimize.
[2022-06-09 01:19:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 477 ms
[2022-06-09 01:19:41] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 206 ms.
[2022-06-09 01:19:44] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 1 ms to minimize.
[2022-06-09 01:19:44] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 4 ms to minimize.
[2022-06-09 01:19:44] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 1 ms to minimize.
[2022-06-09 01:19:45] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 0 ms to minimize.
[2022-06-09 01:19:45] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 1 ms to minimize.
[2022-06-09 01:19:45] [INFO ] Deduced a trap composed of 57 places in 242 ms of which 0 ms to minimize.
[2022-06-09 01:19:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2162 ms
[2022-06-09 01:19:46] [INFO ] Added : 68 causal constraints over 14 iterations in 4744 ms. Result :sat
[2022-06-09 01:19:46] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:46] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2022-06-09 01:19:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:47] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2022-06-09 01:19:47] [INFO ] [Nat]Added 296 Read/Feed constraints in 198 ms returned sat
[2022-06-09 01:19:47] [INFO ] Deduced a trap composed of 99 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:19:48] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 1 ms to minimize.
[2022-06-09 01:19:48] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 1 ms to minimize.
[2022-06-09 01:19:48] [INFO ] Deduced a trap composed of 23 places in 319 ms of which 0 ms to minimize.
[2022-06-09 01:19:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1434 ms
[2022-06-09 01:19:49] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 202 ms.
[2022-06-09 01:19:52] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 1 ms to minimize.
[2022-06-09 01:19:53] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 0 ms to minimize.
[2022-06-09 01:19:53] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 0 ms to minimize.
[2022-06-09 01:19:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1059 ms
[2022-06-09 01:19:53] [INFO ] Added : 110 causal constraints over 23 iterations in 4881 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[0, 1, 0, 2]
Incomplete Parikh walk after 1100300 steps, including 1000 resets, run finished after 8414 ms. (steps per millisecond=130 ) properties (out of 4) seen :5 could not realise parikh vector
Incomplete Parikh walk after 1102800 steps, including 1000 resets, run finished after 8427 ms. (steps per millisecond=130 ) properties (out of 4) seen :4 could not realise parikh vector
Incomplete Parikh walk after 1465100 steps, including 1000 resets, run finished after 10917 ms. (steps per millisecond=134 ) properties (out of 4) seen :5 could not realise parikh vector
Incomplete Parikh walk after 1166200 steps, including 1001 resets, run finished after 8804 ms. (steps per millisecond=132 ) properties (out of 4) seen :3 could not realise parikh vector
Support contains 4 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 61 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 84 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:20:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:20:30] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 01:20:31] [INFO ] Implicit Places using invariants in 456 ms returned []
[2022-06-09 01:20:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:20:31] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 01:20:31] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:20:37] [INFO ] Implicit Places using invariants and state equation in 6410 ms returned []
Implicit Place search using SMT with State Equation took 6870 ms to find 0 implicit places.
[2022-06-09 01:20:37] [INFO ] Redundant transitions in 301 ms returned []
[2022-06-09 01:20:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:20:37] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 01:20:38] [INFO ] Dead Transitions using invariants and state equation in 956 ms returned []
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 01:20:38] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7168 ms. (steps per millisecond=139 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1951 ms. (steps per millisecond=512 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1934 ms. (steps per millisecond=517 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1878 ms. (steps per millisecond=532 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1665 ms. (steps per millisecond=600 ) properties (out of 4) seen :3
[2022-06-09 01:20:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:20:53] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 01:20:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:20:53] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2022-06-09 01:20:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:20:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:20:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:20:54] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2022-06-09 01:20:54] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:20:54] [INFO ] [Nat]Added 296 Read/Feed constraints in 205 ms returned sat
[2022-06-09 01:20:55] [INFO ] Deduced a trap composed of 96 places in 346 ms of which 0 ms to minimize.
[2022-06-09 01:20:55] [INFO ] Deduced a trap composed of 95 places in 352 ms of which 2 ms to minimize.
[2022-06-09 01:20:56] [INFO ] Deduced a trap composed of 97 places in 346 ms of which 0 ms to minimize.
[2022-06-09 01:20:56] [INFO ] Deduced a trap composed of 92 places in 336 ms of which 1 ms to minimize.
[2022-06-09 01:20:56] [INFO ] Deduced a trap composed of 53 places in 347 ms of which 0 ms to minimize.
[2022-06-09 01:20:57] [INFO ] Deduced a trap composed of 19 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:20:57] [INFO ] Deduced a trap composed of 5 places in 337 ms of which 1 ms to minimize.
[2022-06-09 01:20:58] [INFO ] Deduced a trap composed of 54 places in 333 ms of which 0 ms to minimize.
[2022-06-09 01:20:58] [INFO ] Deduced a trap composed of 54 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:20:58] [INFO ] Deduced a trap composed of 101 places in 331 ms of which 0 ms to minimize.
[2022-06-09 01:20:59] [INFO ] Deduced a trap composed of 96 places in 331 ms of which 0 ms to minimize.
[2022-06-09 01:20:59] [INFO ] Deduced a trap composed of 97 places in 342 ms of which 7 ms to minimize.
[2022-06-09 01:21:00] [INFO ] Deduced a trap composed of 57 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:21:00] [INFO ] Deduced a trap composed of 54 places in 335 ms of which 1 ms to minimize.
[2022-06-09 01:21:01] [INFO ] Deduced a trap composed of 54 places in 353 ms of which 0 ms to minimize.
[2022-06-09 01:21:01] [INFO ] Deduced a trap composed of 57 places in 332 ms of which 0 ms to minimize.
[2022-06-09 01:21:02] [INFO ] Deduced a trap composed of 61 places in 339 ms of which 0 ms to minimize.
[2022-06-09 01:21:02] [INFO ] Deduced a trap composed of 62 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:21:02] [INFO ] Deduced a trap composed of 96 places in 333 ms of which 0 ms to minimize.
[2022-06-09 01:21:03] [INFO ] Deduced a trap composed of 97 places in 360 ms of which 1 ms to minimize.
[2022-06-09 01:21:03] [INFO ] Deduced a trap composed of 62 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:21:04] [INFO ] Deduced a trap composed of 41 places in 332 ms of which 1 ms to minimize.
[2022-06-09 01:21:04] [INFO ] Deduced a trap composed of 10 places in 333 ms of which 1 ms to minimize.
[2022-06-09 01:21:05] [INFO ] Deduced a trap composed of 100 places in 334 ms of which 0 ms to minimize.
[2022-06-09 01:21:05] [INFO ] Deduced a trap composed of 65 places in 329 ms of which 1 ms to minimize.
[2022-06-09 01:21:05] [INFO ] Deduced a trap composed of 64 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:21:06] [INFO ] Deduced a trap composed of 66 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:21:06] [INFO ] Deduced a trap composed of 65 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:21:06] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 12083 ms
[2022-06-09 01:21:07] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 213 ms.
[2022-06-09 01:21:09] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 0 ms to minimize.
[2022-06-09 01:21:10] [INFO ] Deduced a trap composed of 40 places in 278 ms of which 0 ms to minimize.
[2022-06-09 01:21:10] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 1 ms to minimize.
[2022-06-09 01:21:11] [INFO ] Deduced a trap composed of 17 places in 281 ms of which 1 ms to minimize.
[2022-06-09 01:21:11] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 0 ms to minimize.
[2022-06-09 01:21:12] [INFO ] Deduced a trap composed of 15 places in 273 ms of which 0 ms to minimize.
[2022-06-09 01:21:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2521 ms
[2022-06-09 01:21:12] [INFO ] Added : 87 causal constraints over 19 iterations in 5776 ms. Result :sat
[2022-06-09 01:21:12] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:13] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2022-06-09 01:21:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:13] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2022-06-09 01:21:13] [INFO ] [Nat]Added 296 Read/Feed constraints in 197 ms returned sat
[2022-06-09 01:21:14] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 0 ms to minimize.
[2022-06-09 01:21:14] [INFO ] Deduced a trap composed of 59 places in 223 ms of which 0 ms to minimize.
[2022-06-09 01:21:14] [INFO ] Deduced a trap composed of 57 places in 222 ms of which 0 ms to minimize.
[2022-06-09 01:21:15] [INFO ] Deduced a trap composed of 58 places in 226 ms of which 1 ms to minimize.
[2022-06-09 01:21:15] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 0 ms to minimize.
[2022-06-09 01:21:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1620 ms
[2022-06-09 01:21:15] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 207 ms.
[2022-06-09 01:21:18] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 0 ms to minimize.
[2022-06-09 01:21:19] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 0 ms to minimize.
[2022-06-09 01:21:19] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 0 ms to minimize.
[2022-06-09 01:21:19] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 0 ms to minimize.
[2022-06-09 01:21:20] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 2 ms to minimize.
[2022-06-09 01:21:20] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 0 ms to minimize.
[2022-06-09 01:21:20] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 1 ms to minimize.
[2022-06-09 01:21:21] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 0 ms to minimize.
[2022-06-09 01:21:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2531 ms
[2022-06-09 01:21:21] [INFO ] Added : 104 causal constraints over 22 iterations in 6135 ms. Result :sat
[2022-06-09 01:21:21] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:22] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2022-06-09 01:21:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:22] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2022-06-09 01:21:23] [INFO ] [Nat]Added 296 Read/Feed constraints in 217 ms returned sat
[2022-06-09 01:21:23] [INFO ] Deduced a trap composed of 25 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:21:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 483 ms
[2022-06-09 01:21:23] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 208 ms.
[2022-06-09 01:21:26] [INFO ] Deduced a trap composed of 10 places in 242 ms of which 0 ms to minimize.
[2022-06-09 01:21:26] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 0 ms to minimize.
[2022-06-09 01:21:26] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 0 ms to minimize.
[2022-06-09 01:21:27] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 0 ms to minimize.
[2022-06-09 01:21:27] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 0 ms to minimize.
[2022-06-09 01:21:28] [INFO ] Deduced a trap composed of 57 places in 232 ms of which 0 ms to minimize.
[2022-06-09 01:21:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2211 ms
[2022-06-09 01:21:28] [INFO ] Added : 68 causal constraints over 14 iterations in 4821 ms. Result :sat
[2022-06-09 01:21:28] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:28] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2022-06-09 01:21:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:29] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2022-06-09 01:21:29] [INFO ] [Nat]Added 296 Read/Feed constraints in 187 ms returned sat
[2022-06-09 01:21:29] [INFO ] Deduced a trap composed of 31 places in 264 ms of which 0 ms to minimize.
[2022-06-09 01:21:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
[2022-06-09 01:21:30] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 219 ms.
[2022-06-09 01:21:34] [INFO ] Deduced a trap composed of 18 places in 336 ms of which 0 ms to minimize.
[2022-06-09 01:21:34] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 1 ms to minimize.
[2022-06-09 01:21:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1013 ms
[2022-06-09 01:21:35] [INFO ] Added : 125 causal constraints over 28 iterations in 5376 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[0, 3, 0, 3]
Incomplete Parikh walk after 1187000 steps, including 1000 resets, run finished after 8980 ms. (steps per millisecond=132 ) properties (out of 4) seen :6 could not realise parikh vector
Incomplete Parikh walk after 1102800 steps, including 1000 resets, run finished after 8217 ms. (steps per millisecond=134 ) properties (out of 4) seen :3 could not realise parikh vector
Incomplete Parikh walk after 1356300 steps, including 1000 resets, run finished after 10251 ms. (steps per millisecond=132 ) properties (out of 4) seen :2 could not realise parikh vector
Incomplete Parikh walk after 1166200 steps, including 1000 resets, run finished after 8642 ms. (steps per millisecond=134 ) properties (out of 4) seen :3 could not realise parikh vector
Support contains 4 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 70 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 55 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:22:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:11] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:22:12] [INFO ] Implicit Places using invariants in 375 ms returned []
[2022-06-09 01:22:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:12] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 01:22:12] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:22:18] [INFO ] Implicit Places using invariants and state equation in 5969 ms returned []
Implicit Place search using SMT with State Equation took 6345 ms to find 0 implicit places.
[2022-06-09 01:22:18] [INFO ] Redundant transitions in 146 ms returned []
[2022-06-09 01:22:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:18] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:22:19] [INFO ] Dead Transitions using invariants and state equation in 995 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-04
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:19] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2022-06-09 01:22:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:19] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 01:22:19] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:22:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:19] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2022-06-09 01:22:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:22:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:22:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:20] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2022-06-09 01:22:20] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:22:20] [INFO ] [Nat]Added 296 Read/Feed constraints in 202 ms returned sat
[2022-06-09 01:22:20] [INFO ] Deduced a trap composed of 96 places in 329 ms of which 1 ms to minimize.
[2022-06-09 01:22:21] [INFO ] Deduced a trap composed of 95 places in 333 ms of which 0 ms to minimize.
[2022-06-09 01:22:21] [INFO ] Deduced a trap composed of 97 places in 342 ms of which 1 ms to minimize.
[2022-06-09 01:22:22] [INFO ] Deduced a trap composed of 92 places in 339 ms of which 0 ms to minimize.
[2022-06-09 01:22:22] [INFO ] Deduced a trap composed of 53 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:22:23] [INFO ] Deduced a trap composed of 19 places in 341 ms of which 1 ms to minimize.
[2022-06-09 01:22:23] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 1 ms to minimize.
[2022-06-09 01:22:23] [INFO ] Deduced a trap composed of 54 places in 334 ms of which 0 ms to minimize.
[2022-06-09 01:22:24] [INFO ] Deduced a trap composed of 54 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:22:24] [INFO ] Deduced a trap composed of 101 places in 340 ms of which 0 ms to minimize.
[2022-06-09 01:22:25] [INFO ] Deduced a trap composed of 96 places in 388 ms of which 1 ms to minimize.
[2022-06-09 01:22:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:25] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 5324 ms. (steps per millisecond=187 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1915 ms. (steps per millisecond=522 ) properties (out of 1) seen :0
[2022-06-09 01:22:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:32] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 01:22:32] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2022-06-09 01:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:33] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2022-06-09 01:22:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:22:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:22:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:33] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2022-06-09 01:22:33] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:22:33] [INFO ] [Nat]Added 296 Read/Feed constraints in 203 ms returned sat
[2022-06-09 01:22:34] [INFO ] Deduced a trap composed of 96 places in 335 ms of which 1 ms to minimize.
[2022-06-09 01:22:34] [INFO ] Deduced a trap composed of 95 places in 338 ms of which 1 ms to minimize.
[2022-06-09 01:22:35] [INFO ] Deduced a trap composed of 97 places in 350 ms of which 0 ms to minimize.
[2022-06-09 01:22:35] [INFO ] Deduced a trap composed of 92 places in 351 ms of which 0 ms to minimize.
[2022-06-09 01:22:36] [INFO ] Deduced a trap composed of 53 places in 346 ms of which 1 ms to minimize.
[2022-06-09 01:22:36] [INFO ] Deduced a trap composed of 19 places in 331 ms of which 0 ms to minimize.
[2022-06-09 01:22:36] [INFO ] Deduced a trap composed of 5 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:22:37] [INFO ] Deduced a trap composed of 54 places in 336 ms of which 0 ms to minimize.
[2022-06-09 01:22:37] [INFO ] Deduced a trap composed of 54 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:22:38] [INFO ] Deduced a trap composed of 101 places in 332 ms of which 1 ms to minimize.
[2022-06-09 01:22:38] [INFO ] Deduced a trap composed of 96 places in 322 ms of which 0 ms to minimize.
[2022-06-09 01:22:38] [INFO ] Deduced a trap composed of 97 places in 334 ms of which 0 ms to minimize.
[2022-06-09 01:22:39] [INFO ] Deduced a trap composed of 57 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:22:39] [INFO ] Deduced a trap composed of 54 places in 329 ms of which 1 ms to minimize.
[2022-06-09 01:22:40] [INFO ] Deduced a trap composed of 54 places in 342 ms of which 1 ms to minimize.
[2022-06-09 01:22:40] [INFO ] Deduced a trap composed of 57 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:22:41] [INFO ] Deduced a trap composed of 61 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:22:41] [INFO ] Deduced a trap composed of 62 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:22:41] [INFO ] Deduced a trap composed of 96 places in 339 ms of which 1 ms to minimize.
[2022-06-09 01:22:42] [INFO ] Deduced a trap composed of 97 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:22:42] [INFO ] Deduced a trap composed of 62 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:22:43] [INFO ] Deduced a trap composed of 41 places in 332 ms of which 0 ms to minimize.
[2022-06-09 01:22:43] [INFO ] Deduced a trap composed of 10 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:22:43] [INFO ] Deduced a trap composed of 100 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:22:44] [INFO ] Deduced a trap composed of 65 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:22:44] [INFO ] Deduced a trap composed of 64 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:22:45] [INFO ] Deduced a trap composed of 66 places in 340 ms of which 0 ms to minimize.
[2022-06-09 01:22:45] [INFO ] Deduced a trap composed of 65 places in 317 ms of which 0 ms to minimize.
[2022-06-09 01:22:45] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 11872 ms
[2022-06-09 01:22:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 203 ms.
[2022-06-09 01:22:48] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 0 ms to minimize.
[2022-06-09 01:22:49] [INFO ] Deduced a trap composed of 40 places in 278 ms of which 1 ms to minimize.
[2022-06-09 01:22:49] [INFO ] Deduced a trap composed of 39 places in 275 ms of which 0 ms to minimize.
[2022-06-09 01:22:50] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 1 ms to minimize.
[2022-06-09 01:22:50] [INFO ] Deduced a trap composed of 37 places in 276 ms of which 0 ms to minimize.
[2022-06-09 01:22:50] [INFO ] Deduced a trap composed of 15 places in 266 ms of which 1 ms to minimize.
[2022-06-09 01:22:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2478 ms
[2022-06-09 01:22:51] [INFO ] Added : 87 causal constraints over 19 iterations in 5671 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 1166200 steps, including 1000 resets, run finished after 8660 ms. (steps per millisecond=134 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:23:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:23:00] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:23:00] [INFO ] Implicit Places using invariants in 378 ms returned []
[2022-06-09 01:23:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:23:00] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:23:01] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:23:07] [INFO ] Implicit Places using invariants and state equation in 6434 ms returned []
Implicit Place search using SMT with State Equation took 6814 ms to find 0 implicit places.
[2022-06-09 01:23:07] [INFO ] Redundant transitions in 233 ms returned []
[2022-06-09 01:23:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:23:07] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 01:23:08] [INFO ] Dead Transitions using invariants and state equation in 957 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-04 in 49082 ms.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-06
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:23:08] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 01:23:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:23:08] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:23:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:08] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2022-06-09 01:23:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:23:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:23:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:09] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2022-06-09 01:23:09] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:23:09] [INFO ] [Nat]Added 296 Read/Feed constraints in 201 ms returned sat
[2022-06-09 01:23:10] [INFO ] Deduced a trap composed of 63 places in 316 ms of which 0 ms to minimize.
[2022-06-09 01:23:10] [INFO ] Deduced a trap composed of 94 places in 309 ms of which 0 ms to minimize.
[2022-06-09 01:23:10] [INFO ] Deduced a trap composed of 62 places in 312 ms of which 0 ms to minimize.
[2022-06-09 01:23:11] [INFO ] Deduced a trap composed of 92 places in 320 ms of which 1 ms to minimize.
[2022-06-09 01:23:11] [INFO ] Deduced a trap composed of 64 places in 312 ms of which 0 ms to minimize.
[2022-06-09 01:23:12] [INFO ] Deduced a trap composed of 65 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:23:12] [INFO ] Deduced a trap composed of 64 places in 328 ms of which 1 ms to minimize.
[2022-06-09 01:23:12] [INFO ] Deduced a trap composed of 64 places in 320 ms of which 1 ms to minimize.
[2022-06-09 01:23:13] [INFO ] Deduced a trap composed of 90 places in 310 ms of which 1 ms to minimize.
[2022-06-09 01:23:13] [INFO ] Deduced a trap composed of 22 places in 312 ms of which 0 ms to minimize.
[2022-06-09 01:23:14] [INFO ] Deduced a trap composed of 65 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:23:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:23:14] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5648 ms. (steps per millisecond=177 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1847 ms. (steps per millisecond=541 ) properties (out of 1) seen :0
[2022-06-09 01:23:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:23:21] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 01:23:21] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:22] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2022-06-09 01:23:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:23:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:22] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2022-06-09 01:23:22] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:23:22] [INFO ] [Nat]Added 296 Read/Feed constraints in 210 ms returned sat
[2022-06-09 01:23:23] [INFO ] Deduced a trap composed of 63 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:23:23] [INFO ] Deduced a trap composed of 94 places in 313 ms of which 1 ms to minimize.
[2022-06-09 01:23:24] [INFO ] Deduced a trap composed of 62 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:23:24] [INFO ] Deduced a trap composed of 92 places in 316 ms of which 0 ms to minimize.
[2022-06-09 01:23:24] [INFO ] Deduced a trap composed of 64 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:23:25] [INFO ] Deduced a trap composed of 65 places in 328 ms of which 2 ms to minimize.
[2022-06-09 01:23:25] [INFO ] Deduced a trap composed of 64 places in 321 ms of which 1 ms to minimize.
[2022-06-09 01:23:26] [INFO ] Deduced a trap composed of 64 places in 349 ms of which 1 ms to minimize.
[2022-06-09 01:23:26] [INFO ] Deduced a trap composed of 90 places in 315 ms of which 1 ms to minimize.
[2022-06-09 01:23:26] [INFO ] Deduced a trap composed of 22 places in 321 ms of which 1 ms to minimize.
[2022-06-09 01:23:27] [INFO ] Deduced a trap composed of 65 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:23:27] [INFO ] Deduced a trap composed of 96 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:23:28] [INFO ] Deduced a trap composed of 96 places in 318 ms of which 1 ms to minimize.
[2022-06-09 01:23:28] [INFO ] Deduced a trap composed of 96 places in 309 ms of which 1 ms to minimize.
[2022-06-09 01:23:28] [INFO ] Deduced a trap composed of 96 places in 311 ms of which 0 ms to minimize.
[2022-06-09 01:23:29] [INFO ] Deduced a trap composed of 96 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:23:29] [INFO ] Deduced a trap composed of 96 places in 318 ms of which 1 ms to minimize.
[2022-06-09 01:23:30] [INFO ] Deduced a trap composed of 94 places in 314 ms of which 0 ms to minimize.
[2022-06-09 01:23:30] [INFO ] Deduced a trap composed of 88 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:23:31] [INFO ] Deduced a trap composed of 89 places in 312 ms of which 1 ms to minimize.
[2022-06-09 01:23:31] [INFO ] Deduced a trap composed of 90 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:23:31] [INFO ] Deduced a trap composed of 88 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:23:32] [INFO ] Deduced a trap composed of 89 places in 312 ms of which 1 ms to minimize.
[2022-06-09 01:23:32] [INFO ] Deduced a trap composed of 91 places in 340 ms of which 0 ms to minimize.
[2022-06-09 01:23:33] [INFO ] Deduced a trap composed of 88 places in 306 ms of which 0 ms to minimize.
[2022-06-09 01:23:33] [INFO ] Deduced a trap composed of 89 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:23:33] [INFO ] Deduced a trap composed of 89 places in 308 ms of which 0 ms to minimize.
[2022-06-09 01:23:34] [INFO ] Deduced a trap composed of 89 places in 309 ms of which 0 ms to minimize.
[2022-06-09 01:23:34] [INFO ] Deduced a trap composed of 89 places in 305 ms of which 1 ms to minimize.
[2022-06-09 01:23:35] [INFO ] Deduced a trap composed of 89 places in 308 ms of which 0 ms to minimize.
[2022-06-09 01:23:35] [INFO ] Deduced a trap composed of 91 places in 314 ms of which 0 ms to minimize.
[2022-06-09 01:23:35] [INFO ] Deduced a trap composed of 13 places in 316 ms of which 0 ms to minimize.
[2022-06-09 01:23:36] [INFO ] Deduced a trap composed of 21 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:23:36] [INFO ] Deduced a trap composed of 15 places in 317 ms of which 0 ms to minimize.
[2022-06-09 01:23:37] [INFO ] Deduced a trap composed of 86 places in 309 ms of which 1 ms to minimize.
[2022-06-09 01:23:37] [INFO ] Deduced a trap composed of 14 places in 317 ms of which 0 ms to minimize.
[2022-06-09 01:23:37] [INFO ] Deduced a trap composed of 90 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:23:38] [INFO ] Deduced a trap composed of 94 places in 318 ms of which 1 ms to minimize.
[2022-06-09 01:23:38] [INFO ] Deduced a trap composed of 94 places in 313 ms of which 0 ms to minimize.
[2022-06-09 01:23:39] [INFO ] Deduced a trap composed of 94 places in 333 ms of which 1 ms to minimize.
[2022-06-09 01:23:39] [INFO ] Deduced a trap composed of 92 places in 310 ms of which 1 ms to minimize.
[2022-06-09 01:23:39] [INFO ] Deduced a trap composed of 92 places in 309 ms of which 0 ms to minimize.
[2022-06-09 01:23:40] [INFO ] Deduced a trap composed of 92 places in 314 ms of which 1 ms to minimize.
[2022-06-09 01:23:40] [INFO ] Deduced a trap composed of 92 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:23:41] [INFO ] Deduced a trap composed of 92 places in 310 ms of which 1 ms to minimize.
[2022-06-09 01:23:41] [INFO ] Deduced a trap composed of 92 places in 307 ms of which 0 ms to minimize.
[2022-06-09 01:23:41] [INFO ] Deduced a trap composed of 92 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:23:42] [INFO ] Deduced a trap composed of 94 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:23:42] [INFO ] Deduced a trap composed of 92 places in 313 ms of which 0 ms to minimize.
[2022-06-09 01:23:43] [INFO ] Deduced a trap composed of 94 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:23:43] [INFO ] Deduced a trap composed of 99 places in 321 ms of which 1 ms to minimize.
[2022-06-09 01:23:44] [INFO ] Deduced a trap composed of 93 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:23:44] [INFO ] Deduced a trap composed of 99 places in 321 ms of which 1 ms to minimize.
[2022-06-09 01:23:44] [INFO ] Deduced a trap composed of 94 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:23:45] [INFO ] Deduced a trap composed of 99 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:23:45] [INFO ] Deduced a trap composed of 94 places in 303 ms of which 0 ms to minimize.
[2022-06-09 01:23:46] [INFO ] Deduced a trap composed of 92 places in 301 ms of which 1 ms to minimize.
[2022-06-09 01:23:46] [INFO ] Deduced a trap composed of 94 places in 314 ms of which 2 ms to minimize.
[2022-06-09 01:23:46] [INFO ] Deduced a trap composed of 94 places in 305 ms of which 0 ms to minimize.
[2022-06-09 01:23:47] [INFO ] Deduced a trap composed of 101 places in 312 ms of which 1 ms to minimize.
[2022-06-09 01:23:47] [INFO ] Deduced a trap composed of 99 places in 301 ms of which 1 ms to minimize.
[2022-06-09 01:23:48] [INFO ] Deduced a trap composed of 99 places in 319 ms of which 1 ms to minimize.
[2022-06-09 01:23:48] [INFO ] Deduced a trap composed of 99 places in 309 ms of which 1 ms to minimize.
[2022-06-09 01:23:48] [INFO ] Deduced a trap composed of 99 places in 302 ms of which 1 ms to minimize.
[2022-06-09 01:23:49] [INFO ] Deduced a trap composed of 93 places in 320 ms of which 3 ms to minimize.
[2022-06-09 01:23:49] [INFO ] Deduced a trap composed of 94 places in 305 ms of which 0 ms to minimize.
[2022-06-09 01:23:50] [INFO ] Deduced a trap composed of 94 places in 305 ms of which 0 ms to minimize.
[2022-06-09 01:23:50] [INFO ] Deduced a trap composed of 91 places in 315 ms of which 1 ms to minimize.
[2022-06-09 01:23:50] [INFO ] Deduced a trap composed of 90 places in 313 ms of which 0 ms to minimize.
[2022-06-09 01:23:51] [INFO ] Deduced a trap composed of 92 places in 324 ms of which 1 ms to minimize.
[2022-06-09 01:23:51] [INFO ] Deduced a trap composed of 92 places in 308 ms of which 1 ms to minimize.
[2022-06-09 01:23:52] [INFO ] Deduced a trap composed of 92 places in 316 ms of which 0 ms to minimize.
[2022-06-09 01:23:52] [INFO ] Deduced a trap composed of 92 places in 337 ms of which 0 ms to minimize.
[2022-06-09 01:23:52] [INFO ] Deduced a trap composed of 92 places in 316 ms of which 0 ms to minimize.
[2022-06-09 01:23:53] [INFO ] Deduced a trap composed of 92 places in 311 ms of which 0 ms to minimize.
[2022-06-09 01:23:53] [INFO ] Deduced a trap composed of 90 places in 319 ms of which 1 ms to minimize.
[2022-06-09 01:23:54] [INFO ] Deduced a trap composed of 93 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:23:54] [INFO ] Deduced a trap composed of 93 places in 312 ms of which 0 ms to minimize.
[2022-06-09 01:23:54] [INFO ] Deduced a trap composed of 92 places in 317 ms of which 0 ms to minimize.
[2022-06-09 01:23:55] [INFO ] Deduced a trap composed of 93 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:23:55] [INFO ] Deduced a trap composed of 92 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:23:56] [INFO ] Deduced a trap composed of 93 places in 307 ms of which 1 ms to minimize.
[2022-06-09 01:23:56] [INFO ] Deduced a trap composed of 92 places in 312 ms of which 1 ms to minimize.
[2022-06-09 01:23:56] [INFO ] Deduced a trap composed of 93 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:23:57] [INFO ] Deduced a trap composed of 93 places in 316 ms of which 1 ms to minimize.
[2022-06-09 01:23:57] [INFO ] Deduced a trap composed of 92 places in 310 ms of which 0 ms to minimize.
[2022-06-09 01:23:58] [INFO ] Deduced a trap composed of 93 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:23:58] [INFO ] Deduced a trap composed of 93 places in 316 ms of which 0 ms to minimize.
[2022-06-09 01:23:59] [INFO ] Deduced a trap composed of 92 places in 336 ms of which 1 ms to minimize.
[2022-06-09 01:23:59] [INFO ] Deduced a trap composed of 93 places in 318 ms of which 1 ms to minimize.
[2022-06-09 01:23:59] [INFO ] Deduced a trap composed of 91 places in 317 ms of which 1 ms to minimize.
[2022-06-09 01:24:00] [INFO ] Deduced a trap composed of 90 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:24:00] [INFO ] Deduced a trap composed of 91 places in 314 ms of which 1 ms to minimize.
[2022-06-09 01:24:01] [INFO ] Deduced a trap composed of 90 places in 313 ms of which 0 ms to minimize.
[2022-06-09 01:24:01] [INFO ] Deduced a trap composed of 101 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:24:01] [INFO ] Deduced a trap composed of 89 places in 323 ms of which 1 ms to minimize.
[2022-06-09 01:24:02] [INFO ] Deduced a trap composed of 93 places in 318 ms of which 1 ms to minimize.
[2022-06-09 01:24:02] [INFO ] Deduced a trap composed of 94 places in 322 ms of which 0 ms to minimize.
[2022-06-09 01:24:03] [INFO ] Deduced a trap composed of 24 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:24:03] [INFO ] Deduced a trap composed of 95 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:24:04] [INFO ] Deduced a trap composed of 38 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:24:04] [INFO ] Deduced a trap composed of 19 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:24:04] [INFO ] Trap strengthening (SAT) tested/added 103/102 trap constraints in 41719 ms
[2022-06-09 01:24:04] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 235 ms.
[2022-06-09 01:24:07] [INFO ] Added : 80 causal constraints over 16 iterations in 2603 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 1221000 steps, including 1000 resets, run finished after 9196 ms. (steps per millisecond=132 ) properties (out of 1) seen :1 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 01:24:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:24:16] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:24:16] [INFO ] Implicit Places using invariants in 392 ms returned []
[2022-06-09 01:24:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:24:16] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-09 01:24:17] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:24:23] [INFO ] Implicit Places using invariants and state equation in 6849 ms returned []
Implicit Place search using SMT with State Equation took 7242 ms to find 0 implicit places.
[2022-06-09 01:24:23] [INFO ] Redundant transitions in 120 ms returned []
[2022-06-09 01:24:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:24:23] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 01:24:24] [INFO ] Dead Transitions using invariants and state equation in 955 ms returned []
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 01:24:24] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 5948 ms. (steps per millisecond=168 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1918 ms. (steps per millisecond=521 ) properties (out of 1) seen :0
[2022-06-09 01:24:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:24:32] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 01:24:32] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:33] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2022-06-09 01:24:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:24:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:24:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:33] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2022-06-09 01:24:33] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:24:33] [INFO ] [Nat]Added 296 Read/Feed constraints in 206 ms returned sat
[2022-06-09 01:24:34] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 0 ms to minimize.
[2022-06-09 01:24:34] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 0 ms to minimize.
[2022-06-09 01:24:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 699 ms
[2022-06-09 01:24:34] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 210 ms.
[2022-06-09 01:24:37] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 0 ms to minimize.
[2022-06-09 01:24:38] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 0 ms to minimize.
[2022-06-09 01:24:38] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 1 ms to minimize.
[2022-06-09 01:24:38] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 0 ms to minimize.
[2022-06-09 01:24:39] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 0 ms to minimize.
[2022-06-09 01:24:39] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 0 ms to minimize.
[2022-06-09 01:24:40] [INFO ] Deduced a trap composed of 57 places in 225 ms of which 0 ms to minimize.
[2022-06-09 01:24:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2594 ms
[2022-06-09 01:24:40] [INFO ] Added : 92 causal constraints over 19 iterations in 5743 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 1465100 steps, including 1000 resets, run finished after 10701 ms. (steps per millisecond=136 ) properties (out of 1) seen :2 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 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.
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 01:24:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:24:51] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:24:51] [INFO ] Implicit Places using invariants in 391 ms returned []
[2022-06-09 01:24:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:24:51] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-09 01:24:52] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:24:58] [INFO ] Implicit Places using invariants and state equation in 6861 ms returned []
Implicit Place search using SMT with State Equation took 7253 ms to find 0 implicit places.
[2022-06-09 01:24:58] [INFO ] Redundant transitions in 126 ms returned []
[2022-06-09 01:24:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:24:58] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 01:24:59] [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.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:24:59] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 5287 ms. (steps per millisecond=189 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1893 ms. (steps per millisecond=528 ) properties (out of 1) seen :1
[2022-06-09 01:25:06] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:25:06] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 01:25:06] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:07] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2022-06-09 01:25:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:25:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:07] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2022-06-09 01:25:07] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:25:08] [INFO ] [Nat]Added 296 Read/Feed constraints in 207 ms returned sat
[2022-06-09 01:25:08] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 0 ms to minimize.
[2022-06-09 01:25:08] [INFO ] Deduced a trap composed of 59 places in 234 ms of which 1 ms to minimize.
[2022-06-09 01:25:09] [INFO ] Deduced a trap composed of 57 places in 233 ms of which 0 ms to minimize.
[2022-06-09 01:25:09] [INFO ] Deduced a trap composed of 58 places in 233 ms of which 0 ms to minimize.
[2022-06-09 01:25:09] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 0 ms to minimize.
[2022-06-09 01:25:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1673 ms
[2022-06-09 01:25:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 210 ms.
[2022-06-09 01:25:13] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 0 ms to minimize.
[2022-06-09 01:25:13] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 1 ms to minimize.
[2022-06-09 01:25:13] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 1 ms to minimize.
[2022-06-09 01:25:14] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 0 ms to minimize.
[2022-06-09 01:25:14] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 1 ms to minimize.
[2022-06-09 01:25:14] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 0 ms to minimize.
[2022-06-09 01:25:15] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 0 ms to minimize.
[2022-06-09 01:25:15] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 0 ms to minimize.
[2022-06-09 01:25:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2537 ms
[2022-06-09 01:25:16] [INFO ] Added : 104 causal constraints over 22 iterations in 6175 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 1355900 steps, including 1000 resets, run finished after 10478 ms. (steps per millisecond=129 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:25:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:25:26] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 01:25:27] [INFO ] Implicit Places using invariants in 425 ms returned []
[2022-06-09 01:25:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:25:27] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:25:27] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:25:34] [INFO ] Implicit Places using invariants and state equation in 7105 ms returned []
Implicit Place search using SMT with State Equation took 7532 ms to find 0 implicit places.
[2022-06-09 01:25:34] [INFO ] Redundant transitions in 133 ms returned []
[2022-06-09 01:25:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:25:34] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 01:25:35] [INFO ] Dead Transitions using invariants and state equation in 1035 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-06 in 147128 ms.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:25:35] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2022-06-09 01:25:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:25:35] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 01:25:35] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:25:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:36] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2022-06-09 01:25:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:25:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:36] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2022-06-09 01:25:36] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:25:36] [INFO ] [Nat]Added 296 Read/Feed constraints in 223 ms returned sat
[2022-06-09 01:25:37] [INFO ] Deduced a trap composed of 25 places in 332 ms of which 1 ms to minimize.
[2022-06-09 01:25:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 507 ms
[2022-06-09 01:25:37] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 213 ms.
[2022-06-09 01:25:40] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 0 ms to minimize.
[2022-06-09 01:25:40] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 0 ms to minimize.
[2022-06-09 01:25:40] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 0 ms to minimize.
[2022-06-09 01:25:41] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 0 ms to minimize.
[2022-06-09 01:25:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:25:41] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 5212 ms. (steps per millisecond=191 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2180 ms. (steps per millisecond=458 ) properties (out of 1) seen :0
[2022-06-09 01:25:48] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:25:48] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:25:48] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:49] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2022-06-09 01:25:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:25:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:49] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2022-06-09 01:25:49] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:25:50] [INFO ] [Nat]Added 296 Read/Feed constraints in 235 ms returned sat
[2022-06-09 01:25:50] [INFO ] Deduced a trap composed of 25 places in 347 ms of which 0 ms to minimize.
[2022-06-09 01:25:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 524 ms
[2022-06-09 01:25:50] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 219 ms.
[2022-06-09 01:25:53] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 1 ms to minimize.
[2022-06-09 01:25:53] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 0 ms to minimize.
[2022-06-09 01:25:54] [INFO ] Deduced a trap composed of 17 places in 250 ms of which 0 ms to minimize.
[2022-06-09 01:25:54] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 0 ms to minimize.
[2022-06-09 01:25:55] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 0 ms to minimize.
[2022-06-09 01:25:55] [INFO ] Deduced a trap composed of 57 places in 257 ms of which 0 ms to minimize.
[2022-06-09 01:25:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2358 ms
[2022-06-09 01:25:55] [INFO ] Added : 68 causal constraints over 14 iterations in 5080 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 1102800 steps, including 1000 resets, run finished after 8692 ms. (steps per millisecond=126 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:26:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:26:04] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 01:26:05] [INFO ] Implicit Places using invariants in 426 ms returned []
[2022-06-09 01:26:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:26:05] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 01:26:05] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:26:12] [INFO ] Implicit Places using invariants and state equation in 7272 ms returned []
Implicit Place search using SMT with State Equation took 7700 ms to find 0 implicit places.
[2022-06-09 01:26:12] [INFO ] Redundant transitions in 130 ms returned []
[2022-06-09 01:26:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:26:12] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 01:26:13] [INFO ] Dead Transitions using invariants and state equation in 1010 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-12 in 38151 ms.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-14
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:26:13] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :1
[2022-06-09 01:26:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:26:13] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 01:26:13] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:26:14] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2022-06-09 01:26:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:26:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:26:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:26:14] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2022-06-09 01:26:14] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:26:15] [INFO ] [Nat]Added 296 Read/Feed constraints in 215 ms returned sat
[2022-06-09 01:26:15] [INFO ] Deduced a trap composed of 26 places in 338 ms of which 1 ms to minimize.
[2022-06-09 01:26:15] [INFO ] Deduced a trap composed of 65 places in 347 ms of which 0 ms to minimize.
[2022-06-09 01:26:16] [INFO ] Deduced a trap composed of 65 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:26:16] [INFO ] Deduced a trap composed of 53 places in 338 ms of which 1 ms to minimize.
[2022-06-09 01:26:17] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 0 ms to minimize.
[2022-06-09 01:26:17] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 0 ms to minimize.
[2022-06-09 01:26:17] [INFO ] Deduced a trap composed of 62 places in 317 ms of which 1 ms to minimize.
[2022-06-09 01:26:18] [INFO ] Deduced a trap composed of 62 places in 361 ms of which 1 ms to minimize.
[2022-06-09 01:26:18] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 0 ms to minimize.
[2022-06-09 01:26:19] [INFO ] Deduced a trap composed of 67 places in 336 ms of which 0 ms to minimize.
[2022-06-09 01:26:19] [INFO ] Deduced a trap composed of 69 places in 350 ms of which 1 ms to minimize.
[2022-06-09 01:26:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 :[1]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:26:19] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 5136 ms. (steps per millisecond=194 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1676 ms. (steps per millisecond=596 ) properties (out of 1) seen :1
[2022-06-09 01:26:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:26:26] [INFO ] Computed 8 place invariants in 19 ms
[2022-06-09 01:26:26] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:26:26] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2022-06-09 01:26:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:26:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:26:27] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2022-06-09 01:26:27] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:26:27] [INFO ] [Nat]Added 296 Read/Feed constraints in 209 ms returned sat
[2022-06-09 01:26:28] [INFO ] Deduced a trap composed of 26 places in 337 ms of which 0 ms to minimize.
[2022-06-09 01:26:28] [INFO ] Deduced a trap composed of 65 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:26:28] [INFO ] Deduced a trap composed of 65 places in 331 ms of which 0 ms to minimize.
[2022-06-09 01:26:29] [INFO ] Deduced a trap composed of 53 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:26:29] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 1 ms to minimize.
[2022-06-09 01:26:30] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 0 ms to minimize.
[2022-06-09 01:26:30] [INFO ] Deduced a trap composed of 62 places in 337 ms of which 0 ms to minimize.
[2022-06-09 01:26:30] [INFO ] Deduced a trap composed of 62 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:26:31] [INFO ] Deduced a trap composed of 16 places in 248 ms of which 0 ms to minimize.
[2022-06-09 01:26:31] [INFO ] Deduced a trap composed of 67 places in 332 ms of which 1 ms to minimize.
[2022-06-09 01:26:32] [INFO ] Deduced a trap composed of 69 places in 367 ms of which 0 ms to minimize.
[2022-06-09 01:26:32] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 0 ms to minimize.
[2022-06-09 01:26:32] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 0 ms to minimize.
[2022-06-09 01:26:33] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 0 ms to minimize.
[2022-06-09 01:26:33] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 0 ms to minimize.
[2022-06-09 01:26:33] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 1 ms to minimize.
[2022-06-09 01:26:34] [INFO ] Deduced a trap composed of 17 places in 334 ms of which 1 ms to minimize.
[2022-06-09 01:26:34] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 0 ms to minimize.
[2022-06-09 01:26:34] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 6861 ms
[2022-06-09 01:26:34] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 216 ms.
[2022-06-09 01:26:39] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 1 ms to minimize.
[2022-06-09 01:26:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 454 ms
[2022-06-09 01:26:39] [INFO ] Added : 143 causal constraints over 29 iterations in 5110 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 1266200 steps, including 1001 resets, run finished after 9559 ms. (steps per millisecond=132 ) properties (out of 1) seen :2 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 50 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:26:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:26:49] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 01:26:49] [INFO ] Implicit Places using invariants in 417 ms returned []
[2022-06-09 01:26:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:26:49] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:26:50] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:26:56] [INFO ] Implicit Places using invariants and state equation in 6828 ms returned []
Implicit Place search using SMT with State Equation took 7246 ms to find 0 implicit places.
[2022-06-09 01:26:56] [INFO ] Redundant transitions in 124 ms returned []
[2022-06-09 01:26:56] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:26:56] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 01:26:57] [INFO ] Dead Transitions using invariants and state equation in 1018 ms returned []
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 01:26:57] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6081 ms. (steps per millisecond=164 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1856 ms. (steps per millisecond=538 ) properties (out of 1) seen :2
[2022-06-09 01:27:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:27:05] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 01:27:05] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:27:06] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2022-06-09 01:27:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:27:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:27:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:27:06] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2022-06-09 01:27:06] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:27:07] [INFO ] [Nat]Added 296 Read/Feed constraints in 207 ms returned sat
[2022-06-09 01:27:07] [INFO ] Deduced a trap composed of 99 places in 333 ms of which 1 ms to minimize.
[2022-06-09 01:27:07] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 0 ms to minimize.
[2022-06-09 01:27:07] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 0 ms to minimize.
[2022-06-09 01:27:08] [INFO ] Deduced a trap composed of 23 places in 333 ms of which 0 ms to minimize.
[2022-06-09 01:27:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1486 ms
[2022-06-09 01:27:08] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 207 ms.
[2022-06-09 01:27:12] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 0 ms to minimize.
[2022-06-09 01:27:12] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 0 ms to minimize.
[2022-06-09 01:27:13] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 0 ms to minimize.
[2022-06-09 01:27:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1104 ms
[2022-06-09 01:27:13] [INFO ] Added : 110 causal constraints over 23 iterations in 5036 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 1100300 steps, including 1000 resets, run finished after 8504 ms. (steps per millisecond=129 ) properties (out of 1) seen :2 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 58 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 58 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:27:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:27:22] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 01:27:22] [INFO ] Implicit Places using invariants in 416 ms returned []
[2022-06-09 01:27:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:27:22] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 01:27:23] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:27:29] [INFO ] Implicit Places using invariants and state equation in 7120 ms returned []
Implicit Place search using SMT with State Equation took 7537 ms to find 0 implicit places.
[2022-06-09 01:27:29] [INFO ] Redundant transitions in 132 ms returned []
[2022-06-09 01:27:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:27:29] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 01:27:30] [INFO ] Dead Transitions using invariants and state equation in 990 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-14 in 77347 ms.
[2022-06-09 01:27:31] [INFO ] Flatten gal took : 383 ms
[2022-06-09 01:27:31] [INFO ] Applying decomposition
[2022-06-09 01:27:31] [INFO ] Flatten gal took : 221 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/graph12929859950573645061.txt, -o, /tmp/graph12929859950573645061.bin, -w, /tmp/graph12929859950573645061.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/graph12929859950573645061.bin, -l, -1, -v, -w, /tmp/graph12929859950573645061.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 01:27:32] [INFO ] Decomposing Gal with order
[2022-06-09 01:27:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 01:27:32] [INFO ] Removed a total of 424 redundant transitions.
[2022-06-09 01:27:32] [INFO ] Flatten gal took : 446 ms
[2022-06-09 01:27:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 28 ms.
[2022-06-09 01:27:33] [INFO ] Time to serialize gal into /tmp/UpperBounds15033635927489024205.gal : 79 ms
[2022-06-09 01:27:33] [INFO ] Time to serialize properties into /tmp/UpperBounds17009114052138195972.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/UpperBounds15033635927489024205.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17009114052138195972.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/UpperBounds15033635927489024205.gal -t CGAL -reachable-file /tmp/UpperBounds17009114052138195972.prop --nowitness
Loading property file /tmp/UpperBounds17009114052138195972.prop.
Detected timeout of ITS tools.
[2022-06-09 01:50:37] [INFO ] Flatten gal took : 824 ms
[2022-06-09 01:50:37] [INFO ] Time to serialize gal into /tmp/UpperBounds17670780637975277251.gal : 94 ms
[2022-06-09 01:50:37] [INFO ] Time to serialize properties into /tmp/UpperBounds12246512631172270083.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds17670780637975277251.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12246512631172270083.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/UpperBounds17670780637975277251.gal -t CGAL -reachable-file /tmp/UpperBounds12246512631172270083.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds12246512631172270083.prop.
Detected timeout of ITS tools.
[2022-06-09 02:13:40] [INFO ] Flatten gal took : 2980 ms
[2022-06-09 02:13:42] [INFO ] Input system was already deterministic with 3871 transitions.
[2022-06-09 02:13:42] [INFO ] Transformed 269 places.
[2022-06-09 02:13:42] [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 02:13:42] [INFO ] Time to serialize gal into /tmp/UpperBounds14772970915726421536.gal : 15 ms
[2022-06-09 02:13:42] [INFO ] Time to serialize properties into /tmp/UpperBounds697408974739247396.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/UpperBounds14772970915726421536.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds697408974739247396.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/UpperBounds14772970915726421536.gal -t CGAL -reachable-file /tmp/UpperBounds697408974739247396.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/UpperBounds697408974739247396.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-q8m004"
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-q8m004, 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-165472292500028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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