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-165245701700115.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 AirplaneLD-PT-4000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701700115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 45M
-rw-r--r-- 1 mcc users 1002K Apr 29 23:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.5M Apr 29 23:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Apr 29 22:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.5M Apr 29 22:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 2.1M May 9 07:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 4.7M May 9 07:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M May 9 07:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.5M May 9 07:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 191K May 9 07:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 358K May 9 07:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 18M 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 AirplaneLD-PT-4000-UpperBounds-00
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-01
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-02
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-03
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-04
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-05
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-06
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-07
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-08
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-09
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-10
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-11
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-12
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-13
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-14
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652727587375

Running Version 0
[2022-05-16 18:59:49] [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 18:59:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:59:50] [INFO ] Load time of PNML (sax parser for PT used): 949 ms
[2022-05-16 18:59:50] [INFO ] Transformed 28019 places.
[2022-05-16 18:59:50] [INFO ] Transformed 32008 transitions.
[2022-05-16 18:59:50] [INFO ] Parsed PT model containing 28019 places and 32008 transitions in 1151 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 568 ms.
Reduce places removed 12002 places and 0 transitions.
FORMULA AirplaneLD-PT-4000-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-4000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 32008 rows 16017 cols
[2022-05-16 19:00:15] [INFO ] Computed 3 place invariants in 24722 ms
FORMULA AirplaneLD-PT-4000-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 23746 ms. (steps per millisecond=0 ) properties (out of 13) seen :12
FORMULA AirplaneLD-PT-4000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :4
// Phase 1: matrix 32008 rows 16017 cols
[2022-05-16 19:01:05] [INFO ] Computed 3 place invariants in 24874 ms
[2022-05-16 19:01:07] [INFO ] [Real]Absence check using 2 positive place invariants in 290 ms returned sat
[2022-05-16 19:01:07] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 19:01:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:01:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
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:01:12] [INFO ] [Real]Absence check using 2 positive place invariants in 303 ms returned sat
[2022-05-16 19:01:12] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 19:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:01:15] [INFO ] [Real]Absence check using state equation in 3054 ms returned unknown
[2022-05-16 19:01:17] [INFO ] [Real]Absence check using 2 positive place invariants in 409 ms returned sat
[2022-05-16 19:01:17] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 7 ms returned sat
[2022-05-16 19:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:01:20] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
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:01:22] [INFO ] [Real]Absence check using 2 positive place invariants in 303 ms returned sat
[2022-05-16 19:01:22] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 19:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:01:25] [INFO ] [Real]Absence check using state equation in 2824 ms returned unknown
[2022-05-16 19:01:27] [INFO ] [Real]Absence check using 2 positive place invariants in 282 ms returned sat
[2022-05-16 19:01:27] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 19:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:01:30] [INFO ] [Real]Absence check using state equation in 2924 ms returned unknown
[2022-05-16 19:01:32] [INFO ] [Real]Absence check using 2 positive place invariants in 285 ms returned sat
[2022-05-16 19:01:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 19:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:01:35] [INFO ] [Real]Absence check using state equation in 3189 ms returned unknown
[2022-05-16 19:01:37] [INFO ] [Real]Absence check using 2 positive place invariants in 300 ms returned sat
[2022-05-16 19:01:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 6 ms returned sat
[2022-05-16 19:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:01:40] [INFO ] [Real]Absence check using state equation in 2876 ms returned unknown
[2022-05-16 19:01:42] [INFO ] [Real]Absence check using 2 positive place invariants in 288 ms returned sat
[2022-05-16 19:01:42] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 19:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:01:45] [INFO ] [Real]Absence check using state equation in 3102 ms returned unknown
[2022-05-16 19:01:47] [INFO ] [Real]Absence check using 2 positive place invariants in 295 ms returned sat
[2022-05-16 19:01:47] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 5 ms returned sat
[2022-05-16 19:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:01:50] [INFO ] [Real]Absence check using state equation in 2803 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 0]
Support contains 8006 out of 16017 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16017/16017 places, 32008/32008 transitions.
Graph (complete) has 42023 edges and 16017 vertex of which 12014 are kept as prefixes of interest. Removing 4003 places using SCC suffix rule.124 ms
Discarding 4003 places :
Also discarding 0 output transitions
Drop transitions removed 4001 transitions
Ensure Unique test removed 3998 transitions
Reduce isomorphic transitions removed 7999 transitions.
Iterating post reduction 0 with 7999 rules applied. Total rules applied 8000 place count 12014 transition count 24009
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 8000 place count 12014 transition count 24007
Deduced a syphon composed of 2 places in 11 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 8005 place count 12011 transition count 24007
Discarding 3999 places :
Symmetric choice reduction at 1 with 3999 rule applications. Total rules 12004 place count 8012 transition count 20008
Iterating global reduction 1 with 3999 rules applied. Total rules applied 16003 place count 8012 transition count 20008
Ensure Unique test removed 3999 transitions
Reduce isomorphic transitions removed 3999 transitions.
Iterating post reduction 1 with 3999 rules applied. Total rules applied 20002 place count 8012 transition count 16009
Applied a total of 20002 rules in 1851 ms. Remains 8012 /16017 variables (removed 8005) and now considering 16009/32008 (removed 15999) transitions.
Finished structural reductions, in 1 iterations. Remains : 8012/16017 places, 16009/32008 transitions.
// Phase 1: matrix 16009 rows 8012 cols
[2022-05-16 19:02:00] [INFO ] Computed 1 place invariants in 7721 ms
Interrupted random walk after 27511 steps, including 4022 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1}
Incomplete Best-First random walk after 1000001 steps, including 83 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 1000001 steps, including 49 resets, run finished after 894 ms. (steps per millisecond=1118 ) properties (out of 9) seen :8
Interrupted Best-First random walk after 195394 steps, including 16 resets, run timeout after 5012 ms. (steps per millisecond=38 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 7=1, 8=1}
Interrupted Best-First random walk after 149299 steps, including 12 resets, run timeout after 5007 ms. (steps per millisecond=29 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 7=1, 8=1}
Incomplete Best-First random walk after 1000001 steps, including 83 resets, run finished after 748 ms. (steps per millisecond=1336 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000001 steps, including 83 resets, run finished after 736 ms. (steps per millisecond=1358 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 1000001 steps, including 83 resets, run finished after 714 ms. (steps per millisecond=1400 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000001 steps, including 35 resets, run finished after 398 ms. (steps per millisecond=2512 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 1000001 steps, including 49 resets, run finished after 504 ms. (steps per millisecond=1984 ) properties (out of 9) seen :8
// Phase 1: matrix 16009 rows 8012 cols
[2022-05-16 19:02:52] [INFO ] Computed 1 place invariants in 7026 ms
[2022-05-16 19:02:53] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 73 ms returned sat
[2022-05-16 19:02:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:00] [INFO ] [Real]Absence check using state equation in 6742 ms returned unsat
[2022-05-16 19:03:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 77 ms returned sat
[2022-05-16 19:03:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:08] [INFO ] [Real]Absence check using state equation in 6711 ms returned unsat
[2022-05-16 19:03:09] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 75 ms returned sat
[2022-05-16 19:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:17] [INFO ] [Real]Absence check using state equation in 8065 ms returned unsat
[2022-05-16 19:03:18] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 76 ms returned sat
[2022-05-16 19:03:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:28] [INFO ] [Real]Absence check using state equation in 10572 ms returned unsat
[2022-05-16 19:03:29] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 72 ms returned sat
[2022-05-16 19:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:36] [INFO ] [Real]Absence check using state equation in 7113 ms returned unsat
[2022-05-16 19:03:37] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 69 ms returned sat
[2022-05-16 19:03:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:44] [INFO ] [Real]Absence check using state equation in 7046 ms returned unsat
[2022-05-16 19:03:45] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 72 ms returned sat
[2022-05-16 19:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:51] [INFO ] [Real]Absence check using state equation in 5402 ms returned unsat
[2022-05-16 19:03:52] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 75 ms returned sat
[2022-05-16 19:03:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:56] [INFO ] [Real]Absence check using state equation in 4081 ms returned unsat
[2022-05-16 19:03:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 69 ms returned sat
[2022-05-16 19:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:04:03] [INFO ] [Real]Absence check using state equation in 6775 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA AirplaneLD-PT-4000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652727844092

--------------------
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="AirplaneLD-PT-4000"
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 AirplaneLD-PT-4000, 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-165245701700115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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