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.r143-tall-165271830300190.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 LeafsetExtension-PT-S32C3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-tall-165271830300190
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 11K Apr 29 12:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 12:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 12:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 12:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 9 08:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.4M 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 LeafsetExtension-PT-S32C3-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652743414958

Running Version 0
[2022-05-16 23:23:36] [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-16 23:23:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 23:23:36] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2022-05-16 23:23:36] [INFO ] Transformed 5622 places.
[2022-05-16 23:23:36] [INFO ] Transformed 5449 transitions.
[2022-05-16 23:23:36] [INFO ] Parsed PT model containing 5622 places and 5449 transitions in 272 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 126 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2022-05-16 23:23:37] [INFO ] Computed 173 place invariants in 670 ms
Incomplete random walk after 10000 steps, including 387 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 16) seen :8
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :4
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :3
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :1
// Phase 1: matrix 5449 rows 5622 cols
[2022-05-16 23:23:38] [INFO ] Computed 173 place invariants in 306 ms
[2022-05-16 23:23:38] [INFO ] [Real]Absence check using 35 positive place invariants in 88 ms returned sat
[2022-05-16 23:23:39] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 144 ms returned sat
[2022-05-16 23:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:23:42] [INFO ] [Real]Absence check using state equation in 3054 ms returned sat
[2022-05-16 23:23:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:23:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 59 ms returned sat
[2022-05-16 23:23:43] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 140 ms returned sat
[2022-05-16 23:23:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:23:46] [INFO ] [Nat]Absence check using state equation in 2980 ms returned sat
[2022-05-16 23:23:46] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 314 ms.
[2022-05-16 23:23:54] [INFO ] Deduced a trap composed of 2 places in 6760 ms of which 14 ms to minimize.
[2022-05-16 23:23: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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-16 23:23:54] [INFO ] [Real]Absence check using 35 positive place invariants in 63 ms returned sat
[2022-05-16 23:23:54] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 175 ms returned sat
[2022-05-16 23:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:23:57] [INFO ] [Real]Absence check using state equation in 2994 ms returned sat
[2022-05-16 23:23:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:23:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 70 ms returned sat
[2022-05-16 23:23:58] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 172 ms returned sat
[2022-05-16 23:23:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:24:01] [INFO ] [Nat]Absence check using state equation in 2870 ms returned sat
[2022-05-16 23:24:02] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 252 ms.
[2022-05-16 23:24:03] [INFO ] Added : 11 causal constraints over 3 iterations in 1327 ms. Result :unknown
[2022-05-16 23:24:03] [INFO ] [Real]Absence check using 35 positive place invariants in 64 ms returned sat
[2022-05-16 23:24:03] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 122 ms returned sat
[2022-05-16 23:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:24:06] [INFO ] [Real]Absence check using state equation in 2861 ms returned sat
[2022-05-16 23:24:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:24:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 58 ms returned sat
[2022-05-16 23:24:07] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 129 ms returned sat
[2022-05-16 23:24:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:24:10] [INFO ] [Nat]Absence check using state equation in 3203 ms returned sat
[2022-05-16 23:24:11] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 217 ms.
[2022-05-16 23:24:18] [INFO ] Deduced a trap composed of 2 places in 6621 ms of which 6 ms to minimize.
[2022-05-16 23:24:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 23:24:19] [INFO ] [Real]Absence check using 35 positive place invariants in 58 ms returned sat
[2022-05-16 23:24:19] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 145 ms returned sat
[2022-05-16 23:24:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:24:22] [INFO ] [Real]Absence check using state equation in 3022 ms returned sat
[2022-05-16 23:24:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:24:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 61 ms returned sat
[2022-05-16 23:24:23] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 145 ms returned sat
[2022-05-16 23:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:24:26] [INFO ] [Nat]Absence check using state equation in 3394 ms returned sat
[2022-05-16 23:24:26] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 256 ms.
[2022-05-16 23:24:34] [INFO ] Deduced a trap composed of 2 places in 6539 ms of which 6 ms to minimize.
[2022-05-16 23:24:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 23:24:34] [INFO ] [Real]Absence check using 35 positive place invariants in 56 ms returned sat
[2022-05-16 23:24:34] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 130 ms returned sat
[2022-05-16 23:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:24:37] [INFO ] [Real]Absence check using state equation in 2845 ms returned sat
[2022-05-16 23:24:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:24:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 63 ms returned sat
[2022-05-16 23:24:38] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 116 ms returned sat
[2022-05-16 23:24:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:24:41] [INFO ] [Nat]Absence check using state equation in 3020 ms returned sat
[2022-05-16 23:24:41] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 231 ms.
[2022-05-16 23:24:42] [INFO ] Added : 15 causal constraints over 3 iterations in 1268 ms. Result :unknown
[2022-05-16 23:24:43] [INFO ] [Real]Absence check using 35 positive place invariants in 65 ms returned sat
[2022-05-16 23:24:43] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 129 ms returned sat
[2022-05-16 23:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:24:46] [INFO ] [Real]Absence check using state equation in 2917 ms returned sat
[2022-05-16 23:24:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:24:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 57 ms returned sat
[2022-05-16 23:24:47] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 122 ms returned sat
[2022-05-16 23:24:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:24:50] [INFO ] [Nat]Absence check using state equation in 2881 ms returned sat
[2022-05-16 23:24:50] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 214 ms.
[2022-05-16 23:24:51] [INFO ] Added : 14 causal constraints over 3 iterations in 1263 ms. Result :sat
[2022-05-16 23:24:52] [INFO ] [Real]Absence check using 35 positive place invariants in 63 ms returned sat
[2022-05-16 23:24:52] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 136 ms returned sat
[2022-05-16 23:24:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:24:55] [INFO ] [Real]Absence check using state equation in 3191 ms returned sat
[2022-05-16 23:24:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:24:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 57 ms returned sat
[2022-05-16 23:24:56] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 126 ms returned sat
[2022-05-16 23:24:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:24:59] [INFO ] [Nat]Absence check using state equation in 3330 ms returned sat
[2022-05-16 23:24:59] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 247 ms.
[2022-05-16 23:25:06] [INFO ] Deduced a trap composed of 2 places in 6397 ms of which 5 ms to minimize.
[2022-05-16 23:25:06] [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.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 1, 1, 1, 1] Max seen :[1, 1, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 2100 steps, including 96 resets, run finished after 12 ms. (steps per millisecond=175 ) properties (out of 7) seen :1 could not realise parikh vector
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1600 steps, including 94 resets, run finished after 11 ms. (steps per millisecond=145 ) properties (out of 6) seen :2 could not realise parikh vector
Support contains 6 out of 5622 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 261 are kept as prefixes of interest. Removing 5361 places using SCC suffix rule.15 ms
Discarding 5361 places :
Also discarding 3120 output transitions
Drop transitions removed 3120 transitions
Drop transitions removed 1085 transitions
Reduce isomorphic transitions removed 1085 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 1132 rules applied. Total rules applied 1133 place count 259 transition count 1199
Reduce places removed 47 places and 0 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 1 with 49 rules applied. Total rules applied 1182 place count 212 transition count 1197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1184 place count 210 transition count 1197
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1184 place count 210 transition count 1193
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1192 place count 206 transition count 1193
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1221 place count 177 transition count 1164
Iterating global reduction 3 with 29 rules applied. Total rules applied 1250 place count 177 transition count 1164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1252 place count 176 transition count 1163
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 1257 place count 176 transition count 1158
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1262 place count 171 transition count 1158
Partial Free-agglomeration rule applied 45 times.
Drop transitions removed 45 transitions
Iterating global reduction 4 with 45 rules applied. Total rules applied 1307 place count 171 transition count 1158
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 1309 place count 169 transition count 1158
Applied a total of 1309 rules in 173 ms. Remains 169 /5622 variables (removed 5453) and now considering 1158/5449 (removed 4291) transitions.
Finished structural reductions, in 1 iterations. Remains : 169/5622 places, 1158/5449 transitions.
Successfully produced net in file /tmp/petri1000_4211324754345950484.dot
Successfully produced net in file /tmp/petri1001_2884567425008849707.dot
Successfully produced net in file /tmp/petri1002_8591066379032044937.dot
Successfully produced net in file /tmp/petri1003_3293757040529022523.dot
Successfully produced net in file /tmp/petri1004_5621467059247281234.dot
Successfully produced net in file /tmp/petri1005_10770953202675451345.dot
Successfully produced net in file /tmp/petri1006_6015102693793114196.dot
Successfully produced net in file /tmp/petri1007_6537652817513533044.dot
Successfully produced net in file /tmp/petri1008_7534715649969197288.dot
Successfully produced net in file /tmp/petri1009_9630098125581480400.dot
Successfully produced net in file /tmp/petri1010_8322091382599524937.dot
Successfully produced net in file /tmp/petri1011_11283375204138083714.dot
Successfully produced net in file /tmp/petri1012_12564922241107227801.dot
Successfully produced net in file /tmp/petri1013_6940560093011867303.dot
Successfully produced net in file /tmp/petri1014_17053489100112606383.dot
Successfully produced net in file /tmp/petri1015_11803048878254192665.dot
Successfully produced net in file /tmp/petri1016_5548409745099451714.dot
Successfully produced net in file /tmp/petri1017_6251986265817942512.dot
Successfully produced net in file /tmp/petri1018_8987279570595041189.dot
Successfully produced net in file /tmp/petri1019_2120879157029314723.dot
Successfully produced net in file /tmp/petri1020_5672767937955710354.dot
Successfully produced net in file /tmp/petri1021_17409464456255191785.dot
Successfully produced net in file /tmp/petri1022_16687338124881452438.dot
Successfully produced net in file /tmp/petri1023_12979564425305653782.dot
Successfully produced net in file /tmp/petri1024_2616974437252847270.dot
Successfully produced net in file /tmp/petri1025_16483274044549956660.dot
Successfully produced net in file /tmp/petri1026_15238720295910497995.dot
Successfully produced net in file /tmp/petri1027_7401260660172154086.dot
Successfully produced net in file /tmp/petri1028_13267073897251561633.dot
Successfully produced net in file /tmp/petri1029_8131768497545493657.dot
Successfully produced net in file /tmp/petri1030_14008419561397050969.dot
Drop transitions removed 31 transitions
Dominated transitions for bounds rules discarded 31 transitions
Normalized transition count is 170 out of 1127 initially.
// Phase 1: matrix 170 rows 169 cols
[2022-05-16 23:25:07] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 106300 resets, run finished after 2937 ms. (steps per millisecond=340 ) properties (out of 6) seen :10
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6870 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 6812 resets, run finished after 732 ms. (steps per millisecond=1366 ) properties (out of 2) seen :6
[2022-05-16 23:25:11] [INFO ] Flow matrix only has 170 transitions (discarded 957 similar events)
// Phase 1: matrix 170 rows 169 cols
[2022-05-16 23:25:11] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-16 23:25:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:25:11] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 10 ms returned sat
[2022-05-16 23:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:25:11] [INFO ] [Real]Absence check using state equation in 49 ms returned unsat
[2022-05-16 23:25:11] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-05-16 23:25:12] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-16 23:25:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:25:12] [INFO ] [Real]Absence check using state equation in 26 ms returned unsat
Current structural bounds on expressions (after SMT) : [3, 3] Max seen :[3, 3]
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652743512972

--------------------
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="LeafsetExtension-PT-S32C3"
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 LeafsetExtension-PT-S32C3, 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 r143-tall-165271830300190"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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