fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r319-tall-167873969900064
Last Updated
May 14, 2023

About the Execution of 2022-gold for PolyORBLF-PT-S02J04T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
704.768 49270.00 60058.00 831.40 1 1 1 1 9 1 1 2 1 1 1 0 1 2 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r319-tall-167873969900064.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 gold2022
Input is PolyORBLF-PT-S02J04T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873969900064
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 19K Feb 26 13:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 26 13:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 139K Feb 26 13:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 54K Feb 26 14:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 249K Feb 26 14:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 65K Feb 26 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 329K Feb 26 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 906K 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 PolyORBLF-PT-S02J04T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678873746232

Running Version 202205111006
[2023-03-15 09:49:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 09:49:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 09:49:08] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2023-03-15 09:49:08] [INFO ] Transformed 752 places.
[2023-03-15 09:49:08] [INFO ] Transformed 1572 transitions.
[2023-03-15 09:49:08] [INFO ] Parsed PT model containing 752 places and 1572 transitions in 320 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Normalized transition count is 1392 out of 1412 initially.
// Phase 1: matrix 1392 rows 752 cols
[2023-03-15 09:49:08] [INFO ] Computed 54 place invariants in 99 ms
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :18
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :22
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :18
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :15
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :12
[2023-03-15 09:49:09] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2023-03-15 09:49:09] [INFO ] Computed 54 place invariants in 72 ms
[2023-03-15 09:49:09] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2023-03-15 09:49:09] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 23 ms returned unsat
[2023-03-15 09:49:09] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-03-15 09:49:09] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 18 ms returned unsat
[2023-03-15 09:49:09] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned unsat
[2023-03-15 09:49:10] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned unsat
[2023-03-15 09:49:10] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-15 09:49:10] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 42 ms returned sat
[2023-03-15 09:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:49:11] [INFO ] [Real]Absence check using state equation in 1265 ms returned sat
[2023-03-15 09:49:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:49:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2023-03-15 09:49:11] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 24 ms returned sat
[2023-03-15 09:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:49:13] [INFO ] [Nat]Absence check using state equation in 2070 ms returned sat
[2023-03-15 09:49:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 09:49:16] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 09:49:16] [INFO ] [Nat]Added 120 Read/Feed constraints in 2814 ms returned unknown
[2023-03-15 09:49:16] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-15 09:49:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 17 ms returned unsat
[2023-03-15 09:49:16] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-15 09:49:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned sat
[2023-03-15 09:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:49:18] [INFO ] [Real]Absence check using state equation in 1484 ms returned sat
[2023-03-15 09:49:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:49:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-15 09:49:18] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 32 ms returned sat
[2023-03-15 09:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:49:22] [INFO ] [Nat]Absence check using state equation in 4308 ms returned sat
[2023-03-15 09:49:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 09:49:23] [INFO ] [Nat]Added 120 Read/Feed constraints in 601 ms returned unknown
[2023-03-15 09:49:23] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-15 09:49:23] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 3 ms returned unsat
[2023-03-15 09:49:23] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-15 09:49:23] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 12 ms returned unsat
[2023-03-15 09:49:23] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-15 09:49:23] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 26 ms returned sat
[2023-03-15 09:49:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:49:24] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2023-03-15 09:49:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:49:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 18 ms returned sat
[2023-03-15 09:49:24] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 36 ms returned sat
[2023-03-15 09:49:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:49:27] [INFO ] [Nat]Absence check using state equation in 3488 ms returned sat
[2023-03-15 09:49:28] [INFO ] [Nat]Added 120 Read/Feed constraints in 874 ms returned sat
[2023-03-15 09:49:29] [INFO ] Deduced a trap composed of 23 places in 388 ms of which 3 ms to minimize.
[2023-03-15 09:49:29] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 526 ms
[2023-03-15 09:49:29] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2023-03-15 09:49:29] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 20 ms returned unsat
[2023-03-15 09:49:29] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-03-15 09:49:29] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned sat
[2023-03-15 09:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:49:30] [INFO ] [Real]Absence check using state equation in 1428 ms returned sat
[2023-03-15 09:49:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:49:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 22 ms returned sat
[2023-03-15 09:49:31] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 29 ms returned sat
[2023-03-15 09:49:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:49:32] [INFO ] [Nat]Absence check using state equation in 1398 ms returned sat
[2023-03-15 09:49:34] [INFO ] [Nat]Added 120 Read/Feed constraints in 1808 ms returned sat
[2023-03-15 09:49:34] [INFO ] Deduced a trap composed of 23 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:49:35] [INFO ] Deduced a trap composed of 360 places in 320 ms of which 1 ms to minimize.
[2023-03-15 09:49:36] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1647 ms
[2023-03-15 09:49:36] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-15 09:49:36] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 23 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, -1, 1, -1, 1, 1, 4, 1, -1, 1] Max seen :[1, 1, 1, 1, 9, 1, 2, 1, 1, 0, 1, 2, 1]
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 22 out of 752 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 750 transition count 1332
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 162 place count 670 transition count 1332
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 162 place count 670 transition count 1252
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 322 place count 590 transition count 1252
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 480 place count 511 transition count 1173
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 490 place count 511 transition count 1163
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 500 place count 501 transition count 1163
Applied a total of 500 rules in 254 ms. Remains 501 /752 variables (removed 251) and now considering 1163/1412 (removed 249) transitions.
[2023-03-15 09:49:36] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
// Phase 1: matrix 1143 rows 501 cols
[2023-03-15 09:49:36] [INFO ] Computed 52 place invariants in 34 ms
[2023-03-15 09:49:37] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 501/752 places, 1053/1412 transitions.
Reduce places removed 1 places and 20 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 1033
Reduce places removed 20 places and 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 21 place count 480 transition count 1013
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 21 rules in 35 ms. Remains 480 /501 variables (removed 21) and now considering 1013/1053 (removed 40) transitions.
Finished structural reductions, in 2 iterations. Remains : 480/752 places, 1013/1412 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 993 out of 1013 initially.
// Phase 1: matrix 993 rows 479 cols
[2023-03-15 09:49:37] [INFO ] Computed 52 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 312 resets, run finished after 5267 ms. (steps per millisecond=189 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2030 ms. (steps per millisecond=492 ) properties (out of 3) seen :13
Incomplete Best-First random walk after 1000000 steps, including 141 resets, run finished after 2400 ms. (steps per millisecond=416 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000000 steps, including 138 resets, run finished after 2263 ms. (steps per millisecond=441 ) properties (out of 3) seen :9
[2023-03-15 09:49:49] [INFO ] Flow matrix only has 993 transitions (discarded 20 similar events)
// Phase 1: matrix 993 rows 479 cols
[2023-03-15 09:49:49] [INFO ] Computed 52 place invariants in 20 ms
[2023-03-15 09:49:49] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-15 09:49:49] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 17 ms returned sat
[2023-03-15 09:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:49:51] [INFO ] [Real]Absence check using state equation in 1357 ms returned sat
[2023-03-15 09:49:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:49:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-15 09:49:51] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 18 ms returned sat
[2023-03-15 09:49:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:49:53] [INFO ] [Nat]Absence check using state equation in 2100 ms returned sat
[2023-03-15 09:49:53] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 09:49:54] [INFO ] [Nat]Added 120 Read/Feed constraints in 1574 ms returned sat
[2023-03-15 09:49:55] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 2 ms to minimize.
[2023-03-15 09:49:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 259 ms
[2023-03-15 09:49:55] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-15 09:49:55] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 12 ms returned unsat
[2023-03-15 09:49:55] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-15 09:49:55] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 14 ms returned unsat
Current structural bounds on expressions (after SMT) : [9, 2, 2, -1] Max seen :[9, 2, 2, 2]
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-04 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 47878 ms.

BK_STOP 1678873795502

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-S02J04T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is PolyORBLF-PT-S02J04T10, 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 r319-tall-167873969900064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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