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.r028-tall-165251936100151.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 BusinessProcesses-PT-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100151
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 6.5K Apr 29 23:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 23:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 23:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 23:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 141K May 10 09:33 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 BusinessProcesses-PT-11-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652541281543

Running Version 0
[2022-05-14 15:14:43] [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-05-14 15:14:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 15:14:43] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2022-05-14 15:14:43] [INFO ] Transformed 567 places.
[2022-05-14 15:14:43] [INFO ] Transformed 508 transitions.
[2022-05-14 15:14:43] [INFO ] Found NUPN structural information;
[2022-05-14 15:14:43] [INFO ] Parsed PT model containing 567 places and 508 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 7 transitions.
// Phase 1: matrix 501 rows 560 cols
[2022-05-14 15:14:43] [INFO ] Computed 95 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 75 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :7
FORMULA BusinessProcesses-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
// Phase 1: matrix 501 rows 560 cols
[2022-05-14 15:14:43] [INFO ] Computed 95 place invariants in 14 ms
[2022-05-14 15:14:43] [INFO ] [Real]Absence check using 53 positive place invariants in 25 ms returned sat
[2022-05-14 15:14:43] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2022-05-14 15:14:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:43] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2022-05-14 15:14:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:14:44] [INFO ] [Nat]Absence check using 53 positive place invariants in 31 ms returned sat
[2022-05-14 15:14:44] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2022-05-14 15:14:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:44] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-05-14 15:14:44] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 3 ms to minimize.
[2022-05-14 15:14:44] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 2 ms to minimize.
[2022-05-14 15:14:44] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2022-05-14 15:14:44] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2022-05-14 15:14:45] [INFO ] Deduced a trap composed of 110 places in 134 ms of which 1 ms to minimize.
[2022-05-14 15:14:45] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:14:45] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:14:45] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:14:45] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:14:45] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:14:45] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:14:46] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 0 ms to minimize.
[2022-05-14 15:14:46] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:14:46] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 0 ms to minimize.
[2022-05-14 15:14:46] [INFO ] Deduced a trap composed of 129 places in 132 ms of which 0 ms to minimize.
[2022-05-14 15:14:46] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 0 ms to minimize.
[2022-05-14 15:14:46] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2022-05-14 15:14:47] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 0 ms to minimize.
[2022-05-14 15:14:47] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 1 ms to minimize.
[2022-05-14 15:14:47] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:14:47] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 0 ms to minimize.
[2022-05-14 15:14:47] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2022-05-14 15:14:47] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:14:48] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:14:48] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:14:48] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:14:48] [INFO ] Deduced a trap composed of 135 places in 127 ms of which 0 ms to minimize.
[2022-05-14 15:14:48] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 0 ms to minimize.
[2022-05-14 15:14:48] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:14:48] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:14:49] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:14:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-05-14 15:14:49] [INFO ] [Real]Absence check using 53 positive place invariants in 23 ms returned sat
[2022-05-14 15:14:49] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2022-05-14 15:14:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:49] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-05-14 15:14:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:14:49] [INFO ] [Nat]Absence check using 53 positive place invariants in 20 ms returned sat
[2022-05-14 15:14:49] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2022-05-14 15:14:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:49] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2022-05-14 15:14:49] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2022-05-14 15:14:49] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:14:50] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:14:50] [INFO ] Deduced a trap composed of 118 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:14:50] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:14:50] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2022-05-14 15:14:50] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:14:50] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:14:50] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 1 ms to minimize.
[2022-05-14 15:14:51] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:14:51] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:14:51] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 0 ms to minimize.
[2022-05-14 15:14:51] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:14:51] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2022-05-14 15:14:51] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 1 ms to minimize.
[2022-05-14 15:14:51] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 0 ms to minimize.
[2022-05-14 15:14:52] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 0 ms to minimize.
[2022-05-14 15:14:52] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2022-05-14 15:14:52] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:14:52] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:14:52] [INFO ] Deduced a trap composed of 137 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:14:52] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2022-05-14 15:14:52] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 0 ms to minimize.
[2022-05-14 15:14:52] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:14:53] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:14:53] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2022-05-14 15:14:53] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2022-05-14 15:14:53] [INFO ] Deduced a trap composed of 156 places in 101 ms of which 1 ms to minimize.
[2022-05-14 15:14:53] [INFO ] Deduced a trap composed of 150 places in 99 ms of which 0 ms to minimize.
[2022-05-14 15:14:53] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2022-05-14 15:14:53] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:14:53] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 1 ms to minimize.
[2022-05-14 15:14:54] [INFO ] Deduced a trap composed of 154 places in 115 ms of which 1 ms to minimize.
[2022-05-14 15:14:54] [INFO ] Deduced a trap composed of 142 places in 110 ms of which 1 ms to minimize.
[2022-05-14 15:14:54] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 2 ms to minimize.
[2022-05-14 15:14:54] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2022-05-14 15:14: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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 15:14:54] [INFO ] [Real]Absence check using 53 positive place invariants in 19 ms returned sat
[2022-05-14 15:14:54] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2022-05-14 15:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:54] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2022-05-14 15:14:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:14:54] [INFO ] [Nat]Absence check using 53 positive place invariants in 18 ms returned sat
[2022-05-14 15:14:54] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 12 ms returned sat
[2022-05-14 15:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:55] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2022-05-14 15:14:55] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2022-05-14 15:14:55] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:14:55] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:14:55] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:14:55] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:14:55] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:14:56] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:14:56] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 0 ms to minimize.
[2022-05-14 15:14:56] [INFO ] Deduced a trap composed of 110 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:14:56] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:14:56] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:14:56] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 0 ms to minimize.
[2022-05-14 15:14:56] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2022-05-14 15:14:56] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:14:57] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:14:57] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2022-05-14 15:14:57] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2195 ms
[2022-05-14 15:14:57] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 28 ms.
[2022-05-14 15:14:59] [INFO ] Added : 273 causal constraints over 55 iterations in 1910 ms. Result :sat
Minimization took 111 ms.
[2022-05-14 15:14:59] [INFO ] [Real]Absence check using 53 positive place invariants in 19 ms returned sat
[2022-05-14 15:14:59] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2022-05-14 15:14:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:59] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2022-05-14 15:14:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:14:59] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2022-05-14 15:14:59] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2022-05-14 15:14:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:59] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2022-05-14 15:14:59] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2022-05-14 15:15:00] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:15:00] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2022-05-14 15:15:00] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:15:00] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:15:00] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:15:00] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:15:00] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:15:01] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 1 ms to minimize.
[2022-05-14 15:15:01] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 1 ms to minimize.
[2022-05-14 15:15:01] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
[2022-05-14 15:15:01] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:15:01] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 0 ms to minimize.
[2022-05-14 15:15:01] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:15:01] [INFO ] Deduced a trap composed of 112 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:15:02] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:15:02] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:15:02] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 1 ms to minimize.
[2022-05-14 15:15:02] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:15:02] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2022-05-14 15:15:02] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 0 ms to minimize.
[2022-05-14 15:15:02] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2022-05-14 15:15:02] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3088 ms
[2022-05-14 15:15:02] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 29 ms.
[2022-05-14 15:15:04] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 0 ms to minimize.
[2022-05-14 15:15:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-05-14 15:15:04] [INFO ] [Real]Absence check using 53 positive place invariants in 18 ms returned sat
[2022-05-14 15:15:04] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2022-05-14 15:15:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:05] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2022-05-14 15:15:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:15:05] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2022-05-14 15:15:05] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 13 ms returned sat
[2022-05-14 15:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:05] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2022-05-14 15:15:05] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2022-05-14 15:15:05] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:15:05] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:15:05] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:15:06] [INFO ] Deduced a trap composed of 111 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:15:06] [INFO ] Deduced a trap composed of 136 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:15:06] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:15:06] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:15:06] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:15:06] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 0 ms to minimize.
[2022-05-14 15:15:06] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:15:07] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:15:07] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:15:07] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2022-05-14 15:15:07] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:15:07] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:15:07] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 0 ms to minimize.
[2022-05-14 15:15:07] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:15:07] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 0 ms to minimize.
[2022-05-14 15:15:08] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 0 ms to minimize.
[2022-05-14 15:15:08] [INFO ] Deduced a trap composed of 119 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:15:08] [INFO ] Deduced a trap composed of 111 places in 101 ms of which 0 ms to minimize.
[2022-05-14 15:15:08] [INFO ] Deduced a trap composed of 106 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:15:08] [INFO ] Deduced a trap composed of 115 places in 94 ms of which 0 ms to minimize.
[2022-05-14 15:15:08] [INFO ] Deduced a trap composed of 108 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:15:08] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 0 ms to minimize.
[2022-05-14 15:15:08] [INFO ] Deduced a trap composed of 116 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:15:09] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:15:09] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2022-05-14 15:15:09] [INFO ] Deduced a trap composed of 114 places in 100 ms of which 0 ms to minimize.
[2022-05-14 15:15:09] [INFO ] Deduced a trap composed of 116 places in 97 ms of which 1 ms to minimize.
[2022-05-14 15:15:09] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:15:09] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 1 ms to minimize.
[2022-05-14 15:15:09] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:15:09] [INFO ] Deduced a trap composed of 112 places in 99 ms of which 1 ms to minimize.
[2022-05-14 15:15:10] [INFO ] Deduced a trap composed of 103 places in 101 ms of which 0 ms to minimize.
[2022-05-14 15:15:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 15:15:10] [INFO ] [Real]Absence check using 53 positive place invariants in 19 ms returned sat
[2022-05-14 15:15:10] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2022-05-14 15:15:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:10] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2022-05-14 15:15:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:15:10] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2022-05-14 15:15:10] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2022-05-14 15:15:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:10] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2022-05-14 15:15:10] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 0 ms to minimize.
[2022-05-14 15:15:10] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:15:11] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:15:11] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 0 ms to minimize.
[2022-05-14 15:15:11] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2022-05-14 15:15:11] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:15:11] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2022-05-14 15:15:11] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:15:11] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:15:12] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:15:12] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:15:12] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:15:12] [INFO ] Deduced a trap composed of 127 places in 116 ms of which 0 ms to minimize.
[2022-05-14 15:15:12] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:15:12] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:15:12] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 0 ms to minimize.
[2022-05-14 15:15:13] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 1 ms to minimize.
[2022-05-14 15:15:13] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:15:13] [INFO ] Deduced a trap composed of 116 places in 116 ms of which 0 ms to minimize.
[2022-05-14 15:15:13] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2022-05-14 15:15:13] [INFO ] Deduced a trap composed of 113 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:15:13] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:15:13] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 0 ms to minimize.
[2022-05-14 15:15:14] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:15:14] [INFO ] Deduced a trap composed of 121 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:15:14] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 0 ms to minimize.
[2022-05-14 15:15:14] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:15:14] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:15:14] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2022-05-14 15:15:14] [INFO ] Deduced a trap composed of 126 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:15:14] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2022-05-14 15:15:15] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2022-05-14 15:15:15] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2022-05-14 15:15:15] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2022-05-14 15:15:15] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2022-05-14 15:15:15] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 0 ms to minimize.
[2022-05-14 15:15:15] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2022-05-14 15:15:15] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2022-05-14 15:15:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-05-14 15:15:15] [INFO ] [Real]Absence check using 53 positive place invariants in 18 ms returned sat
[2022-05-14 15:15:15] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2022-05-14 15:15:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:15] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2022-05-14 15:15:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:15:15] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2022-05-14 15:15:15] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2022-05-14 15:15:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:16] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2022-05-14 15:15:16] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:15:16] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2022-05-14 15:15:16] [INFO ] Deduced a trap composed of 114 places in 113 ms of which 1 ms to minimize.
[2022-05-14 15:15:16] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:15:16] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:15:16] [INFO ] Deduced a trap composed of 112 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:15:16] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 1 ms to minimize.
[2022-05-14 15:15:17] [INFO ] Deduced a trap composed of 121 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:15:17] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:15:17] [INFO ] Deduced a trap composed of 112 places in 111 ms of which 0 ms to minimize.
[2022-05-14 15:15:17] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:15:17] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:15:17] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:15:17] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:15:18] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:15:18] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:15:18] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:15:18] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2022-05-14 15:15:18] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2022-05-14 15:15:18] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:15:18] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:15:18] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:15:19] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2022-05-14 15:15:19] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2022-05-14 15:15:19] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2022-05-14 15:15:19] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 0 ms to minimize.
[2022-05-14 15:15:19] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3215 ms
[2022-05-14 15:15:19] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 27 ms.
[2022-05-14 15:15:20] [INFO ] Added : 221 causal constraints over 45 iterations in 1512 ms. Result :sat
Minimization took 17 ms.
[2022-05-14 15:15:20] [INFO ] [Real]Absence check using 53 positive place invariants in 19 ms returned sat
[2022-05-14 15:15:20] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2022-05-14 15:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:21] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-05-14 15:15:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:15:21] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2022-05-14 15:15:21] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2022-05-14 15:15:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:21] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-05-14 15:15:21] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:15:21] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:15:21] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:15:21] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:15:22] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2022-05-14 15:15:22] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:15:22] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:15:22] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:15:22] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:15:22] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 1 ms to minimize.
[2022-05-14 15:15:22] [INFO ] Deduced a trap composed of 110 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:15:23] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2022-05-14 15:15:23] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 0 ms to minimize.
[2022-05-14 15:15:23] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2022-05-14 15:15:23] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2022-05-14 15:15:23] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2022-05-14 15:15:23] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2022-05-14 15:15:24] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 1 ms to minimize.
[2022-05-14 15:15:24] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2022-05-14 15:15:24] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2022-05-14 15:15:24] [INFO ] Deduced a trap composed of 121 places in 125 ms of which 0 ms to minimize.
[2022-05-14 15:15:24] [INFO ] Deduced a trap composed of 119 places in 120 ms of which 0 ms to minimize.
[2022-05-14 15:15:24] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:15:24] [INFO ] Deduced a trap composed of 121 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:15:25] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2022-05-14 15:15:25] [INFO ] Deduced a trap composed of 129 places in 114 ms of which 1 ms to minimize.
[2022-05-14 15:15:25] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:15:25] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2022-05-14 15:15:25] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:15:25] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 1 ms to minimize.
[2022-05-14 15:15:25] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2022-05-14 15:15:26] [INFO ] Deduced a trap composed of 116 places in 123 ms of which 1 ms to minimize.
[2022-05-14 15:15:26] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:15:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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-05-14 15:15:26] [INFO ] [Real]Absence check using 53 positive place invariants in 18 ms returned sat
[2022-05-14 15:15:26] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2022-05-14 15:15:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:26] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-05-14 15:15:26] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
[2022-05-14 15:15:26] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2022-05-14 15:15:26] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2022-05-14 15:15:27] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:15:27] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:15:27] [INFO ] Deduced a trap composed of 124 places in 115 ms of which 1 ms to minimize.
[2022-05-14 15:15:27] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 3 ms to minimize.
[2022-05-14 15:15:27] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:15:27] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 1 ms to minimize.
[2022-05-14 15:15:27] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 1 ms to minimize.
[2022-05-14 15:15:28] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:15:28] [INFO ] Deduced a trap composed of 117 places in 123 ms of which 1 ms to minimize.
[2022-05-14 15:15:28] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2022-05-14 15:15:28] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:15:28] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:15:28] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:15:28] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 4 ms to minimize.
[2022-05-14 15:15:29] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2022-05-14 15:15:29] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:15:29] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:15:29] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:15:29] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:15:29] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 0 ms to minimize.
[2022-05-14 15:15:29] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:15:30] [INFO ] Deduced a trap composed of 123 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:15:30] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:15:30] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 1 ms to minimize.
[2022-05-14 15:15:30] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:15:30] [INFO ] Deduced a trap composed of 108 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:15:30] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2022-05-14 15:15:30] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 0 ms to minimize.
[2022-05-14 15:15:30] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:15:31] [INFO ] Deduced a trap composed of 117 places in 101 ms of which 0 ms to minimize.
[2022-05-14 15:15:31] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:15:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
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:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 27500 steps, including 204 resets, run finished after 68 ms. (steps per millisecond=404 ) properties (out of 9) seen :3 could not realise parikh vector
FORMULA BusinessProcesses-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 560 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 310 edges and 560 vertex of which 7 / 560 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1132 edges and 554 vertex of which 549 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 549 transition count 373
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 241 place count 430 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 242 place count 429 transition count 372
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 242 place count 429 transition count 284
Deduced a syphon composed of 88 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 434 place count 325 transition count 284
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 500 place count 259 transition count 218
Iterating global reduction 3 with 66 rules applied. Total rules applied 566 place count 259 transition count 218
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 566 place count 259 transition count 214
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 574 place count 255 transition count 214
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 175 rules applied. Total rules applied 749 place count 166 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 751 place count 165 transition count 132
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 753 place count 165 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 755 place count 163 transition count 130
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 759 place count 163 transition count 130
Applied a total of 759 rules in 133 ms. Remains 163 /560 variables (removed 397) and now considering 130/501 (removed 371) transitions.
Finished structural reductions, in 1 iterations. Remains : 163/560 places, 130/501 transitions.
// Phase 1: matrix 130 rows 163 cols
[2022-05-14 15:15:31] [INFO ] Computed 72 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 54488 resets, run finished after 2911 ms. (steps per millisecond=343 ) properties (out of 6) seen :6
FORMULA BusinessProcesses-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652541335410

--------------------
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="BusinessProcesses-PT-11"
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 BusinessProcesses-PT-11, 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 r028-tall-165251936100151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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