About the Execution of GreatSPN+red for FireWire-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 602.247 | 19606.00 | 31381.00 | 80.40 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
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.r549-tall-171734898100237.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 FireWire-PT-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898100237
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 100K Jun 2 16:33 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 FireWire-PT-09-UpperBounds-00
FORMULA_NAME FireWire-PT-09-UpperBounds-01
FORMULA_NAME FireWire-PT-09-UpperBounds-02
FORMULA_NAME FireWire-PT-09-UpperBounds-03
FORMULA_NAME FireWire-PT-09-UpperBounds-04
FORMULA_NAME FireWire-PT-09-UpperBounds-05
FORMULA_NAME FireWire-PT-09-UpperBounds-06
FORMULA_NAME FireWire-PT-09-UpperBounds-07
FORMULA_NAME FireWire-PT-09-UpperBounds-08
FORMULA_NAME FireWire-PT-09-UpperBounds-09
FORMULA_NAME FireWire-PT-09-UpperBounds-10
FORMULA_NAME FireWire-PT-09-UpperBounds-11
FORMULA_NAME FireWire-PT-09-UpperBounds-12
FORMULA_NAME FireWire-PT-09-UpperBounds-13
FORMULA_NAME FireWire-PT-09-UpperBounds-14
FORMULA_NAME FireWire-PT-09-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717366926142
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:22:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 22:22:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:22:07] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-06-02 22:22:07] [INFO ] Transformed 130 places.
[2024-06-02 22:22:07] [INFO ] Transformed 408 transitions.
[2024-06-02 22:22:07] [INFO ] Found NUPN structural information;
[2024-06-02 22:22:07] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 22:22:07] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
// Phase 1: matrix 320 rows 130 cols
[2024-06-02 22:22:07] [INFO ] Computed 8 invariants in 25 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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (552 resets) in 44 ms. (222 steps per ms)
FORMULA FireWire-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90006 steps (1264 resets) in 150 ms. (596 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 22:22:07] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
[2024-06-02 22:22:07] [INFO ] Invariant cache hit.
[2024-06-02 22:22:08] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-06-02 22:22:08] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-06-02 22:22:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 22:22:08] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-06-02 22:22:08] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:22:08] [INFO ] [Nat]Added 45 Read/Feed constraints in 24 ms returned sat
[2024-06-02 22:22:08] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 7 ms to minimize.
[2024-06-02 22:22:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-06-02 22:22:08] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 36 ms.
[2024-06-02 22:22:08] [INFO ] Added : 0 causal constraints over 0 iterations in 73 ms. Result :sat
Minimization took 129 ms.
[2024-06-02 22:22:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:22:08] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-02 22:22:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 22:22:08] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 22:22:08] [INFO ] [Nat]Added 45 Read/Feed constraints in 26 ms returned sat
[2024-06-02 22:22:09] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 37 ms.
[2024-06-02 22:22:09] [INFO ] Added : 2 causal constraints over 2 iterations in 94 ms. Result :sat
Minimization took 121 ms.
[2024-06-02 22:22:09] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:22:09] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-02 22:22:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:22:09] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-02 22:22:09] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-06-02 22:22:09] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 31 ms.
[2024-06-02 22:22:09] [INFO ] Added : 19 causal constraints over 6 iterations in 168 ms. Result :sat
Minimization took 114 ms.
[2024-06-02 22:22:09] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:22:09] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-06-02 22:22:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:22:09] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-02 22:22:09] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-06-02 22:22:09] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 30 ms.
[2024-06-02 22:22:10] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:22:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-06-02 22:22:10] [INFO ] Added : 30 causal constraints over 8 iterations in 303 ms. Result :sat
Minimization took 123 ms.
[2024-06-02 22:22:10] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:22:10] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-02 22:22:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 22:22:10] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 22:22:10] [INFO ] [Nat]Added 45 Read/Feed constraints in 22 ms returned sat
[2024-06-02 22:22:10] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 21 ms.
[2024-06-02 22:22:10] [INFO ] Added : 10 causal constraints over 5 iterations in 111 ms. Result :sat
Minimization took 117 ms.
[2024-06-02 22:22:10] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:22:10] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-02 22:22:11] [INFO ] [Real]Added 45 Read/Feed constraints in 16 ms returned sat
[2024-06-02 22:22:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 22:22:11] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 22:22:11] [INFO ] [Nat]Added 45 Read/Feed constraints in 24 ms returned sat
[2024-06-02 22:22:11] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 39 ms.
[2024-06-02 22:22:11] [INFO ] Added : 17 causal constraints over 5 iterations in 148 ms. Result :sat
Minimization took 124 ms.
[2024-06-02 22:22:11] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:22:11] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 22:22:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 22:22:11] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-02 22:22:11] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-06-02 22:22:11] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-02 22:22:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-06-02 22:22:11] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 22 ms.
[2024-06-02 22:22:11] [INFO ] Added : 12 causal constraints over 5 iterations in 122 ms. Result :sat
Minimization took 117 ms.
[2024-06-02 22:22:12] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:22:12] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-02 22:22:12] [INFO ] [Real]Added 45 Read/Feed constraints in 9 ms returned sat
[2024-06-02 22:22:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 22:22:12] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 22:22:12] [INFO ] [Nat]Added 45 Read/Feed constraints in 19 ms returned sat
[2024-06-02 22:22:12] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 32 ms.
[2024-06-02 22:22:12] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:22:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-06-02 22:22:12] [INFO ] Added : 14 causal constraints over 5 iterations in 198 ms. Result :sat
Minimization took 126 ms.
[2024-06-02 22:22:12] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:12] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-02 22:22:12] [INFO ] [Real]Added 45 Read/Feed constraints in 8 ms returned sat
[2024-06-02 22:22:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:22:12] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-02 22:22:12] [INFO ] [Nat]Added 45 Read/Feed constraints in 13 ms returned sat
[2024-06-02 22:22:12] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:22:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-06-02 22:22:12] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 29 ms.
[2024-06-02 22:22:13] [INFO ] Added : 4 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 352/352 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 349
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 127 transition count 343
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 127 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 127 transition count 341
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 126 transition count 338
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 126 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 125 transition count 336
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 124 transition count 333
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 123 transition count 331
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 122 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 121 transition count 326
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 120 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 119 transition count 321
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 118 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 117 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 116 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 116 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 115 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 115 transition count 312
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 41 place count 112 transition count 318
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 47 place count 112 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 56 place count 112 transition count 303
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 112 transition count 305
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 111 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 62 place count 111 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 110 transition count 300
Applied a total of 63 rules in 167 ms. Remains 110 /130 variables (removed 20) and now considering 300/352 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 110/130 places, 300/352 transitions.
[2024-06-02 22:22:13] [INFO ] Flow matrix only has 271 transitions (discarded 29 similar events)
// Phase 1: matrix 271 rows 110 cols
[2024-06-02 22:22:13] [INFO ] Computed 8 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (58117 resets) in 1220 ms. (819 steps per ms)
BEST_FIRST walk for 4000002 steps (56310 resets) in 1617 ms. (2472 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-02 22:22:16] [INFO ] Flow matrix only has 271 transitions (discarded 29 similar events)
[2024-06-02 22:22:16] [INFO ] Invariant cache hit.
[2024-06-02 22:22:16] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:16] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 22:22:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:16] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 22:22:16] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:22:16] [INFO ] [Nat]Added 40 Read/Feed constraints in 20 ms returned sat
[2024-06-02 22:22:16] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:22:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-06-02 22:22:16] [INFO ] Computed and/alt/rep : 111/399/111 causal constraints (skipped 158 transitions) in 22 ms.
[2024-06-02 22:22:16] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:22:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-06-02 22:22:16] [INFO ] Added : 25 causal constraints over 5 iterations in 185 ms. Result :sat
Minimization took 70 ms.
[2024-06-02 22:22:16] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 22:22:16] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 22:22:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:17] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 22:22:17] [INFO ] [Nat]Added 40 Read/Feed constraints in 14 ms returned sat
[2024-06-02 22:22:17] [INFO ] Computed and/alt/rep : 111/399/111 causal constraints (skipped 158 transitions) in 20 ms.
[2024-06-02 22:22:17] [INFO ] Added : 11 causal constraints over 4 iterations in 82 ms. Result :sat
Minimization took 61 ms.
[2024-06-02 22:22:17] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:17] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 22:22:17] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2024-06-02 22:22:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:17] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 22:22:17] [INFO ] [Nat]Added 40 Read/Feed constraints in 11 ms returned sat
[2024-06-02 22:22:17] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-06-02 22:22:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-06-02 22:22:17] [INFO ] Computed and/alt/rep : 111/399/111 causal constraints (skipped 158 transitions) in 14 ms.
[2024-06-02 22:22:17] [INFO ] Added : 3 causal constraints over 2 iterations in 48 ms. Result :sat
Minimization took 52 ms.
[2024-06-02 22:22:17] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:17] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-02 22:22:17] [INFO ] [Real]Added 40 Read/Feed constraints in 7 ms returned sat
[2024-06-02 22:22:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:17] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 22:22:17] [INFO ] [Nat]Added 40 Read/Feed constraints in 12 ms returned sat
[2024-06-02 22:22:17] [INFO ] Computed and/alt/rep : 111/399/111 causal constraints (skipped 158 transitions) in 16 ms.
[2024-06-02 22:22:17] [INFO ] Added : 11 causal constraints over 3 iterations in 67 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 300/300 transitions.
Applied a total of 0 rules in 6 ms. Remains 110 /110 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 110/110 places, 300/300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 300/300 transitions.
Applied a total of 0 rules in 6 ms. Remains 110 /110 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2024-06-02 22:22:17] [INFO ] Flow matrix only has 271 transitions (discarded 29 similar events)
[2024-06-02 22:22:17] [INFO ] Invariant cache hit.
[2024-06-02 22:22:18] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 22:22:18] [INFO ] Flow matrix only has 271 transitions (discarded 29 similar events)
[2024-06-02 22:22:18] [INFO ] Invariant cache hit.
[2024-06-02 22:22:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:22:18] [INFO ] Implicit Places using invariants and state equation in 169 ms returned [12, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 245 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 108/110 places, 300/300 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 298
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 106 transition count 298
Applied a total of 4 rules in 15 ms. Remains 106 /108 variables (removed 2) and now considering 298/300 (removed 2) transitions.
[2024-06-02 22:22:18] [INFO ] Flow matrix only has 269 transitions (discarded 29 similar events)
// Phase 1: matrix 269 rows 106 cols
[2024-06-02 22:22:18] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 22:22:18] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 22:22:18] [INFO ] Flow matrix only has 269 transitions (discarded 29 similar events)
[2024-06-02 22:22:18] [INFO ] Invariant cache hit.
[2024-06-02 22:22:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:22:18] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 106/110 places, 298/300 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 485 ms. Remains : 106/110 places, 298/300 transitions.
[2024-06-02 22:22:18] [INFO ] Flow matrix only has 269 transitions (discarded 29 similar events)
[2024-06-02 22:22:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (57720 resets) in 1103 ms. (905 steps per ms)
FORMULA FireWire-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (42284 resets) in 1180 ms. (2540 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 22:22:20] [INFO ] Flow matrix only has 269 transitions (discarded 29 similar events)
[2024-06-02 22:22:20] [INFO ] Invariant cache hit.
[2024-06-02 22:22:20] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:20] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 22:22:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:20] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 22:22:20] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:22:20] [INFO ] [Nat]Added 40 Read/Feed constraints in 17 ms returned sat
[2024-06-02 22:22:20] [INFO ] Computed and/alt/rep : 109/393/109 causal constraints (skipped 158 transitions) in 16 ms.
[2024-06-02 22:22:21] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:22:21] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:22:21] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:22:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 195 ms
[2024-06-02 22:22:21] [INFO ] Added : 22 causal constraints over 7 iterations in 319 ms. Result :sat
Minimization took 62 ms.
[2024-06-02 22:22:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:21] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 22:22:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:21] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 22:22:21] [INFO ] [Nat]Added 40 Read/Feed constraints in 17 ms returned sat
[2024-06-02 22:22:21] [INFO ] Computed and/alt/rep : 109/393/109 causal constraints (skipped 158 transitions) in 15 ms.
[2024-06-02 22:22:21] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:22:21] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:22:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2024-06-02 22:22:21] [INFO ] Added : 27 causal constraints over 8 iterations in 279 ms. Result :sat
Minimization took 66 ms.
[2024-06-02 22:22:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:21] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 22:22:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:21] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 22:22:21] [INFO ] [Nat]Added 40 Read/Feed constraints in 26 ms returned sat
[2024-06-02 22:22:22] [INFO ] Computed and/alt/rep : 109/393/109 causal constraints (skipped 158 transitions) in 16 ms.
[2024-06-02 22:22:22] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:22:22] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2024-06-02 22:22:22] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:22:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 232 ms
[2024-06-02 22:22:22] [INFO ] Added : 26 causal constraints over 6 iterations in 352 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA FireWire-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 298/298 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 295
Applied a total of 3 rules in 9 ms. Remains 105 /106 variables (removed 1) and now considering 295/298 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 105/106 places, 295/298 transitions.
[2024-06-02 22:22:22] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
// Phase 1: matrix 266 rows 105 cols
[2024-06-02 22:22:22] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (57768 resets) in 1078 ms. (926 steps per ms)
BEST_FIRST walk for 2000002 steps (28405 resets) in 803 ms. (2487 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 22:22:24] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
[2024-06-02 22:22:24] [INFO ] Invariant cache hit.
[2024-06-02 22:22:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:24] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-02 22:22:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:24] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 22:22:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:22:24] [INFO ] [Nat]Added 40 Read/Feed constraints in 15 ms returned sat
[2024-06-02 22:22:24] [INFO ] Computed and/alt/rep : 118/476/118 causal constraints (skipped 146 transitions) in 15 ms.
[2024-06-02 22:22:24] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:22:24] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:22:24] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:22:24] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:22:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 250 ms
[2024-06-02 22:22:25] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:22:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-06-02 22:22:25] [INFO ] Added : 49 causal constraints over 14 iterations in 542 ms. Result :sat
Minimization took 74 ms.
[2024-06-02 22:22:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:25] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 22:22:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:22:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:25] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 22:22:25] [INFO ] [Nat]Added 40 Read/Feed constraints in 14 ms returned sat
[2024-06-02 22:22:25] [INFO ] Computed and/alt/rep : 118/476/118 causal constraints (skipped 146 transitions) in 15 ms.
[2024-06-02 22:22:25] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:22:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-06-02 22:22:25] [INFO ] Added : 23 causal constraints over 6 iterations in 195 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA FireWire-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 18391 ms.
ITS solved all properties within timeout
BK_STOP 1717366945748
--------------------
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="FireWire-PT-09"
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 FireWire-PT-09, 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 r549-tall-171734898100237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-09.tgz
mv FireWire-PT-09 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 ;