About the Execution of 2022-gold for DBSingleClientW-PT-d1m06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
385.611 | 15966.00 | 32129.00 | 107.90 | 0 0 1 0 0 0 1 0 1 0 0 0 0 0 2 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r127-tall-167814504300032.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is DBSingleClientW-PT-d1m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-tall-167814504300032
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 15:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 15:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 432K Mar 5 18:22 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-d1m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678174512786
Running Version 202205111006
[2023-03-07 07:35:13] [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]
[2023-03-07 07:35:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:35:14] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2023-03-07 07:35:14] [INFO ] Transformed 1440 places.
[2023-03-07 07:35:14] [INFO ] Transformed 672 transitions.
[2023-03-07 07:35:14] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 244 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2023-03-07 07:35:14] [INFO ] Computed 6 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 971 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 930 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 955 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 962 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :1
// Phase 1: matrix 672 rows 347 cols
[2023-03-07 07:35:14] [INFO ] Computed 6 place invariants in 24 ms
[2023-03-07 07:35:14] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-07 07:35:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-07 07:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:14] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-07 07:35:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-07 07:35:15] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-07 07:35:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:15] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2023-03-07 07:35:15] [INFO ] State equation strengthened by 418 read => feed constraints.
[2023-03-07 07:35:15] [INFO ] [Nat]Added 418 Read/Feed constraints in 71 ms returned sat
[2023-03-07 07:35:15] [INFO ] Deduced a trap composed of 108 places in 265 ms of which 4 ms to minimize.
[2023-03-07 07:35:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2023-03-07 07:35:15] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 136 ms.
[2023-03-07 07:35:15] [INFO ] Added : 4 causal constraints over 1 iterations in 214 ms. Result :sat
Minimization took 85 ms.
[2023-03-07 07:35:16] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-07 07:35:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-07 07:35:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:16] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-07 07:35:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-07 07:35:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2023-03-07 07:35:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:16] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-07 07:35:16] [INFO ] [Nat]Added 418 Read/Feed constraints in 78 ms returned sat
[2023-03-07 07:35:16] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 77 ms.
[2023-03-07 07:35:16] [INFO ] Added : 11 causal constraints over 3 iterations in 270 ms. Result :sat
Minimization took 94 ms.
[2023-03-07 07:35:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-07 07:35:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned unsat
[2023-03-07 07:35:17] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-07 07:35:17] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-07 07:35:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:17] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-07 07:35:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-07 07:35:17] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-07 07:35:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:17] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-07 07:35:17] [INFO ] [Nat]Added 418 Read/Feed constraints in 57 ms returned sat
[2023-03-07 07:35:17] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 72 ms.
[2023-03-07 07:35:17] [INFO ] Added : 2 causal constraints over 1 iterations in 158 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : [1257, 7, 1, 8] Max seen :[0, 0, 1, 1]
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 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 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.4 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 326 transition count 585
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 184 place count 230 transition count 328
Iterating global reduction 1 with 96 rules applied. Total rules applied 280 place count 230 transition count 328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 284 place count 230 transition count 324
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 357 place count 157 transition count 251
Iterating global reduction 2 with 73 rules applied. Total rules applied 430 place count 157 transition count 251
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 436 place count 157 transition count 245
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 478 place count 115 transition count 177
Iterating global reduction 3 with 42 rules applied. Total rules applied 520 place count 115 transition count 177
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 543 place count 115 transition count 154
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 555 place count 103 transition count 135
Iterating global reduction 4 with 12 rules applied. Total rules applied 567 place count 103 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 569 place count 103 transition count 133
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 578 place count 94 transition count 124
Iterating global reduction 5 with 9 rules applied. Total rules applied 587 place count 94 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 590 place count 94 transition count 121
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 597 place count 87 transition count 114
Iterating global reduction 6 with 7 rules applied. Total rules applied 604 place count 87 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 607 place count 87 transition count 111
Applied a total of 607 rules in 79 ms. Remains 87 /347 variables (removed 260) and now considering 111/672 (removed 561) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/347 places, 111/672 transitions.
// Phase 1: matrix 111 rows 87 cols
[2023-03-07 07:35:17] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229625 resets, run finished after 840 ms. (steps per millisecond=1190 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 98800 resets, run finished after 450 ms. (steps per millisecond=2222 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 97870 resets, run finished after 391 ms. (steps per millisecond=2557 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98651 resets, run finished after 395 ms. (steps per millisecond=2531 ) properties (out of 3) seen :3
// Phase 1: matrix 111 rows 87 cols
[2023-03-07 07:35:19] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-07 07:35:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:19] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2023-03-07 07:35:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:19] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-07 07:35:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-07 07:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:20] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-07 07:35:20] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-07 07:35:20] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2023-03-07 07:35:20] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 80 transitions) in 9 ms.
[2023-03-07 07:35:20] [INFO ] Added : 10 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 14 ms.
[2023-03-07 07:35:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:35:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:20] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-07 07:35:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-07 07:35:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:20] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-07 07:35:20] [INFO ] [Nat]Added 39 Read/Feed constraints in 4 ms returned sat
[2023-03-07 07:35:20] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 80 transitions) in 6 ms.
[2023-03-07 07:35:20] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [1, 7, 8] Max seen :[1, 0, 2]
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 111/111 transitions.
Graph (complete) has 271 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 85 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 85 transition count 108
Applied a total of 4 rules in 9 ms. Remains 85 /87 variables (removed 2) and now considering 108/111 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/87 places, 108/111 transitions.
// Phase 1: matrix 108 rows 85 cols
[2023-03-07 07:35:20] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229899 resets, run finished after 762 ms. (steps per millisecond=1312 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98710 resets, run finished after 382 ms. (steps per millisecond=2617 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 98950 resets, run finished after 385 ms. (steps per millisecond=2597 ) properties (out of 2) seen :2
// Phase 1: matrix 108 rows 85 cols
[2023-03-07 07:35:21] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:35:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:35:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:21] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-07 07:35:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:35:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:21] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-07 07:35:21] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-07 07:35:21] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-07 07:35:21] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 6 ms.
[2023-03-07 07:35:21] [INFO ] Added : 13 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 22 ms.
[2023-03-07 07:35:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:35:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:22] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-07 07:35:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-07 07:35:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:22] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-07 07:35:22] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2023-03-07 07:35:22] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2023-03-07 07:35:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-07 07:35:22] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 5 ms.
[2023-03-07 07:35:22] [INFO ] Added : 13 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [7, 8] Max seen :[0, 2]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 17 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 108/108 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 85 cols
[2023-03-07 07:35:22] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-07 07:35:22] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 108 rows 85 cols
[2023-03-07 07:35:22] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-07 07:35:22] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-07 07:35:22] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-07 07:35:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 108 rows 85 cols
[2023-03-07 07:35:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:35:22] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 108/108 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-06
// Phase 1: matrix 108 rows 85 cols
[2023-03-07 07:35:22] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 969 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 108 rows 85 cols
[2023-03-07 07:35:22] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-07 07:35:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:35:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:22] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-07 07:35:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:35:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:22] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-07 07:35:22] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-07 07:35:22] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-07 07:35:22] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 7 ms.
[2023-03-07 07:35:22] [INFO ] Added : 13 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 22 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, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 108/108 transitions.
// Phase 1: matrix 108 rows 85 cols
[2023-03-07 07:35:22] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229525 resets, run finished after 766 ms. (steps per millisecond=1305 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98465 resets, run finished after 394 ms. (steps per millisecond=2538 ) properties (out of 1) seen :0
// Phase 1: matrix 108 rows 85 cols
[2023-03-07 07:35:23] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-07 07:35:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-07 07:35:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:35:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:24] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-07 07:35:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-07 07:35:24] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-07 07:35:24] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 7 ms.
[2023-03-07 07:35:24] [INFO ] Added : 13 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 23 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, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 108/108 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 85 cols
[2023-03-07 07:35:24] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-07 07:35:24] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 108 rows 85 cols
[2023-03-07 07:35:24] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:35:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-07 07:35:24] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-07 07:35:24] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 108 rows 85 cols
[2023-03-07 07:35:24] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-07 07:35:24] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 108/108 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-06 in 1858 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-14
// Phase 1: matrix 108 rows 85 cols
[2023-03-07 07:35:24] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 990 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
// Phase 1: matrix 108 rows 85 cols
[2023-03-07 07:35:24] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-07 07:35:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:24] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-07 07:35:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:35:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:24] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-07 07:35:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-07 07:35:24] [INFO ] [Nat]Added 36 Read/Feed constraints in 3 ms returned sat
[2023-03-07 07:35:24] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2023-03-07 07:35:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-07 07:35:24] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 5 ms.
[2023-03-07 07:35:24] [INFO ] Added : 13 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 108/108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 83 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 83 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 83 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 82 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 82 transition count 99
Applied a total of 7 rules in 11 ms. Remains 82 /85 variables (removed 3) and now considering 99/108 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/85 places, 99/108 transitions.
// Phase 1: matrix 99 rows 82 cols
[2023-03-07 07:35:24] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 229378 resets, run finished after 712 ms. (steps per millisecond=1404 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98573 resets, run finished after 341 ms. (steps per millisecond=2932 ) properties (out of 1) seen :2
// Phase 1: matrix 99 rows 82 cols
[2023-03-07 07:35:25] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-07 07:35:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:35:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:25] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-07 07:35:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:35:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:25] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-07 07:35:25] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-07 07:35:25] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2023-03-07 07:35:25] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2023-03-07 07:35:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-07 07:35:25] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 5 ms.
[2023-03-07 07:35:25] [INFO ] Added : 2 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 82 cols
[2023-03-07 07:35:25] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-07 07:35:25] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 99 rows 82 cols
[2023-03-07 07:35:25] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-07 07:35:25] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-07 07:35:26] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-07 07:35:26] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 99 rows 82 cols
[2023-03-07 07:35:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:35:26] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 99/99 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-14 in 1766 ms.
[2023-03-07 07:35:26] [INFO ] Flatten gal took : 37 ms
[2023-03-07 07:35:26] [INFO ] Applying decomposition
[2023-03-07 07:35:26] [INFO ] Flatten gal took : 13 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/graph1931172921609143953.txt' '-o' '/tmp/graph1931172921609143953.bin' '-w' '/tmp/graph1931172921609143953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1931172921609143953.bin' '-l' '-1' '-v' '-w' '/tmp/graph1931172921609143953.weights' '-q' '0' '-e' '0.001'
[2023-03-07 07:35:26] [INFO ] Decomposing Gal with order
[2023-03-07 07:35:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 07:35:26] [INFO ] Removed a total of 105 redundant transitions.
[2023-03-07 07:35:26] [INFO ] Flatten gal took : 43 ms
[2023-03-07 07:35:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 10 ms.
[2023-03-07 07:35:26] [INFO ] Time to serialize gal into /tmp/UpperBounds12127828389166844636.gal : 5 ms
[2023-03-07 07:35:26] [INFO ] Time to serialize properties into /tmp/UpperBounds15583081570603398009.prop : 1 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/UpperBounds12127828389166844636.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15583081570603398009.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/UpperBounds15583081570603398009.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,478508,2.04316,56772,1413,534,48711,6007,370,400671,111,48642,0
Total reachable state count : 478508
Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m06-UpperBounds-06 :0 <= i2.u6.s9 <= 1
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-06 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-d1m06-UpperBounds-06,0,2.13004,56772,1,0,48711,6007,459,400671,132,48642,1364
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property DBSingleClientW-PT-d1m06-UpperBounds-14 :0 <= i1.u0.l618 <= 2
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-14 2 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-d1m06-UpperBounds-14,0,2.13273,56772,1,0,48711,6007,484,400671,138,48642,1421
Total runtime 14750 ms.
BK_STOP 1678174528752
--------------------
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="DBSingleClientW-PT-d1m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is DBSingleClientW-PT-d1m06, 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 r127-tall-167814504300032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m06.tgz
mv DBSingleClientW-PT-d1m06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;