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

About the Execution of 2022-gold for AutoFlight-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
359.976 41429.00 60708.00 39.90 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.r031-oct2-167813615400060.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 gold2022
Input is AutoFlight-PT-12b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-oct2-167813615400060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 7.6K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 18:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 266K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678866857048

Running Version 202205111006
[2023-03-15 07:54:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 07:54:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:54:19] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2023-03-15 07:54:19] [INFO ] Transformed 1126 places.
[2023-03-15 07:54:19] [INFO ] Transformed 1124 transitions.
[2023-03-15 07:54:19] [INFO ] Found NUPN structural information;
[2023-03-15 07:54:19] [INFO ] Parsed PT model containing 1126 places and 1124 transitions in 373 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 1124 rows 1126 cols
[2023-03-15 07:54:19] [INFO ] Computed 76 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 18 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :10
FORMULA AutoFlight-PT-12b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
// Phase 1: matrix 1124 rows 1126 cols
[2023-03-15 07:54:19] [INFO ] Computed 76 place invariants in 29 ms
[2023-03-15 07:54:20] [INFO ] [Real]Absence check using 75 positive place invariants in 51 ms returned sat
[2023-03-15 07:54:20] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-15 07:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:54:20] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2023-03-15 07:54:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:54:21] [INFO ] [Nat]Absence check using 75 positive place invariants in 37 ms returned sat
[2023-03-15 07:54:21] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 07:54:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:54:21] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2023-03-15 07:54:22] [INFO ] Deduced a trap composed of 22 places in 458 ms of which 4 ms to minimize.
[2023-03-15 07:54:22] [INFO ] Deduced a trap composed of 22 places in 309 ms of which 2 ms to minimize.
[2023-03-15 07:54:22] [INFO ] Deduced a trap composed of 19 places in 317 ms of which 1 ms to minimize.
[2023-03-15 07:54:23] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 1 ms to minimize.
[2023-03-15 07:54:23] [INFO ] Deduced a trap composed of 49 places in 316 ms of which 2 ms to minimize.
[2023-03-15 07:54:23] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 1 ms to minimize.
[2023-03-15 07:54:24] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 1 ms to minimize.
[2023-03-15 07:54:24] [INFO ] Deduced a trap composed of 73 places in 274 ms of which 0 ms to minimize.
[2023-03-15 07:54:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2927 ms
[2023-03-15 07:54:24] [INFO ] Computed and/alt/rep : 1121/1477/1121 causal constraints (skipped 2 transitions) in 75 ms.
[2023-03-15 07:54:26] [INFO ] Deduced a trap composed of 25 places in 662 ms of which 1 ms to minimize.
[2023-03-15 07:54:26] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 07:54:26] [INFO ] [Real]Absence check using 75 positive place invariants in 39 ms returned sat
[2023-03-15 07:54:26] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 07:54:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:54:27] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2023-03-15 07:54:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:54:27] [INFO ] [Nat]Absence check using 75 positive place invariants in 33 ms returned sat
[2023-03-15 07:54:27] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 07:54:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:54:27] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2023-03-15 07:54:28] [INFO ] Deduced a trap composed of 21 places in 309 ms of which 1 ms to minimize.
[2023-03-15 07:54:28] [INFO ] Deduced a trap composed of 31 places in 265 ms of which 1 ms to minimize.
[2023-03-15 07:54:28] [INFO ] Deduced a trap composed of 22 places in 252 ms of which 1 ms to minimize.
[2023-03-15 07:54:29] [INFO ] Deduced a trap composed of 18 places in 284 ms of which 1 ms to minimize.
[2023-03-15 07:54:29] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 1 ms to minimize.
[2023-03-15 07:54:29] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 1 ms to minimize.
[2023-03-15 07:54:29] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 1 ms to minimize.
[2023-03-15 07:54:30] [INFO ] Deduced a trap composed of 133 places in 287 ms of which 1 ms to minimize.
[2023-03-15 07:54:30] [INFO ] Deduced a trap composed of 44 places in 276 ms of which 2 ms to minimize.
[2023-03-15 07:54:30] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 1 ms to minimize.
[2023-03-15 07:54:31] [INFO ] Deduced a trap composed of 138 places in 242 ms of which 0 ms to minimize.
[2023-03-15 07:54:31] [INFO ] Deduced a trap composed of 82 places in 336 ms of which 1 ms to minimize.
[2023-03-15 07:54:31] [INFO ] Deduced a trap composed of 50 places in 279 ms of which 1 ms to minimize.
[2023-03-15 07:54:32] [INFO ] Deduced a trap composed of 63 places in 335 ms of which 1 ms to minimize.
[2023-03-15 07:54:32] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 07:54:32] [INFO ] [Real]Absence check using 75 positive place invariants in 44 ms returned sat
[2023-03-15 07:54:32] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-15 07:54:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:54:32] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2023-03-15 07:54:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:54:33] [INFO ] [Nat]Absence check using 75 positive place invariants in 77 ms returned sat
[2023-03-15 07:54:33] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 07:54:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:54:33] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2023-03-15 07:54:34] [INFO ] Deduced a trap composed of 21 places in 361 ms of which 1 ms to minimize.
[2023-03-15 07:54:34] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 1 ms to minimize.
[2023-03-15 07:54:34] [INFO ] Deduced a trap composed of 18 places in 353 ms of which 0 ms to minimize.
[2023-03-15 07:54:35] [INFO ] Deduced a trap composed of 19 places in 308 ms of which 1 ms to minimize.
[2023-03-15 07:54:35] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 4 ms to minimize.
[2023-03-15 07:54:35] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 1 ms to minimize.
[2023-03-15 07:54:36] [INFO ] Deduced a trap composed of 15 places in 329 ms of which 2 ms to minimize.
[2023-03-15 07:54:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2534 ms
[2023-03-15 07:54:36] [INFO ] Computed and/alt/rep : 1121/1477/1121 causal constraints (skipped 2 transitions) in 64 ms.
[2023-03-15 07:54: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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 07:54:38] [INFO ] [Real]Absence check using 75 positive place invariants in 37 ms returned sat
[2023-03-15 07:54:38] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 07:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:54:38] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2023-03-15 07:54:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:54:39] [INFO ] [Nat]Absence check using 75 positive place invariants in 37 ms returned sat
[2023-03-15 07:54:39] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 16 ms returned sat
[2023-03-15 07:54:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:54:39] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2023-03-15 07:54:39] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 1 ms to minimize.
[2023-03-15 07:54:40] [INFO ] Deduced a trap composed of 21 places in 318 ms of which 0 ms to minimize.
[2023-03-15 07:54:40] [INFO ] Deduced a trap composed of 18 places in 318 ms of which 15 ms to minimize.
[2023-03-15 07:54:41] [INFO ] Deduced a trap composed of 19 places in 517 ms of which 1 ms to minimize.
[2023-03-15 07:54:41] [INFO ] Deduced a trap composed of 43 places in 460 ms of which 17 ms to minimize.
[2023-03-15 07:54:41] [INFO ] Deduced a trap composed of 143 places in 302 ms of which 1 ms to minimize.
[2023-03-15 07:54:42] [INFO ] Deduced a trap composed of 48 places in 278 ms of which 0 ms to minimize.
[2023-03-15 07:54:42] [INFO ] Deduced a trap composed of 59 places in 248 ms of which 1 ms to minimize.
[2023-03-15 07:54:42] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 1 ms to minimize.
[2023-03-15 07:54:43] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 0 ms to minimize.
[2023-03-15 07:54:43] [INFO ] Deduced a trap composed of 108 places in 249 ms of which 1 ms to minimize.
[2023-03-15 07:54:43] [INFO ] Deduced a trap composed of 155 places in 233 ms of which 1 ms to minimize.
[2023-03-15 07:54:43] [INFO ] Deduced a trap composed of 179 places in 258 ms of which 0 ms to minimize.
[2023-03-15 07:54:43] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 07:54:44] [INFO ] [Real]Absence check using 75 positive place invariants in 34 ms returned sat
[2023-03-15 07:54:44] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 07:54:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:54:44] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2023-03-15 07:54:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:54:44] [INFO ] [Nat]Absence check using 75 positive place invariants in 36 ms returned sat
[2023-03-15 07:54:44] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-15 07:54:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:54:45] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2023-03-15 07:54:45] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 1 ms to minimize.
[2023-03-15 07:54:45] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 1 ms to minimize.
[2023-03-15 07:54:46] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 1 ms to minimize.
[2023-03-15 07:54:46] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 0 ms to minimize.
[2023-03-15 07:54:46] [INFO ] Deduced a trap composed of 71 places in 365 ms of which 1 ms to minimize.
[2023-03-15 07:54:47] [INFO ] Deduced a trap composed of 67 places in 259 ms of which 1 ms to minimize.
[2023-03-15 07:54:47] [INFO ] Deduced a trap composed of 74 places in 329 ms of which 1 ms to minimize.
[2023-03-15 07:54:48] [INFO ] Deduced a trap composed of 125 places in 327 ms of which 1 ms to minimize.
[2023-03-15 07:54:48] [INFO ] Deduced a trap composed of 159 places in 312 ms of which 1 ms to minimize.
[2023-03-15 07:54:48] [INFO ] Deduced a trap composed of 126 places in 261 ms of which 0 ms to minimize.
[2023-03-15 07:54:48] [INFO ] Deduced a trap composed of 122 places in 247 ms of which 1 ms to minimize.
[2023-03-15 07:54:49] [INFO ] Deduced a trap composed of 159 places in 267 ms of which 1 ms to minimize.
[2023-03-15 07:54:49] [INFO ] Deduced a trap composed of 114 places in 212 ms of which 0 ms to minimize.
[2023-03-15 07:54:49] [INFO ] Deduced a trap composed of 129 places in 306 ms of which 22 ms to minimize.
[2023-03-15 07:54:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 07:54:50] [INFO ] [Real]Absence check using 75 positive place invariants in 45 ms returned sat
[2023-03-15 07:54:50] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-15 07:54:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:54:50] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2023-03-15 07:54:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:54:51] [INFO ] [Nat]Absence check using 75 positive place invariants in 38 ms returned sat
[2023-03-15 07:54:51] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-15 07:54:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:54:51] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2023-03-15 07:54:51] [INFO ] Deduced a trap composed of 15 places in 312 ms of which 1 ms to minimize.
[2023-03-15 07:54:52] [INFO ] Deduced a trap composed of 18 places in 334 ms of which 1 ms to minimize.
[2023-03-15 07:54:52] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 1 ms to minimize.
[2023-03-15 07:54:52] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 1 ms to minimize.
[2023-03-15 07:54:53] [INFO ] Deduced a trap composed of 21 places in 402 ms of which 1 ms to minimize.
[2023-03-15 07:54:53] [INFO ] Deduced a trap composed of 144 places in 337 ms of which 1 ms to minimize.
[2023-03-15 07:54:54] [INFO ] Deduced a trap composed of 22 places in 311 ms of which 1 ms to minimize.
[2023-03-15 07:54:54] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 1 ms to minimize.
[2023-03-15 07:54:54] [INFO ] Deduced a trap composed of 48 places in 293 ms of which 1 ms to minimize.
[2023-03-15 07:54:55] [INFO ] Deduced a trap composed of 132 places in 260 ms of which 1 ms to minimize.
[2023-03-15 07:54:55] [INFO ] Deduced a trap composed of 34 places in 235 ms of which 1 ms to minimize.
[2023-03-15 07:54:55] [INFO ] Deduced a trap composed of 158 places in 378 ms of which 0 ms to minimize.
[2023-03-15 07:54:56] [INFO ] Deduced a trap composed of 61 places in 336 ms of which 1 ms to minimize.
[2023-03-15 07:54:56] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 1126 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Drop transitions removed 442 transitions
Trivial Post-agglo rules discarded 442 transitions
Performed 442 trivial Post agglomeration. Transition count delta: 442
Iterating post reduction 0 with 442 rules applied. Total rules applied 442 place count 1126 transition count 682
Reduce places removed 442 places and 0 transitions.
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 524 rules applied. Total rules applied 966 place count 684 transition count 600
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 991 place count 660 transition count 599
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 992 place count 659 transition count 599
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 148 Pre rules applied. Total rules applied 992 place count 659 transition count 451
Deduced a syphon composed of 148 places in 2 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 4 with 296 rules applied. Total rules applied 1288 place count 511 transition count 451
Discarding 107 places :
Symmetric choice reduction at 4 with 107 rule applications. Total rules 1395 place count 404 transition count 344
Iterating global reduction 4 with 107 rules applied. Total rules applied 1502 place count 404 transition count 344
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 1502 place count 404 transition count 310
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 1570 place count 370 transition count 310
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 1748 place count 281 transition count 221
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1750 place count 281 transition count 219
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1754 place count 279 transition count 217
Free-agglomeration rule applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1802 place count 279 transition count 169
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 4 with 48 rules applied. Total rules applied 1850 place count 231 transition count 169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1851 place count 230 transition count 168
Reduce places removed 45 places and 0 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 5 with 106 rules applied. Total rules applied 1957 place count 185 transition count 107
Reduce places removed 61 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 6 with 64 rules applied. Total rules applied 2021 place count 124 transition count 104
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2024 place count 121 transition count 104
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 32 Pre rules applied. Total rules applied 2024 place count 121 transition count 72
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 64 rules applied. Total rules applied 2088 place count 89 transition count 72
Applied a total of 2088 rules in 320 ms. Remains 89 /1126 variables (removed 1037) and now considering 72/1124 (removed 1052) transitions.
Finished structural reductions, in 1 iterations. Remains : 89/1126 places, 72/1124 transitions.
// Phase 1: matrix 72 rows 89 cols
[2023-03-15 07:54:56] [INFO ] Computed 31 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1848 ms. (steps per millisecond=541 ) properties (out of 6) seen :6
FORMULA AutoFlight-PT-12b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 39490 ms.

BK_STOP 1678866898477

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-12b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is AutoFlight-PT-12b, 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 r031-oct2-167813615400060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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