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.r233-tall-165286037600370.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 ShieldRVt-PT-020B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037600370
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.1K Apr 30 00:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 30 00:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 00:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 00:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 239K May 10 09:34 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 ShieldRVt-PT-020B-UpperBounds-00
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-01
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-02
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-03
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-04
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-05
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-06
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-07
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-08
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-09
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-10
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-11
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-12
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-13
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-14
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653033678827

Running Version 0
[2022-05-20 08:01:20] [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-20 08:01:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 08:01:20] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2022-05-20 08:01:20] [INFO ] Transformed 1003 places.
[2022-05-20 08:01:20] [INFO ] Transformed 1003 transitions.
[2022-05-20 08:01:20] [INFO ] Found NUPN structural information;
[2022-05-20 08:01:20] [INFO ] Parsed PT model containing 1003 places and 1003 transitions in 285 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 1003 rows 1003 cols
[2022-05-20 08:01:20] [INFO ] Computed 81 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :9
FORMULA ShieldRVt-PT-020B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
// Phase 1: matrix 1003 rows 1003 cols
[2022-05-20 08:01:20] [INFO ] Computed 81 place invariants in 12 ms
[2022-05-20 08:01:21] [INFO ] [Real]Absence check using 81 positive place invariants in 33 ms returned sat
[2022-05-20 08:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:01:21] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2022-05-20 08:01:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:01:21] [INFO ] [Nat]Absence check using 81 positive place invariants in 42 ms returned sat
[2022-05-20 08:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:01:22] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2022-05-20 08:01:22] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 4 ms to minimize.
[2022-05-20 08:01:22] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 1 ms to minimize.
[2022-05-20 08:01:22] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 1 ms to minimize.
[2022-05-20 08:01:23] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 2 ms to minimize.
[2022-05-20 08:01:23] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 1 ms to minimize.
[2022-05-20 08:01:23] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 2 ms to minimize.
[2022-05-20 08:01:23] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 0 ms to minimize.
[2022-05-20 08:01:24] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 1 ms to minimize.
[2022-05-20 08:01:24] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 1 ms to minimize.
[2022-05-20 08:01:24] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 0 ms to minimize.
[2022-05-20 08:01:24] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 1 ms to minimize.
[2022-05-20 08:01:24] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 1 ms to minimize.
[2022-05-20 08:01:25] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 0 ms to minimize.
[2022-05-20 08:01:25] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 1 ms to minimize.
[2022-05-20 08:01:25] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 1 ms to minimize.
[2022-05-20 08:01:25] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 1 ms to minimize.
[2022-05-20 08:01:25] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 1 ms to minimize.
[2022-05-20 08:01:26] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 1 ms to minimize.
[2022-05-20 08:01:26] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 0 ms to minimize.
[2022-05-20 08:01:26] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 0 ms to minimize.
[2022-05-20 08:01:26] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 0 ms to minimize.
[2022-05-20 08:01:26] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 0 ms to minimize.
[2022-05-20 08:01: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 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-20 08:01:26] [INFO ] [Real]Absence check using 81 positive place invariants in 32 ms returned sat
[2022-05-20 08:01:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:01:27] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2022-05-20 08:01:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:01:27] [INFO ] [Nat]Absence check using 81 positive place invariants in 30 ms returned sat
[2022-05-20 08:01:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:01:27] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2022-05-20 08:01:27] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 1 ms to minimize.
[2022-05-20 08:01:28] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 1 ms to minimize.
[2022-05-20 08:01:28] [INFO ] Deduced a trap composed of 62 places in 211 ms of which 1 ms to minimize.
[2022-05-20 08:01:28] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 1 ms to minimize.
[2022-05-20 08:01:28] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 1 ms to minimize.
[2022-05-20 08:01:29] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 0 ms to minimize.
[2022-05-20 08:01:29] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 0 ms to minimize.
[2022-05-20 08:01:29] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 1 ms to minimize.
[2022-05-20 08:01:29] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 0 ms to minimize.
[2022-05-20 08:01:29] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 3 ms to minimize.
[2022-05-20 08:01:30] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 4 ms to minimize.
[2022-05-20 08:01:30] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 2 ms to minimize.
[2022-05-20 08:01:30] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 1 ms to minimize.
[2022-05-20 08:01:30] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 1 ms to minimize.
[2022-05-20 08:01:30] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 1 ms to minimize.
[2022-05-20 08:01:31] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 0 ms to minimize.
[2022-05-20 08:01:31] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 0 ms to minimize.
[2022-05-20 08:01:31] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 1 ms to minimize.
[2022-05-20 08:01:31] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 1 ms to minimize.
[2022-05-20 08:01:31] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 1 ms to minimize.
[2022-05-20 08:01:32] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 1 ms to minimize.
[2022-05-20 08:01:32] [INFO ] Deduced a trap composed of 57 places in 155 ms of which 1 ms to minimize.
[2022-05-20 08:01:32] [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-20 08:01:32] [INFO ] [Real]Absence check using 81 positive place invariants in 30 ms returned sat
[2022-05-20 08:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:01:32] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2022-05-20 08:01:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:01:32] [INFO ] [Nat]Absence check using 81 positive place invariants in 31 ms returned sat
[2022-05-20 08:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:01:33] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2022-05-20 08:01:33] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 1 ms to minimize.
[2022-05-20 08:01:33] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 0 ms to minimize.
[2022-05-20 08:01:33] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 1 ms to minimize.
[2022-05-20 08:01:34] [INFO ] Deduced a trap composed of 46 places in 213 ms of which 1 ms to minimize.
[2022-05-20 08:01:34] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 1 ms to minimize.
[2022-05-20 08:01:34] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 0 ms to minimize.
[2022-05-20 08:01:34] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 2 ms to minimize.
[2022-05-20 08:01:35] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 0 ms to minimize.
[2022-05-20 08:01:35] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 1 ms to minimize.
[2022-05-20 08:01:35] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 0 ms to minimize.
[2022-05-20 08:01:35] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 1 ms to minimize.
[2022-05-20 08:01:36] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 4 ms to minimize.
[2022-05-20 08:01:36] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 1 ms to minimize.
[2022-05-20 08:01:36] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 0 ms to minimize.
[2022-05-20 08:01:36] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 1 ms to minimize.
[2022-05-20 08:01:36] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 1 ms to minimize.
[2022-05-20 08:01:37] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 0 ms to minimize.
[2022-05-20 08:01:37] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 0 ms to minimize.
[2022-05-20 08:01:37] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 0 ms to minimize.
[2022-05-20 08:01:37] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 1 ms to minimize.
[2022-05-20 08:01:37] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 0 ms to minimize.
[2022-05-20 08:01:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-20 08:01:38] [INFO ] [Real]Absence check using 81 positive place invariants in 31 ms returned sat
[2022-05-20 08:01:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:01:38] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-05-20 08:01:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:01:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 29 ms returned sat
[2022-05-20 08:01:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:01:38] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2022-05-20 08:01:38] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 3 ms to minimize.
[2022-05-20 08:01:39] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 2 ms to minimize.
[2022-05-20 08:01:39] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 9 ms to minimize.
[2022-05-20 08:01:39] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 0 ms to minimize.
[2022-05-20 08:01:39] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 1 ms to minimize.
[2022-05-20 08:01:40] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 1 ms to minimize.
[2022-05-20 08:01:40] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 1 ms to minimize.
[2022-05-20 08:01:40] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 1 ms to minimize.
[2022-05-20 08:01:40] [INFO ] Deduced a trap composed of 64 places in 181 ms of which 0 ms to minimize.
[2022-05-20 08:01:41] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 0 ms to minimize.
[2022-05-20 08:01:41] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 0 ms to minimize.
[2022-05-20 08:01:41] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 1 ms to minimize.
[2022-05-20 08:01:41] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 0 ms to minimize.
[2022-05-20 08:01:41] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 1 ms to minimize.
[2022-05-20 08:01:42] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 0 ms to minimize.
[2022-05-20 08:01:42] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 1 ms to minimize.
[2022-05-20 08:01:42] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 1 ms to minimize.
[2022-05-20 08:01:42] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 1 ms to minimize.
[2022-05-20 08:01:42] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 0 ms to minimize.
[2022-05-20 08:01:43] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 1 ms to minimize.
[2022-05-20 08:01:43] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 1 ms to minimize.
[2022-05-20 08:01:43] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 0 ms to minimize.
[2022-05-20 08:01:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-20 08:01:43] [INFO ] [Real]Absence check using 81 positive place invariants in 31 ms returned sat
[2022-05-20 08:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:01:43] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2022-05-20 08:01:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:01:44] [INFO ] [Nat]Absence check using 81 positive place invariants in 32 ms returned sat
[2022-05-20 08:01:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:01:44] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2022-05-20 08:01:44] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 1 ms to minimize.
[2022-05-20 08:01:44] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 0 ms to minimize.
[2022-05-20 08:01:45] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 1 ms to minimize.
[2022-05-20 08:01:45] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 0 ms to minimize.
[2022-05-20 08:01:45] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 0 ms to minimize.
[2022-05-20 08:01:45] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 0 ms to minimize.
[2022-05-20 08:01:46] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 0 ms to minimize.
[2022-05-20 08:01:46] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 0 ms to minimize.
[2022-05-20 08:01:46] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 0 ms to minimize.
[2022-05-20 08:01:46] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 0 ms to minimize.
[2022-05-20 08:01:46] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 0 ms to minimize.
[2022-05-20 08:01:46] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 1 ms to minimize.
[2022-05-20 08:01:47] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 1 ms to minimize.
[2022-05-20 08:01:47] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 1 ms to minimize.
[2022-05-20 08:01:47] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 0 ms to minimize.
[2022-05-20 08:01:47] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 1 ms to minimize.
[2022-05-20 08:01:47] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 1 ms to minimize.
[2022-05-20 08:01:48] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 1 ms to minimize.
[2022-05-20 08:01:48] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 1 ms to minimize.
[2022-05-20 08:01:48] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 0 ms to minimize.
[2022-05-20 08:01:48] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 1 ms to minimize.
[2022-05-20 08:01:48] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 0 ms to minimize.
[2022-05-20 08:01:49] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 0 ms to minimize.
[2022-05-20 08:01: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: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-20 08:01:49] [INFO ] [Real]Absence check using 81 positive place invariants in 30 ms returned sat
[2022-05-20 08:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:01:49] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2022-05-20 08:01:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:01:49] [INFO ] [Nat]Absence check using 81 positive place invariants in 34 ms returned sat
[2022-05-20 08:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:01:49] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2022-05-20 08:01:50] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 0 ms to minimize.
[2022-05-20 08:01:50] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 1 ms to minimize.
[2022-05-20 08:01:50] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 1 ms to minimize.
[2022-05-20 08:01:50] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 1 ms to minimize.
[2022-05-20 08:01:51] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 0 ms to minimize.
[2022-05-20 08:01:51] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 0 ms to minimize.
[2022-05-20 08:01:51] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 0 ms to minimize.
[2022-05-20 08:01:51] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 0 ms to minimize.
[2022-05-20 08:01:51] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 1 ms to minimize.
[2022-05-20 08:01:52] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 1 ms to minimize.
[2022-05-20 08:01:52] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 1 ms to minimize.
[2022-05-20 08:01:52] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 0 ms to minimize.
[2022-05-20 08:01:52] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 0 ms to minimize.
[2022-05-20 08:01:53] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 1 ms to minimize.
[2022-05-20 08:01:53] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 1 ms to minimize.
[2022-05-20 08:01:53] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 1 ms to minimize.
[2022-05-20 08:01:53] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 1 ms to minimize.
[2022-05-20 08:01:53] [INFO ] Deduced a trap composed of 85 places in 157 ms of which 0 ms to minimize.
[2022-05-20 08:01:54] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 1 ms to minimize.
[2022-05-20 08:01:54] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 1 ms to minimize.
[2022-05-20 08:01:54] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 0 ms to minimize.
[2022-05-20 08:01:54] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 0 ms to minimize.
[2022-05-20 08:01: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 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-20 08:01:54] [INFO ] [Real]Absence check using 81 positive place invariants in 30 ms returned sat
[2022-05-20 08:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:01:55] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2022-05-20 08:01:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:01:55] [INFO ] [Nat]Absence check using 81 positive place invariants in 32 ms returned sat
[2022-05-20 08:01:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:01:55] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2022-05-20 08:01:55] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 1 ms to minimize.
[2022-05-20 08:01:55] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 0 ms to minimize.
[2022-05-20 08:01:56] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 0 ms to minimize.
[2022-05-20 08:01:56] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 0 ms to minimize.
[2022-05-20 08:01:56] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 1 ms to minimize.
[2022-05-20 08:01:56] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 0 ms to minimize.
[2022-05-20 08:01:56] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 1 ms to minimize.
[2022-05-20 08:01:57] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 0 ms to minimize.
[2022-05-20 08:01:57] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 0 ms to minimize.
[2022-05-20 08:01:57] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 1 ms to minimize.
[2022-05-20 08:01:57] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 0 ms to minimize.
[2022-05-20 08:01:57] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 1 ms to minimize.
[2022-05-20 08:01:58] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 1 ms to minimize.
[2022-05-20 08:01:58] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 0 ms to minimize.
[2022-05-20 08:01:58] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 1 ms to minimize.
[2022-05-20 08:01:58] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 0 ms to minimize.
[2022-05-20 08:01:58] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 1 ms to minimize.
[2022-05-20 08:01:58] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 0 ms to minimize.
[2022-05-20 08:01:58] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3436 ms
[2022-05-20 08:01:59] [INFO ] Computed and/alt/rep : 1002/1483/1002 causal constraints (skipped 0 transitions) in 55 ms.
[2022-05-20 08:02:00] [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 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 318 transitions
Trivial Post-agglo rules discarded 318 transitions
Performed 318 trivial Post agglomeration. Transition count delta: 318
Iterating post reduction 0 with 318 rules applied. Total rules applied 318 place count 1003 transition count 685
Reduce places removed 318 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 320 rules applied. Total rules applied 638 place count 685 transition count 683
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 641 place count 684 transition count 681
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 643 place count 682 transition count 681
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 78 Pre rules applied. Total rules applied 643 place count 682 transition count 603
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 799 place count 604 transition count 603
Discarding 138 places :
Symmetric choice reduction at 4 with 138 rule applications. Total rules 937 place count 466 transition count 465
Iterating global reduction 4 with 138 rules applied. Total rules applied 1075 place count 466 transition count 465
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 1075 place count 466 transition count 408
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1189 place count 409 transition count 408
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 0 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 4 with 362 rules applied. Total rules applied 1551 place count 228 transition count 227
Renaming transitions due to excessive name length > 1024 char.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1665 place count 171 transition count 280
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1666 place count 171 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1667 place count 170 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1668 place count 169 transition count 278
Applied a total of 1668 rules in 162 ms. Remains 169 /1003 variables (removed 834) and now considering 278/1003 (removed 725) transitions.
Finished structural reductions, in 1 iterations. Remains : 169/1003 places, 278/1003 transitions.
// Phase 1: matrix 278 rows 169 cols
[2022-05-20 08:02:00] [INFO ] Computed 80 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 270 resets, run finished after 2922 ms. (steps per millisecond=342 ) properties (out of 7) seen :7
FORMULA ShieldRVt-PT-020B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1653033724313

--------------------
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="ShieldRVt-PT-020B"
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 ShieldRVt-PT-020B, 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 r233-tall-165286037600370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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