Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089268300379.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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-S05J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089268300379
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 27 09:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 09:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 12:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 12:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 93K May 5 16:51 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-S05J40-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621212538797

Running Version 0
[2021-05-17 00:49:03] [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]
[2021-05-17 00:49:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 00:49:04] [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.
[2021-05-17 00:49:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 00:49:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 818 ms
[2021-05-17 00:49:04] [INFO ] ms3 symmetric to ms2 in transition trans_489
[2021-05-17 00:49:04] [INFO ] ms2 symmetric to ms4 in transition trans_489
[2021-05-17 00:49:04] [INFO ] ms4 symmetric to ms1 in transition trans_489
[2021-05-17 00:49:04] [INFO ] ms3 symmetric to ms2 in transition trans_488
[2021-05-17 00:49:04] [INFO ] ms2 symmetric to ms1 in transition trans_488
[2021-05-17 00:49:04] [INFO ] ms2 symmetric to ms1 in transition trans_487
[2021-05-17 00:49:04] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 47 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2021-05-17 00:49:05] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 7 ms.
[2021-05-17 00:49:05] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_17869926307302190182.dot
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 00:49:05] [INFO ] Computed 13 place invariants in 11 ms
FORMULA PolyORBNT-COL-S05J40-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-17 00:49:05] [INFO ] Unfolded HLPN to a Petri net with 669 places and 975 transitions in 23 ms.
[2021-05-17 00:49:05] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 00:49:05] [INFO ] Computed 13 place invariants in 7 ms
[2021-05-17 00:49:06] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-17 00:49:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-17 00:49:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:06] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-17 00:49:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:49:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:49:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:06] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-17 00:49:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:49:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-17 00:49:06] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2021-05-17 00:49:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2021-05-17 00:49:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 00:49:06] [INFO ] Added : 18 causal constraints over 4 iterations in 280 ms. Result :sat
Minimization took 130 ms.
[2021-05-17 00:49:06] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:49:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:49:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:06] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 00:49:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 52 ms returned sat
[2021-05-17 00:49:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 33 ms returned sat
[2021-05-17 00:49:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:07] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2021-05-17 00:49:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2021-05-17 00:49:07] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2021-05-17 00:49:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-17 00:49:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 25 ms.
[2021-05-17 00:49:07] [INFO ] Added : 18 causal constraints over 4 iterations in 107 ms. Result :sat
Minimization took 13 ms.
[2021-05-17 00:49:07] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2021-05-17 00:49:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 13 ms returned sat
[2021-05-17 00:49:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:07] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-17 00:49:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:49:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:49:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:07] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-17 00:49:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:49:08] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 3 ms to minimize.
[2021-05-17 00:49:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2021-05-17 00:49:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 00:49:08] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 2 ms to minimize.
[2021-05-17 00:49:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 552 ms
[2021-05-17 00:49:08] [INFO ] Added : 36 causal constraints over 8 iterations in 675 ms. Result :sat
Minimization took 70 ms.
[2021-05-17 00:49:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:49:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:08] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-17 00:49:08] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:49:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:49:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:49:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:09] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-17 00:49:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 00:49:09] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2021-05-17 00:49:09] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2021-05-17 00:49:09] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2021-05-17 00:49:09] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2021-05-17 00:49:09] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2021-05-17 00:49:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 239 ms
[2021-05-17 00:49:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 00:49:09] [INFO ] Added : 33 causal constraints over 7 iterations in 206 ms. Result :sat
Minimization took 24 ms.
[2021-05-17 00:49:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:49:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:09] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-17 00:49:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:49:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-17 00:49:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:49:09] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2021-05-17 00:49:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2021-05-17 00:49:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-17 00:49:09] [INFO ] Added : 17 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 75 ms.
[2021-05-17 00:49:09] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 00:49:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 36 ms returned sat
[2021-05-17 00:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:10] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-17 00:49:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:49:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 19 ms returned sat
[2021-05-17 00:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:10] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-17 00:49:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:49:10] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2021-05-17 00:49:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2021-05-17 00:49:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 00:49:10] [INFO ] Added : 14 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 31 ms.
[2021-05-17 00:49:10] [INFO ] [Real]Absence check using 6 positive place invariants in 53 ms returned sat
[2021-05-17 00:49:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 53 ms returned sat
[2021-05-17 00:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:10] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-17 00:49:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:49:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-17 00:49:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:49:10] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2021-05-17 00:49:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2021-05-17 00:49:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 00:49:10] [INFO ] Added : 17 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 74 ms.
[2021-05-17 00:49:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:49:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-17 00:49:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:49:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:10] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-17 00:49:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:49:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-17 00:49:10] [INFO ] Added : 35 causal constraints over 7 iterations in 61 ms. Result :sat
Minimization took 24 ms.
[2021-05-17 00:49:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:49:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:11] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-17 00:49:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:49:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 55 ms returned sat
[2021-05-17 00:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:11] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-17 00:49:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:49:11] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2021-05-17 00:49:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2021-05-17 00:49:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 00:49:11] [INFO ] Added : 21 causal constraints over 5 iterations in 177 ms. Result :sat
Minimization took 26 ms.
[2021-05-17 00:49:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:49:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:11] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-17 00:49:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 22 ms returned sat
[2021-05-17 00:49:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:11] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-17 00:49:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:49:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 00:49:11] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2021-05-17 00:49:11] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2021-05-17 00:49:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
[2021-05-17 00:49:11] [INFO ] Added : 36 causal constraints over 8 iterations in 255 ms. Result :sat
Minimization took 51 ms.
[2021-05-17 00:49:12] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:12] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-17 00:49:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:12] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 00:49:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 00:49:12] [INFO ] Added : 36 causal constraints over 8 iterations in 108 ms. Result :sat
Minimization took 26 ms.
[2021-05-17 00:49:12] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2021-05-17 00:49:12] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:12] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-17 00:49:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:12] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:49:12] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2021-05-17 00:49:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2021-05-17 00:49:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 00:49:12] [INFO ] Added : 18 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 11 ms.
[2021-05-17 00:49:12] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:12] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-17 00:49:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:12] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:49:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 00:49:12] [INFO ] Added : 36 causal constraints over 8 iterations in 53 ms. Result :sat
Minimization took 27 ms.
[2021-05-17 00:49:12] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:49:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 2, -1, 1, 10, 1, 10, -1, 3, -1, -1, 3, 2, -1, 1]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2021-05-17 00:49:12] [INFO ] Unfolded HLPN to a Petri net with 669 places and 975 transitions in 7 ms.
[2021-05-17 00:49:12] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_16602206492497484834.dot
Deduced a syphon composed of 40 places in 23 ms
Reduce places removed 40 places and 40 transitions.
Incomplete random walk after 10000 steps, including 680 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :23
FORMULA PolyORBNT-COL-S05J40-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 143 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :11
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10000 steps, including 175 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 10000 steps, including 148 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10000 steps, including 118 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :11
[2021-05-17 00:49:13] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2021-05-17 00:49:13] [INFO ] Computed 102 place invariants in 124 ms
[2021-05-17 00:49:14] [INFO ] [Real]Absence check using 95 positive place invariants in 596 ms returned sat
[2021-05-17 00:49:14] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 5 ms returned unsat
[2021-05-17 00:49:14] [INFO ] [Real]Absence check using 95 positive place invariants in 53 ms returned sat
[2021-05-17 00:49:14] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned unsat
[2021-05-17 00:49:14] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2021-05-17 00:49:14] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 23 ms returned sat
[2021-05-17 00:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:15] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2021-05-17 00:49:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:15] [INFO ] [Nat]Absence check using 95 positive place invariants in 32 ms returned sat
[2021-05-17 00:49:15] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 24 ms returned sat
[2021-05-17 00:49:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:16] [INFO ] [Nat]Absence check using state equation in 793 ms returned sat
[2021-05-17 00:49:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:49:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2021-05-17 00:49:16] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 181 ms.
[2021-05-17 00:49:17] [INFO ] Added : 18 causal constraints over 4 iterations in 700 ms. Result :sat
Minimization took 207 ms.
[2021-05-17 00:49:17] [INFO ] [Real]Absence check using 95 positive place invariants in 41 ms returned sat
[2021-05-17 00:49:17] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2021-05-17 00:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:18] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2021-05-17 00:49:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:18] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2021-05-17 00:49:18] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-17 00:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:18] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2021-05-17 00:49:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-17 00:49:18] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 100 ms.
[2021-05-17 00:49:19] [INFO ] Added : 7 causal constraints over 2 iterations in 332 ms. Result :sat
Minimization took 128 ms.
[2021-05-17 00:49:19] [INFO ] [Real]Absence check using 95 positive place invariants in 41 ms returned sat
[2021-05-17 00:49:19] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 25 ms returned sat
[2021-05-17 00:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:19] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2021-05-17 00:49:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:20] [INFO ] [Nat]Absence check using 95 positive place invariants in 87 ms returned sat
[2021-05-17 00:49:20] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 28 ms returned sat
[2021-05-17 00:49:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:20] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2021-05-17 00:49:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2021-05-17 00:49:20] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 129 ms.
[2021-05-17 00:49:21] [INFO ] Added : 18 causal constraints over 4 iterations in 789 ms. Result :sat
Minimization took 431 ms.
[2021-05-17 00:49:22] [INFO ] [Real]Absence check using 95 positive place invariants in 36 ms returned sat
[2021-05-17 00:49:22] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 28 ms returned unsat
[2021-05-17 00:49:22] [INFO ] [Real]Absence check using 95 positive place invariants in 103 ms returned sat
[2021-05-17 00:49:22] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 26 ms returned sat
[2021-05-17 00:49:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:23] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2021-05-17 00:49:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:23] [INFO ] [Nat]Absence check using 95 positive place invariants in 49 ms returned sat
[2021-05-17 00:49:23] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 25 ms returned unsat
[2021-05-17 00:49:23] [INFO ] [Real]Absence check using 95 positive place invariants in 48 ms returned sat
[2021-05-17 00:49:23] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 21 ms returned unsat
[2021-05-17 00:49:23] [INFO ] [Real]Absence check using 95 positive place invariants in 28 ms returned sat
[2021-05-17 00:49:23] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 10, 1, 10, 1, 1, 1, 1] Max seen :[4, 1, 3, 0, 3, 1, 1, 1, 1]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 5600 steps, including 323 resets, run finished after 54 ms. (steps per millisecond=103 ) properties (out of 3) seen :4 could not realise parikh vector
Incomplete Parikh walk after 1100 steps, including 91 resets, run finished after 3 ms. (steps per millisecond=366 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA PolyORBNT-COL-S05J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 5600 steps, including 324 resets, run finished after 19 ms. (steps per millisecond=294 ) properties (out of 2) seen :4 could not realise parikh vector
Support contains 1 out of 629 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 624 transition count 890
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 96 place count 579 transition count 889
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 578 transition count 889
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 97 place count 578 transition count 845
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 185 place count 534 transition count 845
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 186 place count 533 transition count 844
Iterating global reduction 3 with 1 rules applied. Total rules applied 187 place count 533 transition count 844
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 191 place count 531 transition count 842
Applied a total of 191 rules in 490 ms. Remains 531 /629 variables (removed 98) and now considering 842/935 (removed 93) transitions.
[2021-05-17 00:49:24] [INFO ] Flow matrix only has 838 transitions (discarded 4 similar events)
// Phase 1: matrix 838 rows 531 cols
[2021-05-17 00:49:24] [INFO ] Computed 97 place invariants in 82 ms
[2021-05-17 00:49:26] [INFO ] Dead Transitions using invariants and state equation in 1776 ms returned [501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 542, 543, 544, 545, 546, 548, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 577, 578, 579, 580, 581, 583, 586, 587, 588, 589, 590, 591, 593, 596, 600, 601, 602, 603, 604, 605, 606, 608, 611, 615, 620]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[620, 615, 611, 608, 606, 605, 604, 603, 602, 601, 600, 596, 593, 591, 590, 589, 588, 587, 586, 583, 581, 580, 579, 578, 577, 575, 574, 573, 572, 571, 570, 569, 568, 567, 566, 565, 564, 563, 562, 561, 560, 559, 558, 557, 556, 555, 554, 553, 552, 551, 548, 546, 545, 544, 543, 542, 540, 539, 538, 537, 536, 535, 534, 533, 532, 531, 530, 529, 528, 527, 526, 525, 524, 523, 522, 520, 519, 518, 517, 516, 515, 514, 513, 512, 511, 510, 509, 508, 507, 506, 505, 504, 503, 502, 501]
Starting structural reductions, iteration 1 : 531/629 places, 747/935 transitions.
Applied a total of 0 rules in 46 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 531/629 places, 747/935 transitions.
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:49:26] [INFO ] Computed 97 place invariants in 62 ms
Incomplete random walk after 1000000 steps, including 47229 resets, run finished after 5038 ms. (steps per millisecond=198 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 4455 resets, run finished after 960 ms. (steps per millisecond=1041 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 4531 resets, run finished after 956 ms. (steps per millisecond=1046 ) properties (out of 2) seen :6
[2021-05-17 00:49:33] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:49:33] [INFO ] Computed 97 place invariants in 39 ms
[2021-05-17 00:49:33] [INFO ] [Real]Absence check using 90 positive place invariants in 28 ms returned sat
[2021-05-17 00:49:33] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 22 ms returned sat
[2021-05-17 00:49:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:34] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2021-05-17 00:49:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:49:34] [INFO ] [Nat]Absence check using 90 positive place invariants in 42 ms returned sat
[2021-05-17 00:49:34] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 26 ms returned sat
[2021-05-17 00:49:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:49:34] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2021-05-17 00:49:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:49:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2021-05-17 00:49:35] [INFO ] Deduced a trap composed of 161 places in 476 ms of which 42 ms to minimize.
[2021-05-17 00:49:38] [INFO ] Deduced a trap composed of 167 places in 2793 ms of which 1 ms to minimize.
[2021-05-17 00:49:41] [INFO ] Deduced a trap composed of 167 places in 3070 ms of which 1 ms to minimize.
[2021-05-17 00:49:41] [INFO ] Deduced a trap composed of 164 places in 321 ms of which 0 ms to minimize.
[2021-05-17 00:49:42] [INFO ] Deduced a trap composed of 176 places in 318 ms of which 1 ms to minimize.
[2021-05-17 00:49:43] [INFO ] Deduced a trap composed of 161 places in 1637 ms of which 9 ms to minimize.
[2021-05-17 00:49:44] [INFO ] Deduced a trap composed of 167 places in 441 ms of which 2 ms to minimize.
[2021-05-17 00:49:44] [INFO ] Deduced a trap composed of 162 places in 339 ms of which 1 ms to minimize.
[2021-05-17 00:49:44] [INFO ] Deduced a trap composed of 164 places in 283 ms of which 1 ms to minimize.
[2021-05-17 00:49:45] [INFO ] Deduced a trap composed of 162 places in 364 ms of which 0 ms to minimize.
[2021-05-17 00:49:54] [INFO ] Deduced a trap composed of 155 places in 8622 ms of which 10 ms to minimize.
[2021-05-17 00:49:54] [INFO ] Deduced a trap composed of 165 places in 350 ms of which 1 ms to minimize.
[2021-05-17 00:49:55] [INFO ] Deduced a trap composed of 161 places in 316 ms of which 1 ms to minimize.
[2021-05-17 00:50:02] [INFO ] Deduced a trap composed of 164 places in 6786 ms of which 17 ms to minimize.
[2021-05-17 00:50:02] [INFO ] Deduced a trap composed of 155 places in 160 ms of which 0 ms to minimize.
[2021-05-17 00:50:03] [INFO ] Deduced a trap composed of 179 places in 247 ms of which 1 ms to minimize.
[2021-05-17 00:50:08] [INFO ] Deduced a trap composed of 179 places in 4701 ms of which 3 ms to minimize.
[2021-05-17 00:50:08] [INFO ] Deduced a trap composed of 152 places in 342 ms of which 11 ms to minimize.
[2021-05-17 00:50:10] [INFO ] Deduced a trap composed of 185 places in 309 ms of which 5 ms to minimize.
[2021-05-17 00:50:11] [INFO ] Deduced a trap composed of 170 places in 320 ms of which 1 ms to minimize.
[2021-05-17 00:50:19] [INFO ] Deduced a trap composed of 7 places in 381 ms of which 0 ms to minimize.
[2021-05-17 00:50:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 00:50:19] [INFO ] [Real]Absence check using 90 positive place invariants in 15 ms returned sat
[2021-05-17 00:50:19] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 8 ms returned sat
[2021-05-17 00:50:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:50:19] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2021-05-17 00:50:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:50:19] [INFO ] [Nat]Absence check using 90 positive place invariants in 15 ms returned sat
[2021-05-17 00:50:19] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 14 ms returned sat
[2021-05-17 00:50:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:50:20] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2021-05-17 00:50:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 16 ms returned sat
[2021-05-17 00:50:20] [INFO ] Deduced a trap composed of 161 places in 278 ms of which 1 ms to minimize.
[2021-05-17 00:50:20] [INFO ] Deduced a trap composed of 167 places in 329 ms of which 1 ms to minimize.
[2021-05-17 00:50:21] [INFO ] Deduced a trap composed of 167 places in 145 ms of which 0 ms to minimize.
[2021-05-17 00:50:21] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 1 ms to minimize.
[2021-05-17 00:50:21] [INFO ] Deduced a trap composed of 176 places in 244 ms of which 0 ms to minimize.
[2021-05-17 00:50:21] [INFO ] Deduced a trap composed of 161 places in 168 ms of which 0 ms to minimize.
[2021-05-17 00:50:21] [INFO ] Deduced a trap composed of 167 places in 187 ms of which 1 ms to minimize.
[2021-05-17 00:50:22] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2021-05-17 00:50:22] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 1 ms to minimize.
[2021-05-17 00:50:22] [INFO ] Deduced a trap composed of 162 places in 356 ms of which 1 ms to minimize.
[2021-05-17 00:50:25] [INFO ] Deduced a trap composed of 155 places in 2270 ms of which 0 ms to minimize.
[2021-05-17 00:50:25] [INFO ] Deduced a trap composed of 165 places in 247 ms of which 0 ms to minimize.
[2021-05-17 00:50:25] [INFO ] Deduced a trap composed of 161 places in 260 ms of which 2 ms to minimize.
[2021-05-17 00:50:26] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 1 ms to minimize.
[2021-05-17 00:50:26] [INFO ] Deduced a trap composed of 155 places in 274 ms of which 1 ms to minimize.
[2021-05-17 00:50:27] [INFO ] Deduced a trap composed of 179 places in 211 ms of which 1 ms to minimize.
[2021-05-17 00:50:28] [INFO ] Deduced a trap composed of 179 places in 392 ms of which 1 ms to minimize.
[2021-05-17 00:50:28] [INFO ] Deduced a trap composed of 152 places in 205 ms of which 7 ms to minimize.
[2021-05-17 00:50:29] [INFO ] Deduced a trap composed of 185 places in 123 ms of which 1 ms to minimize.
[2021-05-17 00:50:30] [INFO ] Deduced a trap composed of 170 places in 141 ms of which 0 ms to minimize.
[2021-05-17 00:51:05] [INFO ] Deduced a trap composed of 7 places in 390 ms of which 1 ms to minimize.
[2021-05-17 00:51:05] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[3, 3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 41 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 26 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2021-05-17 00:51:05] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:51:05] [INFO ] Computed 97 place invariants in 18 ms
[2021-05-17 00:51:06] [INFO ] Implicit Places using invariants in 724 ms returned []
[2021-05-17 00:51:06] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:51:06] [INFO ] Computed 97 place invariants in 10 ms
[2021-05-17 00:51:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:51:07] [INFO ] Implicit Places using invariants and state equation in 1742 ms returned []
Implicit Place search using SMT with State Equation took 2483 ms to find 0 implicit places.
[2021-05-17 00:51:07] [INFO ] Redundant transitions in 32 ms returned []
[2021-05-17 00:51:07] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:51:07] [INFO ] Computed 97 place invariants in 16 ms
[2021-05-17 00:51:08] [INFO ] Dead Transitions using invariants and state equation in 439 ms returned []
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J40-UpperBounds-04
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:51:08] [INFO ] Computed 97 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 486 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :3
[2021-05-17 00:51:08] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:51:08] [INFO ] Computed 97 place invariants in 11 ms
[2021-05-17 00:51:08] [INFO ] [Real]Absence check using 90 positive place invariants in 21 ms returned sat
[2021-05-17 00:51:08] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 24 ms returned sat
[2021-05-17 00:51:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:51:09] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2021-05-17 00:51:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:51:09] [INFO ] [Nat]Absence check using 90 positive place invariants in 20 ms returned sat
[2021-05-17 00:51:09] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2021-05-17 00:51:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:51:09] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2021-05-17 00:51:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:51:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 43 ms returned sat
[2021-05-17 00:51:09] [INFO ] Deduced a trap composed of 161 places in 149 ms of which 1 ms to minimize.
[2021-05-17 00:51:10] [INFO ] Deduced a trap composed of 167 places in 278 ms of which 1 ms to minimize.
[2021-05-17 00:51:10] [INFO ] Deduced a trap composed of 167 places in 242 ms of which 1 ms to minimize.
[2021-05-17 00:51:10] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 1 ms to minimize.
[2021-05-17 00:51:10] [INFO ] Deduced a trap composed of 176 places in 250 ms of which 1 ms to minimize.
[2021-05-17 00:51:11] [INFO ] Deduced a trap composed of 161 places in 238 ms of which 1 ms to minimize.
[2021-05-17 00:51:11] [INFO ] Deduced a trap composed of 167 places in 232 ms of which 3 ms to minimize.
[2021-05-17 00:51:11] [INFO ] Deduced a trap composed of 162 places in 235 ms of which 2 ms to minimize.
[2021-05-17 00:51:11] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 10 ms to minimize.
[2021-05-17 00:51:12] [INFO ] Deduced a trap composed of 162 places in 248 ms of which 2 ms to minimize.
[2021-05-17 00:51:13] [INFO ] Deduced a trap composed of 155 places in 710 ms of which 1 ms to minimize.
[2021-05-17 00:51:13] [INFO ] Deduced a trap composed of 165 places in 298 ms of which 0 ms to minimize.
[2021-05-17 00:51:13] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 12 ms to minimize.
[2021-05-17 00:51:14] [INFO ] Deduced a trap composed of 164 places in 142 ms of which 0 ms to minimize.
[2021-05-17 00:51:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 29 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2021-05-17 00:51:14] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:51:14] [INFO ] Computed 97 place invariants in 11 ms
[2021-05-17 00:51:14] [INFO ] Dead Transitions using invariants and state equation in 509 ms returned []
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:51:14] [INFO ] Computed 97 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 47450 resets, run finished after 3015 ms. (steps per millisecond=331 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000002 steps, including 4495 resets, run finished after 936 ms. (steps per millisecond=1068 ) properties (out of 1) seen :3
[2021-05-17 00:51:18] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:51:18] [INFO ] Computed 97 place invariants in 12 ms
[2021-05-17 00:51:18] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2021-05-17 00:51:18] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 15 ms returned sat
[2021-05-17 00:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:51:18] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2021-05-17 00:51:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:51:19] [INFO ] [Nat]Absence check using 90 positive place invariants in 15 ms returned sat
[2021-05-17 00:51:19] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-17 00:51:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:51:19] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2021-05-17 00:51:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:51:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2021-05-17 00:51:19] [INFO ] Deduced a trap composed of 161 places in 268 ms of which 2 ms to minimize.
[2021-05-17 00:51:20] [INFO ] Deduced a trap composed of 167 places in 289 ms of which 1 ms to minimize.
[2021-05-17 00:51:20] [INFO ] Deduced a trap composed of 167 places in 291 ms of which 1 ms to minimize.
[2021-05-17 00:51:20] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 0 ms to minimize.
[2021-05-17 00:51:20] [INFO ] Deduced a trap composed of 176 places in 220 ms of which 1 ms to minimize.
[2021-05-17 00:51:21] [INFO ] Deduced a trap composed of 161 places in 189 ms of which 1 ms to minimize.
[2021-05-17 00:51:21] [INFO ] Deduced a trap composed of 167 places in 193 ms of which 0 ms to minimize.
[2021-05-17 00:51:21] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 1 ms to minimize.
[2021-05-17 00:51:21] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 0 ms to minimize.
[2021-05-17 00:51:22] [INFO ] Deduced a trap composed of 162 places in 286 ms of which 1 ms to minimize.
[2021-05-17 00:51:22] [INFO ] Deduced a trap composed of 155 places in 243 ms of which 0 ms to minimize.
[2021-05-17 00:51:22] [INFO ] Deduced a trap composed of 165 places in 250 ms of which 1 ms to minimize.
[2021-05-17 00:51:23] [INFO ] Deduced a trap composed of 161 places in 131 ms of which 0 ms to minimize.
[2021-05-17 00:51:23] [INFO ] Deduced a trap composed of 164 places in 283 ms of which 1 ms to minimize.
[2021-05-17 00:51:24] [INFO ] Deduced a trap composed of 155 places in 322 ms of which 0 ms to minimize.
[2021-05-17 00:51:24] [INFO ] Deduced a trap composed of 179 places in 175 ms of which 1 ms to minimize.
[2021-05-17 00:51:25] [INFO ] Deduced a trap composed of 179 places in 166 ms of which 1 ms to minimize.
[2021-05-17 00:51:25] [INFO ] Deduced a trap composed of 152 places in 134 ms of which 1 ms to minimize.
[2021-05-17 00:51:27] [INFO ] Deduced a trap composed of 185 places in 291 ms of which 1 ms to minimize.
[2021-05-17 00:51:27] [INFO ] Deduced a trap composed of 170 places in 221 ms of which 1 ms to minimize.
[2021-05-17 00:52:04] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 0 ms to minimize.
[2021-05-17 00:52:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 49 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 15 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2021-05-17 00:52:04] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:52:04] [INFO ] Computed 97 place invariants in 12 ms
[2021-05-17 00:52:04] [INFO ] Implicit Places using invariants in 520 ms returned []
[2021-05-17 00:52:05] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:52:05] [INFO ] Computed 97 place invariants in 15 ms
[2021-05-17 00:52:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:52:07] [INFO ] Implicit Places using invariants and state equation in 2687 ms returned []
Implicit Place search using SMT with State Equation took 3221 ms to find 0 implicit places.
[2021-05-17 00:52:07] [INFO ] Redundant transitions in 24 ms returned []
[2021-05-17 00:52:07] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:52:07] [INFO ] Computed 97 place invariants in 14 ms
[2021-05-17 00:52:08] [INFO ] Dead Transitions using invariants and state equation in 620 ms returned []
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J40-UpperBounds-04 in 59998 ms.
Starting property specific reduction for PolyORBNT-COL-S05J40-UpperBounds-06
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:52:08] [INFO ] Computed 97 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 468 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :3
[2021-05-17 00:52:08] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:52:08] [INFO ] Computed 97 place invariants in 24 ms
[2021-05-17 00:52:08] [INFO ] [Real]Absence check using 90 positive place invariants in 27 ms returned sat
[2021-05-17 00:52:08] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 9 ms returned sat
[2021-05-17 00:52:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:52:08] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2021-05-17 00:52:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:52:09] [INFO ] [Nat]Absence check using 90 positive place invariants in 26 ms returned sat
[2021-05-17 00:52:09] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 25 ms returned sat
[2021-05-17 00:52:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:52:09] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2021-05-17 00:52:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:52:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2021-05-17 00:52:09] [INFO ] Deduced a trap composed of 161 places in 184 ms of which 0 ms to minimize.
[2021-05-17 00:52:09] [INFO ] Deduced a trap composed of 167 places in 120 ms of which 0 ms to minimize.
[2021-05-17 00:52:10] [INFO ] Deduced a trap composed of 167 places in 126 ms of which 1 ms to minimize.
[2021-05-17 00:52:10] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 1 ms to minimize.
[2021-05-17 00:52:10] [INFO ] Deduced a trap composed of 176 places in 140 ms of which 1 ms to minimize.
[2021-05-17 00:52:10] [INFO ] Deduced a trap composed of 161 places in 209 ms of which 0 ms to minimize.
[2021-05-17 00:52:10] [INFO ] Deduced a trap composed of 167 places in 196 ms of which 1 ms to minimize.
[2021-05-17 00:52:11] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2021-05-17 00:52:11] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 1 ms to minimize.
[2021-05-17 00:52:11] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 1 ms to minimize.
[2021-05-17 00:52:11] [INFO ] Deduced a trap composed of 155 places in 138 ms of which 0 ms to minimize.
[2021-05-17 00:52:12] [INFO ] Deduced a trap composed of 165 places in 157 ms of which 0 ms to minimize.
[2021-05-17 00:52:12] [INFO ] Deduced a trap composed of 161 places in 138 ms of which 0 ms to minimize.
[2021-05-17 00:52:12] [INFO ] Deduced a trap composed of 164 places in 144 ms of which 1 ms to minimize.
[2021-05-17 00:52:13] [INFO ] Deduced a trap composed of 155 places in 204 ms of which 0 ms to minimize.
[2021-05-17 00:52:14] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 1 ms to minimize.
[2021-05-17 00:52:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 25 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2021-05-17 00:52:14] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:52:14] [INFO ] Computed 97 place invariants in 10 ms
[2021-05-17 00:52:14] [INFO ] Dead Transitions using invariants and state equation in 669 ms returned []
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:52:14] [INFO ] Computed 97 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 47245 resets, run finished after 2925 ms. (steps per millisecond=341 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 4508 resets, run finished after 893 ms. (steps per millisecond=1119 ) properties (out of 1) seen :3
[2021-05-17 00:52:18] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:52:18] [INFO ] Computed 97 place invariants in 12 ms
[2021-05-17 00:52:18] [INFO ] [Real]Absence check using 90 positive place invariants in 17 ms returned sat
[2021-05-17 00:52:18] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 8 ms returned sat
[2021-05-17 00:52:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:52:19] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2021-05-17 00:52:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:52:19] [INFO ] [Nat]Absence check using 90 positive place invariants in 25 ms returned sat
[2021-05-17 00:52:19] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 25 ms returned sat
[2021-05-17 00:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:52:19] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2021-05-17 00:52:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:52:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2021-05-17 00:52:19] [INFO ] Deduced a trap composed of 161 places in 243 ms of which 1 ms to minimize.
[2021-05-17 00:52:20] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 1 ms to minimize.
[2021-05-17 00:52:20] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 1 ms to minimize.
[2021-05-17 00:52:20] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 1 ms to minimize.
[2021-05-17 00:52:20] [INFO ] Deduced a trap composed of 176 places in 243 ms of which 1 ms to minimize.
[2021-05-17 00:52:21] [INFO ] Deduced a trap composed of 161 places in 202 ms of which 0 ms to minimize.
[2021-05-17 00:52:21] [INFO ] Deduced a trap composed of 167 places in 190 ms of which 1 ms to minimize.
[2021-05-17 00:52:21] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 0 ms to minimize.
[2021-05-17 00:52:21] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 0 ms to minimize.
[2021-05-17 00:52:22] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 1 ms to minimize.
[2021-05-17 00:52:22] [INFO ] Deduced a trap composed of 155 places in 254 ms of which 1 ms to minimize.
[2021-05-17 00:52:22] [INFO ] Deduced a trap composed of 165 places in 211 ms of which 0 ms to minimize.
[2021-05-17 00:52:23] [INFO ] Deduced a trap composed of 161 places in 209 ms of which 1 ms to minimize.
[2021-05-17 00:52:23] [INFO ] Deduced a trap composed of 164 places in 260 ms of which 1 ms to minimize.
[2021-05-17 00:52:23] [INFO ] Deduced a trap composed of 155 places in 181 ms of which 0 ms to minimize.
[2021-05-17 00:52:24] [INFO ] Deduced a trap composed of 179 places in 122 ms of which 1 ms to minimize.
[2021-05-17 00:52:25] [INFO ] Deduced a trap composed of 179 places in 276 ms of which 0 ms to minimize.
[2021-05-17 00:52:25] [INFO ] Deduced a trap composed of 152 places in 152 ms of which 0 ms to minimize.
[2021-05-17 00:52:26] [INFO ] Deduced a trap composed of 185 places in 122 ms of which 1 ms to minimize.
[2021-05-17 00:52:27] [INFO ] Deduced a trap composed of 170 places in 230 ms of which 1 ms to minimize.
[2021-05-17 00:53:04] [INFO ] Deduced a trap composed of 7 places in 446 ms of which 1 ms to minimize.
[2021-05-17 00:53:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 29 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 47 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2021-05-17 00:53:04] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:53:04] [INFO ] Computed 97 place invariants in 9 ms
[2021-05-17 00:53:05] [INFO ] Implicit Places using invariants in 423 ms returned []
[2021-05-17 00:53:05] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:53:05] [INFO ] Computed 97 place invariants in 26 ms
[2021-05-17 00:53:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:53:06] [INFO ] Implicit Places using invariants and state equation in 1802 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
[2021-05-17 00:53:06] [INFO ] Redundant transitions in 5 ms returned []
[2021-05-17 00:53:06] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 00:53:07] [INFO ] Computed 97 place invariants in 18 ms
[2021-05-17 00:53:07] [INFO ] Dead Transitions using invariants and state equation in 562 ms returned []
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J40-UpperBounds-06 in 59206 ms.
[2021-05-17 00:53:07] [INFO ] Flatten gal took : 131 ms
[2021-05-17 00:53:07] [INFO ] Applying decomposition
[2021-05-17 00:53:07] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12352380371719389720.txt, -o, /tmp/graph12352380371719389720.bin, -w, /tmp/graph12352380371719389720.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12352380371719389720.bin, -l, -1, -v, -w, /tmp/graph12352380371719389720.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 00:53:08] [INFO ] Decomposing Gal with order
[2021-05-17 00:53:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 00:53:08] [INFO ] Removed a total of 849 redundant transitions.
[2021-05-17 00:53:08] [INFO ] Flatten gal took : 211 ms
[2021-05-17 00:53:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 36 ms.
[2021-05-17 00:53:08] [INFO ] Time to serialize gal into /tmp/UpperBounds9422833082254650907.gal : 13 ms
[2021-05-17 00:53:08] [INFO ] Time to serialize properties into /tmp/UpperBounds9842350515637026061.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds9422833082254650907.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9842350515637026061.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds9422833082254650907.gal -t CGAL -reachable-file /tmp/UpperBounds9842350515637026061.prop --nowitness
Loading property file /tmp/UpperBounds9842350515637026061.prop.
Detected timeout of ITS tools.
[2021-05-17 01:14:38] [INFO ] Applying decomposition
[2021-05-17 01:14:39] [INFO ] Flatten gal took : 545 ms
[2021-05-17 01:14:39] [INFO ] Decomposing Gal with order
[2021-05-17 01:14:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 01:14:40] [INFO ] Removed a total of 2724 redundant transitions.
[2021-05-17 01:14:40] [INFO ] Flatten gal took : 716 ms
[2021-05-17 01:14:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 62 ms.
[2021-05-17 01:14:40] [INFO ] Time to serialize gal into /tmp/UpperBounds8366925507640197576.gal : 36 ms
[2021-05-17 01:14:40] [INFO ] Time to serialize properties into /tmp/UpperBounds7241494190410836236.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds8366925507640197576.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7241494190410836236.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8366925507640197576.gal -t CGAL -reachable-file /tmp/UpperBounds7241494190410836236.prop --nowitness
Loading property file /tmp/UpperBounds7241494190410836236.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.10827e+10,572.473,5608356,1.71832e+06,25,1.41456e+07,2669,1808,1.36633e+07,48,2406,0
Total reachable state count : 11082705900

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property PolyORBNT-COL-S05J40-UpperBounds-04 :0 <= NotifyEventJobQueuedE.NotifyEventJobQueuedE_0 <= 3
FORMULA PolyORBNT-COL-S05J40-UpperBounds-04 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBNT-COL-S05J40-UpperBounds-04,0,694.083,5630132,1,0,1.41456e+07,2669,3740,2.72526e+07,60,2406,55589
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property PolyORBNT-COL-S05J40-UpperBounds-06 :0 <= NotifyEventJobQueuedE.NotifyEventJobQueuedE_0 <= 3
FORMULA PolyORBNT-COL-S05J40-UpperBounds-06 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBNT-COL-S05J40-UpperBounds-06,0,695.135,5630132,1,0,1.41456e+07,2669,3740,2.72526e+07,60,2406,55589

BK_STOP 1621214777641

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J40"
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-S05J40, 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 r159-oct2-162089268300379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J40.tgz
mv PolyORBNT-COL-S05J40 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;