Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446800317.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S06J04T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446800317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.8M May 18 16:43 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 PolyORBLF-PT-S06J04T04-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716919703535

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 18:08:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 18:08:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:08:25] [INFO ] Load time of PNML (sax parser for PT used): 442 ms
[2024-05-28 18:08:25] [INFO ] Transformed 454 places.
[2024-05-28 18:08:25] [INFO ] Transformed 6994 transitions.
[2024-05-28 18:08:25] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 621 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 10, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 10, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 18:08:25] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2024-05-28 18:08:25] [INFO ] Computed 50 invariants in 126 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 10, 0, 0, 1] Max Struct:[1, 13392, 6780, 6612, 6780, 1, 33, 6780, 16, 31, 6, 42, 10, 1653, 47, 1695]
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (39 resets) in 151 ms. (65 steps per ms)
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130010 steps (628 resets) in 551 ms. (235 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1, 4, 1, 6, 3, 1, 1, 1, 1, 4, 1, 1] Max Struct:[13392, 6780, 6612, 6780, 33, 6780, 16, 31, 6, 42, 1653, 47, 1695]
[2024-05-28 18:08:26] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-05-28 18:08:26] [INFO ] Invariant cache hit.
[2024-05-28 18:08:26] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2024-05-28 18:08:26] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 22 ms returned unsat
[2024-05-28 18:08:26] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-28 18:08:26] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned unsat
[2024-05-28 18:08:27] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-28 18:08:27] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned unsat
[2024-05-28 18:08:27] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-28 18:08:27] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned unsat
[2024-05-28 18:08:27] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-28 18:08:27] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned unsat
[2024-05-28 18:08:27] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-28 18:08:27] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned sat
[2024-05-28 18:08:28] [INFO ] [Real]Absence check using state equation in 920 ms returned sat
[2024-05-28 18:08:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:08:28] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-28 18:08:28] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned sat
[2024-05-28 18:08:30] [INFO ] [Nat]Absence check using state equation in 1606 ms returned sat
[2024-05-28 18:08:30] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:08:30] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 18:08:31] [INFO ] [Nat]Added 112 Read/Feed constraints in 1061 ms returned unknown
[2024-05-28 18:08:31] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 18:08:31] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned unsat
[2024-05-28 18:08:31] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 18:08:31] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 7 ms returned unsat
[2024-05-28 18:08:31] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-28 18:08:31] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 10 ms returned unsat
[2024-05-28 18:08:31] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-28 18:08:31] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 5 ms returned unsat
[2024-05-28 18:08:31] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-28 18:08:31] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned unsat
[2024-05-28 18:08:31] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-28 18:08:31] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned unsat
[2024-05-28 18:08:31] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 18:08:31] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned sat
[2024-05-28 18:08:33] [INFO ] [Real]Absence check using state equation in 1332 ms returned sat
[2024-05-28 18:08:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:08:33] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 18:08:33] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned sat
[2024-05-28 18:08:34] [INFO ] [Nat]Absence check using state equation in 1440 ms returned sat
[2024-05-28 18:08:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 18:08:35] [INFO ] [Nat]Added 112 Read/Feed constraints in 1022 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1, 4, 1, 6, 3, 1, 1, 1, 1, 4, 1, 1] Max Struct:[4, 1, 4, 1, 6, 6780, 1, 1, 1, 1, 4, 1, 1695]
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 1] Max Struct:[6780, 1695]
Support contains 5 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 448 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 412 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 78 place count 412 transition count 1530
Deduced a syphon composed of 48 places in 4 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 364 transition count 1530
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 268 place count 317 transition count 1483
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 276 place count 317 transition count 1475
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 284 place count 309 transition count 1475
Applied a total of 284 rules in 378 ms. Remains 309 /454 variables (removed 145) and now considering 1475/1614 (removed 139) transitions.
Running 1469 sub problems to find dead transitions.
[2024-05-28 18:08:36] [INFO ] Flow matrix only has 1451 transitions (discarded 24 similar events)
// Phase 1: matrix 1451 rows 309 cols
[2024-05-28 18:08:36] [INFO ] Computed 44 invariants in 56 ms
[2024-05-28 18:08:36] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
[2024-05-28 18:09:02] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 13 ms to minimize.
[2024-05-28 18:09:02] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-28 18:09:03] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-05-28 18:09:07] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 1 ms to minimize.
[2024-05-28 18:09:07] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 303/1760 variables, and 38 constraints, problems are : Problem set: 0 solved, 1469 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/309 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1469/1469 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1469 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
[2024-05-28 18:09:17] [INFO ] Deduced a trap composed of 52 places in 407 ms of which 3 ms to minimize.
[2024-05-28 18:09:17] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 2 ms to minimize.
[2024-05-28 18:09:18] [INFO ] Deduced a trap composed of 23 places in 349 ms of which 3 ms to minimize.
[2024-05-28 18:09:18] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 2 ms to minimize.
[2024-05-28 18:09:18] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
At refinement iteration 5 (OVERLAPS) 3/306 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/1760 variables, and 46 constraints, problems are : Problem set: 0 solved, 1469 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/309 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1469 constraints, Known Traps: 10/10 constraints]
After SMT, in 58989ms problems are : Problem set: 0 solved, 1469 unsolved
Search for dead transitions found 0 dead transitions in 59029ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59447 ms. Remains : 309/454 places, 1475/1614 transitions.
[2024-05-28 18:09:35] [INFO ] Flow matrix only has 1451 transitions (discarded 24 similar events)
[2024-05-28 18:09:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 1] Max Struct:[420, 105]
RANDOM walk for 1000000 steps (10977 resets) in 7803 ms. (128 steps per ms)
BEST_FIRST walk for 2000001 steps (12368 resets) in 5066 ms. (394 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 1] Max Struct:[420, 105]
[2024-05-28 18:09:48] [INFO ] Flow matrix only has 1451 transitions (discarded 24 similar events)
[2024-05-28 18:09:48] [INFO ] Invariant cache hit.
[2024-05-28 18:09:48] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-28 18:09:48] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 20 ms returned sat
[2024-05-28 18:09:49] [INFO ] [Real]Absence check using state equation in 985 ms returned sat
[2024-05-28 18:09:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:09:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-28 18:09:49] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 29 ms returned sat
[2024-05-28 18:09:50] [INFO ] [Nat]Absence check using state equation in 1186 ms returned sat
[2024-05-28 18:09:50] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:09:50] [INFO ] [Nat]Added 112 Read/Feed constraints in 85 ms returned sat
[2024-05-28 18:09:51] [INFO ] Deduced a trap composed of 23 places in 358 ms of which 3 ms to minimize.
[2024-05-28 18:09:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 451 ms
[2024-05-28 18:09:51] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-28 18:09:51] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 17 ms returned sat
[2024-05-28 18:09:52] [INFO ] [Real]Absence check using state equation in 1348 ms returned sat
[2024-05-28 18:09:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:09:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-28 18:09:52] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 18:09:54] [INFO ] [Nat]Absence check using state equation in 2060 ms returned sat
[2024-05-28 18:09:55] [INFO ] [Nat]Added 112 Read/Feed constraints in 305 ms returned sat
[2024-05-28 18:09:55] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2024-05-28 18:09:56] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-05-28 18:09:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1614 ms
[2024-05-28 18:09:56] [INFO ] Computed and/alt/rep : 1143/4555/1138 causal constraints (skipped 307 transitions) in 191 ms.
[2024-05-28 18:09:58] [INFO ] Added : 68 causal constraints over 14 iterations in 2013 ms. Result :sat
Minimization took 4843 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 1] Max Struct:[3, 105]
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[105]
Support contains 1 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1475/1475 transitions.
Applied a total of 0 rules in 76 ms. Remains 309 /309 variables (removed 0) and now considering 1475/1475 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 309/309 places, 1475/1475 transitions.
[2024-05-28 18:10:03] [INFO ] Flow matrix only has 1451 transitions (discarded 24 similar events)
[2024-05-28 18:10:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[105]
RANDOM walk for 1000000 steps (10909 resets) in 8351 ms. (119 steps per ms)
BEST_FIRST walk for 1000001 steps (3571 resets) in 2687 ms. (372 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[105]
[2024-05-28 18:10:14] [INFO ] Flow matrix only has 1451 transitions (discarded 24 similar events)
[2024-05-28 18:10:14] [INFO ] Invariant cache hit.
[2024-05-28 18:10:14] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-28 18:10:14] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 28 ms returned sat
[2024-05-28 18:10:16] [INFO ] [Real]Absence check using state equation in 1654 ms returned sat
[2024-05-28 18:10:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:10:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-28 18:10:16] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 18 ms returned sat
[2024-05-28 18:10:18] [INFO ] [Nat]Absence check using state equation in 2220 ms returned sat
[2024-05-28 18:10:18] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:10:19] [INFO ] [Nat]Added 112 Read/Feed constraints in 461 ms returned sat
[2024-05-28 18:10:19] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2024-05-28 18:10:20] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-05-28 18:10:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1716 ms
[2024-05-28 18:10:21] [INFO ] Computed and/alt/rep : 1143/4555/1138 causal constraints (skipped 307 transitions) in 245 ms.
[2024-05-28 18:10:22] [INFO ] Added : 68 causal constraints over 14 iterations in 1879 ms. Result :sat
Minimization took 4839 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[105]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[105]
Support contains 1 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1475/1475 transitions.
Applied a total of 0 rules in 55 ms. Remains 309 /309 variables (removed 0) and now considering 1475/1475 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 309/309 places, 1475/1475 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1475/1475 transitions.
Applied a total of 0 rules in 32 ms. Remains 309 /309 variables (removed 0) and now considering 1475/1475 (removed 0) transitions.
[2024-05-28 18:10:27] [INFO ] Flow matrix only has 1451 transitions (discarded 24 similar events)
[2024-05-28 18:10:27] [INFO ] Invariant cache hit.
[2024-05-28 18:10:28] [INFO ] Implicit Places using invariants in 526 ms returned [29, 202, 241]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 541 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 306/309 places, 1475/1475 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 303 transition count 1472
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 303 transition count 1472
Applied a total of 6 rules in 80 ms. Remains 303 /306 variables (removed 3) and now considering 1472/1475 (removed 3) transitions.
[2024-05-28 18:10:28] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
// Phase 1: matrix 1448 rows 303 cols
[2024-05-28 18:10:28] [INFO ] Computed 41 invariants in 58 ms
[2024-05-28 18:10:29] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-28 18:10:29] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 18:10:29] [INFO ] Invariant cache hit.
[2024-05-28 18:10:30] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:10:35] [INFO ] Implicit Places using invariants and state equation in 6829 ms returned []
Implicit Place search using SMT with State Equation took 7425 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 303/309 places, 1472/1475 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8080 ms. Remains : 303/309 places, 1472/1475 transitions.
[2024-05-28 18:10:35] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 18:10:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[105]
RANDOM walk for 1000000 steps (11025 resets) in 8065 ms. (123 steps per ms)
BEST_FIRST walk for 1000001 steps (3582 resets) in 3010 ms. (332 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[105]
[2024-05-28 18:10:47] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 18:10:47] [INFO ] Invariant cache hit.
[2024-05-28 18:10:47] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2024-05-28 18:10:47] [INFO ] [Real]Absence check using 18 positive and 23 generalized place invariants in 10 ms returned sat
[2024-05-28 18:10:47] [INFO ] [Real]Absence check using state equation in 687 ms returned sat
[2024-05-28 18:10:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:10:47] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-05-28 18:10:47] [INFO ] [Nat]Absence check using 18 positive and 23 generalized place invariants in 14 ms returned sat
[2024-05-28 18:10:51] [INFO ] [Nat]Absence check using state equation in 3538 ms returned sat
[2024-05-28 18:10:51] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:10:52] [INFO ] [Nat]Added 112 Read/Feed constraints in 540 ms returned sat
[2024-05-28 18:10:52] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-05-28 18:10:52] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 1 ms to minimize.
[2024-05-28 18:10:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 525 ms
[2024-05-28 18:10:52] [INFO ] Computed and/alt/rep : 1140/4551/1135 causal constraints (skipped 307 transitions) in 191 ms.
[2024-05-28 18:10:53] [INFO ] Added : 19 causal constraints over 4 iterations in 1096 ms. Result :sat
Minimization took 4819 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[105]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[105]
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 1472/1472 transitions.
Applied a total of 0 rules in 62 ms. Remains 303 /303 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 303/303 places, 1472/1472 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 1472/1472 transitions.
Applied a total of 0 rules in 44 ms. Remains 303 /303 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
[2024-05-28 18:10:58] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 18:10:58] [INFO ] Invariant cache hit.
[2024-05-28 18:10:59] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-05-28 18:10:59] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 18:10:59] [INFO ] Invariant cache hit.
[2024-05-28 18:11:00] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:11:05] [INFO ] Implicit Places using invariants and state equation in 6167 ms returned []
Implicit Place search using SMT with State Equation took 6824 ms to find 0 implicit places.
[2024-05-28 18:11:05] [INFO ] Redundant transitions in 115 ms returned []
Running 1466 sub problems to find dead transitions.
[2024-05-28 18:11:05] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 18:11:05] [INFO ] Invariant cache hit.
[2024-05-28 18:11:05] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
[2024-05-28 18:11:33] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-28 18:11:33] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-05-28 18:11:36] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2024-05-28 18:11:37] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
SMT process timed out in 50988ms, After SMT, problems are : Problem set: 0 solved, 1466 unsolved
Search for dead transitions found 0 dead transitions in 51023ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58028 ms. Remains : 303/303 places, 1472/1472 transitions.
RANDOM walk for 40000 steps (438 resets) in 1348 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (145 resets) in 481 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (133 resets) in 413 ms. (96 steps per ms) remains 2/2 properties
[2024-05-28 18:11:57] [INFO ] Flatten gal took : 385 ms
[2024-05-28 18:11:57] [INFO ] Flatten gal took : 110 ms
[2024-05-28 18:11:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6620920939974694135.gal : 42 ms
[2024-05-28 18:11:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1706651380064675499.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6620920939974694135.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1706651380064675499.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1706651380064675499.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :16 after 19
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :19 after 24
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :24 after 79
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :79 after 268
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :268 after 449
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :449 after 673
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :673 after 7956
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7956 after 17005
Interrupted probabilistic random walk after 184922 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 184922 steps, saw 83441 distinct states, run finished after 3004 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-28 18:12:00] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 18:12:00] [INFO ] Invariant cache hit.
[2024-05-28 18:12:00] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 129/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/197 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/200 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 101/301 variables, 21/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 18:12:00] [INFO ] Deduced a trap composed of 50 places in 244 ms of which 2 ms to minimize.
[2024-05-28 18:12:00] [INFO ] Deduced a trap composed of 50 places in 226 ms of which 3 ms to minimize.
[2024-05-28 18:12:01] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 2 ms to minimize.
[2024-05-28 18:12:01] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 4/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1448/1749 variables, 301/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1749 variables, 112/457 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1749 variables, 0/457 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/1751 variables, 2/459 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1751 variables, 1/460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1751 variables, 0/460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1751 variables, 0/460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1751/1751 variables, and 460 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1771 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 303/303 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/130 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/197 variables, 16/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/200 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 101/301 variables, 21/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 4/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1749/1751 variables, and 345 constraints, problems are : Problem set: 1 solved, 1 unsolved in 996 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 301/303 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 2792ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 104 ms.
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 1472/1472 transitions.
Applied a total of 0 rules in 34 ms. Remains 303 /303 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
Running 1466 sub problems to find dead transitions.
[2024-05-28 18:12:03] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 18:12:03] [INFO ] Invariant cache hit.
[2024-05-28 18:12:03] [INFO ] State equation strengthened by 112 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :17005 after 230405

BK_STOP 1716919937124

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="PolyORBLF-PT-S06J04T04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S06J04T04, 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 r290-tajo-171654446800317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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