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

About the Execution of 2022-gold for PolyORBNT-COL-S10J80

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
874.647 108135.00 129710.00 1219.40 10 1 1 1 1 1 4 10 1 3 4 1 1 1 3 2 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.r319-tall-167873970000089.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 PolyORBNT-COL-S10J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873970000089
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.1K Feb 26 01:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 00:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 03:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 02:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 95K Mar 5 18:23 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-S10J80-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678877752046

Running Version 202205111006
[2023-03-15 10:55:53] [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-03-15 10:55:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:55:53] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 10:55:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 10:55:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 645 ms
[2023-03-15 10:55:53] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-15 10:55:53] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2023-03-15 10:55:53] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:55:54] [INFO ] Computed 13 place invariants in 14 ms
FORMULA PolyORBNT-COL-S10J80-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:55:54] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-15 10:55:54] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2023-03-15 10:55:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 10:55:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:54] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-15 10:55:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:55:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:54] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-15 10:55:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:55:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:55:54] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 3 ms to minimize.
[2023-03-15 10:55:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-15 10:55:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:55:54] [INFO ] Added : 15 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 17 ms.
[2023-03-15 10:55:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 10:55:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:54] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-15 10:55:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:55:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:54] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-15 10:55:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:55:54] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2023-03-15 10:55:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-15 10:55:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:55:54] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2023-03-15 10:55:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-15 10:55:54] [INFO ] Added : 36 causal constraints over 8 iterations in 152 ms. Result :sat
Minimization took 13 ms.
[2023-03-15 10:55:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:55:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:54] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:55:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 10:55:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:54] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:55:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-15 10:55:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:55:54] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2023-03-15 10:55:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-15 10:55:55] [INFO ] Added : 36 causal constraints over 8 iterations in 160 ms. Result :sat
Minimization took 17 ms.
[2023-03-15 10:55:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:55] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:55:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:55:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:55:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:55] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:55:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:55:55] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
[2023-03-15 10:55:55] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2023-03-15 10:55:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 56 ms
[2023-03-15 10:55:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:55:55] [INFO ] Added : 36 causal constraints over 8 iterations in 123 ms. Result :sat
Minimization took 13 ms.
[2023-03-15 10:55:55] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:55:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:55] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 10:55:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:55:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:55:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:55] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-15 10:55:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:55:55] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2023-03-15 10:55:55] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2023-03-15 10:55:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2023-03-15 10:55:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 10:55:55] [INFO ] Added : 36 causal constraints over 8 iterations in 50 ms. Result :sat
Minimization took 14 ms.
[2023-03-15 10:55:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:55] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:55:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:55:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:55] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-15 10:55:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:55:55] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2023-03-15 10:55:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-15 10:55:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-15 10:55:55] [INFO ] Added : 9 causal constraints over 2 iterations in 160 ms. Result :sat
Minimization took 75 ms.
[2023-03-15 10:55:56] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:56] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2023-03-15 10:55:56] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:56] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:55:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:55:56] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2023-03-15 10:55:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-15 10:55:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:55:56] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2023-03-15 10:55:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-15 10:55:56] [INFO ] Added : 36 causal constraints over 8 iterations in 107 ms. Result :sat
Minimization took 14 ms.
[2023-03-15 10:55:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:56] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-15 10:55:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:56] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2023-03-15 10:55:56] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2023-03-15 10:55:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-15 10:55:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:55:56] [INFO ] Added : 21 causal constraints over 5 iterations in 23 ms. Result :sat
Minimization took 43 ms.
[2023-03-15 10:55:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:56] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 10:55:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:56] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:55:56] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2023-03-15 10:55:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-15 10:55:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:55:56] [INFO ] Added : 20 causal constraints over 5 iterations in 85 ms. Result :sat
Minimization took 68 ms.
[2023-03-15 10:55:56] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:56] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-15 10:55:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:56] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-15 10:55:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:55:56] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2023-03-15 10:55:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-15 10:55:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:55:57] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2023-03-15 10:55:57] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2023-03-15 10:55:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2023-03-15 10:55:57] [INFO ] Added : 36 causal constraints over 8 iterations in 172 ms. Result :sat
Minimization took 20 ms.
[2023-03-15 10:55:57] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:57] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 10:55:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:57] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:55:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:55:57] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 11 ms.
[2023-03-15 10:55:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:55:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:57] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:55:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:55:57] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2023-03-15 10:55:57] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2023-03-15 10:55:57] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-15 10:55:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 123 ms
[2023-03-15 10:55:57] [INFO ] Added : 36 causal constraints over 8 iterations in 237 ms. Result :sat
Minimization took 34 ms.
[2023-03-15 10:55:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2023-03-15 10:55:57] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:55:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:57] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-15 10:55:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:55:57] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2023-03-15 10:55:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-15 10:55:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:55:57] [INFO ] Added : 18 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [1, -1, -1, 1, -1, 10, 10, 1, 3, 4, -1, -1, 1, 3, 2]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-15 10:55:58] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 188 ms.
[2023-03-15 10:55:58] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 80 places in 27 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 13) seen :2
FORMULA PolyORBNT-COL-S10J80-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :1
[2023-03-15 10:55:58] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2023-03-15 10:55:59] [INFO ] Computed 192 place invariants in 407 ms
[2023-03-15 10:55:59] [INFO ] [Real]Absence check using 185 positive place invariants in 54 ms returned sat
[2023-03-15 10:55:59] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 50 ms returned sat
[2023-03-15 10:55:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:00] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2023-03-15 10:56:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:56:00] [INFO ] [Nat]Absence check using 185 positive place invariants in 59 ms returned sat
[2023-03-15 10:56:01] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 48 ms returned sat
[2023-03-15 10:56:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:02] [INFO ] [Nat]Absence check using state equation in 1095 ms returned sat
[2023-03-15 10:56:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:56:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 58 ms returned sat
[2023-03-15 10:56:03] [INFO ] Deduced a trap composed of 453 places in 978 ms of which 2 ms to minimize.
[2023-03-15 10:56:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1250 ms
[2023-03-15 10:56:03] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 369 ms.
[2023-03-15 10:56:04] [INFO ] Added : 7 causal constraints over 2 iterations in 943 ms. Result :sat
[2023-03-15 10:56:04] [INFO ] [Real]Absence check using 185 positive place invariants in 57 ms returned sat
[2023-03-15 10:56:04] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 43 ms returned sat
[2023-03-15 10:56:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:05] [INFO ] [Real]Absence check using state equation in 1173 ms returned sat
[2023-03-15 10:56:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:56:06] [INFO ] [Nat]Absence check using 185 positive place invariants in 61 ms returned sat
[2023-03-15 10:56:06] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 51 ms returned sat
[2023-03-15 10:56:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:11] [INFO ] [Nat]Absence check using state equation in 4747 ms returned unknown
[2023-03-15 10:56:11] [INFO ] [Real]Absence check using 185 positive place invariants in 56 ms returned sat
[2023-03-15 10:56:11] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 48 ms returned sat
[2023-03-15 10:56:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:13] [INFO ] [Real]Absence check using state equation in 1768 ms returned sat
[2023-03-15 10:56:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:56:13] [INFO ] [Nat]Absence check using 185 positive place invariants in 60 ms returned sat
[2023-03-15 10:56:13] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 50 ms returned sat
[2023-03-15 10:56:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:14] [INFO ] [Nat]Absence check using state equation in 1248 ms returned sat
[2023-03-15 10:56:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1112 ms returned sat
[2023-03-15 10:56:16] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 288 ms.
[2023-03-15 10:56:17] [INFO ] Deduced a trap composed of 19 places in 374 ms of which 1 ms to minimize.
[2023-03-15 10:56:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 607 ms
[2023-03-15 10:56:18] [INFO ] Added : 27 causal constraints over 6 iterations in 2176 ms. Result :sat
[2023-03-15 10:56:18] [INFO ] [Real]Absence check using 185 positive place invariants in 57 ms returned sat
[2023-03-15 10:56:18] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 49 ms returned sat
[2023-03-15 10:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:19] [INFO ] [Real]Absence check using state equation in 892 ms returned sat
[2023-03-15 10:56:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:56:19] [INFO ] [Nat]Absence check using 185 positive place invariants in 59 ms returned sat
[2023-03-15 10:56:19] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 48 ms returned sat
[2023-03-15 10:56:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:20] [INFO ] [Nat]Absence check using state equation in 993 ms returned sat
[2023-03-15 10:56:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 52 ms returned sat
[2023-03-15 10:56:21] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 287 ms.
[2023-03-15 10:56:21] [INFO ] Added : 8 causal constraints over 2 iterations in 756 ms. Result :sat
[2023-03-15 10:56:22] [INFO ] [Real]Absence check using 185 positive place invariants in 59 ms returned sat
[2023-03-15 10:56:22] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 48 ms returned sat
[2023-03-15 10:56:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:23] [INFO ] [Real]Absence check using state equation in 897 ms returned sat
[2023-03-15 10:56:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:56:23] [INFO ] [Nat]Absence check using 185 positive place invariants in 60 ms returned sat
[2023-03-15 10:56:23] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 49 ms returned sat
[2023-03-15 10:56:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:24] [INFO ] [Nat]Absence check using state equation in 960 ms returned sat
[2023-03-15 10:56:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 59 ms returned sat
[2023-03-15 10:56:25] [INFO ] Deduced a trap composed of 417 places in 923 ms of which 2 ms to minimize.
[2023-03-15 10:56:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1140 ms
[2023-03-15 10:56:25] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 280 ms.
[2023-03-15 10:56:28] [INFO ] Added : 5 causal constraints over 1 iterations in 2586 ms. Result :unknown
[2023-03-15 10:56:28] [INFO ] [Real]Absence check using 185 positive place invariants in 57 ms returned sat
[2023-03-15 10:56:28] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 33 ms returned sat
[2023-03-15 10:56:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:29] [INFO ] [Real]Absence check using state equation in 1033 ms returned sat
[2023-03-15 10:56:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:56:29] [INFO ] [Nat]Absence check using 185 positive place invariants in 56 ms returned sat
[2023-03-15 10:56:29] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 72 ms returned sat
[2023-03-15 10:56:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:31] [INFO ] [Nat]Absence check using state equation in 1831 ms returned sat
[2023-03-15 10:56:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1301 ms returned sat
[2023-03-15 10:56:33] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 292 ms.
[2023-03-15 10:56:33] [INFO ] Added : 6 causal constraints over 2 iterations in 768 ms. Result :sat
[2023-03-15 10:56:34] [INFO ] [Real]Absence check using 185 positive place invariants in 58 ms returned sat
[2023-03-15 10:56:34] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 41 ms returned sat
[2023-03-15 10:56:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:35] [INFO ] [Real]Absence check using state equation in 1465 ms returned sat
[2023-03-15 10:56:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:56:36] [INFO ] [Nat]Absence check using 185 positive place invariants in 54 ms returned sat
[2023-03-15 10:56:36] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 40 ms returned sat
[2023-03-15 10:56:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:40] [INFO ] [Nat]Absence check using state equation in 4674 ms returned unknown
[2023-03-15 10:56:41] [INFO ] [Real]Absence check using 185 positive place invariants in 60 ms returned sat
[2023-03-15 10:56:41] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 49 ms returned sat
[2023-03-15 10:56:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:42] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2023-03-15 10:56:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:56:42] [INFO ] [Nat]Absence check using 185 positive place invariants in 60 ms returned sat
[2023-03-15 10:56:42] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2023-03-15 10:56:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:44] [INFO ] [Nat]Absence check using state equation in 2428 ms returned sat
[2023-03-15 10:56:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 248 ms returned sat
[2023-03-15 10:56:45] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 269 ms.
[2023-03-15 10:56:47] [INFO ] Deduced a trap composed of 778 places in 985 ms of which 1 ms to minimize.
[2023-03-15 10:56:47] [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 7
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:56:47] [INFO ] [Real]Absence check using 185 positive place invariants in 55 ms returned sat
[2023-03-15 10:56:47] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 50 ms returned sat
[2023-03-15 10:56:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:48] [INFO ] [Real]Absence check using state equation in 943 ms returned sat
[2023-03-15 10:56:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:56:49] [INFO ] [Nat]Absence check using 185 positive place invariants in 58 ms returned sat
[2023-03-15 10:56:49] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 48 ms returned sat
[2023-03-15 10:56:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:53] [INFO ] [Nat]Absence check using state equation in 4750 ms returned unknown
[2023-03-15 10:56:54] [INFO ] [Real]Absence check using 185 positive place invariants in 57 ms returned sat
[2023-03-15 10:56:54] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2023-03-15 10:56:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:56:55] [INFO ] [Real]Absence check using state equation in 1025 ms returned sat
[2023-03-15 10:56:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:56:55] [INFO ] [Nat]Absence check using 185 positive place invariants in 58 ms returned sat
[2023-03-15 10:56:55] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 48 ms returned sat
[2023-03-15 10:56:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:57:00] [INFO ] [Nat]Absence check using state equation in 4766 ms returned unknown
[2023-03-15 10:57:00] [INFO ] [Real]Absence check using 185 positive place invariants in 59 ms returned sat
[2023-03-15 10:57:00] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 42 ms returned unsat
[2023-03-15 10:57:00] [INFO ] [Real]Absence check using 185 positive place invariants in 60 ms returned sat
[2023-03-15 10:57:00] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 53 ms returned sat
[2023-03-15 10:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:57:01] [INFO ] [Real]Absence check using state equation in 997 ms returned sat
[2023-03-15 10:57:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:57:02] [INFO ] [Nat]Absence check using 185 positive place invariants in 60 ms returned sat
[2023-03-15 10:57:02] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 45 ms returned sat
[2023-03-15 10:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:57:03] [INFO ] [Nat]Absence check using state equation in 851 ms returned sat
[2023-03-15 10:57:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1512 ms returned sat
[2023-03-15 10:57:05] [INFO ] Deduced a trap composed of 398 places in 964 ms of which 1 ms to minimize.
[2023-03-15 10:57:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1364 ms
[2023-03-15 10:57:06] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 271 ms.
[2023-03-15 10:57:07] [INFO ] Added : 10 causal constraints over 2 iterations in 1047 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 2147483647, 2147483647, 1, 2147483647, 10, 1, 3, 4, 2147483647, 1, 2] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 168 out of 1614 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 1604 transition count 3306
Reduce places removed 84 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 85 rules applied. Total rules applied 179 place count 1520 transition count 3305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 180 place count 1519 transition count 3305
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 180 place count 1519 transition count 3220
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 350 place count 1434 transition count 3220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 352 place count 1433 transition count 3219
Applied a total of 352 rules in 591 ms. Remains 1433 /1614 variables (removed 181) and now considering 3219/3390 (removed 171) transitions.
[2023-03-15 10:57:07] [INFO ] Flow matrix only has 3210 transitions (discarded 9 similar events)
// Phase 1: matrix 3210 rows 1433 cols
[2023-03-15 10:57:07] [INFO ] Computed 182 place invariants in 109 ms
[2023-03-15 10:57:09] [INFO ] Dead Transitions using invariants and state equation in 1922 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 1433/1614 places, 2604/3390 transitions.
Applied a total of 0 rules in 81 ms. Remains 1433 /1433 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1433/1614 places, 2604/3390 transitions.
Normalized transition count is 2595 out of 2604 initially.
// Phase 1: matrix 2595 rows 1433 cols
[2023-03-15 10:57:09] [INFO ] Computed 182 place invariants in 56 ms
Incomplete random walk after 1000000 steps, including 70951 resets, run finished after 13646 ms. (steps per millisecond=73 ) properties (out of 8) seen :17
FORMULA PolyORBNT-COL-S10J80-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6347 resets, run finished after 2359 ms. (steps per millisecond=423 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 6448 resets, run finished after 2372 ms. (steps per millisecond=421 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 6327 resets, run finished after 2385 ms. (steps per millisecond=419 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 6570 resets, run finished after 3399 ms. (steps per millisecond=294 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 6298 resets, run finished after 3618 ms. (steps per millisecond=276 ) properties (out of 5) seen :8
[2023-03-15 10:57:37] [INFO ] Flow matrix only has 2595 transitions (discarded 9 similar events)
// Phase 1: matrix 2595 rows 1433 cols
[2023-03-15 10:57:37] [INFO ] Computed 182 place invariants in 63 ms
[2023-03-15 10:57:37] [INFO ] [Real]Absence check using 175 positive place invariants in 45 ms returned sat
[2023-03-15 10:57:37] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned unsat
[2023-03-15 10:57:38] [INFO ] [Real]Absence check using 175 positive place invariants in 44 ms returned sat
[2023-03-15 10:57:38] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned unsat
[2023-03-15 10:57:38] [INFO ] [Real]Absence check using 175 positive place invariants in 70 ms returned sat
[2023-03-15 10:57:38] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 28 ms returned unsat
[2023-03-15 10:57:38] [INFO ] [Real]Absence check using 175 positive place invariants in 48 ms returned sat
[2023-03-15 10:57:38] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 28 ms returned unsat
[2023-03-15 10:57:38] [INFO ] [Real]Absence check using 175 positive place invariants in 47 ms returned sat
[2023-03-15 10:57:38] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2023-03-15 10:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:57:39] [INFO ] [Real]Absence check using state equation in 948 ms returned sat
[2023-03-15 10:57:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:57:40] [INFO ] [Nat]Absence check using 175 positive place invariants in 49 ms returned sat
[2023-03-15 10:57:40] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 41 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 4, 1] Max seen :[1, 1, 1, 4, 1]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 106921 ms.

BK_STOP 1678877860181

--------------------
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="PolyORBNT-COL-S10J80"
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 PolyORBNT-COL-S10J80, 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 r319-tall-167873970000089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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