About the Execution of 2021-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  | 
   
| 289.531 | 22035.00 | 37387.00 | 45.50 | 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 '/mnt/tpsp/fkordon/mcc2022-input.r010-tajo-165245701800178.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off 
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................
=====================================================================
 Generated by BenchKit 2-4028
    Executing tool gold2021
    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 r010-tajo-165245701800178
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.8K Apr 30 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users  75K Apr 30 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 01:55 CTLFireability.txt
-rw-r--r-- 1 mcc users  38K Apr 30 01:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May  9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users  22K May  9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May  9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users  18K May  9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May  9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May  9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users    6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users    4 May 10 09:33 instance
-rw-r--r-- 1 mcc users    6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 266K May 10 09:33 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 1652727788066
Running Version 0
[2022-05-16 19:03:09] [INFO   ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600] 
[2022-05-16 19:03:09] [INFO   ] Parsing pnml file : /home/mcc/execution/model.pnml 
[2022-05-16 19:03:09] [INFO   ] Load time of PNML (sax parser for PT used): 85 ms 
[2022-05-16 19:03:09] [INFO   ] Transformed 1126 places. 
[2022-05-16 19:03:09] [INFO   ] Transformed 1124 transitions. 
[2022-05-16 19:03:09] [INFO   ] Found NUPN structural information; 
[2022-05-16 19:03:09] [INFO   ] Parsed PT model containing 1126 places and 1124 transitions in 136 ms. 
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 1124 rows 1126 cols
[2022-05-16 19:03:09] [INFO   ] Computed 76 place invariants in 30 ms 
Incomplete random walk after 10000  steps, including 18 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :12
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-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-05 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
FORMULA AutoFlight-PT-12b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001  steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) 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 4) 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 4) 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 4) seen :1
FORMULA AutoFlight-PT-12b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1124 rows 1126 cols
[2022-05-16 19:03:10] [INFO   ] Computed 76 place invariants in 27 ms 
[2022-05-16 19:03:10] [INFO   ] [Real]Absence check using  75 positive place invariants in 39 ms returned sat 
[2022-05-16 19:03:10] [INFO   ] [Real]Absence check using  75 positive and 1 generalized place invariants in 2 ms returned sat 
[2022-05-16 19:03:10] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-16 19:03:10] [INFO   ] [Real]Absence check using state equation in 329 ms returned sat 
[2022-05-16 19:03:10] [INFO   ] Solution in real domain found non-integer solution. 
[2022-05-16 19:03:11] [INFO   ] [Nat]Absence check using  75 positive place invariants in 43 ms returned sat 
[2022-05-16 19:03:11] [INFO   ] [Nat]Absence check using  75 positive and 1 generalized place invariants in 1 ms returned sat 
[2022-05-16 19:03:11] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2022-05-16 19:03:11] [INFO   ] [Nat]Absence check using state equation in 304 ms returned sat 
[2022-05-16 19:03:11] [INFO   ] Deduced a trap composed of 22 places in 359 ms of which 9 ms to minimize. 
[2022-05-16 19:03:12] [INFO   ] Deduced a trap composed of 32 places in 361 ms of which 2 ms to minimize. 
[2022-05-16 19:03:12] [INFO   ] Deduced a trap composed of 36 places in 325 ms of which 1 ms to minimize. 
[2022-05-16 19:03:12] [INFO   ] Deduced a trap composed of 21 places in 274 ms of which 3 ms to minimize. 
[2022-05-16 19:03:13] [INFO   ] Deduced a trap composed of 19 places in 305 ms of which 1 ms to minimize. 
[2022-05-16 19:03:13] [INFO   ] Deduced a trap composed of 18 places in 248 ms of which 0 ms to minimize. 
[2022-05-16 19:03:13] [INFO   ] Deduced a trap composed of 15 places in 266 ms of which 1 ms to minimize. 
[2022-05-16 19:03:14] [INFO   ] Deduced a trap composed of 31 places in 258 ms of which 1 ms to minimize. 
[2022-05-16 19:03:14] [INFO   ] Deduced a trap composed of 19 places in 265 ms of which 1 ms to minimize. 
[2022-05-16 19:03:14] [INFO   ] Deduced a trap composed of 28 places in 230 ms of which 1 ms to minimize. 
[2022-05-16 19:03:15] [INFO   ] Deduced a trap composed of 34 places in 240 ms of which 2 ms to minimize. 
[2022-05-16 19:03:15] [INFO   ] Deduced a trap composed of 25 places in 247 ms of which 1 ms to minimize. 
[2022-05-16 19:03:15] [INFO   ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4051 ms 
[2022-05-16 19:03:15] [INFO   ] Computed and/alt/rep : 1121/1477/1121 causal constraints (skipped 2 transitions) in 83 ms. 
[2022-05-16 19:03:16] [INFO   ] Deduced a trap composed of 25 places in 507 ms of which 2 ms to minimize. 
[2022-05-16 19:03:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0 
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
	at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
	at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
	at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
	at fr.lip6.move.gal.application.Application.start(Application.java:140)
	at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
	at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
	at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
	at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
	at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
	at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
	at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
	at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
	at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
	at java.base/java.lang.reflect.Method.invoke(Method.java:566)
	at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
	at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
	at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
	at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 19:03:16] [INFO   ] [Real]Absence check using  75 positive place invariants in 49 ms returned sat 
[2022-05-16 19:03:16] [INFO   ] [Real]Absence check using  75 positive and 1 generalized place invariants in 2 ms returned sat 
[2022-05-16 19:03:16] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-16 19:03:17] [INFO   ] [Real]Absence check using state equation in 391 ms returned sat 
[2022-05-16 19:03:17] [INFO   ] Solution in real domain found non-integer solution. 
[2022-05-16 19:03:17] [INFO   ] [Nat]Absence check using  75 positive place invariants in 36 ms returned sat 
[2022-05-16 19:03:17] [INFO   ] [Nat]Absence check using  75 positive and 1 generalized place invariants in 2 ms returned sat 
[2022-05-16 19:03:17] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2022-05-16 19:03:17] [INFO   ] [Nat]Absence check using state equation in 313 ms returned sat 
[2022-05-16 19:03:18] [INFO   ] Deduced a trap composed of 21 places in 323 ms of which 0 ms to minimize. 
[2022-05-16 19:03:18] [INFO   ] Deduced a trap composed of 28 places in 290 ms of which 0 ms to minimize. 
[2022-05-16 19:03:18] [INFO   ] Deduced a trap composed of 25 places in 296 ms of which 1 ms to minimize. 
[2022-05-16 19:03:19] [INFO   ] Deduced a trap composed of 78 places in 296 ms of which 1 ms to minimize. 
[2022-05-16 19:03:19] [INFO   ] Deduced a trap composed of 33 places in 264 ms of which 0 ms to minimize. 
[2022-05-16 19:03:19] [INFO   ] Deduced a trap composed of 36 places in 295 ms of which 1 ms to minimize. 
[2022-05-16 19:03:20] [INFO   ] Deduced a trap composed of 99 places in 324 ms of which 1 ms to minimize. 
[2022-05-16 19:03:20] [INFO   ] Deduced a trap composed of 77 places in 298 ms of which 1 ms to minimize. 
[2022-05-16 19:03:20] [INFO   ] Deduced a trap composed of 74 places in 242 ms of which 1 ms to minimize. 
[2022-05-16 19:03:21] [INFO   ] Deduced a trap composed of 77 places in 276 ms of which 1 ms to minimize. 
[2022-05-16 19:03:21] [INFO   ] Deduced a trap composed of 130 places in 283 ms of which 1 ms to minimize. 
[2022-05-16 19:03:21] [INFO   ] Deduced a trap composed of 102 places in 287 ms of which 1 ms to minimize. 
[2022-05-16 19:03:22] [INFO   ] Deduced a trap composed of 78 places in 275 ms of which 1 ms to minimize. 
[2022-05-16 19:03:22] [INFO   ] Deduced a trap composed of 112 places in 280 ms of which 1 ms to minimize. 
[2022-05-16 19:03:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1 
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
	at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
	at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
	at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
	at fr.lip6.move.gal.application.Application.start(Application.java:140)
	at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
	at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
	at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
	at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
	at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
	at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
	at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
	at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
	at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
	at java.base/java.lang.reflect.Method.invoke(Method.java:566)
	at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
	at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
	at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
	at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 19:03:22] [INFO   ] [Real]Absence check using  75 positive place invariants in 42 ms returned sat 
[2022-05-16 19:03:22] [INFO   ] [Real]Absence check using  75 positive and 1 generalized place invariants in 2 ms returned sat 
[2022-05-16 19:03:22] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-16 19:03:22] [INFO   ] [Real]Absence check using state equation in 370 ms returned sat 
[2022-05-16 19:03:22] [INFO   ] Solution in real domain found non-integer solution. 
[2022-05-16 19:03:23] [INFO   ] [Nat]Absence check using  75 positive place invariants in 35 ms returned sat 
[2022-05-16 19:03:23] [INFO   ] [Nat]Absence check using  75 positive and 1 generalized place invariants in 1 ms returned sat 
[2022-05-16 19:03:23] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2022-05-16 19:03:23] [INFO   ] [Nat]Absence check using state equation in 326 ms returned sat 
[2022-05-16 19:03:23] [INFO   ] Deduced a trap composed of 18 places in 287 ms of which 1 ms to minimize. 
[2022-05-16 19:03:24] [INFO   ] Deduced a trap composed of 31 places in 291 ms of which 1 ms to minimize. 
[2022-05-16 19:03:24] [INFO   ] Deduced a trap composed of 15 places in 296 ms of which 0 ms to minimize. 
[2022-05-16 19:03:24] [INFO   ] Deduced a trap composed of 75 places in 266 ms of which 1 ms to minimize. 
[2022-05-16 19:03:25] [INFO   ] Deduced a trap composed of 19 places in 264 ms of which 1 ms to minimize. 
[2022-05-16 19:03:25] [INFO   ] Deduced a trap composed of 25 places in 271 ms of which 1 ms to minimize. 
[2022-05-16 19:03:25] [INFO   ] Deduced a trap composed of 71 places in 263 ms of which 2 ms to minimize. 
[2022-05-16 19:03:26] [INFO   ] Deduced a trap composed of 71 places in 246 ms of which 6 ms to minimize. 
[2022-05-16 19:03:26] [INFO   ] Deduced a trap composed of 79 places in 220 ms of which 1 ms to minimize. 
[2022-05-16 19:03:26] [INFO   ] Deduced a trap composed of 60 places in 224 ms of which 1 ms to minimize. 
[2022-05-16 19:03:26] [INFO   ] Deduced a trap composed of 100 places in 239 ms of which 1 ms to minimize. 
[2022-05-16 19:03:27] [INFO   ] Deduced a trap composed of 59 places in 221 ms of which 1 ms to minimize. 
[2022-05-16 19:03:27] [INFO   ] Deduced a trap composed of 66 places in 226 ms of which 1 ms to minimize. 
[2022-05-16 19:03:27] [INFO   ] Deduced a trap composed of 62 places in 212 ms of which 1 ms to minimize. 
[2022-05-16 19:03:27] [INFO   ] Deduced a trap composed of 88 places in 215 ms of which 0 ms to minimize. 
[2022-05-16 19:03:28] [INFO   ] Deduced a trap composed of 74 places in 228 ms of which 1 ms to minimize. 
[2022-05-16 19:03:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2 
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
	at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
	at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
	at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
	at fr.lip6.move.gal.application.Application.start(Application.java:140)
	at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
	at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
	at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
	at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
	at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
	at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
	at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
	at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
	at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
	at java.base/java.lang.reflect.Method.invoke(Method.java:566)
	at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
	at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
	at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
	at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Drop transitions removed 448 transitions 
Trivial Post-agglo rules discarded 448 transitions
Performed 448 trivial Post agglomeration. Transition count delta: 448
Iterating post reduction 0 with 448 rules applied. Total rules applied 448 place count 1126 transition count 676
Reduce places removed 448 places and 0 transitions. 
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 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 532 rules applied. Total rules applied 980 place count 678 transition count 592
Reduce places removed 24 places and 0 transitions. 
Iterating post reduction 2 with 24 rules applied. Total rules applied 1004 place count 654 transition count 592
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 148 Pre rules applied. Total rules applied 1004 place count 654 transition count 444
Deduced a syphon composed of 148 places in 2 ms
Reduce places removed 148 places and 0 transitions. 
Iterating global reduction 3 with 296 rules applied. Total rules applied 1300 place count 506 transition count 444
Discarding 108 places :
Symmetric choice reduction at 3 with 108 rule applications. Total rules  1408 place count 398 transition count 336
Iterating global reduction 3 with 108 rules applied. Total rules applied 1516 place count 398 transition count 336
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 1516 place count 398 transition count 300
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions. 
Iterating global reduction 3 with 72 rules applied. Total rules applied 1588 place count 362 transition count 300
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions. 
Iterating global reduction 3 with 176 rules applied. Total rules applied 1764 place count 274 transition count 212
Free-agglomeration rule  applied 48 times.
Iterating global reduction 3 with 48 rules applied. Total rules applied 1812 place count 274 transition count 164
Reduce places removed 48 places and 0 transitions. 
Iterating post reduction 3 with 48 rules applied. Total rules applied 1860 place count 226 transition count 164
Reduce places removed 1 places and 1 transitions. 
Iterating global reduction 4 with 1 rules applied. Total rules applied 1861 place count 225 transition count 163
Reduce places removed 46 places and 0 transitions. 
Drop transitions removed 71 transitions 
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 4 with 117 rules applied. Total rules applied 1978 place count 179 transition count 92
Reduce places removed 71 places and 0 transitions. 
Iterating post reduction 5 with 71 rules applied. Total rules applied 2049 place count 108 transition count 92
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 31 Pre rules applied. Total rules applied 2049 place count 108 transition count 61
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions. 
Iterating global reduction 6 with 62 rules applied. Total rules applied 2111 place count 77 transition count 61
Applied a total of 2111 rules in 163 ms. Remains 77 /1126 variables (removed 1049) and now considering 61/1124 (removed 1063) transitions.
Finished structural reductions, in 1 iterations. Remains : 77/1126 places, 61/1124 transitions.
// Phase 1: matrix 61 rows 77 cols
[2022-05-16 19:03:28] [INFO   ] Computed 30 place invariants in 1 ms 
Incomplete random walk after 1000000  steps, including 2 resets, run finished after 1469 ms. (steps per millisecond=680 ) properties (out of 3) seen :3
FORMULA AutoFlight-PT-12b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1652727810101
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-12b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
	rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo "    Executing tool gold2021"
echo "    Input is 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 r010-tajo-165245701800178"
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 '
		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 ;
