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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 8.1K Apr 29 13:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 13:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 13:51 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:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:27 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-S02J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652832403787

Running Version 0
[2022-05-18 00:06:45] [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:06:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:06:45] [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:06:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 00:06:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 665 ms
[2022-05-18 00:06:46] [INFO ] ms1 symmetric to ms2 in transition T_1124
[2022-05-18 00:06:46] [INFO ] ms1 symmetric to ms2 in transition T_1125
[2022-05-18 00:06:46] [INFO ] ms2 symmetric to ms3 in transition T_1125
[2022-05-18 00:06:46] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2022-05-18 00:06:46] [INFO ] ms4 symmetric to ms2 in transition T_1126
[2022-05-18 00:06:46] [INFO ] ms2 symmetric to ms3 in transition T_1126
[2022-05-18 00:06:46] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 61 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2022-05-18 00:06:46] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions in 4 ms.
[2022-05-18 00:06:46] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_17857034314883612063.dot
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 00:06:46] [INFO ] Computed 26 place invariants in 10 ms
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-18 00:06:46] [INFO ] Unfolded HLPN to a Petri net with 476 places and 824 transitions in 18 ms.
[2022-05-18 00:06:46] [INFO ] Unfolded HLPN properties in 0 ms.
[2022-05-18 00:06:46] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 00:06:46] [INFO ] Computed 26 place invariants in 11 ms
[2022-05-18 00:06:46] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-05-18 00:06:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2022-05-18 00:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:46] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-05-18 00:06:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:06:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:06:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:46] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-18 00:06:46] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-18 00:06:46] [INFO ] [Nat]Added 9 Read/Feed constraints in 5 ms returned sat
[2022-05-18 00:06:46] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 3 ms to minimize.
[2022-05-18 00:06:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-05-18 00:06:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 00:06:46] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2022-05-18 00:06:46] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 1 ms to minimize.
[2022-05-18 00:06:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2022-05-18 00:06:46] [INFO ] Added : 60 causal constraints over 12 iterations in 281 ms. Result :sat
Minimization took 27 ms.
[2022-05-18 00:06:46] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:06:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 00:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:46] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-05-18 00:06:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:06:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:06:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:46] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2022-05-18 00:06:46] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:06:46] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2022-05-18 00:06:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-18 00:06:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:06:47] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 1 ms to minimize.
[2022-05-18 00:06:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2022-05-18 00:06:47] [INFO ] Added : 63 causal constraints over 14 iterations in 157 ms. Result :sat
Minimization took 24 ms.
[2022-05-18 00:06:47] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:06:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:06:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:47] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:06:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:06:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:06:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:47] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-18 00:06:47] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:06:47] [INFO ] Deduced a trap composed of 32 places in 23 ms of which 0 ms to minimize.
[2022-05-18 00:06:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-18 00:06:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 00:06:47] [INFO ] Added : 47 causal constraints over 10 iterations in 110 ms. Result :sat
Minimization took 35 ms.
[2022-05-18 00:06:47] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:06:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:06:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:47] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:06:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2022-05-18 00:06:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:06:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:47] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2022-05-18 00:06:47] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:06:47] [INFO ] Deduced a trap composed of 18 places in 12 ms of which 0 ms to minimize.
[2022-05-18 00:06:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-18 00:06:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 00:06:47] [INFO ] Added : 63 causal constraints over 14 iterations in 119 ms. Result :sat
Minimization took 21 ms.
[2022-05-18 00:06:47] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:06:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:06:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:47] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:06:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:06:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:06:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:47] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:06:47] [INFO ] [Nat]Added 9 Read/Feed constraints in 46 ms returned sat
[2022-05-18 00:06:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-18 00:06:48] [INFO ] Added : 63 causal constraints over 14 iterations in 137 ms. Result :sat
Minimization took 20 ms.
[2022-05-18 00:06:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 1 ms returned unsat
[2022-05-18 00:06:48] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:48] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:06:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:48] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-18 00:06:48] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2022-05-18 00:06:48] [INFO ] Deduced a trap composed of 31 places in 16 ms of which 0 ms to minimize.
[2022-05-18 00:06:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 53 ms
[2022-05-18 00:06:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 00:06:48] [INFO ] Added : 57 causal constraints over 12 iterations in 118 ms. Result :sat
Minimization took 22 ms.
[2022-05-18 00:06:48] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:48] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-18 00:06:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:48] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:06:48] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2022-05-18 00:06:48] [INFO ] Deduced a trap composed of 16 places in 12 ms of which 0 ms to minimize.
[2022-05-18 00:06:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 47 ms
[2022-05-18 00:06:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:06:48] [INFO ] Added : 62 causal constraints over 13 iterations in 114 ms. Result :sat
Minimization took 23 ms.
[2022-05-18 00:06:48] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:48] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:06:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:48] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-05-18 00:06:48] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:06:48] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2022-05-18 00:06:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-18 00:06:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:06:48] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
[2022-05-18 00:06:49] [INFO ] Deduced a trap composed of 34 places in 20 ms of which 1 ms to minimize.
[2022-05-18 00:06:49] [INFO ] Deduced a trap composed of 34 places in 19 ms of which 1 ms to minimize.
[2022-05-18 00:06:49] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2022-05-18 00:06:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 129 ms
[2022-05-18 00:06:49] [INFO ] Added : 61 causal constraints over 13 iterations in 224 ms. Result :sat
Minimization took 25 ms.
[2022-05-18 00:06:49] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:06:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:06:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:49] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-18 00:06:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:06:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:06:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:49] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-18 00:06:49] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:06:49] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 0 ms to minimize.
[2022-05-18 00:06:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-18 00:06:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:06:49] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2022-05-18 00:06:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-18 00:06:49] [INFO ] Added : 63 causal constraints over 13 iterations in 150 ms. Result :sat
Minimization took 24 ms.
[2022-05-18 00:06:49] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:06:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:06:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:49] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:06:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:06:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:06:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:49] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:06:49] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:06:49] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2022-05-18 00:06:49] [INFO ] Deduced a trap composed of 28 places in 19 ms of which 1 ms to minimize.
[2022-05-18 00:06:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 58 ms
[2022-05-18 00:06:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 00:06:49] [INFO ] Added : 24 causal constraints over 5 iterations in 97 ms. Result :sat
Minimization took 98 ms.
[2022-05-18 00:06:49] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:06:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:06:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:49] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-18 00:06:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:06:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2022-05-18 00:06:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:49] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-18 00:06:49] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-18 00:06:49] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2022-05-18 00:06:49] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2022-05-18 00:06:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2022-05-18 00:06:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 133 ms
[2022-05-18 00:06:50] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:06:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:06:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:50] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-18 00:06:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:06:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:06:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:50] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2022-05-18 00:06:50] [INFO ] [Nat]Added 9 Read/Feed constraints in 23 ms returned sat
[2022-05-18 00:06:50] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 1 ms to minimize.
[2022-05-18 00:06:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-18 00:06:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-18 00:06:50] [INFO ] Added : 63 causal constraints over 13 iterations in 123 ms. Result :sat
Minimization took 80 ms.
[2022-05-18 00:06:50] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:06:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:06:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:50] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-18 00:06:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:06:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:06:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:50] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:06:50] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-18 00:06:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 00:06:50] [INFO ] Added : 44 causal constraints over 9 iterations in 101 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 6, 6, 3, 10, 6, 6, 6, 2, 20, 5, 3, 2]
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2022-05-18 00:06:50] [INFO ] Unfolded HLPN to a Petri net with 476 places and 824 transitions in 11 ms.
[2022-05-18 00:06:50] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_12343901049483622426.dot
Incomplete random walk after 10000 steps, including 4 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :14
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :14
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :14
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :15
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :14
[2022-05-18 00:06:51] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2022-05-18 00:06:51] [INFO ] Computed 46 place invariants in 45 ms
[2022-05-18 00:06:51] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-18 00:06:51] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 16 ms returned unsat
[2022-05-18 00:06:51] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-18 00:06:51] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 16 ms returned unsat
[2022-05-18 00:06:51] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-18 00:06:51] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 20 ms returned sat
[2022-05-18 00:06:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:51] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2022-05-18 00:06:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-18 00:06:51] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 20 ms returned sat
[2022-05-18 00:06:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:52] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2022-05-18 00:06:52] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-18 00:06:52] [INFO ] [Nat]Added 78 Read/Feed constraints in 191 ms returned sat
[2022-05-18 00:06:52] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 0 ms to minimize.
[2022-05-18 00:06:53] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 0 ms to minimize.
[2022-05-18 00:06:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 524 ms
[2022-05-18 00:06:53] [INFO ] [Real]Absence check using 12 positive place invariants in 23 ms returned sat
[2022-05-18 00:06:53] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 16 ms returned unsat
[2022-05-18 00:06:53] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-18 00:06:53] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 21 ms returned unsat
[2022-05-18 00:06:53] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-18 00:06:53] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 17 ms returned unsat
[2022-05-18 00:06:53] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-05-18 00:06:53] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 17 ms returned unsat
[2022-05-18 00:06:53] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-18 00:06:53] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 16 ms returned unsat
[2022-05-18 00:06:53] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-18 00:06:53] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 17 ms returned unsat
[2022-05-18 00:06:53] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-18 00:06:53] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 21 ms returned sat
[2022-05-18 00:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:53] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2022-05-18 00:06:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-18 00:06:54] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 20 ms returned sat
[2022-05-18 00:06:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:54] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2022-05-18 00:06:54] [INFO ] [Nat]Added 78 Read/Feed constraints in 249 ms returned sat
[2022-05-18 00:06:54] [INFO ] Deduced a trap composed of 65 places in 33 ms of which 0 ms to minimize.
[2022-05-18 00:06:55] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2022-05-18 00:06:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 877 ms
[2022-05-18 00:06:55] [INFO ] Computed and/alt/rep : 558/1858/552 causal constraints (skipped 258 transitions) in 58 ms.
[2022-05-18 00:06:58] [INFO ] Added : 250 causal constraints over 50 iterations in 3546 ms. Result :unknown
[2022-05-18 00:06:59] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2022-05-18 00:06:59] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 23 ms returned sat
[2022-05-18 00:06:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:59] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2022-05-18 00:06:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:06:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-18 00:06:59] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 21 ms returned sat
[2022-05-18 00:06:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:06:59] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2022-05-18 00:07:00] [INFO ] [Nat]Added 78 Read/Feed constraints in 195 ms returned sat
[2022-05-18 00:07:00] [INFO ] Deduced a trap composed of 228 places in 154 ms of which 1 ms to minimize.
[2022-05-18 00:07:00] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2022-05-18 00:07:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 898 ms
[2022-05-18 00:07:01] [INFO ] Computed and/alt/rep : 558/1858/552 causal constraints (skipped 258 transitions) in 57 ms.
[2022-05-18 00:07:04] [INFO ] Deduced a trap composed of 178 places in 181 ms of which 0 ms to minimize.
[2022-05-18 00:07:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 00:07:04] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-05-18 00:07:04] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 20 ms returned sat
[2022-05-18 00:07:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:07:04] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2022-05-18 00:07:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:07:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-18 00:07:04] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 18 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 5, 1, 1, 1, 1, 1, 1, 20, 3, 1] Max seen :[1, 1, 5, 1, 1, 1, 1, 1, 1, 2, 0, 1]
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 203300 steps, including 1002 resets, run finished after 472 ms. (steps per millisecond=430 ) properties (out of 2) seen :2 could not realise parikh vector
Support contains 12 out of 476 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 474 transition count 776
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 426 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 98 place count 426 transition count 728
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 194 place count 378 transition count 728
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 290 place count 330 transition count 680
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 296 place count 330 transition count 674
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 302 place count 324 transition count 674
Applied a total of 302 rules in 141 ms. Remains 324 /476 variables (removed 152) and now considering 674/824 (removed 150) transitions.
[2022-05-18 00:07:05] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
// Phase 1: matrix 662 rows 324 cols
[2022-05-18 00:07:05] [INFO ] Computed 44 place invariants in 26 ms
[2022-05-18 00:07:05] [INFO ] Dead Transitions using invariants and state equation in 304 ms returned [592, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 606, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 620, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 634, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 648, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 662, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673]
Found 66 dead transitions using SMT.
Drop transitions removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions :[673, 672, 671, 670, 669, 668, 667, 666, 665, 664, 662, 659, 658, 657, 656, 655, 654, 653, 652, 651, 650, 648, 645, 644, 643, 642, 641, 640, 639, 638, 637, 636, 634, 631, 630, 629, 628, 627, 626, 625, 624, 623, 622, 620, 617, 616, 615, 614, 613, 612, 611, 610, 609, 608, 606, 603, 602, 601, 600, 599, 598, 597, 596, 595, 594, 592]
Starting structural reductions, iteration 1 : 324/476 places, 608/824 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 596
Reduce places removed 6 places and 12 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 8 place count 316 transition count 584
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 8 rules in 32 ms. Remains 316 /324 variables (removed 8) and now considering 584/608 (removed 24) transitions.
Finished structural reductions, in 2 iterations. Remains : 316/476 places, 584/824 transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 572 out of 584 initially.
// Phase 1: matrix 572 rows 310 cols
[2022-05-18 00:07:05] [INFO ] Computed 44 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 528 resets, run finished after 2498 ms. (steps per millisecond=400 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 227 resets, run finished after 1297 ms. (steps per millisecond=771 ) properties (out of 1) seen :2
[2022-05-18 00:07:09] [INFO ] Flow matrix only has 572 transitions (discarded 12 similar events)
// Phase 1: matrix 572 rows 310 cols
[2022-05-18 00:07:09] [INFO ] Computed 44 place invariants in 17 ms
[2022-05-18 00:07:09] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:07:09] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 3] Max seen :[2, 0]
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652832430760

--------------------
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-S02J04T06"
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-S02J04T06, 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-165277026900166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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