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.r179-tall-165277026900196.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 PolyORBLF-COL-S04J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026900196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 7.6K Apr 29 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 14:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 14:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 154K May 10 09:34 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-COL-S04J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652832994954

Running Version 0
[2022-05-18 00:16:36] [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-18 00:16:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:16:36] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-18 00:16:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 00:16:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 724 ms
[2022-05-18 00:16:37] [INFO ] ms1 symmetric to ms2 in transition T_1124
[2022-05-18 00:16:37] [INFO ] ms1 symmetric to ms2 in transition T_1125
[2022-05-18 00:16:37] [INFO ] ms2 symmetric to ms3 in transition T_1125
[2022-05-18 00:16:37] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2022-05-18 00:16:37] [INFO ] ms4 symmetric to ms2 in transition T_1126
[2022-05-18 00:16:37] [INFO ] ms2 symmetric to ms3 in transition T_1126
[2022-05-18 00:16:37] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 792 PT places and 4336.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-18 00:16:37] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions in 4 ms.
[2022-05-18 00:16:37] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_3806189707862274214.dot
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 00:16:37] [INFO ] Computed 26 place invariants in 17 ms
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-18 00:16:37] [INFO ] Unfolded HLPN to a Petri net with 792 places and 2100 transitions in 36 ms.
[2022-05-18 00:16:37] [INFO ] Unfolded HLPN properties in 0 ms.
[2022-05-18 00:16:37] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 00:16:37] [INFO ] Computed 26 place invariants in 8 ms
[2022-05-18 00:16:37] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-05-18 00:16:37] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 00:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:37] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-18 00:16:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:16:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:16:37] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:16:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:37] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-05-18 00:16:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-18 00:16:37] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-18 00:16:37] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 00:16:37] [INFO ] Added : 62 causal constraints over 13 iterations in 183 ms. Result :sat
Minimization took 33 ms.
[2022-05-18 00:16:37] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:16:37] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:37] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-18 00:16:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:16:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:16:37] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:16:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:37] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-18 00:16:37] [INFO ] [Nat]Added 9 Read/Feed constraints in 51 ms returned sat
[2022-05-18 00:16:38] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-18 00:16:38] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 3 ms to minimize.
[2022-05-18 00:16:38] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2022-05-18 00:16:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2022-05-18 00:16:38] [INFO ] Added : 63 causal constraints over 13 iterations in 237 ms. Result :sat
Minimization took 33 ms.
[2022-05-18 00:16:38] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:16:38] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:38] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:16:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:16:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:16:38] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:16:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:38] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-18 00:16:38] [INFO ] [Nat]Added 9 Read/Feed constraints in 23 ms returned sat
[2022-05-18 00:16:38] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 00:16:38] [INFO ] Deduced a trap composed of 34 places in 23 ms of which 1 ms to minimize.
[2022-05-18 00:16:38] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 2 ms to minimize.
[2022-05-18 00:16:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2022-05-18 00:16:38] [INFO ] Added : 59 causal constraints over 12 iterations in 184 ms. Result :sat
Minimization took 84 ms.
[2022-05-18 00:16:38] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:16:38] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:38] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:16:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:16:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:16:38] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2022-05-18 00:16:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:38] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-18 00:16:38] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2022-05-18 00:16:38] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2022-05-18 00:16:38] [INFO ] Deduced a trap composed of 31 places in 21 ms of which 0 ms to minimize.
[2022-05-18 00:16:38] [INFO ] Deduced a trap composed of 11 places in 14 ms of which 0 ms to minimize.
[2022-05-18 00:16:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 98 ms
[2022-05-18 00:16:38] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 00:16:39] [INFO ] Deduced a trap composed of 32 places in 20 ms of which 0 ms to minimize.
[2022-05-18 00:16:39] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2022-05-18 00:16:39] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2022-05-18 00:16:39] [INFO ] Deduced a trap composed of 33 places in 22 ms of which 0 ms to minimize.
[2022-05-18 00:16:39] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2022-05-18 00:16:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 168 ms
[2022-05-18 00:16:39] [INFO ] Added : 62 causal constraints over 13 iterations in 303 ms. Result :sat
Minimization took 32 ms.
[2022-05-18 00:16:39] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:16:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:39] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:16:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:16:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:16:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:16:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:39] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-18 00:16:39] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:16:39] [INFO ] Deduced a trap composed of 12 places in 12 ms of which 0 ms to minimize.
[2022-05-18 00:16:39] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2022-05-18 00:16:39] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2022-05-18 00:16:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 95 ms
[2022-05-18 00:16:39] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 00:16:39] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2022-05-18 00:16:39] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2022-05-18 00:16:39] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2022-05-18 00:16:39] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2022-05-18 00:16:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 203 ms
[2022-05-18 00:16:39] [INFO ] Added : 62 causal constraints over 14 iterations in 340 ms. Result :sat
Minimization took 27 ms.
[2022-05-18 00:16:39] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2022-05-18 00:16:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:39] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-18 00:16:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:16:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:16:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:16:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:39] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-18 00:16:39] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:16:39] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2022-05-18 00:16:39] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
[2022-05-18 00:16:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2022-05-18 00:16:39] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:16:40] [INFO ] Added : 62 causal constraints over 13 iterations in 109 ms. Result :sat
Minimization took 22 ms.
[2022-05-18 00:16:40] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:16:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:40] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-18 00:16:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:16:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:16:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:16:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:40] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-18 00:16:40] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:16:40] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2022-05-18 00:16:40] [INFO ] Deduced a trap composed of 15 places in 12 ms of which 1 ms to minimize.
[2022-05-18 00:16:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 47 ms
[2022-05-18 00:16:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:16:40] [INFO ] Added : 62 causal constraints over 13 iterations in 126 ms. Result :sat
Minimization took 27 ms.
[2022-05-18 00:16:40] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:16:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 00:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:40] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-18 00:16:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:16:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:16:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:16:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:40] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-05-18 00:16:40] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:16:40] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2022-05-18 00:16:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2022-05-18 00:16:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:16:40] [INFO ] Added : 26 causal constraints over 6 iterations in 53 ms. Result :sat
Minimization took 26 ms.
[2022-05-18 00:16:40] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:16:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:40] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:16:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:16:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:16:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:16:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:40] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-18 00:16:40] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:16:40] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2022-05-18 00:16:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-05-18 00:16:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-18 00:16:41] [INFO ] Added : 61 causal constraints over 13 iterations in 138 ms. Result :sat
Minimization took 40 ms.
[2022-05-18 00:16:41] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:41] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-18 00:16:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:16:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:41] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Nat]Added 9 Read/Feed constraints in 24 ms returned sat
[2022-05-18 00:16:41] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2022-05-18 00:16:41] [INFO ] Deduced a trap composed of 11 places in 13 ms of which 0 ms to minimize.
[2022-05-18 00:16:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 53 ms
[2022-05-18 00:16:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:16:41] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2022-05-18 00:16:41] [INFO ] Deduced a trap composed of 31 places in 17 ms of which 1 ms to minimize.
[2022-05-18 00:16:41] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2022-05-18 00:16:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 111 ms
[2022-05-18 00:16:41] [INFO ] Added : 62 causal constraints over 13 iterations in 203 ms. Result :sat
Minimization took 23 ms.
[2022-05-18 00:16:41] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 1 ms returned unsat
[2022-05-18 00:16:41] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:41] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-18 00:16:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:16:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:41] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Nat]Added 9 Read/Feed constraints in 6 ms returned sat
[2022-05-18 00:16:41] [INFO ] Deduced a trap composed of 28 places in 21 ms of which 1 ms to minimize.
[2022-05-18 00:16:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-18 00:16:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:16:41] [INFO ] Added : 63 causal constraints over 13 iterations in 104 ms. Result :sat
Minimization took 33 ms.
[2022-05-18 00:16:41] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:41] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:16:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:16:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:41] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-18 00:16:41] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:16:41] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
[2022-05-18 00:16:41] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 0 ms to minimize.
[2022-05-18 00:16:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 47 ms
[2022-05-18 00:16:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 00:16:42] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 1 ms to minimize.
[2022-05-18 00:16:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-18 00:16:42] [INFO ] Added : 62 causal constraints over 13 iterations in 163 ms. Result :sat
Minimization took 26 ms.
[2022-05-18 00:16:42] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:16:42] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:42] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:16:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:16:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:16:42] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:16:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:16:42] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:16:42] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-18 00:16:42] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 5 ms to minimize.
[2022-05-18 00:16:42] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2022-05-18 00:16:42] [INFO ] Deduced a trap composed of 22 places in 17 ms of which 0 ms to minimize.
[2022-05-18 00:16:42] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 0 ms to minimize.
[2022-05-18 00:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 126 ms
Current structural bounds on expressions (after SMT) : [30, 4, 150, 8, 1, 1, 8, 30, 38, 8, 10, 2, 4, 7]
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2022-05-18 00:16:42] [INFO ] Unfolded HLPN to a Petri net with 792 places and 2100 transitions in 21 ms.
[2022-05-18 00:16:42] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_8443685741582104046.dot
Incomplete random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :26
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :21
[2022-05-18 00:16:42] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 792 cols
[2022-05-18 00:16:42] [INFO ] Computed 58 place invariants in 130 ms
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 28 ms returned unsat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 30 ms returned unsat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 29 ms returned unsat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 24 ms returned unsat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 25 ms returned unsat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 34 ms returned unsat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 44 ms returned unsat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 25 ms returned unsat
[2022-05-18 00:16:43] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2022-05-18 00:16:44] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 35 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 2, 4, 1, 1, 4, 4, 1, 1] Max seen :[4, 2, 4, 1, 1, 4, 4, 1, 1]
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652833005265

--------------------
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="PolyORBLF-COL-S04J06T08"
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 PolyORBLF-COL-S04J06T08, 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 r179-tall-165277026900196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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