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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 7.6K Apr 29 23:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 23:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 29 23:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 29 23:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 157K 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-15-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652541365872

Running Version 0
[2022-05-14 15:16:07] [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:16:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 15:16:07] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2022-05-14 15:16:07] [INFO ] Transformed 630 places.
[2022-05-14 15:16:07] [INFO ] Transformed 566 transitions.
[2022-05-14 15:16:07] [INFO ] Found NUPN structural information;
[2022-05-14 15:16:07] [INFO ] Parsed PT model containing 630 places and 566 transitions in 239 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
// Phase 1: matrix 562 rows 626 cols
[2022-05-14 15:16:07] [INFO ] Computed 102 place invariants in 46 ms
Incomplete random walk after 10000 steps, including 68 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :5
FORMULA BusinessProcesses-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :2
FORMULA BusinessProcesses-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 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 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
// Phase 1: matrix 562 rows 626 cols
[2022-05-14 15:16:07] [INFO ] Computed 102 place invariants in 23 ms
[2022-05-14 15:16:08] [INFO ] [Real]Absence check using 61 positive place invariants in 36 ms returned sat
[2022-05-14 15:16:08] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 17 ms returned sat
[2022-05-14 15:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:08] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2022-05-14 15:16:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:08] [INFO ] [Nat]Absence check using 61 positive place invariants in 27 ms returned sat
[2022-05-14 15:16:08] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2022-05-14 15:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:08] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2022-05-14 15:16:09] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 4 ms to minimize.
[2022-05-14 15:16:09] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2022-05-14 15:16:09] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 1 ms to minimize.
[2022-05-14 15:16:09] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2022-05-14 15:16:09] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:16:09] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 0 ms to minimize.
[2022-05-14 15:16:09] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 0 ms to minimize.
[2022-05-14 15:16:10] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2022-05-14 15:16:10] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2022-05-14 15:16:10] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2022-05-14 15:16:10] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2022-05-14 15:16:10] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2022-05-14 15:16:10] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 0 ms to minimize.
[2022-05-14 15:16:10] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2022-05-14 15:16:10] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2022-05-14 15:16:10] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1784 ms
[2022-05-14 15:16:10] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 36 ms.
[2022-05-14 15:16:13] [INFO ] Added : 303 causal constraints over 61 iterations in 2315 ms. Result :sat
Minimization took 124 ms.
[2022-05-14 15:16:13] [INFO ] [Real]Absence check using 61 positive place invariants in 27 ms returned sat
[2022-05-14 15:16:13] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2022-05-14 15:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:13] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2022-05-14 15:16:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:13] [INFO ] [Nat]Absence check using 61 positive place invariants in 22 ms returned sat
[2022-05-14 15:16:13] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2022-05-14 15:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:13] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2022-05-14 15:16:13] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 0 ms to minimize.
[2022-05-14 15:16:14] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2022-05-14 15:16:14] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 0 ms to minimize.
[2022-05-14 15:16:14] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2022-05-14 15:16:14] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 0 ms to minimize.
[2022-05-14 15:16:14] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 0 ms to minimize.
[2022-05-14 15:16:14] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
[2022-05-14 15:16:15] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 1 ms to minimize.
[2022-05-14 15:16:15] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2022-05-14 15:16:15] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:16:15] [INFO ] Deduced a trap composed of 153 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:16:15] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-14 15:16:15] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2022-05-14 15:16:15] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 0 ms to minimize.
[2022-05-14 15:16:15] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2022-05-14 15:16:16] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2022-05-14 15:16:16] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2022-05-14 15:16:16] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2022-05-14 15:16:16] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2022-05-14 15:16:16] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 5 ms to minimize.
[2022-05-14 15:16:16] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2528 ms
[2022-05-14 15:16:16] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 35 ms.
[2022-05-14 15:16:18] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2022-05-14 15:16:18] [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-05-14 15:16:18] [INFO ] [Real]Absence check using 61 positive place invariants in 22 ms returned sat
[2022-05-14 15:16:18] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2022-05-14 15:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:19] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2022-05-14 15:16:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:19] [INFO ] [Nat]Absence check using 61 positive place invariants in 22 ms returned sat
[2022-05-14 15:16:19] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 11 ms returned sat
[2022-05-14 15:16:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:19] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2022-05-14 15:16:19] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2022-05-14 15:16:19] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2022-05-14 15:16:19] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2022-05-14 15:16:20] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:16:20] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:16:20] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:16:20] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 0 ms to minimize.
[2022-05-14 15:16:20] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:16:20] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:16:20] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
[2022-05-14 15:16:21] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:16:21] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:16:21] [INFO ] Deduced a trap composed of 156 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:16:21] [INFO ] Deduced a trap composed of 150 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:16:21] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2022-05-14 15:16:21] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 0 ms to minimize.
[2022-05-14 15:16:21] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 1 ms to minimize.
[2022-05-14 15:16:22] [INFO ] Deduced a trap composed of 158 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:16:22] [INFO ] Deduced a trap composed of 144 places in 112 ms of which 0 ms to minimize.
[2022-05-14 15:16:22] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
[2022-05-14 15:16:22] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2847 ms
[2022-05-14 15:16:22] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 38 ms.
[2022-05-14 15:16:24] [INFO ] Added : 230 causal constraints over 46 iterations in 1852 ms. Result :unknown
[2022-05-14 15:16:24] [INFO ] [Real]Absence check using 61 positive place invariants in 26 ms returned sat
[2022-05-14 15:16:24] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2022-05-14 15:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:24] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2022-05-14 15:16:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:24] [INFO ] [Nat]Absence check using 61 positive place invariants in 26 ms returned sat
[2022-05-14 15:16:24] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2022-05-14 15:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:24] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2022-05-14 15:16:24] [INFO ] Deduced a trap composed of 138 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:16:25] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 1 ms to minimize.
[2022-05-14 15:16:25] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2022-05-14 15:16:25] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:16:25] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:16:25] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:16:25] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 0 ms to minimize.
[2022-05-14 15:16:25] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:16:26] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:16:26] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:16:26] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2022-05-14 15:16:26] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2022-05-14 15:16:26] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:16:26] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 2 ms to minimize.
[2022-05-14 15:16:26] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:16:27] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:16:27] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:16:27] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:16:27] [INFO ] Deduced a trap composed of 133 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:16:27] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 1 ms to minimize.
[2022-05-14 15:16:27] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:16:27] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2022-05-14 15:16:28] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:16:28] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 0 ms to minimize.
[2022-05-14 15:16:28] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:16:28] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:16:28] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 0 ms to minimize.
[2022-05-14 15:16:28] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:16:28] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:16:29] [INFO ] Deduced a trap composed of 139 places in 201 ms of which 1 ms to minimize.
[2022-05-14 15:16:29] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:16:29] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:16:29] [INFO ] Deduced a trap composed of 155 places in 126 ms of which 0 ms to minimize.
[2022-05-14 15:16:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 15:16:29] [INFO ] [Real]Absence check using 61 positive place invariants in 21 ms returned sat
[2022-05-14 15:16:29] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2022-05-14 15:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:30] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2022-05-14 15:16:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:30] [INFO ] [Nat]Absence check using 61 positive place invariants in 22 ms returned sat
[2022-05-14 15:16:30] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2022-05-14 15:16:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:30] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2022-05-14 15:16:30] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2022-05-14 15:16:30] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 0 ms to minimize.
[2022-05-14 15:16:30] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2022-05-14 15:16:31] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 0 ms to minimize.
[2022-05-14 15:16:31] [INFO ] Deduced a trap composed of 40 places in 224 ms of which 1 ms to minimize.
[2022-05-14 15:16:31] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2022-05-14 15:16:31] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 1 ms to minimize.
[2022-05-14 15:16:31] [INFO ] Deduced a trap composed of 134 places in 150 ms of which 0 ms to minimize.
[2022-05-14 15:16:32] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 1 ms to minimize.
[2022-05-14 15:16:32] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 0 ms to minimize.
[2022-05-14 15:16:32] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 0 ms to minimize.
[2022-05-14 15:16:32] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2022-05-14 15:16:32] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 0 ms to minimize.
[2022-05-14 15:16:33] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 0 ms to minimize.
[2022-05-14 15:16:33] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 0 ms to minimize.
[2022-05-14 15:16:33] [INFO ] Deduced a trap composed of 37 places in 213 ms of which 1 ms to minimize.
[2022-05-14 15:16:33] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 0 ms to minimize.
[2022-05-14 15:16:33] [INFO ] Deduced a trap composed of 124 places in 209 ms of which 1 ms to minimize.
[2022-05-14 15:16:34] [INFO ] Deduced a trap composed of 144 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:16:34] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:16:34] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:16:34] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 1 ms to minimize.
[2022-05-14 15:16:34] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:16:34] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:16:34] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2022-05-14 15:16:35] [INFO ] Deduced a trap composed of 153 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:16:35] [INFO ] Deduced a trap composed of 145 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:16:35] [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:16:35] [INFO ] [Real]Absence check using 61 positive place invariants in 22 ms returned sat
[2022-05-14 15:16:35] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2022-05-14 15:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:35] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2022-05-14 15:16:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:35] [INFO ] [Nat]Absence check using 61 positive place invariants in 22 ms returned sat
[2022-05-14 15:16:35] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2022-05-14 15:16:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:35] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2022-05-14 15:16:36] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:16:36] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:16:36] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:16:36] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:16:36] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2022-05-14 15:16:36] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2022-05-14 15:16:36] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2022-05-14 15:16:36] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2022-05-14 15:16:36] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2022-05-14 15:16:36] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2022-05-14 15:16:37] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2022-05-14 15:16:37] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2022-05-14 15:16:37] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2022-05-14 15:16:37] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2022-05-14 15:16:37] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2022-05-14 15:16:37] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2022-05-14 15:16:37] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2022-05-14 15:16:37] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2022-05-14 15:16:37] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2022-05-14 15:16:37] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1656 ms
[2022-05-14 15:16:37] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 31 ms.
[2022-05-14 15:16:40] [INFO ] Added : 315 causal constraints over 63 iterations in 2432 ms. Result :sat
Minimization took 134 ms.
[2022-05-14 15:16:40] [INFO ] [Real]Absence check using 61 positive place invariants in 22 ms returned sat
[2022-05-14 15:16:40] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2022-05-14 15:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:40] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2022-05-14 15:16:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:40] [INFO ] [Nat]Absence check using 61 positive place invariants in 21 ms returned sat
[2022-05-14 15:16:40] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 12 ms returned sat
[2022-05-14 15:16:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:40] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2022-05-14 15:16:40] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2022-05-14 15:16:41] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2022-05-14 15:16:41] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-05-14 15:16:41] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2022-05-14 15:16:41] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2022-05-14 15:16:41] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2022-05-14 15:16:41] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 0 ms to minimize.
[2022-05-14 15:16:41] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2022-05-14 15:16:41] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 0 ms to minimize.
[2022-05-14 15:16:41] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2022-05-14 15:16:41] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2022-05-14 15:16:41] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2022-05-14 15:16:41] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2022-05-14 15:16:41] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2022-05-14 15:16:42] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2022-05-14 15:16:42] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2022-05-14 15:16:42] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2022-05-14 15:16:42] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2022-05-14 15:16:42] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2022-05-14 15:16:42] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1546 ms
[2022-05-14 15:16:42] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 25 ms.
[2022-05-14 15:16:44] [INFO ] Added : 307 causal constraints over 62 iterations in 2349 ms. Result :sat
Minimization took 125 ms.
[2022-05-14 15:16:44] [INFO ] [Real]Absence check using 61 positive place invariants in 22 ms returned sat
[2022-05-14 15:16:44] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2022-05-14 15:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:45] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2022-05-14 15:16:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:45] [INFO ] [Nat]Absence check using 61 positive place invariants in 22 ms returned sat
[2022-05-14 15:16:45] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2022-05-14 15:16:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:45] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2022-05-14 15:16:45] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:16:45] [INFO ] Deduced a trap composed of 147 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:16:45] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:16:46] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:16:46] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:16:46] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:16:46] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:16:46] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:16:46] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:16:46] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:16:47] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:16:47] [INFO ] Deduced a trap composed of 151 places in 105 ms of which 1 ms to minimize.
[2022-05-14 15:16:47] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2022-05-14 15:16:47] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 0 ms to minimize.
[2022-05-14 15:16:47] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 0 ms to minimize.
[2022-05-14 15:16:47] [INFO ] Deduced a trap composed of 145 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:16:47] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2022-05-14 15:16:47] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:16:48] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:16:48] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:16:48] [INFO ] Deduced a trap composed of 148 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:16:48] [INFO ] Deduced a trap composed of 144 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:16:48] [INFO ] Deduced a trap composed of 146 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:16:48] [INFO ] Deduced a trap composed of 140 places in 110 ms of which 1 ms to minimize.
[2022-05-14 15:16:48] [INFO ] Deduced a trap composed of 147 places in 119 ms of which 1 ms to minimize.
[2022-05-14 15:16:49] [INFO ] Deduced a trap composed of 142 places in 112 ms of which 0 ms to minimize.
[2022-05-14 15:16:49] [INFO ] Deduced a trap composed of 145 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:16:49] [INFO ] Deduced a trap composed of 143 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:16:49] [INFO ] Deduced a trap composed of 153 places in 114 ms of which 0 ms to minimize.
[2022-05-14 15:16:49] [INFO ] Deduced a trap composed of 150 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:16:49] [INFO ] Deduced a trap composed of 149 places in 110 ms of which 1 ms to minimize.
[2022-05-14 15:16:49] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:16:50] [INFO ] Deduced a trap composed of 178 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:16:50] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 0 ms to minimize.
[2022-05-14 15:16:50] [INFO ] Deduced a trap composed of 148 places in 113 ms of which 1 ms to minimize.
[2022-05-14 15:16:50] [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:16:50] [INFO ] [Real]Absence check using 61 positive place invariants in 22 ms returned sat
[2022-05-14 15:16:50] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2022-05-14 15:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:50] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2022-05-14 15:16:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:50] [INFO ] [Nat]Absence check using 61 positive place invariants in 23 ms returned sat
[2022-05-14 15:16:50] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 20 ms returned sat
[2022-05-14 15:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:50] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2022-05-14 15:16:51] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:16:51] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2022-05-14 15:16:51] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:16:51] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:16:51] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:16:51] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 1 ms to minimize.
[2022-05-14 15:16:51] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2022-05-14 15:16:52] [INFO ] Deduced a trap composed of 144 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:16:52] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2022-05-14 15:16:52] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 0 ms to minimize.
[2022-05-14 15:16:52] [INFO ] Deduced a trap composed of 161 places in 112 ms of which 0 ms to minimize.
[2022-05-14 15:16:52] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:16:52] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:16:52] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 124 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 127 places in 100 ms of which 0 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 0 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 0 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 0 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2022-05-14 15:16:55] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2022-05-14 15:16:55] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 0 ms to minimize.
[2022-05-14 15:16:55] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2022-05-14 15:16:55] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 0 ms to minimize.
[2022-05-14 15:16:55] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 0 ms to minimize.
[2022-05-14 15:16:55] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 4324 ms
[2022-05-14 15:16:55] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 45 ms.
[2022-05-14 15:16:55] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 0 ms to minimize.
[2022-05-14 15:16:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 31100 steps, including 233 resets, run finished after 79 ms. (steps per millisecond=393 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 32300 steps, including 237 resets, run finished after 79 ms. (steps per millisecond=408 ) properties (out of 9) seen :3 could not realise parikh vector
FORMULA BusinessProcesses-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 43200 steps, including 320 resets, run finished after 93 ms. (steps per millisecond=464 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 30100 steps, including 222 resets, run finished after 65 ms. (steps per millisecond=463 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 562/562 transitions.
Graph (trivial) has 353 edges and 626 vertex of which 7 / 626 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1267 edges and 620 vertex of which 616 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 138 place count 616 transition count 417
Reduce places removed 136 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 480 transition count 415
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 278 place count 478 transition count 415
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 278 place count 478 transition count 321
Deduced a syphon composed of 94 places in 2 ms
Ensure Unique test removed 19 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 485 place count 365 transition count 321
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 563 place count 287 transition count 243
Iterating global reduction 3 with 78 rules applied. Total rules applied 641 place count 287 transition count 243
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 641 place count 287 transition count 236
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 657 place count 278 transition count 236
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 853 place count 179 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 855 place count 178 transition count 143
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 857 place count 178 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 859 place count 176 transition count 141
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 860 place count 176 transition count 141
Applied a total of 860 rules in 168 ms. Remains 176 /626 variables (removed 450) and now considering 141/562 (removed 421) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/626 places, 141/562 transitions.
// Phase 1: matrix 141 rows 176 cols
[2022-05-14 15:16:56] [INFO ] Computed 76 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 28725 resets, run finished after 2883 ms. (steps per millisecond=346 ) properties (out of 6) seen :5
FORMULA BusinessProcesses-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 16715 resets, run finished after 1830 ms. (steps per millisecond=546 ) properties (out of 1) seen :0
// Phase 1: matrix 141 rows 176 cols
[2022-05-14 15:17:01] [INFO ] Computed 76 place invariants in 4 ms
[2022-05-14 15:17:01] [INFO ] [Real]Absence check using 58 positive place invariants in 7 ms returned sat
[2022-05-14 15:17:01] [INFO ] [Real]Absence check using 58 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-14 15:17:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:01] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2022-05-14 15:17:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:17:01] [INFO ] [Nat]Absence check using 58 positive place invariants in 13 ms returned sat
[2022-05-14 15:17:01] [INFO ] [Nat]Absence check using 58 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-14 15:17:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:01] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-14 15:17:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-14 15:17:01] [INFO ] [Nat]Added 12 Read/Feed constraints in 23 ms returned sat
[2022-05-14 15:17:01] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
[2022-05-14 15:17:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-05-14 15:17:01] [INFO ] Computed and/alt/rep : 91/422/91 causal constraints (skipped 48 transitions) in 12 ms.
[2022-05-14 15:17:01] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2022-05-14 15:17:01] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2022-05-14 15:17:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2022-05-14 15:17:01] [INFO ] Added : 31 causal constraints over 7 iterations in 237 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 7300 steps, including 702 resets, run finished after 50 ms. (steps per millisecond=146 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 176/176 places, 141/141 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 176 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 174 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 174 transition count 137
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 171 transition count 137
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 168 transition count 134
Applied a total of 15 rules in 15 ms. Remains 168 /176 variables (removed 8) and now considering 134/141 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/176 places, 134/141 transitions.
// Phase 1: matrix 134 rows 168 cols
[2022-05-14 15:17:01] [INFO ] Computed 75 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 29956 resets, run finished after 2605 ms. (steps per millisecond=383 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 18479 resets, run finished after 1886 ms. (steps per millisecond=530 ) properties (out of 1) seen :0
// Phase 1: matrix 134 rows 168 cols
[2022-05-14 15:17:06] [INFO ] Computed 75 place invariants in 4 ms
[2022-05-14 15:17:06] [INFO ] [Real]Absence check using 59 positive place invariants in 7 ms returned sat
[2022-05-14 15:17:06] [INFO ] [Real]Absence check using 59 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-14 15:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:06] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-05-14 15:17:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:17:06] [INFO ] [Nat]Absence check using 59 positive place invariants in 16 ms returned sat
[2022-05-14 15:17:06] [INFO ] [Nat]Absence check using 59 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-14 15:17:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:06] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-14 15:17:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-14 15:17:06] [INFO ] [Nat]Added 12 Read/Feed constraints in 19 ms returned sat
[2022-05-14 15:17:06] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2022-05-14 15:17:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-05-14 15:17:06] [INFO ] Computed and/alt/rep : 83/399/83 causal constraints (skipped 49 transitions) in 8 ms.
[2022-05-14 15:17:06] [INFO ] Added : 25 causal constraints over 5 iterations in 81 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4800 steps, including 612 resets, run finished after 18 ms. (steps per millisecond=266 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 168 /168 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/168 places, 134/134 transitions.
Starting structural reductions, iteration 0 : 168/168 places, 134/134 transitions.
Applied a total of 0 rules in 8 ms. Remains 168 /168 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 168 cols
[2022-05-14 15:17:06] [INFO ] Computed 75 place invariants in 3 ms
[2022-05-14 15:17:06] [INFO ] Implicit Places using invariants in 343 ms returned [1, 2, 3, 4, 5, 10, 11, 34, 35, 36, 37, 42, 43, 44, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 348 ms to find 24 implicit places.
[2022-05-14 15:17:06] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 134 rows 144 cols
[2022-05-14 15:17:06] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-14 15:17:07] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Starting structural reductions, iteration 1 : 144/168 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 144 /144 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2022-05-14 15:17:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 134 rows 144 cols
[2022-05-14 15:17:07] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-14 15:17:07] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/168 places, 134/134 transitions.
Successfully produced net in file /tmp/petri1000_9794760185742198654.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 133 rows 144 cols
[2022-05-14 15:17:07] [INFO ] Computed 52 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 29801 resets, run finished after 1634 ms. (steps per millisecond=611 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 18321 resets, run finished after 1177 ms. (steps per millisecond=849 ) properties (out of 1) seen :0
// Phase 1: matrix 133 rows 144 cols
[2022-05-14 15:17:09] [INFO ] Computed 52 place invariants in 14 ms
[2022-05-14 15:17:09] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2022-05-14 15:17:09] [INFO ] [Real]Absence check using 35 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-14 15:17:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:10] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-14 15:17:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:17:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2022-05-14 15:17:10] [INFO ] [Nat]Absence check using 35 positive and 17 generalized place invariants in 8 ms returned sat
[2022-05-14 15:17:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:10] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-05-14 15:17:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-14 15:17:10] [INFO ] [Nat]Added 12 Read/Feed constraints in 9 ms returned sat
[2022-05-14 15:17:10] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
[2022-05-14 15:17:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-05-14 15:17:10] [INFO ] Computed and/alt/rep : 83/396/83 causal constraints (skipped 48 transitions) in 11 ms.
[2022-05-14 15:17:10] [INFO ] Added : 27 causal constraints over 6 iterations in 89 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4400 steps, including 449 resets, run finished after 10 ms. (steps per millisecond=440 ) properties (out of 1) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652541431223

--------------------
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-15"
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-15, 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-165251936100163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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