Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 8.8K Apr 30 03:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 03:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 30 03:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 03:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 94K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652835845073

Running Version 0
[2022-05-18 01:04:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 01:04:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 01:04:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-18 01:04:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 01:04:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 556 ms
[2022-05-18 01:04:08] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2022-05-18 01:04:08] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2022-05-18 01:04:08] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2022-05-18 01:04:08] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2022-05-18 01:04:08] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2022-05-18 01:04:08] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2022-05-18 01:04:08] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2022-05-18 01:04:08] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 3 ms.
[2022-05-18 01:04:08] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_17368414177339675705.dot
// Phase 1: matrix 38 rows 48 cols
[2022-05-18 01:04:08] [INFO ] Computed 13 place invariants in 10 ms
FORMULA PolyORBNT-COL-S05J60-UpperBounds-06 61 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-18 01:04:08] [INFO ] Unfolded HLPN to a Petri net with 969 places and 1375 transitions in 27 ms.
[2022-05-18 01:04:08] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2022-05-18 01:04:08] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-18 01:04:08] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-18 01:04:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-18 01:04:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-18 01:04:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-18 01:04:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:04:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:08] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-05-18 01:04:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:04:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2022-05-18 01:04:08] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
[2022-05-18 01:04:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2022-05-18 01:04:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:04:09] [INFO ] Added : 22 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 54 ms.
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:04:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:09] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:04:09] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 1 ms to minimize.
[2022-05-18 01:04:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-18 01:04:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:04:09] [INFO ] Added : 21 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 20 ms.
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:04:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:09] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:04:09] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 2 ms to minimize.
[2022-05-18 01:04:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-18 01:04:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:04:09] [INFO ] Added : 15 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 9 ms.
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:04:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:04:09] [INFO ] Added : 36 causal constraints over 8 iterations in 51 ms. Result :sat
Minimization took 15 ms.
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:04:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:09] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] Deduced a trap composed of 14 places in 14 ms of which 1 ms to minimize.
[2022-05-18 01:04:09] [INFO ] Deduced a trap composed of 17 places in 13 ms of which 1 ms to minimize.
[2022-05-18 01:04:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 35 ms
[2022-05-18 01:04:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:04:09] [INFO ] Deduced a trap composed of 25 places in 16 ms of which 0 ms to minimize.
[2022-05-18 01:04:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2022-05-18 01:04:09] [INFO ] Added : 36 causal constraints over 8 iterations in 74 ms. Result :sat
Minimization took 16 ms.
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:09] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:04:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:09] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:04:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:04:09] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2022-05-18 01:04:09] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2022-05-18 01:04:09] [INFO ] Deduced a trap composed of 16 places in 13 ms of which 1 ms to minimize.
[2022-05-18 01:04:09] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2022-05-18 01:04:09] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2022-05-18 01:04:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 131 ms
[2022-05-18 01:04:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:04:09] [INFO ] Added : 33 causal constraints over 7 iterations in 130 ms. Result :sat
Minimization took 17 ms.
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-18 01:04:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:10] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:04:10] [INFO ] Deduced a trap composed of 14 places in 15 ms of which 0 ms to minimize.
[2022-05-18 01:04:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2022-05-18 01:04:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-18 01:04:10] [INFO ] Added : 18 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 11 ms.
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:04:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:04:10] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2022-05-18 01:04:10] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2022-05-18 01:04:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 53 ms
[2022-05-18 01:04:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:04:10] [INFO ] Added : 36 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 18 ms.
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:04:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:04:10] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2022-05-18 01:04:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-18 01:04:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:04:10] [INFO ] Added : 18 causal constraints over 4 iterations in 211 ms. Result :sat
Minimization took 149 ms.
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:04:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:04:10] [INFO ] Deduced a trap composed of 13 places in 12 ms of which 0 ms to minimize.
[2022-05-18 01:04:10] [INFO ] Deduced a trap composed of 14 places in 10 ms of which 0 ms to minimize.
[2022-05-18 01:04:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 36 ms
[2022-05-18 01:04:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:04:10] [INFO ] Added : 36 causal constraints over 8 iterations in 60 ms. Result :sat
Minimization took 13 ms.
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:11] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-18 01:04:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:04:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:11] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:04:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:04:11] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2022-05-18 01:04:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-05-18 01:04:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:04:11] [INFO ] Added : 14 causal constraints over 4 iterations in 20 ms. Result :sat
Minimization took 8 ms.
[2022-05-18 01:04:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:04:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:04:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-05-18 01:04:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:11] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:04:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:04:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:04:11] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2022-05-18 01:04:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-18 01:04:11] [INFO ] Added : 36 causal constraints over 8 iterations in 211 ms. Result :sat
Minimization took 72 ms.
[2022-05-18 01:04:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:04:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:11] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-18 01:04:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:04:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:04:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:11] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:04:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:04:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 01:04:11] [INFO ] Added : 13 causal constraints over 4 iterations in 257 ms. Result :sat
Minimization took 162 ms.
Current structural bounds on expressions (after SMT) : [4, 1, 3, 1, -1, 1, 1, 2, -1, 10, -1, 10, 1, -1, 5]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2022-05-18 01:04:11] [INFO ] Unfolded HLPN to a Petri net with 969 places and 1375 transitions in 24 ms.
[2022-05-18 01:04:11] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_4740562515114285671.dot
Deduced a syphon composed of 60 places in 8 ms
Reduce places removed 60 places and 60 transitions.
Incomplete random walk after 10000 steps, including 686 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 13) seen :20
FORMULA PolyORBNT-COL-S05J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 139 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :15
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :15
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :15
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :17
FORMULA PolyORBNT-COL-S05J60-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 10000 steps, including 137 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 246 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :10
[2022-05-18 01:04:12] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2022-05-18 01:04:12] [INFO ] Computed 142 place invariants in 163 ms
[2022-05-18 01:04:12] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-18 01:04:12] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-18 01:04:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:12] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2022-05-18 01:04:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:13] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-18 01:04:13] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2022-05-18 01:04:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:13] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2022-05-18 01:04:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:04:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 315 ms returned sat
[2022-05-18 01:04:13] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 107 ms.
[2022-05-18 01:04:14] [INFO ] Added : 17 causal constraints over 4 iterations in 491 ms. Result :sat
Minimization took 339 ms.
[2022-05-18 01:04:14] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2022-05-18 01:04:14] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-18 01:04:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:15] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2022-05-18 01:04:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:15] [INFO ] [Nat]Absence check using 135 positive place invariants in 34 ms returned sat
[2022-05-18 01:04:15] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned sat
[2022-05-18 01:04:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:16] [INFO ] [Nat]Absence check using state equation in 880 ms returned sat
[2022-05-18 01:04:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2022-05-18 01:04:16] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 73 ms.
[2022-05-18 01:04:16] [INFO ] Added : 9 causal constraints over 2 iterations in 327 ms. Result :sat
Minimization took 630 ms.
[2022-05-18 01:04:17] [INFO ] [Real]Absence check using 135 positive place invariants in 35 ms returned sat
[2022-05-18 01:04:17] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 6 ms returned unsat
[2022-05-18 01:04:17] [INFO ] [Real]Absence check using 135 positive place invariants in 34 ms returned sat
[2022-05-18 01:04:17] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-18 01:04:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:18] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2022-05-18 01:04:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:18] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-18 01:04:18] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 13 ms returned unsat
[2022-05-18 01:04:18] [INFO ] [Real]Absence check using 135 positive place invariants in 34 ms returned sat
[2022-05-18 01:04:18] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 16 ms returned unsat
[2022-05-18 01:04:18] [INFO ] [Real]Absence check using 135 positive place invariants in 34 ms returned sat
[2022-05-18 01:04:18] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2022-05-18 01:04:18] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-18 01:04:18] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2022-05-18 01:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:19] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2022-05-18 01:04:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:19] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-18 01:04:19] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2022-05-18 01:04:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:19] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2022-05-18 01:04:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2022-05-18 01:04:20] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 86 ms.
[2022-05-18 01:04:20] [INFO ] Added : 8 causal constraints over 2 iterations in 340 ms. Result :sat
Minimization took 151 ms.
[2022-05-18 01:04:20] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2022-05-18 01:04:20] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2022-05-18 01:04:20] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2022-05-18 01:04:20] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 1, 1, 4, 1, 1, 1, 4] Max seen :[3, 0, 1, 1, 4, 1, 0, 1, 4]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 1200 steps, including 92 resets, run finished after 10 ms. (steps per millisecond=120 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA PolyORBNT-COL-S05J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1400 steps, including 93 resets, run finished after 6 ms. (steps per millisecond=233 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA PolyORBNT-COL-S05J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 5300 steps, including 294 resets, run finished after 27 ms. (steps per millisecond=196 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 909 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1184
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1181
Applied a total of 273 rules in 256 ms. Remains 770 /909 variables (removed 139) and now considering 1181/1315 (removed 134) transitions.
[2022-05-18 01:04:21] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2022-05-18 01:04:21] [INFO ] Computed 137 place invariants in 104 ms
[2022-05-18 01:04:21] [INFO ] Dead Transitions using invariants and state equation in 844 ms returned [740, 741, 743, 746, 747, 748, 749, 750, 751, 753, 756, 760, 761, 762, 763, 764, 765, 766, 768, 771, 775, 780, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 824, 825, 827, 828, 829, 830, 831, 833, 836, 837, 838, 839, 840, 841, 842, 843, 844, 845, 846, 847, 848, 849, 850, 851, 852, 853, 854, 855, 856, 857, 858, 859, 860, 862, 863, 864]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[864, 863, 862, 860, 859, 858, 857, 856, 855, 854, 853, 852, 851, 850, 849, 848, 847, 846, 845, 844, 843, 842, 841, 840, 839, 838, 837, 836, 833, 831, 830, 829, 828, 827, 825, 824, 823, 822, 821, 820, 819, 818, 817, 816, 815, 814, 813, 812, 811, 810, 809, 808, 807, 805, 804, 803, 802, 801, 800, 799, 798, 797, 796, 795, 794, 793, 792, 791, 790, 789, 788, 787, 786, 780, 775, 771, 768, 766, 765, 764, 763, 762, 761, 760, 756, 753, 751, 750, 749, 748, 747, 746, 743, 741, 740]
Starting structural reductions, iteration 1 : 770/909 places, 1086/1315 transitions.
Applied a total of 0 rules in 65 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 770/909 places, 1086/1315 transitions.
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:04:22] [INFO ] Computed 137 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 52120 resets, run finished after 4747 ms. (steps per millisecond=210 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3501 resets, run finished after 1279 ms. (steps per millisecond=781 ) properties (out of 1) seen :3
[2022-05-18 01:04:28] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:04:28] [INFO ] Computed 137 place invariants in 38 ms
[2022-05-18 01:04:28] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2022-05-18 01:04:28] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 18 ms returned sat
[2022-05-18 01:04:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:28] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2022-05-18 01:04:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:04:28] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2022-05-18 01:04:28] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-18 01:04:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:04:29] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2022-05-18 01:04:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:04:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 54 ms returned sat
[2022-05-18 01:04:29] [INFO ] Deduced a trap composed of 248 places in 206 ms of which 0 ms to minimize.
[2022-05-18 01:04:29] [INFO ] Deduced a trap composed of 245 places in 211 ms of which 0 ms to minimize.
[2022-05-18 01:04:29] [INFO ] Deduced a trap composed of 239 places in 200 ms of which 1 ms to minimize.
[2022-05-18 01:04:30] [INFO ] Deduced a trap composed of 236 places in 205 ms of which 0 ms to minimize.
[2022-05-18 01:04:30] [INFO ] Deduced a trap composed of 233 places in 205 ms of which 1 ms to minimize.
[2022-05-18 01:04:30] [INFO ] Deduced a trap composed of 227 places in 199 ms of which 1 ms to minimize.
[2022-05-18 01:04:30] [INFO ] Deduced a trap composed of 233 places in 199 ms of which 1 ms to minimize.
[2022-05-18 01:04:31] [INFO ] Deduced a trap composed of 242 places in 207 ms of which 0 ms to minimize.
[2022-05-18 01:04:31] [INFO ] Deduced a trap composed of 254 places in 209 ms of which 0 ms to minimize.
[2022-05-18 01:04:31] [INFO ] Deduced a trap composed of 233 places in 209 ms of which 1 ms to minimize.
[2022-05-18 01:04:31] [INFO ] Deduced a trap composed of 245 places in 198 ms of which 0 ms to minimize.
[2022-05-18 01:04:32] [INFO ] Deduced a trap composed of 227 places in 200 ms of which 1 ms to minimize.
[2022-05-18 01:04:32] [INFO ] Deduced a trap composed of 233 places in 201 ms of which 1 ms to minimize.
[2022-05-18 01:04:32] [INFO ] Deduced a trap composed of 221 places in 197 ms of which 1 ms to minimize.
[2022-05-18 01:04:33] [INFO ] Deduced a trap composed of 215 places in 208 ms of which 1 ms to minimize.
[2022-05-18 01:04:33] [INFO ] Deduced a trap composed of 221 places in 206 ms of which 5 ms to minimize.
[2022-05-18 01:04:33] [INFO ] Deduced a trap composed of 227 places in 198 ms of which 1 ms to minimize.
[2022-05-18 01:04:34] [INFO ] Deduced a trap composed of 242 places in 201 ms of which 1 ms to minimize.
[2022-05-18 01:04:34] [INFO ] Deduced a trap composed of 242 places in 205 ms of which 0 ms to minimize.
[2022-05-18 01:04:34] [INFO ] Deduced a trap composed of 242 places in 203 ms of which 0 ms to minimize.
[2022-05-18 01:04:35] [INFO ] Deduced a trap composed of 233 places in 198 ms of which 0 ms to minimize.
[2022-05-18 01:04:35] [INFO ] Deduced a trap composed of 248 places in 200 ms of which 0 ms to minimize.
[2022-05-18 01:04:35] [INFO ] Deduced a trap composed of 251 places in 199 ms of which 1 ms to minimize.
[2022-05-18 01:04:36] [INFO ] Deduced a trap composed of 248 places in 201 ms of which 1 ms to minimize.
[2022-05-18 01:04:36] [INFO ] Deduced a trap composed of 212 places in 208 ms of which 1 ms to minimize.
[2022-05-18 01:04:36] [INFO ] Deduced a trap composed of 227 places in 203 ms of which 1 ms to minimize.
[2022-05-18 01:04:37] [INFO ] Deduced a trap composed of 239 places in 204 ms of which 0 ms to minimize.
[2022-05-18 01:04:37] [INFO ] Deduced a trap composed of 242 places in 203 ms of which 0 ms to minimize.
[2022-05-18 01:04:38] [INFO ] Deduced a trap composed of 236 places in 192 ms of which 1 ms to minimize.
[2022-05-18 01:04:38] [INFO ] Deduced a trap composed of 218 places in 201 ms of which 0 ms to minimize.
[2022-05-18 01:04:39] [INFO ] Deduced a trap composed of 233 places in 195 ms of which 1 ms to minimize.
[2022-05-18 01:04:39] [INFO ] Deduced a trap composed of 242 places in 204 ms of which 1 ms to minimize.
[2022-05-18 01:04:39] [INFO ] Deduced a trap composed of 227 places in 200 ms of which 1 ms to minimize.
[2022-05-18 01:04:40] [INFO ] Deduced a trap composed of 245 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:04:40] [INFO ] Deduced a trap composed of 230 places in 200 ms of which 1 ms to minimize.
[2022-05-18 01:04:41] [INFO ] Deduced a trap composed of 257 places in 234 ms of which 0 ms to minimize.
[2022-05-18 01:04:41] [INFO ] Deduced a trap composed of 251 places in 204 ms of which 1 ms to minimize.
[2022-05-18 01:04:41] [INFO ] Deduced a trap composed of 251 places in 212 ms of which 1 ms to minimize.
[2022-05-18 01:04:41] [INFO ] Deduced a trap composed of 233 places in 209 ms of which 1 ms to minimize.
[2022-05-18 01:04:42] [INFO ] Deduced a trap composed of 233 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:04:45] [INFO ] Deduced a trap composed of 239 places in 204 ms of which 0 ms to minimize.
[2022-05-18 01:05:13] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 0 ms to minimize.
[2022-05-18 01:05:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 31 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 31 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2022-05-18 01:05:14] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:05:14] [INFO ] Computed 137 place invariants in 33 ms
[2022-05-18 01:05:14] [INFO ] Implicit Places using invariants in 821 ms returned []
[2022-05-18 01:05:14] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:05:14] [INFO ] Computed 137 place invariants in 38 ms
[2022-05-18 01:05:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:05:18] [INFO ] Implicit Places using invariants and state equation in 3887 ms returned []
Implicit Place search using SMT with State Equation took 4713 ms to find 0 implicit places.
[2022-05-18 01:05:18] [INFO ] Redundant transitions in 70 ms returned []
[2022-05-18 01:05:18] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:05:18] [INFO ] Computed 137 place invariants in 32 ms
[2022-05-18 01:05:19] [INFO ] Dead Transitions using invariants and state equation in 703 ms returned []
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-00
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:05:19] [INFO ] Computed 137 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 513 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :3
[2022-05-18 01:05:19] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:05:19] [INFO ] Computed 137 place invariants in 29 ms
[2022-05-18 01:05:19] [INFO ] [Real]Absence check using 130 positive place invariants in 27 ms returned sat
[2022-05-18 01:05:19] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 19 ms returned sat
[2022-05-18 01:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:05:20] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2022-05-18 01:05:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:05:20] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2022-05-18 01:05:20] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-18 01:05:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:05:20] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2022-05-18 01:05:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:05:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 56 ms returned sat
[2022-05-18 01:05:20] [INFO ] Deduced a trap composed of 248 places in 206 ms of which 1 ms to minimize.
[2022-05-18 01:05:21] [INFO ] Deduced a trap composed of 245 places in 208 ms of which 1 ms to minimize.
[2022-05-18 01:05:21] [INFO ] Deduced a trap composed of 239 places in 208 ms of which 1 ms to minimize.
[2022-05-18 01:05:21] [INFO ] Deduced a trap composed of 236 places in 215 ms of which 1 ms to minimize.
[2022-05-18 01:05:21] [INFO ] Deduced a trap composed of 233 places in 207 ms of which 0 ms to minimize.
[2022-05-18 01:05:22] [INFO ] Deduced a trap composed of 227 places in 205 ms of which 1 ms to minimize.
[2022-05-18 01:05:22] [INFO ] Deduced a trap composed of 233 places in 200 ms of which 1 ms to minimize.
[2022-05-18 01:05:22] [INFO ] Deduced a trap composed of 242 places in 202 ms of which 1 ms to minimize.
[2022-05-18 01:05:22] [INFO ] Deduced a trap composed of 254 places in 198 ms of which 1 ms to minimize.
[2022-05-18 01:05:23] [INFO ] Deduced a trap composed of 233 places in 199 ms of which 1 ms to minimize.
[2022-05-18 01:05:23] [INFO ] Deduced a trap composed of 245 places in 200 ms of which 1 ms to minimize.
[2022-05-18 01:05:23] [INFO ] Deduced a trap composed of 227 places in 198 ms of which 0 ms to minimize.
[2022-05-18 01:05:23] [INFO ] Deduced a trap composed of 233 places in 202 ms of which 1 ms to minimize.
[2022-05-18 01:05:24] [INFO ] Deduced a trap composed of 221 places in 204 ms of which 1 ms to minimize.
[2022-05-18 01:05:24] [INFO ] Deduced a trap composed of 215 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:05:24] [INFO ] Deduced a trap composed of 221 places in 200 ms of which 1 ms to minimize.
[2022-05-18 01:05:25] [INFO ] Deduced a trap composed of 227 places in 196 ms of which 1 ms to minimize.
[2022-05-18 01:05:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 51 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2022-05-18 01:05:25] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:05:25] [INFO ] Computed 137 place invariants in 30 ms
[2022-05-18 01:05:25] [INFO ] Dead Transitions using invariants and state equation in 693 ms returned []
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:05:26] [INFO ] Computed 137 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 52226 resets, run finished after 4610 ms. (steps per millisecond=216 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3409 resets, run finished after 1254 ms. (steps per millisecond=797 ) properties (out of 1) seen :3
[2022-05-18 01:05:31] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:05:31] [INFO ] Computed 137 place invariants in 32 ms
[2022-05-18 01:05:32] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2022-05-18 01:05:32] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 19 ms returned sat
[2022-05-18 01:05:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:05:32] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2022-05-18 01:05:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:05:32] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2022-05-18 01:05:32] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-18 01:05:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:05:32] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2022-05-18 01:05:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:05:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 55 ms returned sat
[2022-05-18 01:05:33] [INFO ] Deduced a trap composed of 248 places in 201 ms of which 1 ms to minimize.
[2022-05-18 01:05:33] [INFO ] Deduced a trap composed of 245 places in 194 ms of which 1 ms to minimize.
[2022-05-18 01:05:33] [INFO ] Deduced a trap composed of 239 places in 206 ms of which 1 ms to minimize.
[2022-05-18 01:05:33] [INFO ] Deduced a trap composed of 236 places in 202 ms of which 1 ms to minimize.
[2022-05-18 01:05:34] [INFO ] Deduced a trap composed of 233 places in 207 ms of which 1 ms to minimize.
[2022-05-18 01:05:34] [INFO ] Deduced a trap composed of 227 places in 203 ms of which 0 ms to minimize.
[2022-05-18 01:05:34] [INFO ] Deduced a trap composed of 233 places in 201 ms of which 0 ms to minimize.
[2022-05-18 01:05:34] [INFO ] Deduced a trap composed of 242 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:05:35] [INFO ] Deduced a trap composed of 254 places in 197 ms of which 1 ms to minimize.
[2022-05-18 01:05:35] [INFO ] Deduced a trap composed of 233 places in 197 ms of which 1 ms to minimize.
[2022-05-18 01:05:35] [INFO ] Deduced a trap composed of 245 places in 200 ms of which 0 ms to minimize.
[2022-05-18 01:05:35] [INFO ] Deduced a trap composed of 227 places in 201 ms of which 1 ms to minimize.
[2022-05-18 01:05:36] [INFO ] Deduced a trap composed of 233 places in 207 ms of which 0 ms to minimize.
[2022-05-18 01:05:36] [INFO ] Deduced a trap composed of 221 places in 200 ms of which 0 ms to minimize.
[2022-05-18 01:05:36] [INFO ] Deduced a trap composed of 215 places in 197 ms of which 1 ms to minimize.
[2022-05-18 01:05:37] [INFO ] Deduced a trap composed of 221 places in 196 ms of which 0 ms to minimize.
[2022-05-18 01:05:37] [INFO ] Deduced a trap composed of 227 places in 197 ms of which 0 ms to minimize.
[2022-05-18 01:05:37] [INFO ] Deduced a trap composed of 242 places in 198 ms of which 1 ms to minimize.
[2022-05-18 01:05:38] [INFO ] Deduced a trap composed of 242 places in 198 ms of which 1 ms to minimize.
[2022-05-18 01:05:38] [INFO ] Deduced a trap composed of 242 places in 203 ms of which 0 ms to minimize.
[2022-05-18 01:05:39] [INFO ] Deduced a trap composed of 233 places in 216 ms of which 0 ms to minimize.
[2022-05-18 01:05:39] [INFO ] Deduced a trap composed of 248 places in 204 ms of which 1 ms to minimize.
[2022-05-18 01:05:39] [INFO ] Deduced a trap composed of 251 places in 204 ms of which 1 ms to minimize.
[2022-05-18 01:05:39] [INFO ] Deduced a trap composed of 248 places in 205 ms of which 1 ms to minimize.
[2022-05-18 01:05:40] [INFO ] Deduced a trap composed of 212 places in 211 ms of which 1 ms to minimize.
[2022-05-18 01:05:40] [INFO ] Deduced a trap composed of 227 places in 201 ms of which 0 ms to minimize.
[2022-05-18 01:05:40] [INFO ] Deduced a trap composed of 239 places in 203 ms of which 0 ms to minimize.
[2022-05-18 01:05:41] [INFO ] Deduced a trap composed of 242 places in 205 ms of which 0 ms to minimize.
[2022-05-18 01:05:41] [INFO ] Deduced a trap composed of 236 places in 203 ms of which 1 ms to minimize.
[2022-05-18 01:05:42] [INFO ] Deduced a trap composed of 218 places in 207 ms of which 0 ms to minimize.
[2022-05-18 01:05:42] [INFO ] Deduced a trap composed of 233 places in 206 ms of which 1 ms to minimize.
[2022-05-18 01:05:43] [INFO ] Deduced a trap composed of 242 places in 209 ms of which 1 ms to minimize.
[2022-05-18 01:05:43] [INFO ] Deduced a trap composed of 227 places in 216 ms of which 2 ms to minimize.
[2022-05-18 01:05:43] [INFO ] Deduced a trap composed of 245 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:05:44] [INFO ] Deduced a trap composed of 230 places in 198 ms of which 1 ms to minimize.
[2022-05-18 01:05:44] [INFO ] Deduced a trap composed of 257 places in 205 ms of which 1 ms to minimize.
[2022-05-18 01:05:45] [INFO ] Deduced a trap composed of 251 places in 202 ms of which 1 ms to minimize.
[2022-05-18 01:05:45] [INFO ] Deduced a trap composed of 251 places in 204 ms of which 1 ms to minimize.
[2022-05-18 01:05:45] [INFO ] Deduced a trap composed of 233 places in 207 ms of which 1 ms to minimize.
[2022-05-18 01:05:46] [INFO ] Deduced a trap composed of 233 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:05:49] [INFO ] Deduced a trap composed of 239 places in 205 ms of which 1 ms to minimize.
[2022-05-18 01:06:17] [INFO ] Deduced a trap composed of 7 places in 312 ms of which 1 ms to minimize.
[2022-05-18 01:06:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 27 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 25 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2022-05-18 01:06:17] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:06:17] [INFO ] Computed 137 place invariants in 30 ms
[2022-05-18 01:06:18] [INFO ] Implicit Places using invariants in 805 ms returned []
[2022-05-18 01:06:18] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:06:18] [INFO ] Computed 137 place invariants in 22 ms
[2022-05-18 01:06:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:06:21] [INFO ] Implicit Places using invariants and state equation in 3395 ms returned []
Implicit Place search using SMT with State Equation took 4202 ms to find 0 implicit places.
[2022-05-18 01:06:21] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-18 01:06:21] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:06:22] [INFO ] Computed 137 place invariants in 27 ms
[2022-05-18 01:06:22] [INFO ] Dead Transitions using invariants and state equation in 686 ms returned []
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-00 in 63160 ms.
[2022-05-18 01:06:22] [INFO ] Flatten gal took : 137 ms
[2022-05-18 01:06:22] [INFO ] Applying decomposition
[2022-05-18 01:06:23] [INFO ] Flatten gal took : 100 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15816740632692720227.txt, -o, /tmp/graph15816740632692720227.bin, -w, /tmp/graph15816740632692720227.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15816740632692720227.bin, -l, -1, -v, -w, /tmp/graph15816740632692720227.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 01:06:23] [INFO ] Decomposing Gal with order
[2022-05-18 01:06:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:06:23] [INFO ] Removed a total of 1264 redundant transitions.
[2022-05-18 01:06:23] [INFO ] Flatten gal took : 286 ms
[2022-05-18 01:06:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 123 labels/synchronizations in 48 ms.
[2022-05-18 01:06:23] [INFO ] Time to serialize gal into /tmp/UpperBounds12247632346389950880.gal : 15 ms
[2022-05-18 01:06:23] [INFO ] Time to serialize properties into /tmp/UpperBounds10784876923842044319.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds12247632346389950880.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10784876923842044319.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds12247632346389950880.gal -t CGAL -reachable-file /tmp/UpperBounds10784876923842044319.prop --nowitness
Loading property file /tmp/UpperBounds10784876923842044319.prop.
Detected timeout of ITS tools.
[2022-05-18 01:27:10] [INFO ] Applying decomposition
[2022-05-18 01:27:11] [INFO ] Flatten gal took : 321 ms
[2022-05-18 01:27:11] [INFO ] Decomposing Gal with order
[2022-05-18 01:27:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:27:11] [INFO ] Removed a total of 3944 redundant transitions.
[2022-05-18 01:27:12] [INFO ] Flatten gal took : 512 ms
[2022-05-18 01:27:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 82 ms.
[2022-05-18 01:27:12] [INFO ] Time to serialize gal into /tmp/UpperBounds13673790000949868123.gal : 66 ms
[2022-05-18 01:27:12] [INFO ] Time to serialize properties into /tmp/UpperBounds7133347038831099887.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds13673790000949868123.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7133347038831099887.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds13673790000949868123.gal -t CGAL -reachable-file /tmp/UpperBounds7133347038831099887.prop --nowitness
Loading property file /tmp/UpperBounds7133347038831099887.prop.
Detected timeout of ITS tools.
[2022-05-18 01:48:10] [INFO ] Flatten gal took : 444 ms
[2022-05-18 01:48:12] [INFO ] Input system was already deterministic with 1086 transitions.
[2022-05-18 01:48:12] [INFO ] Transformed 770 places.
[2022-05-18 01:48:12] [INFO ] Transformed 1086 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-18 01:48:42] [INFO ] Time to serialize gal into /tmp/UpperBounds8489196556017668908.gal : 120 ms
[2022-05-18 01:48:42] [INFO ] Time to serialize properties into /tmp/UpperBounds10167186500883605.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds8489196556017668908.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10167186500883605.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8489196556017668908.gal -t CGAL -reachable-file /tmp/UpperBounds10167186500883605.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10167186500883605.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is PolyORBNT-COL-S05J60, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-165277027100283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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