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.r393-oct2-167903716900333.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 ltsminxred
Input is ShieldIIPt-PT-050B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716900333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 860K 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-050B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679440525211

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 23:15:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 23:15:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:15:28] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2023-03-21 23:15:28] [INFO ] Transformed 3503 places.
[2023-03-21 23:15:28] [INFO ] Transformed 3253 transitions.
[2023-03-21 23:15:28] [INFO ] Found NUPN structural information;
[2023-03-21 23:15:28] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 455 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 3253 rows 3503 cols
[2023-03-21 23:15:28] [INFO ] Computed 451 place invariants in 40 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 16) seen :8
FORMULA ShieldIIPt-PT-050B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) 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 8) seen :0
[2023-03-21 23:15:28] [INFO ] Invariant cache hit.
[2023-03-21 23:15:30] [INFO ] [Real]Absence check using 451 positive place invariants in 405 ms returned sat
[2023-03-21 23:15:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:15:33] [INFO ] [Real]Absence check using state equation in 3551 ms returned sat
[2023-03-21 23:15:37] [INFO ] Deduced a trap composed of 15 places in 3297 ms of which 14 ms to minimize.
[2023-03-21 23:15:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:2618)
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-21 23:15:38] [INFO ] [Real]Absence check using 451 positive place invariants in 324 ms returned sat
[2023-03-21 23:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:15:41] [INFO ] [Real]Absence check using state equation in 2866 ms returned sat
[2023-03-21 23:15:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:15:42] [INFO ] [Nat]Absence check using 451 positive place invariants in 368 ms returned sat
[2023-03-21 23:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:15:44] [INFO ] [Nat]Absence check using state equation in 1878 ms returned sat
[2023-03-21 23:15:46] [INFO ] Deduced a trap composed of 20 places in 1655 ms of which 30 ms to minimize.
[2023-03-21 23:15:47] [INFO ] Deduced a trap composed of 20 places in 1496 ms of which 3 ms to minimize.
[2023-03-21 23:15:47] [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.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-21 23:15:48] [INFO ] [Real]Absence check using 451 positive place invariants in 669 ms returned sat
[2023-03-21 23:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:15:52] [INFO ] [Real]Absence check using state equation in 3188 ms returned sat
[2023-03-21 23:15:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:15:53] [INFO ] [Nat]Absence check using 451 positive place invariants in 281 ms returned sat
[2023-03-21 23:15:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:15:55] [INFO ] [Nat]Absence check using state equation in 2229 ms returned sat
[2023-03-21 23:15:57] [INFO ] Deduced a trap composed of 22 places in 2168 ms of which 3 ms to minimize.
[2023-03-21 23:15:57] [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-21 23:15:58] [INFO ] [Real]Absence check using 451 positive place invariants in 337 ms returned sat
[2023-03-21 23:15:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:16:00] [INFO ] [Real]Absence check using state equation in 1738 ms returned sat
[2023-03-21 23:16:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:16:01] [INFO ] [Nat]Absence check using 451 positive place invariants in 355 ms returned sat
[2023-03-21 23:16:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:16:04] [INFO ] [Nat]Absence check using state equation in 2330 ms returned sat
[2023-03-21 23:16:05] [INFO ] Deduced a trap composed of 13 places in 1155 ms of which 2 ms to minimize.
[2023-03-21 23:16:06] [INFO ] Deduced a trap composed of 43 places in 995 ms of which 2 ms to minimize.
[2023-03-21 23:16: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 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-21 23:16:07] [INFO ] [Real]Absence check using 451 positive place invariants in 555 ms returned sat
[2023-03-21 23:16:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:16:09] [INFO ] [Real]Absence check using state equation in 2153 ms returned sat
[2023-03-21 23:16:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:16:11] [INFO ] [Nat]Absence check using 451 positive place invariants in 741 ms returned sat
[2023-03-21 23:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:16:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
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-21 23:16:15] [INFO ] [Real]Absence check using 451 positive place invariants in 516 ms returned sat
[2023-03-21 23:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:16:19] [INFO ] [Real]Absence check using state equation in 3854 ms returned unknown
[2023-03-21 23:16:20] [INFO ] [Real]Absence check using 451 positive place invariants in 314 ms returned sat
[2023-03-21 23:16:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:16:24] [INFO ] [Real]Absence check using state equation in 4088 ms returned sat
[2023-03-21 23:16:27] [INFO ] Deduced a trap composed of 15 places in 3059 ms of which 5 ms to minimize.
[2023-03-21 23:16:27] [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:2618)
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-21 23:16:28] [INFO ] [Real]Absence check using 451 positive place invariants in 358 ms returned sat
[2023-03-21 23:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:16:32] [INFO ] [Real]Absence check using state equation in 3341 ms returned sat
[2023-03-21 23:16:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:16:33] [INFO ] [Nat]Absence check using 451 positive place invariants in 313 ms returned sat
[2023-03-21 23:16:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:16:36] [INFO ] [Nat]Absence check using state equation in 3531 ms returned sat
[2023-03-21 23:16:37] [INFO ] Deduced a trap composed of 30 places in 1171 ms of which 2 ms to minimize.
[2023-03-21 23:16:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions removed 849 transitions
Trivial Post-agglo rules discarded 849 transitions
Performed 849 trivial Post agglomeration. Transition count delta: 849
Iterating post reduction 0 with 849 rules applied. Total rules applied 849 place count 3503 transition count 2404
Reduce places removed 849 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 851 rules applied. Total rules applied 1700 place count 2654 transition count 2402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1701 place count 2653 transition count 2402
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 1701 place count 2653 transition count 2202
Deduced a syphon composed of 200 places in 6 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2101 place count 2453 transition count 2202
Discarding 346 places :
Symmetric choice reduction at 3 with 346 rule applications. Total rules 2447 place count 2107 transition count 1856
Iterating global reduction 3 with 346 rules applied. Total rules applied 2793 place count 2107 transition count 1856
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 147 Pre rules applied. Total rules applied 2793 place count 2107 transition count 1709
Deduced a syphon composed of 147 places in 10 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 3087 place count 1960 transition count 1709
Performed 852 Post agglomeration using F-continuation condition.Transition count delta: 852
Deduced a syphon composed of 852 places in 1 ms
Reduce places removed 852 places and 0 transitions.
Iterating global reduction 3 with 1704 rules applied. Total rules applied 4791 place count 1108 transition count 857
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4993 place count 1007 transition count 920
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 5083 place count 962 transition count 950
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5084 place count 962 transition count 949
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 5085 place count 962 transition count 948
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5086 place count 961 transition count 948
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 5 with 50 rules applied. Total rules applied 5136 place count 961 transition count 948
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5137 place count 960 transition count 947
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 5139 place count 958 transition count 947
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 5139 place count 958 transition count 946
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5141 place count 957 transition count 946
Applied a total of 5141 rules in 1208 ms. Remains 957 /3503 variables (removed 2546) and now considering 946/3253 (removed 2307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1209 ms. Remains : 957/3503 places, 946/3253 transitions.
// Phase 1: matrix 946 rows 957 cols
[2023-03-21 23:16:39] [INFO ] Computed 449 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7849 ms. (steps per millisecond=127 ) properties (out of 8) seen :3
FORMULA ShieldIIPt-PT-050B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 886589 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=177 ) properties seen 0
Interrupted Best-First random walk after 929546 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=185 ) properties seen 0
Interrupted Best-First random walk after 915251 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=183 ) properties seen 0
Interrupted Best-First random walk after 927298 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=185 ) properties seen 0
Interrupted Best-First random walk after 941549 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=188 ) properties seen 0
[2023-03-21 23:17:12] [INFO ] Invariant cache hit.
[2023-03-21 23:17:12] [INFO ] [Real]Absence check using 449 positive place invariants in 148 ms returned sat
[2023-03-21 23:17:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:17:13] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2023-03-21 23:17:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:17:13] [INFO ] [Nat]Absence check using 449 positive place invariants in 440 ms returned sat
[2023-03-21 23:17:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:17:14] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2023-03-21 23:17:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:17:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-21 23:17:14] [INFO ] Computed and/alt/rep : 943/1683/943 causal constraints (skipped 0 transitions) in 141 ms.
[2023-03-21 23:17:30] [INFO ] Added : 865 causal constraints over 174 iterations in 16173 ms. Result :sat
Minimization took 476 ms.
[2023-03-21 23:17:31] [INFO ] [Real]Absence check using 449 positive place invariants in 71 ms returned sat
[2023-03-21 23:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:17:32] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2023-03-21 23:17:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:17:32] [INFO ] [Nat]Absence check using 449 positive place invariants in 81 ms returned sat
[2023-03-21 23:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:17:32] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2023-03-21 23:17:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-21 23:17:32] [INFO ] Computed and/alt/rep : 943/1683/943 causal constraints (skipped 0 transitions) in 119 ms.
[2023-03-21 23:17:53] [INFO ] Added : 875 causal constraints over 175 iterations in 20234 ms.(timeout) Result :sat
Minimization took 2178 ms.
[2023-03-21 23:17:55] [INFO ] [Real]Absence check using 449 positive place invariants in 111 ms returned sat
[2023-03-21 23:17:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:17:56] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2023-03-21 23:17:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:17:56] [INFO ] [Nat]Absence check using 449 positive place invariants in 209 ms returned sat
[2023-03-21 23:17:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:17:57] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2023-03-21 23:17:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2023-03-21 23:17:57] [INFO ] Computed and/alt/rep : 943/1683/943 causal constraints (skipped 0 transitions) in 63 ms.
[2023-03-21 23:18:16] [INFO ] Added : 845 causal constraints over 169 iterations in 18960 ms. Result :sat
Minimization took 1364 ms.
[2023-03-21 23:18:18] [INFO ] [Real]Absence check using 449 positive place invariants in 69 ms returned sat
[2023-03-21 23:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:18:18] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2023-03-21 23:18:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:18:19] [INFO ] [Nat]Absence check using 449 positive place invariants in 156 ms returned sat
[2023-03-21 23:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:18:19] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2023-03-21 23:18:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-21 23:18:19] [INFO ] Computed and/alt/rep : 943/1683/943 causal constraints (skipped 0 transitions) in 43 ms.
[2023-03-21 23:18:35] [INFO ] Added : 861 causal constraints over 173 iterations in 15375 ms. Result :sat
Minimization took 2749 ms.
[2023-03-21 23:18:38] [INFO ] [Real]Absence check using 449 positive place invariants in 77 ms returned sat
[2023-03-21 23:18:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:18:38] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2023-03-21 23:18:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:18:39] [INFO ] [Nat]Absence check using 449 positive place invariants in 155 ms returned sat
[2023-03-21 23:18:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:18:39] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2023-03-21 23:18:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-21 23:18:39] [INFO ] Computed and/alt/rep : 943/1683/943 causal constraints (skipped 0 transitions) in 92 ms.
[2023-03-21 23:18:54] [INFO ] Added : 862 causal constraints over 173 iterations in 14918 ms. Result :sat
Minimization took 3013 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA ShieldIIPt-PT-050B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 216855 ms.
ITS solved all properties within timeout

BK_STOP 1679440744911

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-050B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPt-PT-050B, 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 r393-oct2-167903716900333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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