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.r491-tall-167912710500477.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 Szymanski-PT-b08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r491-tall-167912710500477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b08-UpperBounds-00
FORMULA_NAME Szymanski-PT-b08-UpperBounds-01
FORMULA_NAME Szymanski-PT-b08-UpperBounds-02
FORMULA_NAME Szymanski-PT-b08-UpperBounds-03
FORMULA_NAME Szymanski-PT-b08-UpperBounds-04
FORMULA_NAME Szymanski-PT-b08-UpperBounds-05
FORMULA_NAME Szymanski-PT-b08-UpperBounds-06
FORMULA_NAME Szymanski-PT-b08-UpperBounds-07
FORMULA_NAME Szymanski-PT-b08-UpperBounds-08
FORMULA_NAME Szymanski-PT-b08-UpperBounds-09
FORMULA_NAME Szymanski-PT-b08-UpperBounds-10
FORMULA_NAME Szymanski-PT-b08-UpperBounds-11
FORMULA_NAME Szymanski-PT-b08-UpperBounds-12
FORMULA_NAME Szymanski-PT-b08-UpperBounds-13
FORMULA_NAME Szymanski-PT-b08-UpperBounds-14
FORMULA_NAME Szymanski-PT-b08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679258142364

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=Szymanski-PT-b08
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-19 20:35:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 20:35:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 20:35:44] [INFO ] Load time of PNML (sax parser for PT used): 302 ms
[2023-03-19 20:35:44] [INFO ] Transformed 568 places.
[2023-03-19 20:35:44] [INFO ] Transformed 8320 transitions.
[2023-03-19 20:35:44] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 487 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 260 places in 16 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2733 out of 8064 initially.
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 20:35:44] [INFO ] Computed 3 place invariants in 68 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :2
FORMULA Szymanski-PT-b08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-b08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :1
FORMULA Szymanski-PT-b08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :1
FORMULA Szymanski-PT-b08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-19 20:35:45] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 20:35:45] [INFO ] Computed 3 place invariants in 31 ms
[2023-03-19 20:35:45] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-19 20:35:45] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 20:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:35:46] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2023-03-19 20:35:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:35:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:35:46] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:35:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:35:46] [INFO ] [Nat]Absence check using state equation in 629 ms returned sat
[2023-03-19 20:35:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:35:47] [INFO ] [Nat]Added 147 Read/Feed constraints in 908 ms returned sat
[2023-03-19 20:35:48] [INFO ] Deduced a trap composed of 137 places in 703 ms of which 5 ms to minimize.
[2023-03-19 20:35:49] [INFO ] Deduced a trap composed of 79 places in 666 ms of which 1 ms to minimize.
[2023-03-19 20:35:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1599 ms
[2023-03-19 20:35:50] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 641 ms.
[2023-03-19 20:35:50] [INFO ] Added : 0 causal constraints over 0 iterations in 831 ms. Result :sat
Minimization took 730 ms.
[2023-03-19 20:35:51] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:35:51] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 20:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:35:51] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2023-03-19 20:35:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:35:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:35:51] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:35:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:35:52] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2023-03-19 20:35:53] [INFO ] [Nat]Added 147 Read/Feed constraints in 658 ms returned sat
[2023-03-19 20:35:53] [INFO ] Deduced a trap composed of 88 places in 673 ms of which 1 ms to minimize.
[2023-03-19 20:35:54] [INFO ] Deduced a trap composed of 87 places in 657 ms of which 0 ms to minimize.
[2023-03-19 20:35:55] [INFO ] Deduced a trap composed of 85 places in 604 ms of which 0 ms to minimize.
[2023-03-19 20:35:55] [INFO ] Deduced a trap composed of 138 places in 611 ms of which 1 ms to minimize.
[2023-03-19 20:35:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2867 ms
[2023-03-19 20:35:56] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 402 ms.
[2023-03-19 20:35:56] [INFO ] Added : 0 causal constraints over 0 iterations in 582 ms. Result :sat
Minimization took 190 ms.
[2023-03-19 20:35:56] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:35:56] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 20:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:35:57] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2023-03-19 20:35:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:35:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:35:57] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 20:35:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:35:57] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2023-03-19 20:35:58] [INFO ] [Nat]Added 147 Read/Feed constraints in 479 ms returned sat
[2023-03-19 20:35:58] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 435 ms.
[2023-03-19 20:35:59] [INFO ] Added : 0 causal constraints over 0 iterations in 601 ms. Result :sat
Minimization took 484 ms.
[2023-03-19 20:35:59] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:35:59] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 20:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:36:00] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2023-03-19 20:36:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:36:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:36:00] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 20:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:36:00] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2023-03-19 20:36:01] [INFO ] [Nat]Added 147 Read/Feed constraints in 711 ms returned sat
[2023-03-19 20:36:02] [INFO ] Deduced a trap composed of 79 places in 697 ms of which 1 ms to minimize.
[2023-03-19 20:36:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 827 ms
[2023-03-19 20:36:02] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 411 ms.
[2023-03-19 20:36:02] [INFO ] Added : 0 causal constraints over 0 iterations in 581 ms. Result :sat
Minimization took 629 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA Szymanski-PT-b08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 458 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 466 ms. Remains : 305/308 places, 7808/8064 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:36:04] [INFO ] Computed 3 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1477 ms. (steps per millisecond=677 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1040 ms. (steps per millisecond=961 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1070 ms. (steps per millisecond=934 ) properties (out of 3) seen :1
FORMULA Szymanski-PT-b08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-19 20:36:08] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:36:08] [INFO ] Computed 3 place invariants in 24 ms
[2023-03-19 20:36:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:36:08] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2023-03-19 20:36:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:36:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-19 20:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:36:09] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2023-03-19 20:36:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:36:11] [INFO ] [Nat]Added 147 Read/Feed constraints in 1785 ms returned sat
[2023-03-19 20:36:11] [INFO ] Deduced a trap composed of 50 places in 630 ms of which 1 ms to minimize.
[2023-03-19 20:36:12] [INFO ] Deduced a trap composed of 136 places in 687 ms of which 0 ms to minimize.
[2023-03-19 20:36:13] [INFO ] Deduced a trap composed of 140 places in 669 ms of which 1 ms to minimize.
[2023-03-19 20:36:13] [INFO ] Deduced a trap composed of 140 places in 664 ms of which 0 ms to minimize.
[2023-03-19 20:36:14] [INFO ] Deduced a trap composed of 142 places in 600 ms of which 1 ms to minimize.
[2023-03-19 20:36:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3618 ms
[2023-03-19 20:36:15] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 380 ms.
[2023-03-19 20:36:15] [INFO ] Added : 3 causal constraints over 2 iterations in 1092 ms. Result :sat
Minimization took 1010 ms.
[2023-03-19 20:36:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:36:17] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2023-03-19 20:36:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:36:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:36:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:36:17] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2023-03-19 20:36:18] [INFO ] [Nat]Added 147 Read/Feed constraints in 934 ms returned sat
[2023-03-19 20:36:19] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 390 ms.
[2023-03-19 20:36:19] [INFO ] Added : 0 causal constraints over 0 iterations in 546 ms. Result :sat
Minimization took 681 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 205 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:36:20] [INFO ] Computed 3 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1577 ms. (steps per millisecond=634 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1141 ms. (steps per millisecond=876 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1163 ms. (steps per millisecond=859 ) properties (out of 2) seen :1
FORMULA Szymanski-PT-b08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-19 20:36:24] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:36:24] [INFO ] Computed 3 place invariants in 23 ms
[2023-03-19 20:36:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:36:25] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2023-03-19 20:36:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:36:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:36:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:36:25] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2023-03-19 20:36:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:36:27] [INFO ] [Nat]Added 147 Read/Feed constraints in 1852 ms returned sat
[2023-03-19 20:36:28] [INFO ] Deduced a trap composed of 50 places in 657 ms of which 1 ms to minimize.
[2023-03-19 20:36:29] [INFO ] Deduced a trap composed of 136 places in 639 ms of which 1 ms to minimize.
[2023-03-19 20:36:29] [INFO ] Deduced a trap composed of 140 places in 646 ms of which 0 ms to minimize.
[2023-03-19 20:36:30] [INFO ] Deduced a trap composed of 140 places in 653 ms of which 0 ms to minimize.
[2023-03-19 20:36:31] [INFO ] Deduced a trap composed of 142 places in 653 ms of which 1 ms to minimize.
[2023-03-19 20:36:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3617 ms
[2023-03-19 20:36:31] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 400 ms.
[2023-03-19 20:36:32] [INFO ] Added : 3 causal constraints over 2 iterations in 1111 ms. Result :sat
Minimization took 1030 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 295 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:36:34] [INFO ] Computed 3 place invariants in 19 ms
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 1435 ms. (steps per millisecond=696 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 985 ms. (steps per millisecond=1015 ) properties (out of 1) seen :0
[2023-03-19 20:36:36] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:36:36] [INFO ] Computed 3 place invariants in 19 ms
[2023-03-19 20:36:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 20:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:36:37] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2023-03-19 20:36:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:36:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:36:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:36:37] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2023-03-19 20:36:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:36:39] [INFO ] [Nat]Added 147 Read/Feed constraints in 1844 ms returned sat
[2023-03-19 20:36:40] [INFO ] Deduced a trap composed of 50 places in 617 ms of which 1 ms to minimize.
[2023-03-19 20:36:40] [INFO ] Deduced a trap composed of 136 places in 654 ms of which 1 ms to minimize.
[2023-03-19 20:36:41] [INFO ] Deduced a trap composed of 140 places in 597 ms of which 1 ms to minimize.
[2023-03-19 20:36:42] [INFO ] Deduced a trap composed of 140 places in 673 ms of which 1 ms to minimize.
[2023-03-19 20:36:42] [INFO ] Deduced a trap composed of 142 places in 655 ms of which 1 ms to minimize.
[2023-03-19 20:36:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3563 ms
[2023-03-19 20:36:43] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 349 ms.
[2023-03-19 20:36:44] [INFO ] Added : 3 causal constraints over 2 iterations in 1073 ms. Result :sat
Minimization took 1022 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 20:36:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 20:36:45] [INFO ] Invariant cache hit.
[2023-03-19 20:36:46] [INFO ] Implicit Places using invariants in 551 ms returned []
[2023-03-19 20:36:46] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 20:36:46] [INFO ] Invariant cache hit.
[2023-03-19 20:36:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:36:50] [INFO ] Implicit Places using invariants and state equation in 3748 ms returned []
Implicit Place search using SMT with State Equation took 4306 ms to find 0 implicit places.
[2023-03-19 20:36:50] [INFO ] Redundant transitions in 925 ms returned []
[2023-03-19 20:36:51] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 20:36:51] [INFO ] Invariant cache hit.
[2023-03-19 20:36:53] [INFO ] Dead Transitions using invariants and state equation in 2634 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8058 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting property specific reduction for Szymanski-PT-b08-UpperBounds-00
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:36:53] [INFO ] Computed 3 place invariants in 19 ms
Incomplete random walk after 10005 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-19 20:36:53] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:36:53] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-19 20:36:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:36:54] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2023-03-19 20:36:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:36:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-19 20:36:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:36:54] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2023-03-19 20:36:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:36:56] [INFO ] [Nat]Added 147 Read/Feed constraints in 1781 ms returned sat
[2023-03-19 20:36:57] [INFO ] Deduced a trap composed of 50 places in 598 ms of which 1 ms to minimize.
[2023-03-19 20:36:57] [INFO ] Deduced a trap composed of 136 places in 578 ms of which 13 ms to minimize.
[2023-03-19 20:36:58] [INFO ] Deduced a trap composed of 140 places in 558 ms of which 0 ms to minimize.
[2023-03-19 20:36:59] [INFO ] Deduced a trap composed of 140 places in 566 ms of which 0 ms to minimize.
[2023-03-19 20:36:59] [INFO ] Deduced a trap composed of 142 places in 554 ms of which 1 ms to minimize.
[2023-03-19 20:36:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:36:59] [INFO ] Computed 3 place invariants in 23 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 1221 ms. (steps per millisecond=819 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1089 ms. (steps per millisecond=918 ) properties (out of 1) seen :0
[2023-03-19 20:37:02] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:37:02] [INFO ] Computed 3 place invariants in 23 ms
[2023-03-19 20:37:02] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 20:37:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:37:02] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2023-03-19 20:37:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:37:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:37:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:37:03] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2023-03-19 20:37:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:37:05] [INFO ] [Nat]Added 147 Read/Feed constraints in 1800 ms returned sat
[2023-03-19 20:37:05] [INFO ] Deduced a trap composed of 50 places in 604 ms of which 0 ms to minimize.
[2023-03-19 20:37:06] [INFO ] Deduced a trap composed of 136 places in 577 ms of which 0 ms to minimize.
[2023-03-19 20:37:06] [INFO ] Deduced a trap composed of 140 places in 576 ms of which 0 ms to minimize.
[2023-03-19 20:37:07] [INFO ] Deduced a trap composed of 140 places in 592 ms of which 1 ms to minimize.
[2023-03-19 20:37:08] [INFO ] Deduced a trap composed of 142 places in 573 ms of which 1 ms to minimize.
[2023-03-19 20:37:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3280 ms
[2023-03-19 20:37:08] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 334 ms.
[2023-03-19 20:37:09] [INFO ] Added : 3 causal constraints over 2 iterations in 1027 ms. Result :sat
Minimization took 1027 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 175 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 20:37:11] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 20:37:11] [INFO ] Invariant cache hit.
[2023-03-19 20:37:11] [INFO ] Implicit Places using invariants in 537 ms returned []
[2023-03-19 20:37:11] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 20:37:11] [INFO ] Invariant cache hit.
[2023-03-19 20:37:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:37:13] [INFO ] Implicit Places using invariants and state equation in 1940 ms returned []
Implicit Place search using SMT with State Equation took 2480 ms to find 0 implicit places.
[2023-03-19 20:37:14] [INFO ] Redundant transitions in 852 ms returned []
[2023-03-19 20:37:14] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 20:37:14] [INFO ] Invariant cache hit.
[2023-03-19 20:37:16] [INFO ] Dead Transitions using invariants and state equation in 2626 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6146 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b08-UpperBounds-00 in 23334 ms.
[2023-03-19 20:37:17] [INFO ] Flatten gal took : 448 ms
[2023-03-19 20:37:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-19 20:37:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7808 transitions and 31360 arcs took 34 ms.
Total runtime 93348 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Szymanski (PT), instance b08
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: 305 places, 7808 transitions, 31360 arcs.
Final Score: 90860.373
Took : 124 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 9661952 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16094412 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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
Caught signal 15, terminating.

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="Szymanski-PT-b08"
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 Szymanski-PT-b08, 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 r491-tall-167912710500477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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