About the Execution of GreatSPN+red for DoubleExponent-PT-100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9322.136 | 3600000.00 | 3682861.00 | 8906.30 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131400573.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DoubleExponent-PT-100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131400573
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:42 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 DoubleExponent-PT-100-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716384849138
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 13:34:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 13:34:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:34:10] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2024-05-22 13:34:10] [INFO ] Transformed 5304 places.
[2024-05-22 13:34:10] [INFO ] Transformed 4998 transitions.
[2024-05-22 13:34:10] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 345 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 4998 rows 5304 cols
[2024-05-22 13:34:11] [INFO ] Invariants computation overflowed in 266 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (336 resets) in 55 ms. (178 steps per ms)
BEST_FIRST walk for 160001 steps (4516 resets) in 482 ms. (331 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 4998 rows 5304 cols
[2024-05-22 13:34:12] [INFO ] Invariants computation overflowed in 155 ms
[2024-05-22 13:34:17] [INFO ] [Real]Absence check using state equation in 4375 ms returned unknown
[2024-05-22 13:34:22] [INFO ] [Real]Absence check using state equation in 4524 ms returned unknown
[2024-05-22 13:34:27] [INFO ] [Real]Absence check using state equation in 4474 ms returned unknown
[2024-05-22 13:34:32] [INFO ] [Real]Absence check using state equation in 4554 ms returned unknown
[2024-05-22 13:34:37] [INFO ] [Real]Absence check using state equation in 4569 ms returned unknown
[2024-05-22 13:34:40] [INFO ] [Real]Absence check using state equation in 2114 ms returned sat
[2024-05-22 13:34:41] [INFO ] Computed and/alt/rep : 4997/9693/4997 causal constraints (skipped 0 transitions) in 313 ms.
[2024-05-22 13:34:42] [INFO ] Added : 5 causal constraints over 1 iterations in 1574 ms. Result :unknown
[2024-05-22 13:34:47] [INFO ] [Real]Absence check using state equation in 4496 ms returned unknown
[2024-05-22 13:34:52] [INFO ] [Real]Absence check using state equation in 4494 ms returned unknown
[2024-05-22 13:34:57] [INFO ] [Real]Absence check using state equation in 4493 ms returned unknown
[2024-05-22 13:35:02] [INFO ] [Real]Absence check using state equation in 4473 ms returned unknown
[2024-05-22 13:35:07] [INFO ] [Real]Absence check using state equation in 4574 ms returned unknown
[2024-05-22 13:35:12] [INFO ] [Real]Absence check using state equation in 4468 ms returned unknown
[2024-05-22 13:35:17] [INFO ] [Real]Absence check using state equation in 4441 ms returned unknown
[2024-05-22 13:35:22] [INFO ] [Real]Absence check using state equation in 4499 ms returned unknown
[2024-05-22 13:35:26] [INFO ] [Real]Absence check using state equation in 2957 ms returned sat
[2024-05-22 13:35:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:35:31] [INFO ] [Nat]Absence check using state equation in 4493 ms returned unknown
[2024-05-22 13:35:33] [INFO ] [Real]Absence check using state equation in 1574 ms returned sat
[2024-05-22 13:35:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:35:35] [INFO ] [Nat]Absence check using state equation in 1579 ms returned sat
[2024-05-22 13:35:35] [INFO ] Computed and/alt/rep : 4997/9693/4997 causal constraints (skipped 0 transitions) in 268 ms.
[2024-05-22 13:35:37] [INFO ] Added : 5 causal constraints over 1 iterations in 1515 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 16 out of 5304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Graph (complete) has 9096 edges and 5304 vertex of which 5298 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.15 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1180 transitions
Trivial Post-agglo rules discarded 1180 transitions
Performed 1180 trivial Post agglomeration. Transition count delta: 1180
Iterating post reduction 0 with 1183 rules applied. Total rules applied 1184 place count 5297 transition count 3816
Reduce places removed 1180 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 1190 rules applied. Total rules applied 2374 place count 4117 transition count 3806
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 2384 place count 4107 transition count 3806
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2384 place count 4107 transition count 3605
Deduced a syphon composed of 201 places in 185 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2786 place count 3906 transition count 3605
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 99 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 4588 place count 3005 transition count 2704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 52 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4790 place count 2904 transition count 2704
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 92 places in 51 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 4974 place count 2812 transition count 2704
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4975 place count 2812 transition count 2703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4976 place count 2811 transition count 2703
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 4 with 400 rules applied. Total rules applied 5376 place count 2811 transition count 2303
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 4 with 400 rules applied. Total rules applied 5776 place count 2411 transition count 2303
Partial Free-agglomeration rule applied 398 times.
Drop transitions (Partial Free agglomeration) removed 398 transitions
Iterating global reduction 5 with 398 rules applied. Total rules applied 6174 place count 2411 transition count 2303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6175 place count 2410 transition count 2302
Applied a total of 6175 rules in 2525 ms. Remains 2410 /5304 variables (removed 2894) and now considering 2302/4998 (removed 2696) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2536 ms. Remains : 2410/5304 places, 2302/4998 transitions.
Found an invariant !
This invariant on transitions {282=1, 393=1, 416=1, 704=1, 725=1, 1054=1, 1484=1, 2002=1, 2180=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {282=1, 393=1, 416=1, 704=1, 725=1, 1054=1, 1484=1, 2002=1, 2180=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1291 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2302 rows 2410 cols
[2024-05-22 13:45:50] [INFO ] Invariants computation overflowed in 50 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (128305 resets) in 1937 ms. (515 steps per ms)
BEST_FIRST walk for 16000004 steps (1355654 resets) in 17676 ms. (905 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2302 rows 2410 cols
[2024-05-22 13:46:10] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-22 13:46:55] [INFO ] [Real]Absence check using state equation in 44806 ms returned unknown
[2024-05-22 13:47:02] [INFO ] [Real]Absence check using state equation in 7311 ms returned sat
[2024-05-22 13:47:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:47:10] [INFO ] [Nat]Absence check using state equation in 7447 ms returned sat
[2024-05-22 13:47:10] [INFO ] State equation strengthened by 396 read => feed constraints.
[2024-05-22 13:47:14] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 13:47:19] [INFO ] [Nat]Added 396 Read/Feed constraints in 9086 ms returned unknown
[2024-05-22 13:48:04] [INFO ] [Real]Absence check using state equation in 44797 ms returned unknown
[2024-05-22 13:48:22] [INFO ] [Real]Absence check using state equation in 17735 ms returned sat
[2024-05-22 13:48:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:48:40] [INFO ] [Nat]Absence check using state equation in 17844 ms returned sat
[2024-05-22 13:48:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 13:48:49] [INFO ] [Nat]Added 396 Read/Feed constraints in 9196 ms returned unknown
[2024-05-22 13:48:51] [INFO ] [Real]Absence check using state equation in 1775 ms returned sat
[2024-05-22 13:48:56] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 13:49:00] [INFO ] [Real]Added 396 Read/Feed constraints in 9044 ms returned unknown
[2024-05-22 13:49:45] [INFO ] [Real]Absence check using state equation in 43967 ms returned sat
[2024-05-22 13:49:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 13:49:45] [INFO ] [Real]Added 396 Read/Feed constraints in 779 ms returned unknown
[2024-05-22 13:49:50] [INFO ] [Real]Absence check using state equation in 3913 ms returned sat
[2024-05-22 13:49:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 13:49:59] [INFO ] [Real]Added 396 Read/Feed constraints in 9268 ms returned unknown
[2024-05-22 13:50:22] [INFO ] [Real]Absence check using state equation in 22790 ms returned sat
[2024-05-22 13:50:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:50:45] [INFO ] [Nat]Absence check using state equation in 22768 ms returned sat
[2024-05-22 13:50:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 13:50:54] [INFO ] [Nat]Added 396 Read/Feed constraints in 9118 ms returned unknown
[2024-05-22 13:50:58] [INFO ] [Real]Absence check using state equation in 3775 ms returned sat
[2024-05-22 13:51:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 13:51:08] [INFO ] [Real]Added 396 Read/Feed constraints in 10037 ms returned unknown
[2024-05-22 13:51:14] [INFO ] [Real]Absence check using state equation in 5371 ms returned sat
[2024-05-22 13:51:15] [INFO ] [Real]Added 396 Read/Feed constraints in 1360 ms returned sat
[2024-05-22 13:51:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:51:20] [INFO ] [Nat]Absence check using state equation in 4303 ms returned sat
[2024-05-22 13:51:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 13:51:26] [INFO ] [Nat]Added 396 Read/Feed constraints in 6291 ms returned sat
[2024-05-22 13:51:26] [INFO ] Computed and/alt/rep : 1830/11377/1830 causal constraints (skipped 471 transitions) in 259 ms.
[2024-05-22 13:51:37] [INFO ] Deduced a trap composed of 571 places in 2958 ms of which 131 ms to minimize.
[2024-05-22 13:51:40] [INFO ] Deduced a trap composed of 614 places in 2757 ms of which 19 ms to minimize.
[2024-05-22 13:51:45] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 10453 ms
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-22 13:52:02] [INFO ] [Real]Absence check using state equation in 1250 ms returned sat
[2024-05-22 13:52:06] [INFO ] [Real]Added 396 Read/Feed constraints in 4431 ms returned sat
[2024-05-22 13:52:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:52:08] [INFO ] [Nat]Absence check using state equation in 1434 ms returned sat
[2024-05-22 13:52:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 13:52:17] [INFO ] [Nat]Added 396 Read/Feed constraints in 9069 ms returned unknown
[2024-05-22 13:52:27] [INFO ] [Real]Absence check using state equation in 9741 ms returned sat
[2024-05-22 13:52:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:52:37] [INFO ] [Nat]Absence check using state equation in 9881 ms returned sat
[2024-05-22 13:52:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 13:52:46] [INFO ] [Nat]Added 396 Read/Feed constraints in 9168 ms returned unknown
[2024-05-22 13:52:49] [INFO ] [Real]Absence check using state equation in 2087 ms returned sat
[2024-05-22 13:52:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 13:52:58] [INFO ] [Real]Added 396 Read/Feed constraints in 9153 ms returned unknown
[2024-05-22 13:53:05] [INFO ] [Real]Absence check using state equation in 6786 ms returned sat
[2024-05-22 13:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:53:50] [INFO ] [Nat]Absence check using state equation in 44824 ms returned unknown
[2024-05-22 13:53:59] [INFO ] [Real]Absence check using state equation in 8628 ms returned sat
[2024-05-22 13:53:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:54:13] [INFO ] [Nat]Absence check using state equation in 13510 ms returned sat
[2024-05-22 13:54:18] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 13:54:22] [INFO ] [Nat]Added 396 Read/Feed constraints in 9795 ms returned unknown
[2024-05-22 13:54:41] [INFO ] [Real]Absence check using state equation in 18126 ms returned sat
[2024-05-22 13:54:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 13:54:52] [INFO ] [Real]Added 396 Read/Feed constraints in 11020 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 16 out of 2410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2410/2410 places, 2302/2302 transitions.
Applied a total of 0 rules in 135 ms. Remains 2410 /2410 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 2410/2410 places, 2302/2302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2410/2410 places, 2302/2302 transitions.
Applied a total of 0 rules in 131 ms. Remains 2410 /2410 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
// Phase 1: matrix 2302 rows 2410 cols
[2024-05-22 13:55:52] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 13:56:02] [INFO ] Implicit Places using invariants in 9853 ms returned []
// Phase 1: matrix 2302 rows 2410 cols
[2024-05-22 13:56:02] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-22 13:56:03] [INFO ] State equation strengthened by 396 read => feed constraints.
[2024-05-22 13:56:34] [INFO ] Performed 30/2410 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2024-05-22 13:57:06] [INFO ] Performed 134/2410 implicitness test of which 10 returned IMPLICIT in 62 seconds.
[2024-05-22 13:57:37] [INFO ] Performed 241/2410 implicitness test of which 19 returned IMPLICIT in 93 seconds.
[2024-05-22 13:58:10] [INFO ] Performed 323/2410 implicitness test of which 26 returned IMPLICIT in 127 seconds.
[2024-05-22 13:58:41] [INFO ] Performed 460/2410 implicitness test of which 37 returned IMPLICIT in 157 seconds.
[2024-05-22 13:58:42] [INFO ] Implicit Places using invariants and state equation in 160090 ms returned [19, 25, 47, 54, 77, 82, 102, 108, 129, 134, 156, 162, 182, 184, 188, 209, 215, 236, 241, 245, 262, 268, 288, 294, 317, 323, 345, 350, 370, 375, 396, 401, 422, 428, 448, 451, 454, 474]
[2024-05-22 13:58:42] [INFO ] Actually due to overlaps returned [245, 184]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 169962 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2408/2410 places, 2302/2302 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2408 transition count 2301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2407 transition count 2301
Applied a total of 2 rules in 262 ms. Remains 2407 /2408 variables (removed 1) and now considering 2301/2302 (removed 1) transitions.
// Phase 1: matrix 2301 rows 2407 cols
[2024-05-22 13:58:42] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-22 13:58:52] [INFO ] Implicit Places using invariants in 9676 ms returned []
// Phase 1: matrix 2301 rows 2407 cols
[2024-05-22 13:58:52] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 13:58:53] [INFO ] State equation strengthened by 396 read => feed constraints.
[2024-05-22 13:59:27] [INFO ] Performed 4/2407 implicitness test of which 0 returned IMPLICIT in 33 seconds.
[2024-05-22 13:59:57] [INFO ] Performed 61/2407 implicitness test of which 4 returned IMPLICIT in 63 seconds.
[2024-05-22 14:00:27] [INFO ] Performed 166/2407 implicitness test of which 12 returned IMPLICIT in 93 seconds.
[2024-05-22 14:00:58] [INFO ] Performed 187/2407 implicitness test of which 14 returned IMPLICIT in 124 seconds.
[2024-05-22 14:01:32] [INFO ] Performed 291/2407 implicitness test of which 22 returned IMPLICIT in 158 seconds.
[2024-05-22 14:01:32] [INFO ] Implicit Places using invariants and state equation in 160078 ms returned [19, 25, 47, 54, 77, 82, 102, 108, 129, 134, 156, 162, 182, 187, 208, 214, 235, 240, 259, 265, 285, 291]
[2024-05-22 14:01:32] [INFO ] Actually due to overlaps returned [25, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 169765 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2405/2410 places, 2301/2302 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2405 transition count 2300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2404 transition count 2300
Applied a total of 2 rules in 266 ms. Remains 2404 /2405 variables (removed 1) and now considering 2300/2301 (removed 1) transitions.
// Phase 1: matrix 2300 rows 2404 cols
[2024-05-22 14:01:32] [INFO ] Invariants computation overflowed in 61 ms
[2024-05-22 14:01:42] [INFO ] Implicit Places using invariants in 9503 ms returned []
// Phase 1: matrix 2300 rows 2404 cols
[2024-05-22 14:01:42] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-22 14:01:43] [INFO ] State equation strengthened by 396 read => feed constraints.
[2024-05-22 14:02:14] [INFO ] Performed 51/2404 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2024-05-22 14:02:50] [INFO ] Performed 172/2404 implicitness test of which 10 returned IMPLICIT in 66 seconds.
[2024-05-22 14:03:25] [INFO ] Performed 283/2404 implicitness test of which 19 returned IMPLICIT in 101 seconds.
[2024-05-22 14:03:57] [INFO ] Performed 364/2404 implicitness test of which 25 returned IMPLICIT in 133 seconds.
[2024-05-22 14:04:22] [INFO ] Implicit Places with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... after 160088 ms
[2024-05-22 14:04:22] [INFO ] Actually due to overlaps returned [51, 44, 445]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 169605 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2401/2410 places, 2300/2302 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2401 transition count 2299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2400 transition count 2299
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 2400 transition count 2299
Applied a total of 3 rules in 387 ms. Remains 2400 /2401 variables (removed 1) and now considering 2299/2300 (removed 1) transitions.
// Phase 1: matrix 2299 rows 2400 cols
[2024-05-22 14:04:22] [INFO ] Invariants computation overflowed in 56 ms
[2024-05-22 14:04:32] [INFO ] Implicit Places using invariants in 9718 ms returned []
// Phase 1: matrix 2299 rows 2400 cols
[2024-05-22 14:04:32] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-22 14:04:33] [INFO ] State equation strengthened by 396 read => feed constraints.
[2024-05-22 14:05:12] [INFO ] Performed 4/2400 implicitness test of which 0 returned IMPLICIT in 38 seconds.
[2024-05-22 14:05:52] [INFO ] Performed 7/2400 implicitness test of which 0 returned IMPLICIT in 78 seconds.
[2024-05-22 14:06:34] [INFO ] Performed 9/2400 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2024-05-22 14:06:34] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2024-05-22 14:06:34] [INFO ] Implicit Places using invariants and state equation in 122383 ms returned []
Implicit Place search using SMT with State Equation took 132102 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 2400/2410 places, 2299/2302 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 642487 ms. Remains : 2400/2410 places, 2299/2302 transitions.
Found an invariant !
This invariant on transitions {280=1, 391=1, 414=1, 694=1, 715=1, 1044=1, 1474=1, 1992=1, 2170=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {280=1, 391=1, 414=1, 694=1, 715=1, 1044=1, 1474=1, 1992=1, 2170=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1304 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2299 rows 2400 cols
[2024-05-22 14:16:43] [INFO ] Invariants computation overflowed in 48 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (128167 resets) in 1559 ms. (641 steps per ms)
BEST_FIRST walk for 16000006 steps (1355304 resets) in 17162 ms. (932 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2299 rows 2400 cols
[2024-05-22 14:17:01] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-22 14:17:05] [INFO ] [Real]Absence check using state equation in 3814 ms returned sat
[2024-05-22 14:17:05] [INFO ] State equation strengthened by 396 read => feed constraints.
[2024-05-22 14:17:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 14:17:15] [INFO ] [Real]Added 396 Read/Feed constraints in 9031 ms returned unknown
[2024-05-22 14:17:21] [INFO ] [Real]Absence check using state equation in 6194 ms returned sat
[2024-05-22 14:17:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:28] [INFO ] [Nat]Absence check using state equation in 6359 ms returned sat
[2024-05-22 14:17:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 14:17:37] [INFO ] [Nat]Added 396 Read/Feed constraints in 9056 ms returned unknown
[2024-05-22 14:18:17] [INFO ] [Real]Absence check using state equation in 40574 ms returned sat
[2024-05-22 14:18:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:59] [INFO ] [Nat]Absence check using state equation in 40984 ms returned sat
[2024-05-22 14:19:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 14:19:03] [INFO ] [Nat]Added 396 Read/Feed constraints in 3831 ms returned unknown
[2024-05-22 14:19:14] [INFO ] [Real]Absence check using state equation in 11702 ms returned sat
[2024-05-22 14:19:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 14:19:25] [INFO ] [Real]Added 396 Read/Feed constraints in 10237 ms returned unknown
[2024-05-22 14:20:10] [INFO ] [Real]Absence check using state equation in 44819 ms returned unknown
[2024-05-22 14:20:27] [INFO ] [Real]Absence check using state equation in 17410 ms returned sat
[2024-05-22 14:20:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 14:20:37] [INFO ] [Real]Added 396 Read/Feed constraints in 9561 ms returned unknown
[2024-05-22 14:20:43] [INFO ] [Real]Absence check using state equation in 6007 ms returned sat
[2024-05-22 14:20:48] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 14:20:52] [INFO ] [Real]Added 396 Read/Feed constraints in 9043 ms returned unknown
[2024-05-22 14:21:03] [INFO ] [Real]Absence check using state equation in 10720 ms returned sat
[2024-05-22 14:21:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:21:14] [INFO ] [Nat]Absence check using state equation in 10859 ms returned sat
[2024-05-22 14:21:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 14:21:24] [INFO ] [Nat]Added 396 Read/Feed constraints in 9078 ms returned unknown
[2024-05-22 14:21:27] [INFO ] [Real]Absence check using state equation in 2802 ms returned sat
[2024-05-22 14:21:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 14:21:38] [INFO ] [Real]Added 396 Read/Feed constraints in 11005 ms returned unknown
[2024-05-22 14:21:44] [INFO ] [Real]Absence check using state equation in 6616 ms returned sat
[2024-05-22 14:21:46] [INFO ] [Real]Added 396 Read/Feed constraints in 1702 ms returned sat
[2024-05-22 14:21:47] [INFO ] Computed and/alt/rep : 1827/11394/1827 causal constraints (skipped 471 transitions) in 192 ms.
[2024-05-22 14:21:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:21:49] [INFO ] [Nat]Absence check using state equation in 1439 ms returned sat
[2024-05-22 14:21:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 14:21:55] [INFO ] [Nat]Added 396 Read/Feed constraints in 6816 ms returned sat
[2024-05-22 14:21:56] [INFO ] Computed and/alt/rep : 1827/11394/1827 causal constraints (skipped 471 transitions) in 266 ms.
[2024-05-22 14:22:00] [INFO ] Deduced a trap composed of 8 places in 2738 ms of which 17 ms to minimize.
[2024-05-22 14:22:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2959 ms
[2024-05-22 14:22:00] [INFO ] Added : 41 causal constraints over 9 iterations in 4694 ms. Result :sat
Minimization took 4502 ms.
[2024-05-22 14:22:06] [INFO ] [Real]Absence check using state equation in 1117 ms returned sat
[2024-05-22 14:22:11] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 14:22:12] [INFO ] [Real]Added 396 Read/Feed constraints in 6235 ms returned sat
[2024-05-22 14:22:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:22:14] [INFO ] [Nat]Absence check using state equation in 1543 ms returned sat
[2024-05-22 14:22:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 14:22:24] [INFO ] [Nat]Added 396 Read/Feed constraints in 9677 ms returned unknown
[2024-05-22 14:23:09] [INFO ] [Real]Absence check using state equation in 44799 ms returned unknown
[2024-05-22 14:23:15] [INFO ] [Real]Absence check using state equation in 5740 ms returned sat
[2024-05-22 14:23:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 14:23:24] [INFO ] [Real]Added 396 Read/Feed constraints in 9094 ms returned unknown
[2024-05-22 14:23:48] [INFO ] [Real]Absence check using state equation in 23640 ms returned sat
[2024-05-22 14:23:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 14:23:58] [INFO ] [Real]Added 396 Read/Feed constraints in 9771 ms returned unknown
[2024-05-22 14:24:10] [INFO ] [Real]Absence check using state equation in 12075 ms returned sat
[2024-05-22 14:24:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 14:24:17] [INFO ] [Real]Added 396 Read/Feed constraints in 6572 ms returned sat
[2024-05-22 14:24:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:24:46] [INFO ] [Nat]Absence check using state equation in 28602 ms returned sat
[2024-05-22 14:24:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 14:24:55] [INFO ] [Nat]Added 396 Read/Feed constraints in 9047 ms returned unknown
[2024-05-22 14:25:19] [INFO ] [Real]Absence check using state equation in 24355 ms returned sat
[2024-05-22 14:25:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:26:04] [INFO ] [Nat]Absence check using state equation in 44831 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 16 out of 2400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2299/2299 transitions.
Applied a total of 0 rules in 124 ms. Remains 2400 /2400 variables (removed 0) and now considering 2299/2299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 2400/2400 places, 2299/2299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2299/2299 transitions.
Applied a total of 0 rules in 124 ms. Remains 2400 /2400 variables (removed 0) and now considering 2299/2299 (removed 0) transitions.
// Phase 1: matrix 2299 rows 2400 cols
[2024-05-22 14:27:35] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-22 14:27:44] [INFO ] Implicit Places using invariants in 9354 ms returned []
// Phase 1: matrix 2299 rows 2400 cols
[2024-05-22 14:27:44] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-22 14:27:45] [INFO ] State equation strengthened by 396 read => feed constraints.
[2024-05-22 14:28:23] [INFO ] Performed 4/2400 implicitness test of which 0 returned IMPLICIT in 38 seconds.
[2024-05-22 14:29:04] [INFO ] Performed 7/2400 implicitness test of which 0 returned IMPLICIT in 79 seconds.
[2024-05-22 14:29:49] [INFO ] Performed 9/2400 implicitness test of which 0 returned IMPLICIT in 123 seconds.
[2024-05-22 14:29:49] [INFO ] Timeout of Implicit test with SMT after 123 seconds.
[2024-05-22 14:29:49] [INFO ] Implicit Places using invariants and state equation in 124568 ms returned []
Implicit Place search using SMT with State Equation took 133925 ms to find 0 implicit places.
[2024-05-22 14:29:49] [INFO ] Redundant transitions in 158 ms returned []
Running 2298 sub problems to find dead transitions.
// Phase 1: matrix 2299 rows 2400 cols
[2024-05-22 14:29:49] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 14:29:49] [INFO ] State equation strengthened by 396 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2399/4699 variables, and 0 constraints, problems are : Problem set: 0 solved, 2298 unsolved in 30059 ms.
Refiners :[State Equation: 0/2400 constraints, ReadFeed: 0/396 constraints, PredecessorRefiner: 2298/2298 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2298 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2399/4699 variables, and 0 constraints, problems are : Problem set: 0 solved, 2298 unsolved in 30031 ms.
Refiners :[State Equation: 0/2400 constraints, ReadFeed: 0/396 constraints, PredecessorRefiner: 0/2298 constraints, Known Traps: 0/0 constraints]
After SMT, in 69392ms problems are : Problem set: 0 solved, 2298 unsolved
Search for dead transitions found 0 dead transitions in 69444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203685 ms. Remains : 2400/2400 places, 2299/2299 transitions.
Found an invariant !
This invariant on transitions {280=1, 391=1, 414=1, 694=1, 715=1, 1044=1, 1474=1, 1992=1, 2170=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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="DoubleExponent-PT-100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is DoubleExponent-PT-100, 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 r135-tall-171631131400573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 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 ;