About the Execution of ITS-Tools for PolyORBNT-COL-S10J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.027 | 3600000.00 | 2471875.00 | 722204.10 | 1 1 1 1 1 1 3 1 4 10 10 ? ? 10 1 1 | normal |
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.r168-tall-165277017200797.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 itstools
Input is PolyORBNT-COL-S10J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017200797
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 6.9K Apr 30 04:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 04:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 03:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 30 03:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 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-S10J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652951132597
Running Version 202205111006
[2022-05-19 09:05:33] [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-19 09:05:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 09:05:33] [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.
[2022-05-19 09:05:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 09:05:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 623 ms
[2022-05-19 09:05:34] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2022-05-19 09:05:34] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 8 ms.
[2022-05-19 09:05:34] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 09:05:34] [INFO ] Computed 13 place invariants in 9 ms
FORMULA PolyORBNT-COL-S10J60-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 09:05:34] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-19 09:05:34] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-19 09:05:34] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-19 09:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:34] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-19 09:05:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:34] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:05:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:34] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-19 09:05:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:05:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 09:05:34] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 3 ms to minimize.
[2022-05-19 09:05:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2022-05-19 09:05:34] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 09:05:35] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2022-05-19 09:05:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-05-19 09:05:35] [INFO ] Added : 33 causal constraints over 7 iterations in 234 ms. Result :sat
Minimization took 168 ms.
[2022-05-19 09:05:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:35] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-19 09:05:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:35] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 09:05:35] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2022-05-19 09:05:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-05-19 09:05:35] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 09:05:35] [INFO ] Added : 15 causal constraints over 4 iterations in 30 ms. Result :sat
Minimization took 11 ms.
[2022-05-19 09:05:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:35] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 09:05:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:35] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 39 ms returned sat
[2022-05-19 09:05:35] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-19 09:05:35] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 2 ms to minimize.
[2022-05-19 09:05:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-05-19 09:05:35] [INFO ] Added : 36 causal constraints over 8 iterations in 107 ms. Result :sat
Minimization took 12 ms.
[2022-05-19 09:05:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:35] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 09:05:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:35] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-19 09:05:35] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 3 ms to minimize.
[2022-05-19 09:05:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-05-19 09:05:35] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 09:05:35] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2022-05-19 09:05:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-19 09:05:35] [INFO ] Added : 36 causal constraints over 8 iterations in 88 ms. Result :sat
Minimization took 14 ms.
[2022-05-19 09:05:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:36] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-19 09:05:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:36] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 09:05:36] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2022-05-19 09:05:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2022-05-19 09:05:36] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 09:05:36] [INFO ] Added : 36 causal constraints over 8 iterations in 109 ms. Result :sat
Minimization took 12 ms.
[2022-05-19 09:05:36] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2022-05-19 09:05:36] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:36] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 09:05:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:36] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 09:05:36] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 09:05:36] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 09:05:36] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:36] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 09:05:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:36] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 09:05:36] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2022-05-19 09:05:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-19 09:05:36] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 09:05:36] [INFO ] Added : 23 causal constraints over 6 iterations in 169 ms. Result :sat
Minimization took 21 ms.
[2022-05-19 09:05:36] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:36] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 09:05:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:36] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 09:05:36] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 09:05:36] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 09:05:36] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:36] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-19 09:05:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:36] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-19 09:05:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 09:05:36] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2022-05-19 09:05:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-19 09:05:36] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 09:05:37] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2022-05-19 09:05:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-05-19 09:05:37] [INFO ] Added : 36 causal constraints over 8 iterations in 180 ms. Result :sat
Minimization took 200 ms.
[2022-05-19 09:05:37] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:37] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:37] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 09:05:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 09:05:37] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:05:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:37] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-19 09:05:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 09:05:37] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2022-05-19 09:05:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-19 09:05:37] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 09:05:37] [INFO ] Added : 22 causal constraints over 5 iterations in 178 ms. Result :sat
Minimization took 122 ms.
[2022-05-19 09:05:37] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 09:05:37] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-19 09:05:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:37] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 09:05:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:37] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 09:05:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-19 09:05:37] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2022-05-19 09:05:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-05-19 09:05:37] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 09:05:37] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2022-05-19 09:05:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-19 09:05:37] [INFO ] Added : 36 causal constraints over 8 iterations in 165 ms. Result :sat
Minimization took 21 ms.
[2022-05-19 09:05:38] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 09:05:38] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:05:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 09:05:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 09:05:38] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 09:05:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:38] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 09:05:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 09:05:38] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2022-05-19 09:05:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-19 09:05:38] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 09:05:38] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-05-19 09:05:38] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2022-05-19 09:05:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2022-05-19 09:05:38] [INFO ] Added : 36 causal constraints over 8 iterations in 207 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [1, 1, -1, 1, -1, 3, -1, 10, 10, 10, 10, -1, -1]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-06 3 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.
[2022-05-19 09:05:38] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 185 ms.
[2022-05-19 09:05:38] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Deduced a syphon composed of 60 places in 29 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 12) seen :25
FORMULA PolyORBNT-COL-S10J60-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) 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 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :1
[2022-05-19 09:05:39] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2022-05-19 09:05:39] [INFO ] Computed 152 place invariants in 241 ms
[2022-05-19 09:05:39] [INFO ] [Real]Absence check using 145 positive place invariants in 48 ms returned sat
[2022-05-19 09:05:39] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2022-05-19 09:05:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:40] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2022-05-19 09:05:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:40] [INFO ] [Nat]Absence check using 145 positive place invariants in 44 ms returned sat
[2022-05-19 09:05:40] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2022-05-19 09:05:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:43] [INFO ] [Nat]Absence check using state equation in 2284 ms returned sat
[2022-05-19 09:05:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:05:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2022-05-19 09:05:43] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 322 ms.
[2022-05-19 09:05:44] [INFO ] Added : 7 causal constraints over 2 iterations in 738 ms. Result :sat
Minimization took 762 ms.
[2022-05-19 09:05:45] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2022-05-19 09:05:45] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 25 ms returned sat
[2022-05-19 09:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:46] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2022-05-19 09:05:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:46] [INFO ] [Nat]Absence check using 145 positive place invariants in 46 ms returned sat
[2022-05-19 09:05:46] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 38 ms returned sat
[2022-05-19 09:05:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:48] [INFO ] [Nat]Absence check using state equation in 1682 ms returned sat
[2022-05-19 09:05:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1119 ms returned sat
[2022-05-19 09:05:49] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 682 ms.
[2022-05-19 09:05:51] [INFO ] Deduced a trap composed of 19 places in 374 ms of which 1 ms to minimize.
[2022-05-19 09:05:51] [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 1
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)
[2022-05-19 09:05:51] [INFO ] [Real]Absence check using 145 positive place invariants in 47 ms returned sat
[2022-05-19 09:05:51] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 33 ms returned sat
[2022-05-19 09:05:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:52] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2022-05-19 09:05:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:52] [INFO ] [Nat]Absence check using 145 positive place invariants in 46 ms returned sat
[2022-05-19 09:05:52] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned unsat
[2022-05-19 09:05:52] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2022-05-19 09:05:52] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 34 ms returned unsat
[2022-05-19 09:05:53] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2022-05-19 09:05:53] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2022-05-19 09:05:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:54] [INFO ] [Real]Absence check using state equation in 1040 ms returned sat
[2022-05-19 09:05:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:05:54] [INFO ] [Nat]Absence check using 145 positive place invariants in 45 ms returned sat
[2022-05-19 09:05:54] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned sat
[2022-05-19 09:05:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:05:57] [INFO ] [Nat]Absence check using state equation in 2896 ms returned sat
[2022-05-19 09:05:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 462 ms returned sat
[2022-05-19 09:05:58] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 235 ms.
[2022-05-19 09:05:58] [INFO ] Added : 6 causal constraints over 2 iterations in 622 ms. Result :sat
Minimization took 559 ms.
[2022-05-19 09:05:59] [INFO ] [Real]Absence check using 145 positive place invariants in 46 ms returned sat
[2022-05-19 09:05:59] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2022-05-19 09:05:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:06:00] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2022-05-19 09:06:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:06:00] [INFO ] [Nat]Absence check using 145 positive place invariants in 41 ms returned sat
[2022-05-19 09:06:00] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned sat
[2022-05-19 09:06:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:06:05] [INFO ] [Nat]Absence check using state equation in 4826 ms returned unknown
[2022-05-19 09:06:05] [INFO ] [Real]Absence check using 145 positive place invariants in 50 ms returned sat
[2022-05-19 09:06:05] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2022-05-19 09:06:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:06:06] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2022-05-19 09:06:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:06:06] [INFO ] [Nat]Absence check using 145 positive place invariants in 43 ms returned sat
[2022-05-19 09:06:06] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2022-05-19 09:06:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:06:08] [INFO ] [Nat]Absence check using state equation in 1538 ms returned sat
[2022-05-19 09:06:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 625 ms returned sat
[2022-05-19 09:06:09] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 233 ms.
[2022-05-19 09:06:10] [INFO ] Deduced a trap composed of 629 places in 716 ms of which 1 ms to minimize.
[2022-05-19 09:06:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 923 ms
[2022-05-19 09:06:10] [INFO ] Added : 16 causal constraints over 4 iterations in 2012 ms. Result :sat
Minimization took 556 ms.
[2022-05-19 09:06:11] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2022-05-19 09:06:11] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 31 ms returned sat
[2022-05-19 09:06:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:06:12] [INFO ] [Real]Absence check using state equation in 875 ms returned sat
[2022-05-19 09:06:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:06:12] [INFO ] [Nat]Absence check using 145 positive place invariants in 45 ms returned sat
[2022-05-19 09:06:12] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2022-05-19 09:06:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:06:15] [INFO ] [Nat]Absence check using state equation in 2629 ms returned sat
[2022-05-19 09:06:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 133 ms returned sat
[2022-05-19 09:06:15] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 270 ms.
[2022-05-19 09:06:17] [INFO ] Added : 15 causal constraints over 3 iterations in 1945 ms. Result :unknown
[2022-05-19 09:06:17] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2022-05-19 09:06:17] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 22 ms returned sat
[2022-05-19 09:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:06:18] [INFO ] [Real]Absence check using state equation in 804 ms returned sat
[2022-05-19 09:06:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:06:18] [INFO ] [Nat]Absence check using 145 positive place invariants in 44 ms returned sat
[2022-05-19 09:06:18] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 23 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 2147483647, 1, 1, 10, 10, 10, 2147483647, 1] Max seen :[0, 0, 1, 1, 3, 4, 3, 0, 1]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 125 out of 1234 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1224 transition count 2806
Reduce places removed 4 places and 0 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Iterating post reduction 1 with 66 rules applied. Total rules applied 80 place count 1220 transition count 2744
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 2 with 62 rules applied. Total rules applied 142 place count 1158 transition count 2744
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 142 place count 1158 transition count 2741
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 148 place count 1155 transition count 2741
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 1154 transition count 2740
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 1154 transition count 2740
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 3 with 4 rules applied. Total rules applied 154 place count 1152 transition count 2738
Applied a total of 154 rules in 586 ms. Remains 1152 /1234 variables (removed 82) and now considering 2738/2810 (removed 72) transitions.
[2022-05-19 09:06:19] [INFO ] Flow matrix only has 2729 transitions (discarded 9 similar events)
// Phase 1: matrix 2729 rows 1152 cols
[2022-05-19 09:06:19] [INFO ] Computed 142 place invariants in 123 ms
[2022-05-19 09:06:21] [INFO ] Dead Transitions using invariants and state equation in 1732 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 : 1152/1234 places, 2123/2810 transitions.
Applied a total of 0 rules in 83 ms. Remains 1152 /1152 variables (removed 0) and now considering 2123/2123 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1152/1234 places, 2123/2810 transitions.
Normalized transition count is 2114 out of 2123 initially.
// Phase 1: matrix 2114 rows 1152 cols
[2022-05-19 09:06:21] [INFO ] Computed 142 place invariants in 37 ms
Incomplete random walk after 1000000 steps, including 69292 resets, run finished after 11713 ms. (steps per millisecond=85 ) properties (out of 5) seen :13
Incomplete Best-First random walk after 1000001 steps, including 7104 resets, run finished after 2881 ms. (steps per millisecond=347 ) properties (out of 5) seen :13
Incomplete Best-First random walk after 1000000 steps, including 5964 resets, run finished after 2712 ms. (steps per millisecond=368 ) properties (out of 5) seen :11
Incomplete Best-First random walk after 1000001 steps, including 5936 resets, run finished after 1990 ms. (steps per millisecond=502 ) properties (out of 5) seen :13
Incomplete Best-First random walk after 1000001 steps, including 7213 resets, run finished after 2160 ms. (steps per millisecond=462 ) properties (out of 5) seen :13
Incomplete Best-First random walk after 1000001 steps, including 7052 resets, run finished after 2129 ms. (steps per millisecond=469 ) properties (out of 5) seen :13
[2022-05-19 09:06:44] [INFO ] Flow matrix only has 2114 transitions (discarded 9 similar events)
// Phase 1: matrix 2114 rows 1152 cols
[2022-05-19 09:06:45] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 09:06:45] [INFO ] [Real]Absence check using 136 positive place invariants in 38 ms returned sat
[2022-05-19 09:06:45] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 19 ms returned unsat
[2022-05-19 09:06:45] [INFO ] [Real]Absence check using 136 positive place invariants in 39 ms returned sat
[2022-05-19 09:06:45] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 14 ms returned unsat
[2022-05-19 09:06:45] [INFO ] [Real]Absence check using 136 positive place invariants in 43 ms returned sat
[2022-05-19 09:06:45] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 19 ms returned sat
[2022-05-19 09:06:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:06:46] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2022-05-19 09:06:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:06:46] [INFO ] [Nat]Absence check using 136 positive place invariants in 38 ms returned sat
[2022-05-19 09:06:46] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 22 ms returned sat
[2022-05-19 09:06:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:06:53] [INFO ] [Nat]Absence check using state equation in 6937 ms returned unknown
[2022-05-19 09:06:53] [INFO ] [Real]Absence check using 136 positive place invariants in 39 ms returned sat
[2022-05-19 09:06:53] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 24 ms returned sat
[2022-05-19 09:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:06:54] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2022-05-19 09:06:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:06:54] [INFO ] [Nat]Absence check using 136 positive place invariants in 37 ms returned sat
[2022-05-19 09:06:54] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 26 ms returned sat
[2022-05-19 09:06:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:06:54] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2022-05-19 09:06:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:06:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 458 ms returned sat
[2022-05-19 09:06:55] [INFO ] Deduced a trap composed of 512 places in 499 ms of which 1 ms to minimize.
[2022-05-19 09:06:56] [INFO ] Deduced a trap composed of 520 places in 491 ms of which 1 ms to minimize.
[2022-05-19 09:06:57] [INFO ] Deduced a trap composed of 514 places in 506 ms of which 1 ms to minimize.
[2022-05-19 09:06:57] [INFO ] Deduced a trap composed of 506 places in 521 ms of which 1 ms to minimize.
[2022-05-19 09:06:58] [INFO ] Deduced a trap composed of 504 places in 515 ms of which 1 ms to minimize.
[2022-05-19 09:06:58] [INFO ] Deduced a trap composed of 504 places in 522 ms of which 1 ms to minimize.
[2022-05-19 09:06:59] [INFO ] Deduced a trap composed of 518 places in 506 ms of which 1 ms to minimize.
[2022-05-19 09:06:59] [INFO ] Deduced a trap composed of 500 places in 494 ms of which 1 ms to minimize.
[2022-05-19 09:07:00] [INFO ] Deduced a trap composed of 507 places in 494 ms of which 0 ms to minimize.
[2022-05-19 09:07:01] [INFO ] Deduced a trap composed of 508 places in 497 ms of which 1 ms to minimize.
[2022-05-19 09:07:01] [INFO ] Deduced a trap composed of 518 places in 491 ms of which 1 ms to minimize.
[2022-05-19 09:07:02] [INFO ] Deduced a trap composed of 510 places in 497 ms of which 0 ms to minimize.
[2022-05-19 09:07:03] [INFO ] Deduced a trap composed of 514 places in 562 ms of which 1 ms to minimize.
[2022-05-19 09:07:03] [INFO ] Deduced a trap composed of 510 places in 495 ms of which 1 ms to minimize.
[2022-05-19 09:07:04] [INFO ] Deduced a trap composed of 516 places in 481 ms of which 1 ms to minimize.
[2022-05-19 09:07:05] [INFO ] Deduced a trap composed of 504 places in 541 ms of which 1 ms to minimize.
[2022-05-19 09:07:05] [INFO ] Deduced a trap composed of 502 places in 543 ms of which 1 ms to minimize.
[2022-05-19 09:07:06] [INFO ] Deduced a trap composed of 510 places in 535 ms of which 1 ms to minimize.
[2022-05-19 09:07:07] [INFO ] Deduced a trap composed of 516 places in 524 ms of which 1 ms to minimize.
[2022-05-19 09:07:08] [INFO ] Deduced a trap composed of 504 places in 508 ms of which 1 ms to minimize.
[2022-05-19 09:07:09] [INFO ] Deduced a trap composed of 520 places in 499 ms of which 1 ms to minimize.
[2022-05-19 09:07:10] [INFO ] Deduced a trap composed of 516 places in 503 ms of which 1 ms to minimize.
[2022-05-19 09:07:10] [INFO ] Deduced a trap composed of 506 places in 491 ms of which 1 ms to minimize.
[2022-05-19 09:07:11] [INFO ] Deduced a trap composed of 500 places in 542 ms of which 1 ms to minimize.
[2022-05-19 09:07:12] [INFO ] Deduced a trap composed of 514 places in 551 ms of which 1 ms to minimize.
[2022-05-19 09:07:13] [INFO ] Deduced a trap composed of 502 places in 505 ms of which 1 ms to minimize.
[2022-05-19 09:07:14] [INFO ] Deduced a trap composed of 514 places in 522 ms of which 1 ms to minimize.
[2022-05-19 09:07:15] [INFO ] Deduced a trap composed of 512 places in 534 ms of which 2 ms to minimize.
[2022-05-19 09:07:16] [INFO ] Deduced a trap composed of 526 places in 531 ms of which 1 ms to minimize.
[2022-05-19 09:07:17] [INFO ] Deduced a trap composed of 508 places in 524 ms of which 1 ms to minimize.
[2022-05-19 09:07:17] [INFO ] Deduced a trap composed of 508 places in 510 ms of which 1 ms to minimize.
[2022-05-19 09:07:18] [INFO ] Deduced a trap composed of 518 places in 489 ms of which 1 ms to minimize.
[2022-05-19 09:07:19] [INFO ] Deduced a trap composed of 510 places in 476 ms of which 3 ms to minimize.
[2022-05-19 09:07:20] [INFO ] Deduced a trap composed of 516 places in 484 ms of which 1 ms to minimize.
[2022-05-19 09:07:21] [INFO ] Deduced a trap composed of 510 places in 514 ms of which 1 ms to minimize.
[2022-05-19 09:07:22] [INFO ] Deduced a trap composed of 496 places in 551 ms of which 1 ms to minimize.
[2022-05-19 09:07:22] [INFO ] Deduced a trap composed of 514 places in 541 ms of which 1 ms to minimize.
[2022-05-19 09:07:23] [INFO ] Deduced a trap composed of 514 places in 527 ms of which 1 ms to minimize.
[2022-05-19 09:07:24] [INFO ] Deduced a trap composed of 504 places in 523 ms of which 3 ms to minimize.
[2022-05-19 09:07:24] [INFO ] Deduced a trap composed of 522 places in 547 ms of which 1 ms to minimize.
[2022-05-19 09:07:25] [INFO ] Deduced a trap composed of 524 places in 544 ms of which 1 ms to minimize.
[2022-05-19 09:07:26] [INFO ] Deduced a trap composed of 494 places in 509 ms of which 1 ms to minimize.
[2022-05-19 09:07:28] [INFO ] Deduced a trap composed of 502 places in 547 ms of which 1 ms to minimize.
[2022-05-19 09:07:29] [INFO ] Deduced a trap composed of 506 places in 516 ms of which 1 ms to minimize.
[2022-05-19 09:07:29] [INFO ] Deduced a trap composed of 526 places in 512 ms of which 1 ms to minimize.
[2022-05-19 09:07:30] [INFO ] Deduced a trap composed of 516 places in 511 ms of which 1 ms to minimize.
[2022-05-19 09:07:31] [INFO ] Deduced a trap composed of 508 places in 519 ms of which 1 ms to minimize.
[2022-05-19 09:07:32] [INFO ] Deduced a trap composed of 510 places in 501 ms of which 1 ms to minimize.
[2022-05-19 09:07:35] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 39740 ms
[2022-05-19 09:07:35] [INFO ] [Real]Absence check using 136 positive place invariants in 41 ms returned sat
[2022-05-19 09:07:35] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 19 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 10, 10, 1] Max seen :[1, 4, 4, 3, 1]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 1152 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1152/1152 places, 2123/2123 transitions.
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 61 Pre rules applied. Total rules applied 0 place count 1152 transition count 2062
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 0 with 122 rules applied. Total rules applied 122 place count 1091 transition count 2062
Applied a total of 122 rules in 105 ms. Remains 1091 /1152 variables (removed 61) and now considering 2062/2123 (removed 61) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1152 places, 2062/2123 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:07:35] [INFO ] Computed 142 place invariants in 41 ms
Incomplete random walk after 1000000 steps, including 70469 resets, run finished after 10043 ms. (steps per millisecond=99 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 5994 resets, run finished after 1851 ms. (steps per millisecond=540 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 7200 resets, run finished after 1994 ms. (steps per millisecond=501 ) properties (out of 2) seen :7
[2022-05-19 09:07:49] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:07:49] [INFO ] Computed 142 place invariants in 59 ms
[2022-05-19 09:07:49] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-19 09:07:49] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2022-05-19 09:07:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:07:50] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2022-05-19 09:07:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:07:50] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-19 09:07:50] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 19 ms returned sat
[2022-05-19 09:07:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:07:56] [INFO ] [Nat]Absence check using state equation in 6468 ms returned unknown
[2022-05-19 09:07:56] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2022-05-19 09:07:56] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2022-05-19 09:07:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:07:57] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2022-05-19 09:07:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:07:57] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-19 09:07:57] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2022-05-19 09:07:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:07:58] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2022-05-19 09:07:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:07:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 807 ms returned sat
[2022-05-19 09:07:59] [INFO ] Deduced a trap composed of 446 places in 443 ms of which 1 ms to minimize.
[2022-05-19 09:07:59] [INFO ] Deduced a trap composed of 436 places in 449 ms of which 1 ms to minimize.
[2022-05-19 09:08:00] [INFO ] Deduced a trap composed of 438 places in 435 ms of which 1 ms to minimize.
[2022-05-19 09:08:01] [INFO ] Deduced a trap composed of 438 places in 441 ms of which 1 ms to minimize.
[2022-05-19 09:08:01] [INFO ] Deduced a trap composed of 438 places in 446 ms of which 1 ms to minimize.
[2022-05-19 09:08:02] [INFO ] Deduced a trap composed of 436 places in 432 ms of which 1 ms to minimize.
[2022-05-19 09:08:02] [INFO ] Deduced a trap composed of 452 places in 443 ms of which 1 ms to minimize.
[2022-05-19 09:08:03] [INFO ] Deduced a trap composed of 446 places in 445 ms of which 1 ms to minimize.
[2022-05-19 09:08:03] [INFO ] Deduced a trap composed of 442 places in 449 ms of which 1 ms to minimize.
[2022-05-19 09:08:04] [INFO ] Deduced a trap composed of 434 places in 452 ms of which 0 ms to minimize.
[2022-05-19 09:08:04] [INFO ] Deduced a trap composed of 432 places in 439 ms of which 0 ms to minimize.
[2022-05-19 09:08:05] [INFO ] Deduced a trap composed of 440 places in 433 ms of which 1 ms to minimize.
[2022-05-19 09:08:05] [INFO ] Deduced a trap composed of 448 places in 452 ms of which 1 ms to minimize.
[2022-05-19 09:08:06] [INFO ] Deduced a trap composed of 442 places in 434 ms of which 1 ms to minimize.
[2022-05-19 09:08:07] [INFO ] Deduced a trap composed of 432 places in 442 ms of which 1 ms to minimize.
[2022-05-19 09:08:07] [INFO ] Deduced a trap composed of 460 places in 429 ms of which 0 ms to minimize.
[2022-05-19 09:08:08] [INFO ] Deduced a trap composed of 446 places in 445 ms of which 1 ms to minimize.
[2022-05-19 09:08:09] [INFO ] Deduced a trap composed of 434 places in 434 ms of which 1 ms to minimize.
[2022-05-19 09:08:10] [INFO ] Deduced a trap composed of 436 places in 428 ms of which 1 ms to minimize.
[2022-05-19 09:08:10] [INFO ] Deduced a trap composed of 452 places in 435 ms of which 1 ms to minimize.
[2022-05-19 09:08:11] [INFO ] Deduced a trap composed of 436 places in 450 ms of which 1 ms to minimize.
[2022-05-19 09:08:12] [INFO ] Deduced a trap composed of 443 places in 491 ms of which 1 ms to minimize.
[2022-05-19 09:08:12] [INFO ] Deduced a trap composed of 428 places in 496 ms of which 1 ms to minimize.
[2022-05-19 09:08:13] [INFO ] Deduced a trap composed of 435 places in 493 ms of which 1 ms to minimize.
[2022-05-19 09:08:13] [INFO ] Deduced a trap composed of 428 places in 489 ms of which 1 ms to minimize.
[2022-05-19 09:08:14] [INFO ] Deduced a trap composed of 438 places in 481 ms of which 1 ms to minimize.
[2022-05-19 09:08:15] [INFO ] Deduced a trap composed of 435 places in 452 ms of which 1 ms to minimize.
[2022-05-19 09:08:15] [INFO ] Deduced a trap composed of 444 places in 455 ms of which 1 ms to minimize.
[2022-05-19 09:08:18] [INFO ] Deduced a trap composed of 430 places in 459 ms of which 1 ms to minimize.
[2022-05-19 09:08:19] [INFO ] Deduced a trap composed of 432 places in 468 ms of which 1 ms to minimize.
[2022-05-19 09:08:19] [INFO ] Deduced a trap composed of 457 places in 464 ms of which 1 ms to minimize.
[2022-05-19 09:08:20] [INFO ] Deduced a trap composed of 437 places in 460 ms of which 1 ms to minimize.
[2022-05-19 09:08:20] [INFO ] Deduced a trap composed of 436 places in 459 ms of which 1 ms to minimize.
[2022-05-19 09:08:21] [INFO ] Deduced a trap composed of 436 places in 471 ms of which 1 ms to minimize.
[2022-05-19 09:08:22] [INFO ] Deduced a trap composed of 442 places in 457 ms of which 1 ms to minimize.
[2022-05-19 09:08:22] [INFO ] Deduced a trap composed of 439 places in 471 ms of which 1 ms to minimize.
[2022-05-19 09:08:25] [INFO ] Trap strengthening (SAT) tested/added 36/36 trap constraints in 26673 ms
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[4, 3]
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 101 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 90 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2022-05-19 09:08:25] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:08:25] [INFO ] Computed 142 place invariants in 68 ms
[2022-05-19 09:08:26] [INFO ] Implicit Places using invariants in 884 ms returned []
[2022-05-19 09:08:26] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:08:26] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:08:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:08:34] [INFO ] Implicit Places using invariants and state equation in 8198 ms returned []
Implicit Place search using SMT with State Equation took 9086 ms to find 0 implicit places.
[2022-05-19 09:08:35] [INFO ] Redundant transitions in 118 ms returned []
[2022-05-19 09:08:35] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:08:35] [INFO ] Computed 142 place invariants in 38 ms
[2022-05-19 09:08:36] [INFO ] Dead Transitions using invariants and state equation in 1141 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-11
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:08:36] [INFO ] Computed 142 place invariants in 40 ms
Incomplete random walk after 10000 steps, including 683 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :4
[2022-05-19 09:08:36] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:08:36] [INFO ] Computed 142 place invariants in 61 ms
[2022-05-19 09:08:36] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2022-05-19 09:08:36] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned sat
[2022-05-19 09:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:08:37] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2022-05-19 09:08:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:08:37] [INFO ] [Nat]Absence check using 135 positive place invariants in 34 ms returned sat
[2022-05-19 09:08:37] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 19 ms returned sat
[2022-05-19 09:08:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:08:42] [INFO ] [Nat]Absence check using state equation in 4842 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1091 transition count 2061
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1090 transition count 2061
Applied a total of 2 rules in 66 ms. Remains 1090 /1091 variables (removed 1) and now considering 2061/2062 (removed 1) transitions.
[2022-05-19 09:08:42] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:08:42] [INFO ] Computed 142 place invariants in 45 ms
[2022-05-19 09:08:43] [INFO ] Dead Transitions using invariants and state equation in 1172 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1091 places, 2061/2062 transitions.
Normalized transition count is 2052 out of 2061 initially.
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:08:43] [INFO ] Computed 142 place invariants in 38 ms
Incomplete random walk after 1000000 steps, including 72762 resets, run finished after 10291 ms. (steps per millisecond=97 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 6080 resets, run finished after 1861 ms. (steps per millisecond=537 ) properties (out of 1) seen :4
[2022-05-19 09:08:55] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:08:55] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 09:08:55] [INFO ] [Real]Absence check using 135 positive place invariants in 34 ms returned sat
[2022-05-19 09:08:55] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2022-05-19 09:08:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:08:56] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2022-05-19 09:08:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:08:56] [INFO ] [Nat]Absence check using 135 positive place invariants in 41 ms returned sat
[2022-05-19 09:08:56] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-19 09:08:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:09:03] [INFO ] [Nat]Absence check using state equation in 6509 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 55 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 48 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2022-05-19 09:09:03] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:09:03] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:09:04] [INFO ] Implicit Places using invariants in 956 ms returned []
[2022-05-19 09:09:04] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:09:04] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 09:09:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:09:13] [INFO ] Implicit Places using invariants and state equation in 8888 ms returned []
Implicit Place search using SMT with State Equation took 9848 ms to find 0 implicit places.
[2022-05-19 09:09:13] [INFO ] Redundant transitions in 87 ms returned []
[2022-05-19 09:09:13] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:09:13] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 09:09:14] [INFO ] Dead Transitions using invariants and state equation in 1134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-11 in 38166 ms.
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-12
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:09:14] [INFO ] Computed 142 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 706 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :3
[2022-05-19 09:09:14] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:09:14] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 09:09:14] [INFO ] [Real]Absence check using 135 positive place invariants in 44 ms returned sat
[2022-05-19 09:09:14] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-19 09:09:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:09:15] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2022-05-19 09:09:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:09:15] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-19 09:09:15] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2022-05-19 09:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:09:15] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2022-05-19 09:09:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:09:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 842 ms returned sat
[2022-05-19 09:09:17] [INFO ] Deduced a trap composed of 446 places in 447 ms of which 1 ms to minimize.
[2022-05-19 09:09:17] [INFO ] Deduced a trap composed of 436 places in 444 ms of which 1 ms to minimize.
[2022-05-19 09:09:18] [INFO ] Deduced a trap composed of 438 places in 452 ms of which 1 ms to minimize.
[2022-05-19 09:09:18] [INFO ] Deduced a trap composed of 438 places in 452 ms of which 1 ms to minimize.
[2022-05-19 09:09:19] [INFO ] Deduced a trap composed of 438 places in 447 ms of which 1 ms to minimize.
[2022-05-19 09:09:19] [INFO ] Deduced a trap composed of 436 places in 435 ms of which 1 ms to minimize.
[2022-05-19 09:09:20] [INFO ] Deduced a trap composed of 452 places in 431 ms of which 1 ms to minimize.
[2022-05-19 09:09:20] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
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:657)
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)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 55 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2022-05-19 09:09:20] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:09:20] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:09:21] [INFO ] Dead Transitions using invariants and state equation in 1048 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:09:21] [INFO ] Computed 142 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 70370 resets, run finished after 9873 ms. (steps per millisecond=101 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7131 resets, run finished after 1949 ms. (steps per millisecond=513 ) properties (out of 1) seen :3
[2022-05-19 09:09:33] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:09:33] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:09:33] [INFO ] [Real]Absence check using 135 positive place invariants in 41 ms returned sat
[2022-05-19 09:09:33] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-19 09:09:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:09:34] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2022-05-19 09:09:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:09:34] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-19 09:09:34] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2022-05-19 09:09:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:09:34] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2022-05-19 09:09:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:09:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 793 ms returned sat
[2022-05-19 09:09:36] [INFO ] Deduced a trap composed of 446 places in 424 ms of which 1 ms to minimize.
[2022-05-19 09:09:36] [INFO ] Deduced a trap composed of 436 places in 430 ms of which 1 ms to minimize.
[2022-05-19 09:09:37] [INFO ] Deduced a trap composed of 438 places in 434 ms of which 1 ms to minimize.
[2022-05-19 09:09:37] [INFO ] Deduced a trap composed of 438 places in 426 ms of which 1 ms to minimize.
[2022-05-19 09:09:38] [INFO ] Deduced a trap composed of 438 places in 446 ms of which 1 ms to minimize.
[2022-05-19 09:09:38] [INFO ] Deduced a trap composed of 436 places in 439 ms of which 1 ms to minimize.
[2022-05-19 09:09:39] [INFO ] Deduced a trap composed of 452 places in 431 ms of which 0 ms to minimize.
[2022-05-19 09:09:39] [INFO ] Deduced a trap composed of 446 places in 441 ms of which 1 ms to minimize.
[2022-05-19 09:09:40] [INFO ] Deduced a trap composed of 442 places in 435 ms of which 1 ms to minimize.
[2022-05-19 09:09:40] [INFO ] Deduced a trap composed of 434 places in 431 ms of which 1 ms to minimize.
[2022-05-19 09:09:41] [INFO ] Deduced a trap composed of 432 places in 433 ms of which 1 ms to minimize.
[2022-05-19 09:09:41] [INFO ] Deduced a trap composed of 440 places in 451 ms of which 1 ms to minimize.
[2022-05-19 09:09:42] [INFO ] Deduced a trap composed of 448 places in 439 ms of which 0 ms to minimize.
[2022-05-19 09:09:42] [INFO ] Deduced a trap composed of 442 places in 429 ms of which 1 ms to minimize.
[2022-05-19 09:09:43] [INFO ] Deduced a trap composed of 432 places in 435 ms of which 1 ms to minimize.
[2022-05-19 09:09:44] [INFO ] Deduced a trap composed of 460 places in 436 ms of which 1 ms to minimize.
[2022-05-19 09:09:45] [INFO ] Deduced a trap composed of 446 places in 437 ms of which 1 ms to minimize.
[2022-05-19 09:09:45] [INFO ] Deduced a trap composed of 434 places in 435 ms of which 0 ms to minimize.
[2022-05-19 09:09:46] [INFO ] Deduced a trap composed of 436 places in 456 ms of which 1 ms to minimize.
[2022-05-19 09:09:47] [INFO ] Deduced a trap composed of 452 places in 437 ms of which 0 ms to minimize.
[2022-05-19 09:09:48] [INFO ] Deduced a trap composed of 436 places in 448 ms of which 1 ms to minimize.
[2022-05-19 09:09:48] [INFO ] Deduced a trap composed of 443 places in 448 ms of which 1 ms to minimize.
[2022-05-19 09:09:49] [INFO ] Deduced a trap composed of 428 places in 451 ms of which 0 ms to minimize.
[2022-05-19 09:09:49] [INFO ] Deduced a trap composed of 435 places in 459 ms of which 1 ms to minimize.
[2022-05-19 09:09:50] [INFO ] Deduced a trap composed of 428 places in 457 ms of which 1 ms to minimize.
[2022-05-19 09:09:50] [INFO ] Deduced a trap composed of 438 places in 471 ms of which 1 ms to minimize.
[2022-05-19 09:09:51] [INFO ] Deduced a trap composed of 435 places in 456 ms of which 1 ms to minimize.
[2022-05-19 09:09:51] [INFO ] Deduced a trap composed of 444 places in 457 ms of which 1 ms to minimize.
[2022-05-19 09:09:55] [INFO ] Deduced a trap composed of 430 places in 468 ms of which 1 ms to minimize.
[2022-05-19 09:09:55] [INFO ] Deduced a trap composed of 432 places in 481 ms of which 1 ms to minimize.
[2022-05-19 09:09:56] [INFO ] Deduced a trap composed of 457 places in 475 ms of which 1 ms to minimize.
[2022-05-19 09:09:56] [INFO ] Deduced a trap composed of 437 places in 477 ms of which 1 ms to minimize.
[2022-05-19 09:09:57] [INFO ] Deduced a trap composed of 436 places in 471 ms of which 1 ms to minimize.
[2022-05-19 09:09:58] [INFO ] Deduced a trap composed of 436 places in 473 ms of which 1 ms to minimize.
[2022-05-19 09:09:58] [INFO ] Deduced a trap composed of 442 places in 465 ms of which 1 ms to minimize.
[2022-05-19 09:09:59] [INFO ] Deduced a trap composed of 439 places in 463 ms of which 1 ms to minimize.
[2022-05-19 09:10:02] [INFO ] Trap strengthening (SAT) tested/added 36/36 trap constraints in 26598 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 57 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 47 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2022-05-19 09:10:02] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:10:02] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:10:03] [INFO ] Implicit Places using invariants in 884 ms returned []
[2022-05-19 09:10:03] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:10:03] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:10:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:10:09] [INFO ] Implicit Places using invariants and state equation in 6290 ms returned []
Implicit Place search using SMT with State Equation took 7174 ms to find 0 implicit places.
[2022-05-19 09:10:09] [INFO ] Redundant transitions in 35 ms returned []
[2022-05-19 09:10:09] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:10:09] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:10:10] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-12 in 56234 ms.
[2022-05-19 09:10:10] [INFO ] Flatten gal took : 257 ms
[2022-05-19 09:10:11] [INFO ] Applying decomposition
[2022-05-19 09:10:11] [INFO ] Flatten gal took : 167 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13016940454382119541.txt' '-o' '/tmp/graph13016940454382119541.bin' '-w' '/tmp/graph13016940454382119541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13016940454382119541.bin' '-l' '-1' '-v' '-w' '/tmp/graph13016940454382119541.weights' '-q' '0' '-e' '0.001'
[2022-05-19 09:10:11] [INFO ] Decomposing Gal with order
[2022-05-19 09:10:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 09:10:12] [INFO ] Removed a total of 4057 redundant transitions.
[2022-05-19 09:10:12] [INFO ] Flatten gal took : 443 ms
[2022-05-19 09:10:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 560 labels/synchronizations in 99 ms.
[2022-05-19 09:10:12] [INFO ] Time to serialize gal into /tmp/UpperBounds9539272005651745525.gal : 24 ms
[2022-05-19 09:10:12] [INFO ] Time to serialize properties into /tmp/UpperBounds4709263464501544710.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9539272005651745525.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4709263464501544710.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds4709263464501544710.prop.
Detected timeout of ITS tools.
[2022-05-19 09:31:49] [INFO ] Applying decomposition
[2022-05-19 09:31:50] [INFO ] Flatten gal took : 581 ms
[2022-05-19 09:31:50] [INFO ] Decomposing Gal with order
[2022-05-19 09:31:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 09:31:52] [INFO ] Removed a total of 9599 redundant transitions.
[2022-05-19 09:31:52] [INFO ] Flatten gal took : 988 ms
[2022-05-19 09:31:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 85 ms.
[2022-05-19 09:31:52] [INFO ] Time to serialize gal into /tmp/UpperBounds8760651409309904104.gal : 70 ms
[2022-05-19 09:31:52] [INFO ] Time to serialize properties into /tmp/UpperBounds338315352810894033.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8760651409309904104.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds338315352810894033.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...273
Loading property file /tmp/UpperBounds338315352810894033.prop.
Detected timeout of ITS tools.
[2022-05-19 09:53:49] [INFO ] Flatten gal took : 515 ms
[2022-05-19 09:53:51] [INFO ] Input system was already deterministic with 2062 transitions.
[2022-05-19 09:53:51] [INFO ] Transformed 1091 places.
[2022-05-19 09:53:51] [INFO ] Transformed 2062 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 09:54:21] [INFO ] Time to serialize gal into /tmp/UpperBounds13390491589169564412.gal : 42 ms
[2022-05-19 09:54:21] [INFO ] Time to serialize properties into /tmp/UpperBounds8383347198594897330.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13390491589169564412.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8383347198594897330.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds8383347198594897330.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
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-S10J60"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBNT-COL-S10J60, 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 r168-tall-165277017200797"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J60.tgz
mv PolyORBNT-COL-S10J60 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 '
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 ;