MCC'2023- Execution of r543-tall-167987257300051

About the Execution of 2022-gold for PGCD-COL-D03N050

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1144.695	65665.00	72747.00	295.70	202 204 202 204 202 204 204 202 204 204 204 204 204 204 204 204	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r543-tall-167987257300051.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is PGCD-COL-D03N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r543-tall-167987257300051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 7.2K Mar 23 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 7 12:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 7 12:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 7 12:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 12:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 11K Mar 31 16:48 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 PGCD-COL-D03N050-UpperBounds-00
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-01
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-02
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-03
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-04
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-05
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-06
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-07
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-08
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-09
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-10
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-11
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-12
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-13
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-14
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680938836713

Running Version 202205111006
[2023-04-08 07:27:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-08 07:27:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:27:17] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-08 07:27:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-08 07:27:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 509 ms
[2023-04-08 07:27:18] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 12 PT places and 12.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-04-08 07:27:18] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 5 ms.
[2023-04-08 07:27:18] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 3 rows 3 cols
[2023-04-08 07:27:18] [INFO ] Computed 2 place invariants in 9 ms
// Phase 1: matrix 3 rows 3 cols
[2023-04-08 07:27:18] [INFO ] Computed 2 place invariants in 0 ms
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-04-08 07:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-04-08 07:27:18] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:18] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:27:18] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:27:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:18] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 2 ms.
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:27:18] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:18] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:27:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:27:18] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:27:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:27:18] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:27:18] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:18] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:27:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:27:18] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:27:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:18] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:27:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:27:18] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:18] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:27:18] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:27:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:27:19] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 1 ms.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:27:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:19] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 2 ms.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-04-08 07:27:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:27:19] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:27:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:27:19] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Minimization took 2 ms.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:27:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:19] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 1 ms.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:27:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:19] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:27:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:19] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:27:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:27:19] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 2 ms.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:27:19] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [204, 204, 204, 204, 204, 204, 204, 204, 204, 204, 204, 204, 204, 204, 204, 204]
Arc [0:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2023-04-08 07:27:19] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 56 arcs in 8 ms.
[2023-04-08 07:27:19] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Incomplete random walk after 10015 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=770 ) properties (out of 16) seen :2128
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :856
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :3248
FORMULA PGCD-COL-D03N050-UpperBounds-15 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-14 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-13 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-12 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-11 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-10 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-09 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-08 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-06 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-05 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-03 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-01 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :808
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :808
// Phase 1: matrix 12 rows 12 cols
[2023-04-08 07:27:19] [INFO ] Computed 5 place invariants in 5 ms
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:27:19] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:27:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:19] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:19] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:27:19] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:19] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:19] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:27:19] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:19] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:27:19] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:19] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:27:19] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:19] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:27:19] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [204, 204, 204, 204] Max seen :[202, 202, 202, 202]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 6 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-08 07:27:19] [INFO ] Computed 5 place invariants in 0 ms
[2023-04-08 07:27:19] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 12/12 transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-08 07:27:19] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000026 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=3571 ) properties (out of 4) seen :808
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=2695 ) properties (out of 4) seen :808
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=2695 ) properties (out of 4) seen :808
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=3030 ) properties (out of 4) seen :808
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=3484 ) properties (out of 4) seen :808
// Phase 1: matrix 12 rows 12 cols
[2023-04-08 07:27:21] [INFO ] Computed 5 place invariants in 2 ms
[2023-04-08 07:27:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:21] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:27:21] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:21] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:27:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:21] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:27:21] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:21] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 14 ms.
[2023-04-08 07:27:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:21] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:27:21] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:21] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:21] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-08 07:27:21] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2023-04-08 07:27:21] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:21] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:21] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:21] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:21] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:27:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:21] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:21] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:21] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:21] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:21] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [204, 204, 204, 204] Max seen :[202, 202, 202, 202]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 12/12 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-08 07:27:21] [INFO ] Computed 5 place invariants in 1 ms
[2023-04-08 07:27:21] [INFO ] Implicit Places using invariants in 22 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 23 ms to find 4 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 8/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8/12 places, 12/12 transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:21] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000069 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=7634 ) properties (out of 4) seen :808
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=3875 ) properties (out of 4) seen :808
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=4000 ) properties (out of 4) seen :808
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=3921 ) properties (out of 4) seen :808
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=3952 ) properties (out of 4) seen :808
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:22] [INFO ] Computed 1 place invariants in 2 ms
[2023-04-08 07:27:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:22] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-04-08 07:27:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:27:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:22] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:22] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:22] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 5 ms.
[2023-04-08 07:27:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:27:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:22] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:22] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:22] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:27:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:27:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:27:22] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:22] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:27:22] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:27:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:23] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:27:23] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:27:23] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:23] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [204, 204, 204, 204] Max seen :[202, 202, 202, 202]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 12/12 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:27:23] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:23] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:27:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:23] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-04-08 07:27:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:23] [INFO ] Computed 1 place invariants in 2 ms
[2023-04-08 07:27:23] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 12/12 transitions.
Starting property specific reduction for PGCD-COL-D03N050-UpperBounds-00
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:23] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 10052 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3350 ) properties (out of 1) seen :202
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :202
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:27:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:23] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:23] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:27:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:23] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:23] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:23] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [816] Max seen :[202]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:27:23] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 12/12 transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:23] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000014 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=7936 ) properties (out of 1) seen :202
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=4273 ) properties (out of 1) seen :202
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:23] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:27:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:23] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:27:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:23] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:27:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:23] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:23] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:23] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [816] Max seen :[202]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 12/12 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:23] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:27:23] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:27:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:23] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-04-08 07:27:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:23] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:27:23] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 12/12 transitions.
Ending property specific reduction for PGCD-COL-D03N050-UpperBounds-00 in 595 ms.
Starting property specific reduction for PGCD-COL-D03N050-UpperBounds-02
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:23] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 10031 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5015 ) properties (out of 1) seen :202
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :202
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:27:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:23] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:23] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:23] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2023-04-08 07:27:23] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:27:23] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [816] Max seen :[202]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:27:23] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 12/12 transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:23] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000028 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=8196 ) properties (out of 1) seen :202
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=4366 ) properties (out of 1) seen :202
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:27:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:27:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:24] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:24] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:27:24] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [816] Max seen :[202]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 12/12 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:27:24] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:27:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:24] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-04-08 07:27:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:27:24] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 12/12 transitions.
Ending property specific reduction for PGCD-COL-D03N050-UpperBounds-02 in 580 ms.
Starting property specific reduction for PGCD-COL-D03N050-UpperBounds-04
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 10043 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3347 ) properties (out of 1) seen :202
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :202
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:27:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:27:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:24] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:24] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:24] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [816] Max seen :[202]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:27:24] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 12/12 transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000061 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=8264 ) properties (out of 1) seen :202
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=4310 ) properties (out of 1) seen :202
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:27:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:24] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:24] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:27:24] [INFO ] Added : 1 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [816] Max seen :[202]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 12/12 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:27:24] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:27:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:24] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-04-08 07:27:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:27:24] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 12/12 transitions.
Ending property specific reduction for PGCD-COL-D03N050-UpperBounds-04 in 579 ms.
Starting property specific reduction for PGCD-COL-D03N050-UpperBounds-07
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :202
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :202
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:27:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:24] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:27:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:27:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:27:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:24] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:24] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:27:24] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [816] Max seen :[202]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:27:24] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 12/12 transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:24] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000040 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=8064 ) properties (out of 1) seen :202
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=4329 ) properties (out of 1) seen :202
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:27:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:25] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:25] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:27:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:27:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:27:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:25] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:27:25] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:27:25] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [816] Max seen :[202]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 12/12 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:27:25] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:27:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 07:27:25] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-04-08 07:27:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 8 cols
[2023-04-08 07:27:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:27:25] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 12/12 transitions.
Ending property specific reduction for PGCD-COL-D03N050-UpperBounds-07 in 587 ms.
[2023-04-08 07:27:25] [INFO ] Flatten gal took : 14 ms
[2023-04-08 07:27:25] [INFO ] Applying decomposition
[2023-04-08 07:27:25] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11276937502135528330.txt' '-o' '/tmp/graph11276937502135528330.bin' '-w' '/tmp/graph11276937502135528330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11276937502135528330.bin' '-l' '-1' '-v' '-w' '/tmp/graph11276937502135528330.weights' '-q' '0' '-e' '0.001'
[2023-04-08 07:27:25] [INFO ] Decomposing Gal with order
[2023-04-08 07:27:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-08 07:27:25] [INFO ] Flatten gal took : 17 ms
[2023-04-08 07:27:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-04-08 07:27:25] [INFO ] Time to serialize gal into /tmp/UpperBounds3367653887704772151.gal : 1 ms
[2023-04-08 07:27:25] [INFO ] Time to serialize properties into /tmp/UpperBounds3670007579697301605.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3367653887704772151.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3670007579697301605.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds3670007579697301605.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,4.17215e+11,55.8913,772548,2,2681,5,2.43338e+06,6,0,59,2.43383e+06,0
Total reachable state count : 417214571243

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property PGCD-COL-D03N050-UpperBounds-00 :0 <= gu2.p1_0+gu3.p1_1+gu0.p1_2+gu1.p1_3 <= 202
FORMULA PGCD-COL-D03N050-UpperBounds-00 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-COL-D03N050-UpperBounds-00,0,56.5807,772548,1,0,7,2.43338e+06,9,1,881,2.43383e+06,4
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property PGCD-COL-D03N050-UpperBounds-02 :0 <= gu2.p1_0+gu3.p1_1+gu0.p1_2+gu1.p1_3 <= 202
FORMULA PGCD-COL-D03N050-UpperBounds-02 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-COL-D03N050-UpperBounds-02,0,56.5844,772548,1,0,7,2.43338e+06,9,1,881,2.43383e+06,4
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property PGCD-COL-D03N050-UpperBounds-04 :0 <= gu2.p1_0+gu3.p1_1+gu0.p1_2+gu1.p1_3 <= 202
FORMULA PGCD-COL-D03N050-UpperBounds-04 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-COL-D03N050-UpperBounds-04,0,56.5878,772548,1,0,7,2.43338e+06,9,1,881,2.43383e+06,4
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property PGCD-COL-D03N050-UpperBounds-07 :0 <= gu2.p1_0+gu3.p1_1+gu0.p1_2+gu1.p1_3 <= 202
FORMULA PGCD-COL-D03N050-UpperBounds-07 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-COL-D03N050-UpperBounds-07,0,56.591,772548,1,0,7,2.43338e+06,9,1,881,2.43383e+06,4
Total runtime 64477 ms.

BK_STOP 1680938902378

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PGCD-COL-D03N050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is PGCD-COL-D03N050, 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 r543-tall-167987257300051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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