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.r312-tall-165472281900197.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 DBSingleClientW-PT-d1m05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281900197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 5.2K Jun 7 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Jun 7 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 7 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 7 17:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 17:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 432K Jun 6 12:11 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 DBSingleClientW-PT-d1m05-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654776473623

Running Version 202205111006
[2022-06-09 12:07:54] [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-06-09 12:07:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 12:07:54] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2022-06-09 12:07:55] [INFO ] Transformed 1440 places.
[2022-06-09 12:07:55] [INFO ] Transformed 672 transitions.
[2022-06-09 12:07:55] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 246 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 12:07:55] [INFO ] Computed 6 place invariants in 52 ms
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 951 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 961 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 12:07:55] [INFO ] Computed 6 place invariants in 18 ms
[2022-06-09 12:07:55] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-09 12:07:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2022-06-09 12:07:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:07:55] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2022-06-09 12:07:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:07:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 12:07:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 12:07:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:07:55] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-06-09 12:07:55] [INFO ] State equation strengthened by 418 read => feed constraints.
[2022-06-09 12:07:56] [INFO ] [Nat]Added 418 Read/Feed constraints in 104 ms returned sat
[2022-06-09 12:07:56] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2022-06-09 12:07:56] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 2 ms to minimize.
[2022-06-09 12:07:56] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 1 ms to minimize.
[2022-06-09 12:07:56] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 2 ms to minimize.
[2022-06-09 12:07:57] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 1 ms to minimize.
[2022-06-09 12:07:57] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 1 ms to minimize.
[2022-06-09 12:07:57] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 1 ms to minimize.
[2022-06-09 12:07:57] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 1 ms to minimize.
[2022-06-09 12:07:57] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 1 ms to minimize.
[2022-06-09 12:07:58] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 0 ms to minimize.
[2022-06-09 12:07:58] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 1 ms to minimize.
[2022-06-09 12:07:58] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 0 ms to minimize.
[2022-06-09 12:07:58] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 1 ms to minimize.
[2022-06-09 12:07:58] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2022-06-09 12:07:58] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 1 ms to minimize.
[2022-06-09 12:07:59] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 1 ms to minimize.
[2022-06-09 12:07:59] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 0 ms to minimize.
[2022-06-09 12:07:59] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 0 ms to minimize.
[2022-06-09 12:07:59] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 0 ms to minimize.
[2022-06-09 12:07:59] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2022-06-09 12:08:00] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 0 ms to minimize.
[2022-06-09 12:08:00] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 1 ms to minimize.
[2022-06-09 12:08:00] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 0 ms to minimize.
[2022-06-09 12:08:00] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 1 ms to minimize.
[2022-06-09 12:08:00] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 0 ms to minimize.
[2022-06-09 12:08:00] [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.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)
[2022-06-09 12:08:00] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-09 12:08:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 12:08:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:08:01] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-06-09 12:08:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:08:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-09 12:08:01] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-09 12:08:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:08:01] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2022-06-09 12:08:01] [INFO ] [Nat]Added 418 Read/Feed constraints in 101 ms returned sat
[2022-06-09 12:08:01] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2022-06-09 12:08:01] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 1 ms to minimize.
[2022-06-09 12:08:01] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2022-06-09 12:08:02] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 0 ms to minimize.
[2022-06-09 12:08:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 679 ms
[2022-06-09 12:08:02] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 122 ms.
[2022-06-09 12:08:02] [INFO ] Added : 14 causal constraints over 3 iterations in 356 ms. Result :sat
Minimization took 167 ms.
Current structural bounds on expressions (after SMT) : [7, 5] Max seen :[0, 0]
Support contains 2 out of 347 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.193 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 185 place count 229 transition count 327
Iterating global reduction 1 with 96 rules applied. Total rules applied 281 place count 229 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 285 place count 229 transition count 323
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 358 place count 156 transition count 250
Iterating global reduction 2 with 73 rules applied. Total rules applied 431 place count 156 transition count 250
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 436 place count 156 transition count 245
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 477 place count 115 transition count 180
Iterating global reduction 3 with 41 rules applied. Total rules applied 518 place count 115 transition count 180
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 542 place count 115 transition count 156
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 552 place count 105 transition count 139
Iterating global reduction 4 with 10 rules applied. Total rules applied 562 place count 105 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 563 place count 105 transition count 138
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 571 place count 97 transition count 130
Iterating global reduction 5 with 8 rules applied. Total rules applied 579 place count 97 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 582 place count 97 transition count 127
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 588 place count 91 transition count 121
Iterating global reduction 6 with 6 rules applied. Total rules applied 594 place count 91 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 597 place count 91 transition count 118
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 598 place count 90 transition count 116
Iterating global reduction 7 with 1 rules applied. Total rules applied 599 place count 90 transition count 116
Applied a total of 599 rules in 282 ms. Remains 90 /347 variables (removed 257) and now considering 116/672 (removed 556) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/347 places, 116/672 transitions.
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 12:08:02] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229527 resets, run finished after 951 ms. (steps per millisecond=1051 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98660 resets, run finished after 454 ms. (steps per millisecond=2202 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98882 resets, run finished after 410 ms. (steps per millisecond=2439 ) properties (out of 2) seen :0
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 12:08:04] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:08:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:08:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:08:04] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 12:08:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:08:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:08:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:08:04] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 12:08:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 12:08:04] [INFO ] [Nat]Added 38 Read/Feed constraints in 4 ms returned sat
[2022-06-09 12:08:04] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 84 transitions) in 9 ms.
[2022-06-09 12:08:04] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2022-06-09 12:08:05] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2022-06-09 12:08:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2022-06-09 12:08:05] [INFO ] Added : 12 causal constraints over 5 iterations in 174 ms. Result :sat
Minimization took 22 ms.
[2022-06-09 12:08:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:08:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:08:05] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 12:08:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:08:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:08:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:08:05] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-09 12:08:05] [INFO ] [Nat]Added 38 Read/Feed constraints in 6 ms returned sat
[2022-06-09 12:08:05] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 84 transitions) in 8 ms.
[2022-06-09 12:08:05] [INFO ] Added : 9 causal constraints over 2 iterations in 35 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [7, 5] Max seen :[0, 0]
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 116/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 116/116 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 12:08:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:08:05] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 12:08:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:08:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 12:08:05] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2022-06-09 12:08:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 12:08:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:08:05] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 116/116 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-00
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 12:08:05] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1021 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 12:08:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:08:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:08:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:08:05] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 12:08:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:08:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:08:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:08:05] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 12:08:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 12:08:05] [INFO ] [Nat]Added 38 Read/Feed constraints in 6 ms returned sat
[2022-06-09 12:08:05] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 84 transitions) in 7 ms.
[2022-06-09 12:08:05] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2022-06-09 12:08:05] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2022-06-09 12:08:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2022-06-09 12:08:05] [INFO ] Added : 12 causal constraints over 5 iterations in 167 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 116/116 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 87 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 86 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 85 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 85 transition count 104
Applied a total of 10 rules in 17 ms. Remains 85 /90 variables (removed 5) and now considering 104/116 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/90 places, 104/116 transitions.
// Phase 1: matrix 104 rows 85 cols
[2022-06-09 12:08:05] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229439 resets, run finished after 811 ms. (steps per millisecond=1233 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98945 resets, run finished after 394 ms. (steps per millisecond=2538 ) properties (out of 1) seen :0
// Phase 1: matrix 104 rows 85 cols
[2022-06-09 12:08:07] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:08:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:08:07] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 12:08:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:08:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:08:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:08:07] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 12:08:07] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 12:08:07] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2022-06-09 12:08:07] [INFO ] Computed and/alt/rep : 30/65/30 causal constraints (skipped 73 transitions) in 6 ms.
[2022-06-09 12:08:07] [INFO ] Added : 8 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 104/104 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 85 cols
[2022-06-09 12:08:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:08:07] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 104 rows 85 cols
[2022-06-09 12:08:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:08:07] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 12:08:07] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2022-06-09 12:08:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 104 rows 85 cols
[2022-06-09 12:08:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:08:07] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 104/104 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-00 in 1996 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-15
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 12:08:07] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2314 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1025 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 12:08:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:08:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:08:07] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 12:08:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:08:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:08:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:08:07] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 12:08:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 12:08:07] [INFO ] [Nat]Added 38 Read/Feed constraints in 6 ms returned sat
[2022-06-09 12:08:07] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 84 transitions) in 6 ms.
[2022-06-09 12:08:07] [INFO ] Added : 9 causal constraints over 2 iterations in 35 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 116/116 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 89 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 88 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 87 transition count 111
Applied a total of 8 rules in 11 ms. Remains 87 /90 variables (removed 3) and now considering 111/116 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/90 places, 111/116 transitions.
// Phase 1: matrix 111 rows 87 cols
[2022-06-09 12:08:07] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 229930 resets, run finished after 865 ms. (steps per millisecond=1156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98909 resets, run finished after 424 ms. (steps per millisecond=2358 ) properties (out of 1) seen :0
// Phase 1: matrix 111 rows 87 cols
[2022-06-09 12:08:09] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:08:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:08:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:08:09] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-06-09 12:08:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:08:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:08:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:08:09] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 12:08:09] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 12:08:09] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2022-06-09 12:08:09] [INFO ] Computed and/alt/rep : 30/66/30 causal constraints (skipped 80 transitions) in 6 ms.
[2022-06-09 12:08:09] [INFO ] Added : 10 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 111/111 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 111/111 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 111/111 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 87 cols
[2022-06-09 12:08:09] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:08:09] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 111 rows 87 cols
[2022-06-09 12:08:09] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:08:09] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 12:08:09] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2022-06-09 12:08:09] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 111 rows 87 cols
[2022-06-09 12:08:09] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:08:09] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 111/111 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-15 in 1938 ms.
[2022-06-09 12:08:09] [INFO ] Flatten gal took : 38 ms
[2022-06-09 12:08:09] [INFO ] Applying decomposition
[2022-06-09 12:08:09] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7874232256302016909.txt' '-o' '/tmp/graph7874232256302016909.bin' '-w' '/tmp/graph7874232256302016909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7874232256302016909.bin' '-l' '-1' '-v' '-w' '/tmp/graph7874232256302016909.weights' '-q' '0' '-e' '0.001'
[2022-06-09 12:08:09] [INFO ] Decomposing Gal with order
[2022-06-09 12:08:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 12:08:09] [INFO ] Removed a total of 104 redundant transitions.
[2022-06-09 12:08:09] [INFO ] Flatten gal took : 43 ms
[2022-06-09 12:08:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 23 ms.
[2022-06-09 12:08:09] [INFO ] Time to serialize gal into /tmp/UpperBounds13563965443735468696.gal : 6 ms
[2022-06-09 12:08:09] [INFO ] Time to serialize properties into /tmp/UpperBounds8504237152497289289.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13563965443735468696.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8504237152497289289.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds8504237152497289289.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,77203,0.410938,20132,704,442,22469,5325,353,85204,133,34302,0
Total reachable state count : 77203

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m05-UpperBounds-00 :0 <= i6.u11.p102 <= 1
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m05-UpperBounds-00,0,0.430463,20132,1,0,22469,5325,463,85204,158,34302,766
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m05-UpperBounds-15 :0 <= u6.l449 <= 1
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m05-UpperBounds-15,0,0.431356,20132,1,0,22469,5325,484,85204,165,34302,904
Total runtime 15642 ms.

BK_STOP 1654776490423

--------------------
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="DBSingleClientW-PT-d1m05"
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 DBSingleClientW-PT-d1m05, 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 r312-tall-165472281900197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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