Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r127-tall-167814504200001.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is CloudReconfiguration-PT-301, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-tall-167814504200001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 11:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 660K Mar 5 18:22 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 CloudReconfiguration-PT-301-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678174181121

Running Version 202205111006
[2023-03-07 07:29:42] [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]
[2023-03-07 07:29:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:29:42] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2023-03-07 07:29:42] [INFO ] Transformed 2584 places.
[2023-03-07 07:29:42] [INFO ] Transformed 3094 transitions.
[2023-03-07 07:29:42] [INFO ] Found NUPN structural information;
[2023-03-07 07:29:42] [INFO ] Parsed PT model containing 2584 places and 3094 transitions in 316 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 3094 rows 2584 cols
[2023-03-07 07:29:42] [INFO ] Computed 4 place invariants in 69 ms
Incomplete random walk after 10000 steps, including 77 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :5
FORMULA CloudReconfiguration-PT-301-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 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 21 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 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
// Phase 1: matrix 3094 rows 2584 cols
[2023-03-07 07:29:43] [INFO ] Computed 4 place invariants in 26 ms
[2023-03-07 07:29:43] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2023-03-07 07:29:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:29:45] [INFO ] [Real]Absence check using state equation in 1290 ms returned sat
[2023-03-07 07:29:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:29:45] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-07 07:29:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:29:47] [INFO ] [Nat]Absence check using state equation in 1268 ms returned sat
[2023-03-07 07:29:47] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 190 ms.
[2023-03-07 07:29:50] [INFO ] Added : 110 causal constraints over 22 iterations in 3233 ms. Result :unknown
[2023-03-07 07:29:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:29:52] [INFO ] [Real]Absence check using state equation in 1180 ms returned sat
[2023-03-07 07:29:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:29:52] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-07 07:29:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:29:53] [INFO ] [Nat]Absence check using state equation in 1226 ms returned sat
[2023-03-07 07:29:54] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 147 ms.
[2023-03-07 07:29:57] [INFO ] Added : 120 causal constraints over 24 iterations in 3243 ms. Result :unknown
[2023-03-07 07:29:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:29:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:29:58] [INFO ] [Real]Absence check using state equation in 1213 ms returned sat
[2023-03-07 07:29:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:29:59] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:00] [INFO ] [Nat]Absence check using state equation in 1179 ms returned sat
[2023-03-07 07:30:00] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 157 ms.
[2023-03-07 07:30:04] [INFO ] Added : 120 causal constraints over 24 iterations in 3326 ms. Result :unknown
[2023-03-07 07:30:04] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 07:30:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:05] [INFO ] [Real]Absence check using state equation in 1271 ms returned sat
[2023-03-07 07:30:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:30:06] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:30:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:07] [INFO ] [Nat]Absence check using state equation in 1243 ms returned sat
[2023-03-07 07:30:07] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 140 ms.
[2023-03-07 07:30:10] [INFO ] Added : 120 causal constraints over 24 iterations in 3218 ms. Result :unknown
[2023-03-07 07:30:11] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 07:30:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:12] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2023-03-07 07:30:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:30:13] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 54 ms returned sat
[2023-03-07 07:30:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:14] [INFO ] [Nat]Absence check using state equation in 1210 ms returned sat
[2023-03-07 07:30:14] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 162 ms.
[2023-03-07 07:30:17] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-07 07:30:18] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-07 07:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:19] [INFO ] [Real]Absence check using state equation in 1291 ms returned sat
[2023-03-07 07:30:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:30:19] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2023-03-07 07:30:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:21] [INFO ] [Nat]Absence check using state equation in 1259 ms returned sat
[2023-03-07 07:30:21] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 166 ms.
[2023-03-07 07:30:24] [INFO ] Added : 115 causal constraints over 23 iterations in 3257 ms. Result :unknown
[2023-03-07 07:30:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 07:30:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:26] [INFO ] [Real]Absence check using state equation in 1120 ms returned sat
[2023-03-07 07:30:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:30:26] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:27] [INFO ] [Nat]Absence check using state equation in 1150 ms returned sat
[2023-03-07 07:30:27] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 143 ms.
[2023-03-07 07:30:31] [INFO ] Added : 129 causal constraints over 26 iterations in 3430 ms. Result :unknown
[2023-03-07 07:30:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 07:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:32] [INFO ] [Real]Absence check using state equation in 1193 ms returned sat
[2023-03-07 07:30:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:30:33] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2023-03-07 07:30:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:34] [INFO ] [Nat]Absence check using state equation in 1343 ms returned sat
[2023-03-07 07:30:34] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 136 ms.
[2023-03-07 07:30:38] [INFO ] Added : 120 causal constraints over 24 iterations in 3205 ms. Result :unknown
[2023-03-07 07:30:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 07:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:39] [INFO ] [Real]Absence check using state equation in 1245 ms returned sat
[2023-03-07 07:30:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:30:40] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-07 07:30:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:41] [INFO ] [Nat]Absence check using state equation in 1209 ms returned sat
[2023-03-07 07:30:41] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 160 ms.
[2023-03-07 07:30:44] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-07 07:30:45] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 07:30:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:46] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2023-03-07 07:30:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:30:46] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 07:30:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:48] [INFO ] [Nat]Absence check using state equation in 1113 ms returned sat
[2023-03-07 07:30:48] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 141 ms.
[2023-03-07 07:30:51] [INFO ] Added : 122 causal constraints over 25 iterations in 3425 ms. Result :unknown
[2023-03-07 07:30:51] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 07:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:53] [INFO ] [Real]Absence check using state equation in 1196 ms returned sat
[2023-03-07 07:30:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:30:53] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-07 07:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:30:54] [INFO ] [Nat]Absence check using state equation in 1231 ms returned sat
[2023-03-07 07:30:55] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 158 ms.
[2023-03-07 07:30:58] [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 10
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudReconfiguration-PT-301-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 2584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Graph (trivial) has 2938 edges and 2584 vertex of which 845 / 2584 are part of one of the 62 SCC in 12 ms
Free SCC test removed 783 places
Drop transitions removed 956 transitions
Reduce isomorphic transitions removed 956 transitions.
Graph (complete) has 2416 edges and 1801 vertex of which 1787 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.8 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1207 transitions
Trivial Post-agglo rules discarded 1207 transitions
Performed 1207 trivial Post agglomeration. Transition count delta: 1207
Iterating post reduction 0 with 1216 rules applied. Total rules applied 1218 place count 1787 transition count 913
Reduce places removed 1207 places and 0 transitions.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 1 with 1343 rules applied. Total rules applied 2561 place count 580 transition count 777
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 2 with 68 rules applied. Total rules applied 2629 place count 519 transition count 770
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 8 rules applied. Total rules applied 2637 place count 517 transition count 764
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 8 rules applied. Total rules applied 2645 place count 513 transition count 760
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 7 rules applied. Total rules applied 2652 place count 511 transition count 755
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2657 place count 506 transition count 755
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2657 place count 506 transition count 733
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2701 place count 484 transition count 733
Discarding 79 places :
Symmetric choice reduction at 7 with 79 rule applications. Total rules 2780 place count 405 transition count 654
Iterating global reduction 7 with 79 rules applied. Total rules applied 2859 place count 405 transition count 654
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 7 with 5 rules applied. Total rules applied 2864 place count 405 transition count 649
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2865 place count 404 transition count 649
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 6 Pre rules applied. Total rules applied 2865 place count 404 transition count 643
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 2877 place count 398 transition count 643
Discarding 60 places :
Symmetric choice reduction at 9 with 60 rule applications. Total rules 2937 place count 338 transition count 583
Iterating global reduction 9 with 60 rules applied. Total rules applied 2997 place count 338 transition count 583
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 9 with 34 rules applied. Total rules applied 3031 place count 338 transition count 549
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 10 with 29 rules applied. Total rules applied 3060 place count 321 transition count 537
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3066 place count 315 transition count 537
Discarding 20 places :
Symmetric choice reduction at 12 with 20 rule applications. Total rules 3086 place count 295 transition count 506
Iterating global reduction 12 with 20 rules applied. Total rules applied 3106 place count 295 transition count 506
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 3114 place count 295 transition count 498
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 3123 place count 286 transition count 480
Iterating global reduction 13 with 9 rules applied. Total rules applied 3132 place count 286 transition count 480
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 3135 place count 283 transition count 474
Iterating global reduction 13 with 3 rules applied. Total rules applied 3138 place count 283 transition count 474
Performed 153 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 13 with 306 rules applied. Total rules applied 3444 place count 130 transition count 240
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 3447 place count 130 transition count 237
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 14 with 6 rules applied. Total rules applied 3453 place count 127 transition count 234
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3459 place count 127 transition count 228
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 3465 place count 124 transition count 225
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 3471 place count 124 transition count 219
Performed 36 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 16 with 72 rules applied. Total rules applied 3543 place count 88 transition count 251
Drop transitions removed 20 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 16 with 49 rules applied. Total rules applied 3592 place count 88 transition count 202
Discarding 21 places :
Symmetric choice reduction at 17 with 21 rule applications. Total rules 3613 place count 67 transition count 174
Iterating global reduction 17 with 21 rules applied. Total rules applied 3634 place count 67 transition count 174
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 17 with 11 rules applied. Total rules applied 3645 place count 67 transition count 163
Discarding 5 places :
Symmetric choice reduction at 18 with 5 rule applications. Total rules 3650 place count 62 transition count 153
Iterating global reduction 18 with 5 rules applied. Total rules applied 3655 place count 62 transition count 153
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 18 with 5 rules applied. Total rules applied 3660 place count 62 transition count 148
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 3681 place count 62 transition count 127
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 3683 place count 60 transition count 121
Iterating global reduction 19 with 2 rules applied. Total rules applied 3685 place count 60 transition count 121
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 3687 place count 58 transition count 119
Iterating global reduction 19 with 2 rules applied. Total rules applied 3689 place count 58 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 3691 place count 58 transition count 117
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 3693 place count 58 transition count 115
Free-agglomeration rule applied 4 times.
Iterating global reduction 20 with 4 rules applied. Total rules applied 3697 place count 58 transition count 111
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 3703 place count 54 transition count 109
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 21 with 9 rules applied. Total rules applied 3712 place count 54 transition count 109
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 3715 place count 54 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 3716 place count 53 transition count 105
Applied a total of 3716 rules in 267 ms. Remains 53 /2584 variables (removed 2531) and now considering 105/3094 (removed 2989) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/2584 places, 105/3094 transitions.
Normalized transition count is 100 out of 105 initially.
// Phase 1: matrix 100 rows 53 cols
[2023-03-07 07:30:58] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 17842 resets, run finished after 878 ms. (steps per millisecond=1138 ) properties (out of 8) seen :8
FORMULA CloudReconfiguration-PT-301-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 77259 ms.

BK_STOP 1678174259833

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="CloudReconfiguration-PT-301"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is CloudReconfiguration-PT-301, 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 r127-tall-167814504200001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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