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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.5K Jun 7 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 7 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Jun 7 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 7 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 20K Jun 7 17:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Jun 7 17:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m032-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654763336939

Running Version 202205111006
[2022-06-09 08:28:58] [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 08:28:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 08:28:59] [INFO ] Load time of PNML (sax parser for PT used): 819 ms
[2022-06-09 08:28:59] [INFO ] Transformed 754 places.
[2022-06-09 08:28:59] [INFO ] Transformed 27370 transitions.
[2022-06-09 08:28:59] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 1035 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 474 places in 93 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m032-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 08:28:59] [INFO ] Computed 10 place invariants in 55 ms
Incomplete random walk after 10017 steps, including 11 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :1
FORMULA BugTracking-PT-q8m032-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :1
FORMULA BugTracking-PT-q8m032-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
[2022-06-09 08:28:59] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 08:28:59] [INFO ] Computed 10 place invariants in 18 ms
[2022-06-09 08:28:59] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2022-06-09 08:28:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:00] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2022-06-09 08:29:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 08:29:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 08:29:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:01] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2022-06-09 08:29:01] [INFO ] State equation strengthened by 303 read => feed constraints.
[2022-06-09 08:29:01] [INFO ] [Nat]Added 303 Read/Feed constraints in 219 ms returned sat
[2022-06-09 08:29:02] [INFO ] Deduced a trap composed of 14 places in 358 ms of which 3 ms to minimize.
[2022-06-09 08:29:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 553 ms
[2022-06-09 08:29:02] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 421 ms.
[2022-06-09 08:29:03] [INFO ] Deduced a trap composed of 19 places in 548 ms of which 2 ms to minimize.
[2022-06-09 08:29:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 777 ms
[2022-06-09 08:29:04] [INFO ] Added : 9 causal constraints over 2 iterations in 1815 ms. Result :sat
[2022-06-09 08:29:04] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 08:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:04] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2022-06-09 08:29:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 08:29:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 08:29:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:05] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2022-06-09 08:29:05] [INFO ] [Nat]Added 303 Read/Feed constraints in 275 ms returned sat
[2022-06-09 08:29:06] [INFO ] Deduced a trap composed of 63 places in 481 ms of which 5 ms to minimize.
[2022-06-09 08:29:06] [INFO ] Deduced a trap composed of 115 places in 489 ms of which 2 ms to minimize.
[2022-06-09 08:29:07] [INFO ] Deduced a trap composed of 17 places in 286 ms of which 1 ms to minimize.
[2022-06-09 08:29:07] [INFO ] Deduced a trap composed of 40 places in 269 ms of which 1 ms to minimize.
[2022-06-09 08:29:08] [INFO ] Deduced a trap composed of 15 places in 284 ms of which 0 ms to minimize.
[2022-06-09 08:29:08] [INFO ] Deduced a trap composed of 17 places in 358 ms of which 1 ms to minimize.
[2022-06-09 08:29:08] [INFO ] Deduced a trap composed of 20 places in 260 ms of which 0 ms to minimize.
[2022-06-09 08:29:09] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 1 ms to minimize.
[2022-06-09 08:29:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3636 ms
[2022-06-09 08:29:09] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 216 ms.
[2022-06-09 08:29:09] [INFO ] Added : 15 causal constraints over 3 iterations in 565 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1, 1] Max seen :[0, 0]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 355 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:10] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 1000023 steps, including 2 resets, run finished after 1701 ms. (steps per millisecond=587 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2009 ms. (steps per millisecond=497 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1906 ms. (steps per millisecond=524 ) properties (out of 2) seen :0
[2022-06-09 08:29:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:16] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 08:29:16] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 08:29:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:16] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2022-06-09 08:29:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 08:29:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-09 08:29:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:17] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2022-06-09 08:29:17] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 08:29:17] [INFO ] [Nat]Added 283 Read/Feed constraints in 313 ms returned sat
[2022-06-09 08:29:18] [INFO ] Deduced a trap composed of 10 places in 488 ms of which 0 ms to minimize.
[2022-06-09 08:29:18] [INFO ] Deduced a trap composed of 40 places in 337 ms of which 0 ms to minimize.
[2022-06-09 08:29:19] [INFO ] Deduced a trap composed of 52 places in 333 ms of which 1 ms to minimize.
[2022-06-09 08:29:19] [INFO ] Deduced a trap composed of 56 places in 333 ms of which 0 ms to minimize.
[2022-06-09 08:29:19] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 0 ms to minimize.
[2022-06-09 08:29:20] [INFO ] Deduced a trap composed of 54 places in 328 ms of which 0 ms to minimize.
[2022-06-09 08:29:20] [INFO ] Deduced a trap composed of 31 places in 333 ms of which 1 ms to minimize.
[2022-06-09 08:29:21] [INFO ] Deduced a trap composed of 55 places in 310 ms of which 0 ms to minimize.
[2022-06-09 08:29:21] [INFO ] Deduced a trap composed of 30 places in 310 ms of which 0 ms to minimize.
[2022-06-09 08:29:21] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 0 ms to minimize.
[2022-06-09 08:29:22] [INFO ] Deduced a trap composed of 10 places in 303 ms of which 1 ms to minimize.
[2022-06-09 08:29:22] [INFO ] Deduced a trap composed of 41 places in 305 ms of which 1 ms to minimize.
[2022-06-09 08:29:23] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5421 ms
[2022-06-09 08:29:23] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 223 ms.
[2022-06-09 08:29:23] [INFO ] Added : 6 causal constraints over 2 iterations in 642 ms. Result :sat
[2022-06-09 08:29:23] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 08:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:24] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2022-06-09 08:29:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 08:29:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 08:29:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:24] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2022-06-09 08:29:25] [INFO ] [Nat]Added 283 Read/Feed constraints in 195 ms returned sat
[2022-06-09 08:29:25] [INFO ] Deduced a trap composed of 30 places in 352 ms of which 1 ms to minimize.
[2022-06-09 08:29:25] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 0 ms to minimize.
[2022-06-09 08:29:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 779 ms
[2022-06-09 08:29:26] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 249 ms.
[2022-06-09 08:29:26] [INFO ] Added : 11 causal constraints over 3 iterations in 755 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, 1] Max seen :[0, 0]
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 58 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 08:29:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:27] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 08:29:27] [INFO ] Implicit Places using invariants in 449 ms returned []
[2022-06-09 08:29:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:27] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 08:29:28] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 08:29:29] [INFO ] Implicit Places using invariants and state equation in 2171 ms returned []
Implicit Place search using SMT with State Equation took 2625 ms to find 0 implicit places.
[2022-06-09 08:29:29] [INFO ] Redundant transitions in 279 ms returned []
[2022-06-09 08:29:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:29] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 08:29:31] [INFO ] Dead Transitions using invariants and state equation in 1076 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m032-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:31] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 08:29:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:31] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 08:29:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 08:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:31] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2022-06-09 08:29:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 08:29:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 08:29:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:32] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2022-06-09 08:29:32] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 08:29:32] [INFO ] [Nat]Added 283 Read/Feed constraints in 320 ms returned sat
[2022-06-09 08:29:33] [INFO ] Deduced a trap composed of 10 places in 453 ms of which 1 ms to minimize.
[2022-06-09 08:29:33] [INFO ] Deduced a trap composed of 40 places in 327 ms of which 4 ms to minimize.
[2022-06-09 08:29:33] [INFO ] Deduced a trap composed of 52 places in 330 ms of which 0 ms to minimize.
[2022-06-09 08:29:34] [INFO ] Deduced a trap composed of 56 places in 328 ms of which 0 ms to minimize.
[2022-06-09 08:29:34] [INFO ] Deduced a trap composed of 42 places in 294 ms of which 1 ms to minimize.
[2022-06-09 08:29:35] [INFO ] Deduced a trap composed of 54 places in 343 ms of which 1 ms to minimize.
[2022-06-09 08:29:35] [INFO ] Deduced a trap composed of 31 places in 320 ms of which 0 ms to minimize.
[2022-06-09 08:29:36] [INFO ] Deduced a trap composed of 55 places in 294 ms of which 1 ms to minimize.
[2022-06-09 08:29:36] [INFO ] Deduced a trap composed of 30 places in 311 ms of which 1 ms to minimize.
[2022-06-09 08:29:36] [INFO ] Deduced a trap composed of 21 places in 261 ms of which 0 ms to minimize.
[2022-06-09 08:29:36] [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:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:36] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1492 ms. (steps per millisecond=670 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1916 ms. (steps per millisecond=521 ) properties (out of 1) seen :0
[2022-06-09 08:29:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:40] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 08:29:40] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-09 08:29:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:40] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2022-06-09 08:29:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 08:29:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 08:29:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:41] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2022-06-09 08:29:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 08:29:41] [INFO ] [Nat]Added 283 Read/Feed constraints in 314 ms returned sat
[2022-06-09 08:29:42] [INFO ] Deduced a trap composed of 10 places in 498 ms of which 2 ms to minimize.
[2022-06-09 08:29:42] [INFO ] Deduced a trap composed of 40 places in 332 ms of which 1 ms to minimize.
[2022-06-09 08:29:43] [INFO ] Deduced a trap composed of 52 places in 336 ms of which 1 ms to minimize.
[2022-06-09 08:29:43] [INFO ] Deduced a trap composed of 56 places in 331 ms of which 0 ms to minimize.
[2022-06-09 08:29:43] [INFO ] Deduced a trap composed of 42 places in 303 ms of which 0 ms to minimize.
[2022-06-09 08:29:44] [INFO ] Deduced a trap composed of 54 places in 339 ms of which 0 ms to minimize.
[2022-06-09 08:29:45] [INFO ] Deduced a trap composed of 31 places in 345 ms of which 1 ms to minimize.
[2022-06-09 08:29:45] [INFO ] Deduced a trap composed of 55 places in 326 ms of which 0 ms to minimize.
[2022-06-09 08:29:45] [INFO ] Deduced a trap composed of 30 places in 314 ms of which 0 ms to minimize.
[2022-06-09 08:29:46] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 0 ms to minimize.
[2022-06-09 08:29:46] [INFO ] Deduced a trap composed of 10 places in 308 ms of which 0 ms to minimize.
[2022-06-09 08:29:47] [INFO ] Deduced a trap composed of 41 places in 322 ms of which 1 ms to minimize.
[2022-06-09 08:29:47] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5565 ms
[2022-06-09 08:29:47] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 236 ms.
[2022-06-09 08:29:48] [INFO ] Added : 6 causal constraints over 2 iterations in 678 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 08:29:48] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:48] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 08:29:48] [INFO ] Implicit Places using invariants in 402 ms returned []
[2022-06-09 08:29:48] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:48] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 08:29:49] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 08:29:50] [INFO ] Implicit Places using invariants and state equation in 2083 ms returned []
Implicit Place search using SMT with State Equation took 2493 ms to find 0 implicit places.
[2022-06-09 08:29:51] [INFO ] Redundant transitions in 239 ms returned []
[2022-06-09 08:29:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:51] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 08:29:52] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m032-UpperBounds-08 in 21119 ms.
Starting property specific reduction for BugTracking-PT-q8m032-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:52] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 10012 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=556 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 08:29:52] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:52] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 08:29:52] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 08:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:52] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2022-06-09 08:29:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 08:29:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 08:29:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:53] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2022-06-09 08:29:53] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 08:29:53] [INFO ] [Nat]Added 283 Read/Feed constraints in 204 ms returned sat
[2022-06-09 08:29:54] [INFO ] Deduced a trap composed of 30 places in 353 ms of which 0 ms to minimize.
[2022-06-09 08:29:54] [INFO ] Deduced a trap composed of 55 places in 215 ms of which 1 ms to minimize.
[2022-06-09 08:29:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 794 ms
[2022-06-09 08:29:54] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 236 ms.
[2022-06-09 08:29:55] [INFO ] Added : 11 causal constraints over 3 iterations in 752 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 55 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:55] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 1484 ms. (steps per millisecond=673 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1924 ms. (steps per millisecond=519 ) properties (out of 1) seen :0
[2022-06-09 08:29:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:29:58] [INFO ] Computed 8 place invariants in 19 ms
[2022-06-09 08:29:58] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 08:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:59] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2022-06-09 08:29:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 08:29:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 08:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 08:29:59] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2022-06-09 08:29:59] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 08:30:00] [INFO ] [Nat]Added 283 Read/Feed constraints in 196 ms returned sat
[2022-06-09 08:30:00] [INFO ] Deduced a trap composed of 30 places in 371 ms of which 0 ms to minimize.
[2022-06-09 08:30:00] [INFO ] Deduced a trap composed of 55 places in 217 ms of which 1 ms to minimize.
[2022-06-09 08:30:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 801 ms
[2022-06-09 08:30:01] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 208 ms.
[2022-06-09 08:30:01] [INFO ] Added : 11 causal constraints over 3 iterations in 748 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 08:30:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:30:01] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 08:30:02] [INFO ] Implicit Places using invariants in 399 ms returned []
[2022-06-09 08:30:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:30:02] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 08:30:02] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 08:30:04] [INFO ] Implicit Places using invariants and state equation in 2099 ms returned []
Implicit Place search using SMT with State Equation took 2502 ms to find 0 implicit places.
[2022-06-09 08:30:04] [INFO ] Redundant transitions in 168 ms returned []
[2022-06-09 08:30:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 08:30:04] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 08:30:05] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m032-UpperBounds-12 in 13464 ms.
[2022-06-09 08:30:06] [INFO ] Flatten gal took : 369 ms
[2022-06-09 08:30:06] [INFO ] Applying decomposition
[2022-06-09 08:30:06] [INFO ] Flatten gal took : 213 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/graph5469551383699464651.txt' '-o' '/tmp/graph5469551383699464651.bin' '-w' '/tmp/graph5469551383699464651.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5469551383699464651.bin' '-l' '-1' '-v' '-w' '/tmp/graph5469551383699464651.weights' '-q' '0' '-e' '0.001'
[2022-06-09 08:30:07] [INFO ] Decomposing Gal with order
[2022-06-09 08:30:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 08:30:07] [INFO ] Removed a total of 424 redundant transitions.
[2022-06-09 08:30:07] [INFO ] Flatten gal took : 546 ms
[2022-06-09 08:30:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 32 ms.
[2022-06-09 08:30:07] [INFO ] Time to serialize gal into /tmp/UpperBounds11775758706437918416.gal : 42 ms
[2022-06-09 08:30:07] [INFO ] Time to serialize properties into /tmp/UpperBounds16748292374909030043.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/UpperBounds11775758706437918416.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16748292374909030043.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...276
Loading property file /tmp/UpperBounds16748292374909030043.prop.
Detected timeout of ITS tools.
[2022-06-09 08:50:49] [INFO ] Flatten gal took : 1035 ms
[2022-06-09 08:50:49] [INFO ] Time to serialize gal into /tmp/UpperBounds6299487262377636224.gal : 104 ms
[2022-06-09 08:50:49] [INFO ] Time to serialize properties into /tmp/UpperBounds14961474558101251305.prop : 2 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/UpperBounds6299487262377636224.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14961474558101251305.prop' '--nowitness' '--gen-order' 'FOLLOW'

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...296
Loading property file /tmp/UpperBounds14961474558101251305.prop.
Detected timeout of ITS tools.
[2022-06-09 09:11:13] [INFO ] Flatten gal took : 723 ms
[2022-06-09 09:11:16] [INFO ] Input system was already deterministic with 3871 transitions.
[2022-06-09 09:11:16] [INFO ] Transformed 269 places.
[2022-06-09 09:11:16] [INFO ] Transformed 3871 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 09:11:16] [INFO ] Time to serialize gal into /tmp/UpperBounds14412317870330746307.gal : 15 ms
[2022-06-09 09:11:16] [INFO ] Time to serialize properties into /tmp/UpperBounds3806933464802632873.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/UpperBounds14412317870330746307.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3806933464802632873.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

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...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds3806933464802632873.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="BugTracking-PT-q8m032"
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 BugTracking-PT-q8m032, 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-165472281800101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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