fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r389-oct2-167903713400285
Last Updated
May 14, 2023

About the Execution of ITS-Tools for ShieldIIPt-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
412.527 53947.00 76426.00 55.00 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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.r389-oct2-167903713400285.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
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 r389-oct2-167903713400285
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 338K Mar 5 18:23 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 1679186723872

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-19 00:45:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 00:45:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:45:26] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-19 00:45:26] [INFO ] Transformed 1403 places.
[2023-03-19 00:45:26] [INFO ] Transformed 1303 transitions.
[2023-03-19 00:45:26] [INFO ] Found NUPN structural information;
[2023-03-19 00:45:26] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 1303 rows 1403 cols
[2023-03-19 00:45:26] [INFO ] Computed 181 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 16) seen :9
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-06 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-03 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 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
[2023-03-19 00:45:26] [INFO ] Invariant cache hit.
[2023-03-19 00:45:27] [INFO ] [Real]Absence check using 181 positive place invariants in 125 ms returned sat
[2023-03-19 00:45:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:45:28] [INFO ] [Real]Absence check using state equation in 956 ms returned sat
[2023-03-19 00:45:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:45:29] [INFO ] [Nat]Absence check using 181 positive place invariants in 78 ms returned sat
[2023-03-19 00:45:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:45:29] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2023-03-19 00:45:30] [INFO ] Deduced a trap composed of 25 places in 349 ms of which 4 ms to minimize.
[2023-03-19 00:45:30] [INFO ] Deduced a trap composed of 20 places in 358 ms of which 1 ms to minimize.
[2023-03-19 00:45:31] [INFO ] Deduced a trap composed of 19 places in 373 ms of which 2 ms to minimize.
[2023-03-19 00:45:31] [INFO ] Deduced a trap composed of 28 places in 408 ms of which 11 ms to minimize.
[2023-03-19 00:45:32] [INFO ] Deduced a trap composed of 24 places in 424 ms of which 2 ms to minimize.
[2023-03-19 00:45:32] [INFO ] Deduced a trap composed of 27 places in 336 ms of which 1 ms to minimize.
[2023-03-19 00:45:32] [INFO ] Deduced a trap composed of 34 places in 530 ms of which 2 ms to minimize.
[2023-03-19 00:45:33] [INFO ] Deduced a trap composed of 19 places in 466 ms of which 7 ms to minimize.
[2023-03-19 00:45:33] [INFO ] Deduced a trap composed of 28 places in 350 ms of which 1 ms to minimize.
[2023-03-19 00:45:33] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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-19 00:45:34] [INFO ] [Real]Absence check using 181 positive place invariants in 57 ms returned sat
[2023-03-19 00:45:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:45:34] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2023-03-19 00:45:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:45:35] [INFO ] [Nat]Absence check using 181 positive place invariants in 117 ms returned sat
[2023-03-19 00:45:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:45:36] [INFO ] [Nat]Absence check using state equation in 877 ms returned sat
[2023-03-19 00:45:37] [INFO ] Deduced a trap composed of 26 places in 771 ms of which 2 ms to minimize.
[2023-03-19 00:45:37] [INFO ] Deduced a trap composed of 33 places in 554 ms of which 1 ms to minimize.
[2023-03-19 00:45:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1508 ms
[2023-03-19 00:45:37] [INFO ] Computed and/alt/rep : 1302/1963/1302 causal constraints (skipped 0 transitions) in 164 ms.
[2023-03-19 00:45:39] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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-19 00:45:40] [INFO ] [Real]Absence check using 181 positive place invariants in 170 ms returned sat
[2023-03-19 00:45:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:45:40] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2023-03-19 00:45:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:45:41] [INFO ] [Nat]Absence check using 181 positive place invariants in 57 ms returned sat
[2023-03-19 00:45:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:45:42] [INFO ] [Nat]Absence check using state equation in 521 ms returned sat
[2023-03-19 00:45:42] [INFO ] Deduced a trap composed of 22 places in 462 ms of which 1 ms to minimize.
[2023-03-19 00:45:42] [INFO ] Deduced a trap composed of 24 places in 323 ms of which 1 ms to minimize.
[2023-03-19 00:45:43] [INFO ] Deduced a trap composed of 21 places in 338 ms of which 1 ms to minimize.
[2023-03-19 00:45:43] [INFO ] Deduced a trap composed of 30 places in 302 ms of which 1 ms to minimize.
[2023-03-19 00:45:44] [INFO ] Deduced a trap composed of 20 places in 310 ms of which 1 ms to minimize.
[2023-03-19 00:45:44] [INFO ] Deduced a trap composed of 26 places in 419 ms of which 1 ms to minimize.
[2023-03-19 00:45:44] [INFO ] Deduced a trap composed of 23 places in 310 ms of which 1 ms to minimize.
[2023-03-19 00:45:45] [INFO ] Deduced a trap composed of 25 places in 255 ms of which 0 ms to minimize.
[2023-03-19 00:45:45] [INFO ] Deduced a trap composed of 20 places in 374 ms of which 1 ms to minimize.
[2023-03-19 00:45:45] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 1 ms to minimize.
[2023-03-19 00:45:46] [INFO ] Deduced a trap composed of 25 places in 805 ms of which 1 ms to minimize.
[2023-03-19 00:45:46] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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-19 00:45:47] [INFO ] [Real]Absence check using 181 positive place invariants in 77 ms returned sat
[2023-03-19 00:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:45:48] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2023-03-19 00:45:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:45:48] [INFO ] [Nat]Absence check using 181 positive place invariants in 59 ms returned sat
[2023-03-19 00:45:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:45:49] [INFO ] [Nat]Absence check using state equation in 717 ms returned sat
[2023-03-19 00:45:49] [INFO ] Deduced a trap composed of 40 places in 603 ms of which 0 ms to minimize.
[2023-03-19 00:45:50] [INFO ] Deduced a trap composed of 20 places in 344 ms of which 1 ms to minimize.
[2023-03-19 00:45:50] [INFO ] Deduced a trap composed of 12 places in 333 ms of which 0 ms to minimize.
[2023-03-19 00:45:50] [INFO ] Deduced a trap composed of 24 places in 339 ms of which 1 ms to minimize.
[2023-03-19 00:45:51] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 2 ms to minimize.
[2023-03-19 00:45:51] [INFO ] Deduced a trap composed of 19 places in 359 ms of which 1 ms to minimize.
[2023-03-19 00:45:52] [INFO ] Deduced a trap composed of 19 places in 394 ms of which 1 ms to minimize.
[2023-03-19 00:45:52] [INFO ] Deduced a trap composed of 21 places in 307 ms of which 1 ms to minimize.
[2023-03-19 00:45:52] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 1 ms to minimize.
[2023-03-19 00:45:53] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 1 ms to minimize.
[2023-03-19 00:45:53] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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-19 00:45:53] [INFO ] [Real]Absence check using 181 positive place invariants in 72 ms returned sat
[2023-03-19 00:45:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:45:54] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2023-03-19 00:45:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:45:54] [INFO ] [Nat]Absence check using 181 positive place invariants in 87 ms returned sat
[2023-03-19 00:45:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:45:55] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2023-03-19 00:45:55] [INFO ] Deduced a trap composed of 20 places in 317 ms of which 1 ms to minimize.
[2023-03-19 00:45:55] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 1 ms to minimize.
[2023-03-19 00:45:56] [INFO ] Deduced a trap composed of 24 places in 348 ms of which 1 ms to minimize.
[2023-03-19 00:45:56] [INFO ] Deduced a trap composed of 25 places in 351 ms of which 1 ms to minimize.
[2023-03-19 00:45:57] [INFO ] Deduced a trap composed of 26 places in 336 ms of which 1 ms to minimize.
[2023-03-19 00:45:57] [INFO ] Deduced a trap composed of 25 places in 341 ms of which 1 ms to minimize.
[2023-03-19 00:45:57] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 2 ms to minimize.
[2023-03-19 00:45:58] [INFO ] Deduced a trap composed of 22 places in 313 ms of which 1 ms to minimize.
[2023-03-19 00:45:58] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 1 ms to minimize.
[2023-03-19 00:45:59] [INFO ] Deduced a trap composed of 21 places in 347 ms of which 0 ms to minimize.
[2023-03-19 00:45:59] [INFO ] Deduced a trap composed of 22 places in 316 ms of which 1 ms to minimize.
[2023-03-19 00:45:59] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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-19 00:45:59] [INFO ] [Real]Absence check using 181 positive place invariants in 61 ms returned sat
[2023-03-19 00:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:46:00] [INFO ] [Real]Absence check using state equation in 842 ms returned sat
[2023-03-19 00:46:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:46:01] [INFO ] [Nat]Absence check using 181 positive place invariants in 61 ms returned sat
[2023-03-19 00:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:46:01] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2023-03-19 00:46:01] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 0 ms to minimize.
[2023-03-19 00:46:02] [INFO ] Deduced a trap composed of 19 places in 375 ms of which 1 ms to minimize.
[2023-03-19 00:46:02] [INFO ] Deduced a trap composed of 34 places in 325 ms of which 1 ms to minimize.
[2023-03-19 00:46:03] [INFO ] Deduced a trap composed of 16 places in 366 ms of which 1 ms to minimize.
[2023-03-19 00:46:03] [INFO ] Deduced a trap composed of 32 places in 343 ms of which 1 ms to minimize.
[2023-03-19 00:46:03] [INFO ] Deduced a trap composed of 21 places in 356 ms of which 1 ms to minimize.
[2023-03-19 00:46:04] [INFO ] Deduced a trap composed of 12 places in 315 ms of which 1 ms to minimize.
[2023-03-19 00:46:04] [INFO ] Deduced a trap composed of 22 places in 339 ms of which 2 ms to minimize.
[2023-03-19 00:46:05] [INFO ] Deduced a trap composed of 26 places in 342 ms of which 1 ms to minimize.
[2023-03-19 00:46:05] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 1 ms to minimize.
[2023-03-19 00:46:06] [INFO ] Deduced a trap composed of 20 places in 598 ms of which 0 ms to minimize.
[2023-03-19 00:46: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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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-19 00:46:06] [INFO ] [Real]Absence check using 181 positive place invariants in 54 ms returned sat
[2023-03-19 00:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:46:07] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2023-03-19 00:46:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:46:07] [INFO ] [Nat]Absence check using 181 positive place invariants in 72 ms returned sat
[2023-03-19 00:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:46:08] [INFO ] [Nat]Absence check using state equation in 702 ms returned sat
[2023-03-19 00:46:08] [INFO ] Deduced a trap composed of 25 places in 458 ms of which 1 ms to minimize.
[2023-03-19 00:46:09] [INFO ] Deduced a trap composed of 16 places in 550 ms of which 1 ms to minimize.
[2023-03-19 00:46:09] [INFO ] Deduced a trap composed of 35 places in 499 ms of which 1 ms to minimize.
[2023-03-19 00:46:10] [INFO ] Deduced a trap composed of 25 places in 577 ms of which 1 ms to minimize.
[2023-03-19 00:46:12] [INFO ] Deduced a trap composed of 25 places in 1688 ms of which 2 ms to minimize.
[2023-03-19 00:46:12] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 1403 transition count 967
Reduce places removed 336 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 338 rules applied. Total rules applied 674 place count 1067 transition count 965
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 679 place count 1066 transition count 961
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 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 2 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 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 1123 place count 842 transition count 684
Deduced a syphon composed of 57 places in 2 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1237 place count 785 transition count 684
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 4 with 678 rules applied. Total rules applied 1915 place count 446 transition count 345
Renaming transitions due to excessive name length > 1024 char.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 2027 place count 390 transition count 379
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2028 place count 390 transition count 378
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2029 place count 390 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2030 place count 389 transition count 377
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 2050 place count 389 transition count 377
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2051 place count 388 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2053 place count 386 transition count 376
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2053 place count 386 transition count 375
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2055 place count 385 transition count 375
Applied a total of 2055 rules in 427 ms. Remains 385 /1403 variables (removed 1018) and now considering 375/1303 (removed 928) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 427 ms. Remains : 385/1403 places, 375/1303 transitions.
// Phase 1: matrix 375 rows 385 cols
[2023-03-19 00:46:12] [INFO ] Computed 179 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4776 ms. (steps per millisecond=209 ) properties (out of 7) seen :7
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-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-12 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-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 51277 ms.

BK_STOP 1679186777819

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r389-oct2-167903713400285"
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 ;