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.r299-tall-167873952800317.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 smartxred
Input is PhilosophersDyn-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873952800317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 10K Feb 26 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 12:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 12:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 87K Mar 5 18:23 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 PhilosophersDyn-PT-03-UpperBounds-00
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-01
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-02
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-03
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-04
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-05
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-06
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-07
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-08
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-09
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-10
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-11
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-12
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-13
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-14
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679480122729

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-03
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 10:15:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 10:15:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 10:15:25] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-22 10:15:25] [INFO ] Transformed 30 places.
[2023-03-22 10:15:25] [INFO ] Transformed 84 transitions.
[2023-03-22 10:15:25] [INFO ] Parsed PT model containing 30 places and 84 transitions and 564 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Normalized transition count is 57 out of 81 initially.
// Phase 1: matrix 57 rows 30 cols
[2023-03-22 10:15:25] [INFO ] Computed 11 place invariants in 7 ms
FORMULA PhilosophersDyn-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1439 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :24
FORMULA PhilosophersDyn-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 10001 steps, including 354 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 10001 steps, including 315 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :6
[2023-03-22 10:15:26] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2023-03-22 10:15:26] [INFO ] Computed 11 place invariants in 12 ms
[2023-03-22 10:15:26] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-22 10:15:26] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2023-03-22 10:15:26] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-22 10:15:26] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 10:15:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:26] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 10:15:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:15:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 10:15:26] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 10:15:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:26] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-22 10:15:26] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 10:15:26] [INFO ] [Nat]Added 36 Read/Feed constraints in 10 ms returned sat
[2023-03-22 10:15:26] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 10 ms.
[2023-03-22 10:15:26] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Minimization took 11 ms.
[2023-03-22 10:15:26] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 10:15:26] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 10:15:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:26] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 10:15:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:15:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 10:15:26] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 10:15:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:26] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-22 10:15:26] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2023-03-22 10:15:26] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 9 ms.
[2023-03-22 10:15:26] [INFO ] Added : 5 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [3, 3, -1] Max seen :[3, 2, 1]
FORMULA PhilosophersDyn-PT-03-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 81/81 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 79
Applied a total of 4 rules in 20 ms. Remains 28 /30 variables (removed 2) and now considering 79/81 (removed 2) transitions.
[2023-03-22 10:15:26] [INFO ] Flow matrix only has 55 transitions (discarded 24 similar events)
// Phase 1: matrix 55 rows 28 cols
[2023-03-22 10:15:26] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-22 10:15:26] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 30 transitions.
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 28/30 places, 49/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 28/30 places, 49/81 transitions.
// Phase 1: matrix 49 rows 28 cols
[2023-03-22 10:15:26] [INFO ] Computed 11 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 142846 resets, run finished after 1306 ms. (steps per millisecond=765 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 42790 resets, run finished after 507 ms. (steps per millisecond=1972 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 30720 resets, run finished after 478 ms. (steps per millisecond=2092 ) properties (out of 2) seen :3
[2023-03-22 10:15:28] [INFO ] Invariant cache hit.
[2023-03-22 10:15:29] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-22 10:15:29] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-22 10:15:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:29] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 10:15:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:15:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-22 10:15:29] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-22 10:15:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:29] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-22 10:15:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:15:29] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-22 10:15:29] [INFO ] Computed and/alt/rep : 13/103/13 causal constraints (skipped 33 transitions) in 4 ms.
[2023-03-22 10:15:29] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 4 ms to minimize.
[2023-03-22 10:15:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-22 10:15:29] [INFO ] Added : 5 causal constraints over 2 iterations in 51 ms. Result :sat
Minimization took 13 ms.
[2023-03-22 10:15:29] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-22 10:15:29] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 10:15:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:29] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 10:15:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:15:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-22 10:15:29] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 0 ms returned sat
[2023-03-22 10:15:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:29] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-22 10:15:29] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-22 10:15:29] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2023-03-22 10:15:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-22 10:15:29] [INFO ] Computed and/alt/rep : 13/103/13 causal constraints (skipped 33 transitions) in 4 ms.
[2023-03-22 10:15:29] [INFO ] Added : 5 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [3, -1] Max seen :[2, 1]
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 49/49 transitions.
Applied a total of 0 rules in 5 ms. Remains 28 /28 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 28/28 places, 49/49 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 49/49 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2023-03-22 10:15:29] [INFO ] Invariant cache hit.
[2023-03-22 10:15:29] [INFO ] Implicit Places using invariants in 40 ms returned [19, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/28 places, 49/49 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 24 transition count 47
Applied a total of 4 rules in 9 ms. Remains 24 /26 variables (removed 2) and now considering 47/49 (removed 2) transitions.
// Phase 1: matrix 47 rows 24 cols
[2023-03-22 10:15:29] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-22 10:15:29] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-22 10:15:29] [INFO ] Invariant cache hit.
[2023-03-22 10:15:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:15:29] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 24/28 places, 47/49 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 159 ms. Remains : 24/28 places, 47/49 transitions.
[2023-03-22 10:15:29] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 176548 resets, run finished after 1208 ms. (steps per millisecond=827 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 58811 resets, run finished after 362 ms. (steps per millisecond=2762 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 41834 resets, run finished after 400 ms. (steps per millisecond=2500 ) properties (out of 2) seen :3
[2023-03-22 10:15:31] [INFO ] Invariant cache hit.
[2023-03-22 10:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 10:15:31] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-22 10:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:31] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 10:15:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:15:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 10:15:31] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 10:15:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:31] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 10:15:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:15:31] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-22 10:15:31] [INFO ] Computed and/alt/rep : 11/87/11 causal constraints (skipped 33 transitions) in 4 ms.
[2023-03-22 10:15:31] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2023-03-22 10:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 10:15:31] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 10:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:31] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 10:15:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:15:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 10:15:31] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 10:15:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:31] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 10:15:31] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2023-03-22 10:15:31] [INFO ] Computed and/alt/rep : 11/87/11 causal constraints (skipped 33 transitions) in 4 ms.
[2023-03-22 10:15:31] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [3, -1] Max seen :[2, 1]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 24/24 places, 47/47 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-22 10:15:31] [INFO ] Invariant cache hit.
[2023-03-22 10:15:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 10:15:31] [INFO ] Invariant cache hit.
[2023-03-22 10:15:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:15:31] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-22 10:15:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 10:15:31] [INFO ] Invariant cache hit.
[2023-03-22 10:15:31] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 24/24 places, 47/47 transitions.
Starting property specific reduction for PhilosophersDyn-PT-03-UpperBounds-04
[2023-03-22 10:15:31] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1761 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 586 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
[2023-03-22 10:15:31] [INFO ] Invariant cache hit.
[2023-03-22 10:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 10:15:31] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 10:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:31] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 10:15:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:15:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 10:15:31] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-22 10:15:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:31] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 10:15:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:15:31] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2023-03-22 10:15:31] [INFO ] Computed and/alt/rep : 11/87/11 causal constraints (skipped 33 transitions) in 3 ms.
[2023-03-22 10:15:31] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 47/47 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 23 transition count 46
Applied a total of 2 rules in 6 ms. Remains 23 /24 variables (removed 1) and now considering 46/47 (removed 1) transitions.
// Phase 1: matrix 46 rows 23 cols
[2023-03-22 10:15:31] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-22 10:15:31] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 23/24 places, 46/47 transitions.
[2023-03-22 10:15:31] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 178706 resets, run finished after 1177 ms. (steps per millisecond=849 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 58812 resets, run finished after 360 ms. (steps per millisecond=2777 ) properties (out of 1) seen :2
[2023-03-22 10:15:33] [INFO ] Invariant cache hit.
[2023-03-22 10:15:33] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-22 10:15:33] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-22 10:15:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:33] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 10:15:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:15:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 10:15:33] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-22 10:15:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:33] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-22 10:15:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:15:33] [INFO ] [Nat]Added 30 Read/Feed constraints in 6 ms returned sat
[2023-03-22 10:15:33] [INFO ] Computed and/alt/rep : 10/77/10 causal constraints (skipped 33 transitions) in 4 ms.
[2023-03-22 10:15:33] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2023-03-22 10:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-22 10:15:33] [INFO ] Added : 3 causal constraints over 2 iterations in 56 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 46/46 transitions.
Applied a total of 0 rules in 4 ms. Remains 23 /23 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 23/23 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-22 10:15:33] [INFO ] Invariant cache hit.
[2023-03-22 10:15:33] [INFO ] Implicit Places using invariants in 39 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 22/23 places, 46/46 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 21 transition count 45
Applied a total of 2 rules in 5 ms. Remains 21 /22 variables (removed 1) and now considering 45/46 (removed 1) transitions.
// Phase 1: matrix 45 rows 21 cols
[2023-03-22 10:15:33] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-22 10:15:33] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-22 10:15:33] [INFO ] Invariant cache hit.
[2023-03-22 10:15:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:15:33] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 21/23 places, 45/46 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 141 ms. Remains : 21/23 places, 45/46 transitions.
[2023-03-22 10:15:33] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 203185 resets, run finished after 1128 ms. (steps per millisecond=886 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 66666 resets, run finished after 358 ms. (steps per millisecond=2793 ) properties (out of 1) seen :2
[2023-03-22 10:15:35] [INFO ] Invariant cache hit.
[2023-03-22 10:15:35] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 10:15:35] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-22 10:15:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:35] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 10:15:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:15:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 10:15:35] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 10:15:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:35] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-22 10:15:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:15:35] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-22 10:15:35] [INFO ] Computed and/alt/rep : 9/69/9 causal constraints (skipped 33 transitions) in 4 ms.
[2023-03-22 10:15:35] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 21/21 places, 45/45 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-22 10:15:35] [INFO ] Invariant cache hit.
[2023-03-22 10:15:35] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-22 10:15:35] [INFO ] Invariant cache hit.
[2023-03-22 10:15:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:15:35] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-22 10:15:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 10:15:35] [INFO ] Invariant cache hit.
[2023-03-22 10:15:35] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 21/21 places, 45/45 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-04 in 3834 ms.
Starting property specific reduction for PhilosophersDyn-PT-03-UpperBounds-11
// Phase 1: matrix 47 rows 24 cols
[2023-03-22 10:15:35] [INFO ] Computed 9 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1760 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 413 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2023-03-22 10:15:35] [INFO ] Invariant cache hit.
[2023-03-22 10:15:35] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 10:15:35] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 10:15:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:35] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 10:15:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:15:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 10:15:35] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-22 10:15:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:35] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 10:15:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:15:35] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2023-03-22 10:15:35] [INFO ] Computed and/alt/rep : 11/87/11 causal constraints (skipped 33 transitions) in 3 ms.
[2023-03-22 10:15:35] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-22 10:15:35] [INFO ] Invariant cache hit.
[2023-03-22 10:15:35] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 24/24 places, 47/47 transitions.
[2023-03-22 10:15:35] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 176325 resets, run finished after 1146 ms. (steps per millisecond=872 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 41808 resets, run finished after 373 ms. (steps per millisecond=2680 ) properties (out of 1) seen :1
[2023-03-22 10:15:37] [INFO ] Invariant cache hit.
[2023-03-22 10:15:37] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 10:15:37] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-22 10:15:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:37] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 10:15:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:15:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 10:15:37] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 10:15:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:15:37] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-22 10:15:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:15:37] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2023-03-22 10:15:37] [INFO ] Computed and/alt/rep : 11/87/11 causal constraints (skipped 33 transitions) in 7 ms.
[2023-03-22 10:15:37] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 24/24 places, 47/47 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-22 10:15:37] [INFO ] Invariant cache hit.
[2023-03-22 10:15:37] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-22 10:15:37] [INFO ] Invariant cache hit.
[2023-03-22 10:15:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:15:37] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-22 10:15:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 10:15:37] [INFO ] Invariant cache hit.
[2023-03-22 10:15:37] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 24/24 places, 47/47 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-11 in 1993 ms.
[2023-03-22 10:15:37] [INFO ] Flatten gal took : 29 ms
[2023-03-22 10:15:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-22 10:15:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 47 transitions and 309 arcs took 1 ms.
Total runtime 12031 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PhilosophersDyn (PT), instance 03
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 24 places, 47 transitions, 309 arcs.
Final Score: 438.567
Took : 2 seconds
Bounds file is: UpperBounds.xml
FORMULA PhilosophersDyn-PT-03-UpperBounds-04 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA PhilosophersDyn-PT-03-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679480143366

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="PhilosophersDyn-PT-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is PhilosophersDyn-PT-03, 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 r299-tall-167873952800317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;