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-165286037100106.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 ShieldIIPt-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-165286037100106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 8.7K Apr 29 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 29 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 18:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 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 338K 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 ShieldIIPt-PT-020B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653032444000

Running Version 0
[2022-05-20 07:40:45] [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 07:40:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:40:45] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2022-05-20 07:40:45] [INFO ] Transformed 1403 places.
[2022-05-20 07:40:45] [INFO ] Transformed 1303 transitions.
[2022-05-20 07:40:45] [INFO ] Found NUPN structural information;
[2022-05-20 07:40:45] [INFO ] Parsed PT model containing 1403 places and 1303 transitions in 189 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 1303 rows 1403 cols
[2022-05-20 07:40:45] [INFO ] Computed 181 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :12
FORMULA ShieldIIPt-PT-020B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
// Phase 1: matrix 1303 rows 1403 cols
[2022-05-20 07:40:46] [INFO ] Computed 181 place invariants in 8 ms
[2022-05-20 07:40:46] [INFO ] [Real]Absence check using 181 positive place invariants in 101 ms returned sat
[2022-05-20 07:40:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:40:47] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2022-05-20 07:40:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:40:47] [INFO ] [Nat]Absence check using 181 positive place invariants in 63 ms returned sat
[2022-05-20 07:40:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:40:47] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2022-05-20 07:40:48] [INFO ] Deduced a trap composed of 22 places in 322 ms of which 3 ms to minimize.
[2022-05-20 07:40:48] [INFO ] Deduced a trap composed of 12 places in 291 ms of which 1 ms to minimize.
[2022-05-20 07:40:48] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 1 ms to minimize.
[2022-05-20 07:40:49] [INFO ] Deduced a trap composed of 23 places in 307 ms of which 14 ms to minimize.
[2022-05-20 07:40:49] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 2 ms to minimize.
[2022-05-20 07:40:50] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 1 ms to minimize.
[2022-05-20 07:40:50] [INFO ] Deduced a trap composed of 23 places in 350 ms of which 1 ms to minimize.
[2022-05-20 07:40:50] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 1 ms to minimize.
[2022-05-20 07:40:50] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 1 ms to minimize.
[2022-05-20 07:40:51] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 0 ms to minimize.
[2022-05-20 07:40:51] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 1 ms to minimize.
[2022-05-20 07:40:51] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 0 ms to minimize.
[2022-05-20 07:40:52] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 0 ms to minimize.
[2022-05-20 07:40:52] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 1 ms to minimize.
[2022-05-20 07:40:52] [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 07:40:52] [INFO ] [Real]Absence check using 181 positive place invariants in 72 ms returned sat
[2022-05-20 07:40:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:40:53] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2022-05-20 07:40:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:40:53] [INFO ] [Nat]Absence check using 181 positive place invariants in 59 ms returned sat
[2022-05-20 07:40:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:40:53] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2022-05-20 07:40:54] [INFO ] Deduced a trap composed of 23 places in 295 ms of which 1 ms to minimize.
[2022-05-20 07:40:54] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 1 ms to minimize.
[2022-05-20 07:40:54] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 1 ms to minimize.
[2022-05-20 07:40:55] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 1 ms to minimize.
[2022-05-20 07:40:55] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 1 ms to minimize.
[2022-05-20 07:40:55] [INFO ] Deduced a trap composed of 22 places in 271 ms of which 1 ms to minimize.
[2022-05-20 07:40:56] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 1 ms to minimize.
[2022-05-20 07:40:56] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 1 ms to minimize.
[2022-05-20 07:40:56] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 1 ms to minimize.
[2022-05-20 07:40:57] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 1 ms to minimize.
[2022-05-20 07:40:57] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 1 ms to minimize.
[2022-05-20 07:40:57] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 1 ms to minimize.
[2022-05-20 07:40:57] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 1 ms to minimize.
[2022-05-20 07:40:58] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 1 ms to minimize.
[2022-05-20 07:40: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 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 07:40:58] [INFO ] [Real]Absence check using 181 positive place invariants in 66 ms returned sat
[2022-05-20 07:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:40:58] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2022-05-20 07:40:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:40:59] [INFO ] [Nat]Absence check using 181 positive place invariants in 63 ms returned sat
[2022-05-20 07:40:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:40:59] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2022-05-20 07:41:00] [INFO ] Deduced a trap composed of 29 places in 316 ms of which 1 ms to minimize.
[2022-05-20 07:41:00] [INFO ] Deduced a trap composed of 37 places in 317 ms of which 1 ms to minimize.
[2022-05-20 07:41:00] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 0 ms to minimize.
[2022-05-20 07:41:01] [INFO ] Deduced a trap composed of 33 places in 297 ms of which 1 ms to minimize.
[2022-05-20 07:41:01] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 1 ms to minimize.
[2022-05-20 07:41:01] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 5 ms to minimize.
[2022-05-20 07:41:02] [INFO ] Deduced a trap composed of 20 places in 294 ms of which 0 ms to minimize.
[2022-05-20 07:41:02] [INFO ] Deduced a trap composed of 21 places in 294 ms of which 1 ms to minimize.
[2022-05-20 07:41:02] [INFO ] Deduced a trap composed of 18 places in 298 ms of which 0 ms to minimize.
[2022-05-20 07:41:03] [INFO ] Deduced a trap composed of 18 places in 295 ms of which 0 ms to minimize.
[2022-05-20 07:41:03] [INFO ] Deduced a trap composed of 18 places in 292 ms of which 1 ms to minimize.
[2022-05-20 07:41:03] [INFO ] Deduced a trap composed of 23 places in 298 ms of which 2 ms to minimize.
[2022-05-20 07:41:04] [INFO ] Deduced a trap composed of 29 places in 285 ms of which 0 ms to minimize.
[2022-05-20 07:41:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 07:41:04] [INFO ] [Real]Absence check using 181 positive place invariants in 60 ms returned sat
[2022-05-20 07:41:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:04] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2022-05-20 07:41:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:41:05] [INFO ] [Nat]Absence check using 181 positive place invariants in 63 ms returned sat
[2022-05-20 07:41:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:05] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2022-05-20 07:41:06] [INFO ] Deduced a trap composed of 20 places in 288 ms of which 1 ms to minimize.
[2022-05-20 07:41:06] [INFO ] Deduced a trap composed of 12 places in 281 ms of which 1 ms to minimize.
[2022-05-20 07:41:06] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 0 ms to minimize.
[2022-05-20 07:41:07] [INFO ] Deduced a trap composed of 27 places in 293 ms of which 1 ms to minimize.
[2022-05-20 07:41:07] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 1 ms to minimize.
[2022-05-20 07:41:07] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 1 ms to minimize.
[2022-05-20 07:41:08] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 1 ms to minimize.
[2022-05-20 07:41:08] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 1 ms to minimize.
[2022-05-20 07:41:08] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 6 ms to minimize.
[2022-05-20 07:41:08] [INFO ] Deduced a trap composed of 29 places in 251 ms of which 1 ms to minimize.
[2022-05-20 07:41:09] [INFO ] Deduced a trap composed of 29 places in 258 ms of which 1 ms to minimize.
[2022-05-20 07:41:09] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 1 ms to minimize.
[2022-05-20 07:41:09] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 0 ms to minimize.
[2022-05-20 07:41:10] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 1 ms to minimize.
[2022-05-20 07:41:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 1403 transition count 965
Reduce places removed 338 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 340 rules applied. Total rules applied 678 place count 1065 transition count 963
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 681 place count 1064 transition count 961
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 683 place count 1062 transition count 961
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 81 Pre rules applied. Total rules applied 683 place count 1062 transition count 880
Deduced a syphon composed of 81 places in 3 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 845 place count 981 transition count 880
Discarding 139 places :
Symmetric choice reduction at 4 with 139 rule applications. Total rules 984 place count 842 transition count 741
Iterating global reduction 4 with 139 rules applied. Total rules applied 1123 place count 842 transition count 741
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 1123 place count 842 transition count 683
Deduced a syphon composed of 58 places in 3 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1239 place count 784 transition count 683
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 1 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 4 with 680 rules applied. Total rules applied 1919 place count 444 transition count 343
Renaming transitions due to excessive name length > 1024 char.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 2035 place count 386 transition count 381
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2036 place count 386 transition count 380
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 2056 place count 386 transition count 380
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2057 place count 385 transition count 379
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2059 place count 383 transition count 379
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2059 place count 383 transition count 378
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2061 place count 382 transition count 378
Applied a total of 2061 rules in 513 ms. Remains 382 /1403 variables (removed 1021) and now considering 378/1303 (removed 925) transitions.
Finished structural reductions, in 1 iterations. Remains : 382/1403 places, 378/1303 transitions.
// Phase 1: matrix 378 rows 382 cols
[2022-05-20 07:41:10] [INFO ] Computed 179 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4488 ms. (steps per millisecond=222 ) properties (out of 4) seen :4
FORMULA ShieldIIPt-PT-020B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1653032476212

--------------------
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="ShieldIIPt-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 ShieldIIPt-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-165286037100106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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