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

About the Execution of 2022-gold for PGCD-PT-D02N005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
442.512 9615.00 16585.00 80.30 16 18 18 18 18 18 16 16 18 18 18 16 18 16 18 18 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-167987257300055.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-PT-D02N005, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r543-tall-167987257300055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 8.2K Mar 23 15:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 23 15:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 23 15:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 7 12:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 7 12:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 7 12:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 19K Mar 23 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 220K Mar 23 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 23 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Mar 23 15:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 5.6K 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-PT-D02N005-UpperBounds-00
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-01
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-02
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-03
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-04
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-05
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-06
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-07
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-08
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-09
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-10
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-11
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-12
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-13
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-14
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680938958708

Running Version 202205111006
[2023-04-08 07:29:19] [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:29:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:29:19] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-04-08 07:29:19] [INFO ] Transformed 9 places.
[2023-04-08 07:29:19] [INFO ] Transformed 9 transitions.
[2023-04-08 07:29:19] [INFO ] Parsed PT model containing 9 places and 9 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 9 rows 9 cols
[2023-04-08 07:29:19] [INFO ] Computed 4 place invariants in 11 ms
Incomplete random walk after 10012 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :210
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :69
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :68
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :93
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :97
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :89
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :89
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :57
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :72
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :115
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :101
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :95
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :72
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :115
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :69
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :93
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :83
// Phase 1: matrix 9 rows 9 cols
[2023-04-08 07:29:20] [INFO ] Computed 4 place invariants in 2 ms
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-04-08 07:29:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:29:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:29:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
[2023-04-08 07:29:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-08 07:29:20] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:29:20] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:29:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:29:20] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:29:20] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-04-08 07:29:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:29:20] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:20] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 8 ms.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:29:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:20] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:20] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:29:20] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:20] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-04-08 07:29:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-04-08 07:29:20] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-08 07:29:20] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-04-08 07:29:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 14 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:29:20] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:29:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:29:20] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:20] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 13 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:29:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:20] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:29:20] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:21] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:21] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:21] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:29:21] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:29:21] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:21] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:29:21] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:21] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:21] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:21] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:29:21] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:21] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-04-08 07:29:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-04-08 07:29:21] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:21] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:21] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:21] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:21] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:21] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:29:21] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:21] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18] Max seen :[12, 14, 14, 16, 14, 14, 12, 14, 16, 16, 14, 14, 16, 12, 14, 16]
FORMULA PGCD-PT-D02N005-UpperBounds-15 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-12 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-09 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-08 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-03 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-14 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-10 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-04 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-02 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-05 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-01 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-08 07:29:21] [INFO ] Computed 4 place invariants in 0 ms
[2023-04-08 07:29:21] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 9/9 transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-08 07:29:21] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 11 resets, run finished after 340 ms. (steps per millisecond=2941 ) properties (out of 5) seen :80
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=4347 ) properties (out of 5) seen :39
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=3472 ) properties (out of 5) seen :32
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=3846 ) properties (out of 5) seen :39
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=4651 ) properties (out of 5) seen :39
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=4854 ) properties (out of 5) seen :39
// Phase 1: matrix 9 rows 9 cols
[2023-04-08 07:29:23] [INFO ] Computed 4 place invariants in 1 ms
[2023-04-08 07:29:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:23] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:29:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:23] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:29:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2023-04-08 07:29:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-04-08 07:29:23] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:23] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:29:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:23] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:29:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:23] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:29:23] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:29:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:23] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:23] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:29:23] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:23] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:29:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:23] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:23] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:23] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:29:23] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:23] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:23] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:23] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2023-04-08 07:29:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-08 07:29:23] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29: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) : [18, 18, 18, 18, 18] Max seen :[16, 16, 16, 16, 16]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 9/9 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-08 07:29:23] [INFO ] Computed 4 place invariants in 1 ms
[2023-04-08 07:29:23] [INFO ] Implicit Places using invariants in 25 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6/9 places, 9/9 transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:23] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000005 steps, including 13 resets, run finished after 289 ms. (steps per millisecond=3460 ) properties (out of 5) seen :80
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=4926 ) properties (out of 5) seen :39
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=5434 ) properties (out of 5) seen :32
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=5464 ) properties (out of 5) seen :39
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=5434 ) properties (out of 5) seen :39
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=5555 ) properties (out of 5) seen :39
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:24] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:29:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:29:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:24] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:29:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:24] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:29:24] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:24] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:29:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:24] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:29:24] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:29:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-04-08 07:29:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2023-04-08 07:29:24] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:29:24] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:29:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:24] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:24] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:29:24] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:29:24] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:24] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:29:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:24] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:24] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:24] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:24] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:29:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:24] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:24] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:29:24] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:24] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [18, 18, 18, 18, 18] Max seen :[16, 16, 16, 16, 16]
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:24] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:29:24] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:24] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:29:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:24] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-04-08 07:29:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:24] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
Starting property specific reduction for PGCD-PT-D02N005-UpperBounds-00
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:25] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 10004 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2501 ) properties (out of 1) seen :12
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 :12
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:29:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:25] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:29:25] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:25] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:25] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:25] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29: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) : [18] Max seen :[12]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:29:25] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:25] [INFO ] Computed 1 place invariants in 2 ms
Incomplete random walk after 1000005 steps, including 11 resets, run finished after 166 ms. (steps per millisecond=6024 ) properties (out of 1) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=5586 ) properties (out of 1) seen :12
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:29:25] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:25] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:25] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:25] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:25] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[16]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:25] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:25] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-04-08 07:29:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:29:25] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
Ending property specific reduction for PGCD-PT-D02N005-UpperBounds-00 in 559 ms.
Starting property specific reduction for PGCD-PT-D02N005-UpperBounds-06
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:25] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :13
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :12
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:25] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:29:25] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:29:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:25] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:29:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-04-08 07:29:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-08 07:29:25] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:25] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[13]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:25] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:25] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000005 steps, including 10 resets, run finished after 163 ms. (steps per millisecond=6135 ) properties (out of 1) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=6097 ) properties (out of 1) seen :12
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:29:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:29:26] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:26] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:29:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-04-08 07:29:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2023-04-08 07:29:26] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:26] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[16]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:26] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:26] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-08 07:29:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:26] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
Ending property specific reduction for PGCD-PT-D02N005-UpperBounds-06 in 622 ms.
Starting property specific reduction for PGCD-PT-D02N005-UpperBounds-07
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :8
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 :12
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:29:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:26] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:26] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:26] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:29:26] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:26] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[12]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:26] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000004 steps, including 12 resets, run finished after 165 ms. (steps per millisecond=6060 ) properties (out of 1) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=6060 ) properties (out of 1) seen :12
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:29:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:26] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:29:26] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:26] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:29:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:29:26] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-08 07:29:26] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[16]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:26] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:29:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:26] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-04-08 07:29:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:29:26] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
Ending property specific reduction for PGCD-PT-D02N005-UpperBounds-07 in 567 ms.
Starting property specific reduction for PGCD-PT-D02N005-UpperBounds-11
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 1) seen :10
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 :12
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:26] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:26] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:26] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:29:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:29:26] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:26] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[12]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:26] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:26] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000001 steps, including 6 resets, run finished after 166 ms. (steps per millisecond=6024 ) properties (out of 1) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=5988 ) properties (out of 1) seen :12
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:27] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:29:27] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:27] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:29:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:27] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:29:27] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[16]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:27] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:27] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:29:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:27] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-04-08 07:29:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:27] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
Ending property specific reduction for PGCD-PT-D02N005-UpperBounds-11 in 554 ms.
Starting property specific reduction for PGCD-PT-D02N005-UpperBounds-13
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:27] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :12
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 :12
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:27] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:29:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:27] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:29:27] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:27] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:29:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:29:27] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:27] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[12]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:27] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:27] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 10 resets, run finished after 167 ms. (steps per millisecond=5988 ) properties (out of 1) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=6024 ) properties (out of 1) seen :12
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:27] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:29:27] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:29:27] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:29:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:29:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:29:27] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:29:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-04-08 07:29:27] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:29:27] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[16]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:27] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:29:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:29:27] [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:29:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:29:27] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:29:27] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 9/9 transitions.
Ending property specific reduction for PGCD-PT-D02N005-UpperBounds-13 in 562 ms.
[2023-04-08 07:29:28] [INFO ] Flatten gal took : 14 ms
[2023-04-08 07:29:28] [INFO ] Applying decomposition
[2023-04-08 07:29:28] [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/graph17163545174617463190.txt' '-o' '/tmp/graph17163545174617463190.bin' '-w' '/tmp/graph17163545174617463190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17163545174617463190.bin' '-l' '-1' '-v' '-w' '/tmp/graph17163545174617463190.weights' '-q' '0' '-e' '0.001'
[2023-04-08 07:29:28] [INFO ] Decomposing Gal with order
[2023-04-08 07:29:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-08 07:29:28] [INFO ] Flatten gal took : 27 ms
[2023-04-08 07:29:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-04-08 07:29:28] [INFO ] Time to serialize gal into /tmp/UpperBounds3689656803631076897.gal : 1 ms
[2023-04-08 07:29:28] [INFO ] Time to serialize properties into /tmp/UpperBounds4448629141207247585.prop : 0 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/UpperBounds3689656803631076897.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4448629141207247585.prop' '--nowitness'

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...274
Loading property file /tmp/UpperBounds4448629141207247585.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\_flat,8484,0.033199,4288,88,58,1023,615,26,1413,19,1504,0
Total reachable state count : 8484

Verifying 5 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 16
Bounds property PGCD-PT-D02N005-UpperBounds-00 :0 <= u1.p1_2 <= 16
FORMULA PGCD-PT-D02N005-UpperBounds-00 16 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-PT-D02N005-UpperBounds-00,0,0.039821,4288,1,0,1023,615,44,1787,43,2597,62
Min sum of variable value : 0
Maximum sum along a path : 16
Bounds property PGCD-PT-D02N005-UpperBounds-06 :0 <= u0.p1_1 <= 16
FORMULA PGCD-PT-D02N005-UpperBounds-06 16 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-PT-D02N005-UpperBounds-06,0,0.040281,4288,1,0,1023,634,51,1860,43,2689,69
Min sum of variable value : 0
Maximum sum along a path : 16
Bounds property PGCD-PT-D02N005-UpperBounds-07 :0 <= u2.p1_3 <= 16
FORMULA PGCD-PT-D02N005-UpperBounds-07 16 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-PT-D02N005-UpperBounds-07,0,0.046486,4288,1,0,1124,918,57,3080,43,3870,122
Min sum of variable value : 0
Maximum sum along a path : 16
Bounds property PGCD-PT-D02N005-UpperBounds-11 :0 <= u2.p1_3 <= 16
FORMULA PGCD-PT-D02N005-UpperBounds-11 16 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-PT-D02N005-UpperBounds-11,0,0.04656,4288,1,0,1124,918,57,3080,43,3870,122
Min sum of variable value : 0
Maximum sum along a path : 16
Bounds property PGCD-PT-D02N005-UpperBounds-13 :0 <= u1.p1_2 <= 16
FORMULA PGCD-PT-D02N005-UpperBounds-13 16 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-PT-D02N005-UpperBounds-13,0,0.046606,4288,1,0,1124,918,57,3080,43,3870,122
Total runtime 8436 ms.

BK_STOP 1680938968323

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

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