Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821200685.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821200685
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.4M
-rw-r--r-- 1 mcc users 12K Apr 29 16:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 16:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 16:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 16:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K May 9 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 5.2M May 10 09:34 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 MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652830603761

Running Version 202205111006
[2022-05-17 23:36:44] [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-17 23:36:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 23:36:45] [INFO ] Load time of PNML (sax parser for PT used): 396 ms
[2022-05-17 23:36:45] [INFO ] Transformed 5568 places.
[2022-05-17 23:36:45] [INFO ] Transformed 7799 transitions.
[2022-05-17 23:36:45] [INFO ] Parsed PT model containing 5568 places and 7799 transitions in 540 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 7527 out of 7799 initially.
// Phase 1: matrix 7527 rows 5568 cols
[2022-05-17 23:36:45] [INFO ] Computed 573 place invariants in 386 ms
Incomplete random walk after 10000 steps, including 160 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 16) seen :10
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 15) seen :4
[2022-05-17 23:36:46] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
// Phase 1: matrix 7527 rows 5568 cols
[2022-05-17 23:36:46] [INFO ] Computed 573 place invariants in 226 ms
[2022-05-17 23:36:47] [INFO ] [Real]Absence check using 50 positive place invariants in 86 ms returned sat
[2022-05-17 23:36:47] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 130 ms returned unsat
[2022-05-17 23:36:48] [INFO ] [Real]Absence check using 50 positive place invariants in 80 ms returned sat
[2022-05-17 23:36:48] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 119 ms returned unsat
[2022-05-17 23:36:49] [INFO ] [Real]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-05-17 23:36:49] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 208 ms returned sat
[2022-05-17 23:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:36:53] [INFO ] [Real]Absence check using state equation in 4274 ms returned unknown
[2022-05-17 23:36:54] [INFO ] [Real]Absence check using 50 positive place invariants in 66 ms returned sat
[2022-05-17 23:36:54] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 124 ms returned unsat
[2022-05-17 23:36:54] [INFO ] [Real]Absence check using 50 positive place invariants in 69 ms returned sat
[2022-05-17 23:36:55] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 128 ms returned unsat
[2022-05-17 23:36:55] [INFO ] [Real]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-05-17 23:36:55] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 116 ms returned unsat
[2022-05-17 23:36:56] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2022-05-17 23:36:56] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 119 ms returned unsat
[2022-05-17 23:36:56] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2022-05-17 23:36:57] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 204 ms returned sat
[2022-05-17 23:36:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:37:01] [INFO ] [Real]Absence check using state equation in 4218 ms returned unknown
[2022-05-17 23:37:01] [INFO ] [Real]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-05-17 23:37:01] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 116 ms returned unsat
[2022-05-17 23:37:02] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2022-05-17 23:37:02] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 193 ms returned sat
[2022-05-17 23:37:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:37:06] [INFO ] [Real]Absence check using state equation in 4309 ms returned unknown
[2022-05-17 23:37:07] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2022-05-17 23:37:07] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 120 ms returned unsat
[2022-05-17 23:37:08] [INFO ] [Real]Absence check using 50 positive place invariants in 63 ms returned sat
[2022-05-17 23:37:08] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 200 ms returned sat
[2022-05-17 23:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:37:12] [INFO ] [Real]Absence check using state equation in 4238 ms returned unknown
[2022-05-17 23:37:13] [INFO ] [Real]Absence check using 50 positive place invariants in 60 ms returned sat
[2022-05-17 23:37:13] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 194 ms returned sat
[2022-05-17 23:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:37:17] [INFO ] [Real]Absence check using state equation in 4195 ms returned sat
[2022-05-17 23:37:17] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2022-05-17 23:37:17] [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 12
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.verifyPossible(DeadlockTester.java:910)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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)
[2022-05-17 23:37:18] [INFO ] [Real]Absence check using 50 positive place invariants in 65 ms returned sat
[2022-05-17 23:37:18] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 127 ms returned unsat
[2022-05-17 23:37:19] [INFO ] [Real]Absence check using 50 positive place invariants in 60 ms returned sat
[2022-05-17 23:37:19] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 181 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 51, 1, 1, 1, 1, 1, 1, 17, 1, 51, 51, 1, 1] Max seen :[1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 5568 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Graph (complete) has 17461 edges and 5568 vertex of which 5536 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.25 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 1628 transitions
Trivial Post-agglo rules discarded 1628 transitions
Performed 1628 trivial Post agglomeration. Transition count delta: 1628
Iterating post reduction 0 with 1628 rules applied. Total rules applied 1629 place count 5536 transition count 6171
Reduce places removed 1628 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1631 rules applied. Total rules applied 3260 place count 3908 transition count 6168
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 3263 place count 3905 transition count 6168
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 204 Pre rules applied. Total rules applied 3263 place count 3905 transition count 5964
Deduced a syphon composed of 204 places in 5 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 3 with 408 rules applied. Total rules applied 3671 place count 3701 transition count 5964
Discarding 1424 places :
Symmetric choice reduction at 3 with 1424 rule applications. Total rules 5095 place count 2277 transition count 4540
Iterating global reduction 3 with 1424 rules applied. Total rules applied 6519 place count 2277 transition count 4540
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 6519 place count 2277 transition count 4531
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 6537 place count 2268 transition count 4531
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 6771 place count 2034 transition count 3127
Iterating global reduction 3 with 234 rules applied. Total rules applied 7005 place count 2034 transition count 3127
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 7039 place count 2017 transition count 3110
Free-agglomeration rule (complex) applied 164 times.
Iterating global reduction 3 with 164 rules applied. Total rules applied 7203 place count 2017 transition count 4116
Reduce places removed 164 places and 0 transitions.
Iterating post reduction 3 with 164 rules applied. Total rules applied 7367 place count 1853 transition count 4116
Partial Free-agglomeration rule applied 51 times.
Drop transitions removed 51 transitions
Iterating global reduction 4 with 51 rules applied. Total rules applied 7418 place count 1853 transition count 4116
Applied a total of 7418 rules in 2135 ms. Remains 1853 /5568 variables (removed 3715) and now considering 4116/7799 (removed 3683) transitions.
Finished structural reductions, in 1 iterations. Remains : 1853/5568 places, 4116/7799 transitions.
Normalized transition count is 3718 out of 4116 initially.
// Phase 1: matrix 3718 rows 1853 cols
[2022-05-17 23:37:21] [INFO ] Computed 541 place invariants in 53 ms
Incomplete random walk after 1000000 steps, including 26663 resets, run finished after 14895 ms. (steps per millisecond=67 ) properties (out of 5) seen :4
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 4866 resets, run finished after 3293 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4866 resets, run finished after 3298 ms. (steps per millisecond=303 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 4865 resets, run finished after 3293 ms. (steps per millisecond=303 ) properties (out of 3) seen :1
[2022-05-17 23:37:46] [INFO ] Flow matrix only has 3718 transitions (discarded 398 similar events)
// Phase 1: matrix 3718 rows 1853 cols
[2022-05-17 23:37:46] [INFO ] Computed 541 place invariants in 40 ms
[2022-05-17 23:37:46] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2022-05-17 23:37:46] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 51 ms returned unsat
[2022-05-17 23:37:46] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2022-05-17 23:37:46] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 38 ms returned unsat
[2022-05-17 23:37:46] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2022-05-17 23:37:47] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 74 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 62161 ms.

BK_STOP 1652830667091

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="MultiCrashLeafsetExtension-PT-S16C06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, 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 r132-tall-165271821200685"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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