Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r107-smll-165260580400088.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is GPPP-PT-C0100N0000000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-smll-165260580400088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 6.5K Apr 29 18:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 18:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 29 18:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 18:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 17 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1 May 10 09:33 large_marking
-rw-r--r-- 1 mcc users 21K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-00
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-01
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-02
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-03
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-04
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-05
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-06
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-07
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-08
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-09
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-10
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-11
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-12
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-13
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-14
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652646176025

Running Version 0
[2022-05-15 20:22:59] [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]
[2022-05-15 20:22:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:22:59] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2022-05-15 20:22:59] [INFO ] Transformed 33 places.
[2022-05-15 20:22:59] [INFO ] Transformed 22 transitions.
[2022-05-15 20:22:59] [INFO ] Parsed PT model containing 33 places and 22 transitions in 153 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
// Phase 1: matrix 22 rows 33 cols
[2022-05-15 20:22:59] [INFO ] Computed 12 place invariants in 13 ms
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-10 700 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10002 steps, including 23 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :2008
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-12 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-05 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :1071
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :1068
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :1063
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :1059
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :1081
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :1053
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :1043
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :1052
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :1067
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :1070
// Phase 1: matrix 22 rows 33 cols
[2022-05-15 20:22:59] [INFO ] Computed 12 place invariants in 11 ms
[2022-05-15 20:23:00] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2022-05-15 20:23:00] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-15 20:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:00] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-15 20:23:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-05-15 20:23:00] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 651 ms returned sat
[2022-05-15 20:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:01] [INFO ] [Nat]Absence check using state equation in 52 ms returned unsat
[2022-05-15 20:23:01] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:23:01] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-15 20:23:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:01] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-05-15 20:23:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:23:03] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2690 ms returned sat
[2022-05-15 20:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:03] [INFO ] [Nat]Absence check using state equation in 48 ms returned unsat
[2022-05-15 20:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:23:03] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-15 20:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:03] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-15 20:23:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:23:03] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 12 ms returned sat
[2022-05-15 20:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:04] [INFO ] [Nat]Absence check using state equation in 826 ms returned sat
[2022-05-15 20:23:04] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-15 20:23:04] [INFO ] Added : 15 causal constraints over 3 iterations in 68 ms. Result :sat
Minimization took 25 ms.
[2022-05-15 20:23:04] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:23:04] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 14 ms returned sat
[2022-05-15 20:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:05] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-15 20:23:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:23:05] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 590 ms returned sat
[2022-05-15 20:23:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:05] [INFO ] [Nat]Absence check using state equation in 63 ms returned unsat
[2022-05-15 20:23:05] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:23:05] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-15 20:23:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:05] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-15 20:23:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:23:07] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2148 ms returned sat
[2022-05-15 20:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:08] [INFO ] [Nat]Absence check using state equation in 895 ms returned sat
[2022-05-15 20:23:08] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-15 20:23:08] [INFO ] Added : 19 causal constraints over 4 iterations in 75 ms. Result :sat
Minimization took 33 ms.
[2022-05-15 20:23:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:23:08] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:08] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-15 20:23:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:23:09] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 14 ms returned sat
[2022-05-15 20:23:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:09] [INFO ] [Nat]Absence check using state equation in 39 ms returned unsat
[2022-05-15 20:23:09] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:23:09] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2022-05-15 20:23:09] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:23:09] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:23:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:09] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-15 20:23:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2022-05-15 20:23:09] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 409 ms returned sat
[2022-05-15 20:23:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:14] [INFO ] [Nat]Absence check using state equation in 4566 ms returned unknown
[2022-05-15 20:23:14] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:23:14] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2022-05-15 20:23:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:23:14] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-15 20:23:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:23:14] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 603 ms returned sat
[2022-05-15 20:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:14] [INFO ] [Nat]Absence check using state equation in 40 ms returned unsat
Current structural bounds on expressions (after SMT) : [7, 7, 760, 3, 450, 1, 300, 8, 740, 7] Max seen :[7, 7, 5, 3, 38, 1, 300, 1, 740, 7]
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-14 740 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-11 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 35000 steps, including 111 resets, run finished after 105 ms. (steps per millisecond=333 ) properties (out of 3) seen :55 could not realise parikh vector
Incomplete Parikh walk after 6100 steps, including 97 resets, run finished after 12 ms. (steps per millisecond=508 ) properties (out of 3) seen :13 could not realise parikh vector
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 36 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2022-05-15 20:23:15] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 20:23:15] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/33 places, 17/22 transitions.
// Phase 1: matrix 17 rows 26 cols
[2022-05-15 20:23:15] [INFO ] Computed 10 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 5139 resets, run finished after 833 ms. (steps per millisecond=1200 ) properties (out of 3) seen :45
Incomplete Best-First random walk after 1000000 steps, including 1000 resets, run finished after 514 ms. (steps per millisecond=1945 ) properties (out of 3) seen :28
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=2652 ) properties (out of 3) seen :40
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 3) seen :14
// Phase 1: matrix 17 rows 26 cols
[2022-05-15 20:23:17] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 20:23:17] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:23:17] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:17] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-15 20:23:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2022-05-15 20:23:17] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-15 20:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:17] [INFO ] [Nat]Absence check using state equation in 56 ms returned unsat
[2022-05-15 20:23:17] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-15 20:23:17] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 8 ms returned sat
[2022-05-15 20:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:17] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-15 20:23:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-15 20:23:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 20:23:26] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 9005 ms returned unknown
[2022-05-15 20:23:26] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:23:26] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:26] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 20:23:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:23:26] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 28 ms returned sat
[2022-05-15 20:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:26] [INFO ] [Nat]Absence check using state equation in 16 ms returned unsat
Current structural bounds on expressions (after SMT) : [7, 450, 1] Max seen :[7, 47, 1]
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 17/17 transitions.
Graph (trivial) has 2 edges and 26 vertex of which 2 / 26 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 24 transition count 14
Applied a total of 3 rules in 7 ms. Remains 24 /26 variables (removed 2) and now considering 14/17 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/26 places, 14/17 transitions.
// Phase 1: matrix 14 rows 24 cols
[2022-05-15 20:23:26] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000028 steps, including 5698 resets, run finished after 429 ms. (steps per millisecond=2331 ) properties (out of 1) seen :39
Incomplete Best-First random walk after 1000001 steps, including 1799 resets, run finished after 432 ms. (steps per millisecond=2314 ) properties (out of 1) seen :47
// Phase 1: matrix 14 rows 24 cols
[2022-05-15 20:23:27] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 20:23:27] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:23:27] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:27] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 20:23:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:23:27] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 29 ms returned sat
[2022-05-15 20:23:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:27] [INFO ] [Nat]Absence check using state equation in 224 ms returned unsat
Current structural bounds on expressions (after SMT) : [47] Max seen :[47]
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-08 47 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652646209249

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="GPPP-PT-C0100N0000000010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is GPPP-PT-C0100N0000000010, 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 r107-smll-165260580400088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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