About the Execution of ITS-Tools for PolyORBNT-COL-S05J20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11368.163 | 1473613.00 | 1460634.00 | 1444.10 | 2 5 4 1 3 1 3 3 5 10 1 4 1 1 1 4 | normal |
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-162089268200363.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-S05J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089268200363
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K 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.7K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 27 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 09:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 12:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 12:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:12 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 92K 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-S05J20-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1621210997603
Running Version 0
[2021-05-17 00:23:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 00:23:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 00:23:19] [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:23:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 00:23:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 543 ms
[2021-05-17 00:23:20] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2021-05-17 00:23:20] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2021-05-17 00:23:20] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2021-05-17 00:23:20] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2021-05-17 00:23:20] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2021-05-17 00:23:20] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2021-05-17 00:23:20] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2021-05-17 00:23:20] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 8 ms.
[2021-05-17 00:23:20] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_12548692361404507562.dot
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 00:23:20] [INFO ] Computed 13 place invariants in 7 ms
FORMULA PolyORBNT-COL-S05J20-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-17 00:23:20] [INFO ] Unfolded HLPN to a Petri net with 369 places and 575 transitions in 14 ms.
[2021-05-17 00:23:20] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 00:23:20] [INFO ] Computed 13 place invariants in 3 ms
[2021-05-17 00:23:20] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-17 00:23:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-17 00:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:20] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-17 00:23:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:23:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:20] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2021-05-17 00:23:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:23:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:23:20] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
[2021-05-17 00:23:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2021-05-17 00:23:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 00:23:20] [INFO ] Added : 18 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 11 ms.
[2021-05-17 00:23:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-17 00:23:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:20] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-17 00:23:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:23:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 00:23:20] [INFO ] Added : 33 causal constraints over 7 iterations in 96 ms. Result :sat
Minimization took 29 ms.
[2021-05-17 00:23:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-17 00:23:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-17 00:23:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:23:20] [INFO ] Deduced a trap composed of 14 places in 15 ms of which 1 ms to minimize.
[2021-05-17 00:23:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2021-05-17 00:23:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 00:23:20] [INFO ] Added : 18 causal constraints over 4 iterations in 166 ms. Result :sat
Minimization took 179 ms.
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-17 00:23:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:21] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 00:23:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 00:23:21] [INFO ] Added : 36 causal constraints over 8 iterations in 34 ms. Result :sat
Minimization took 15 ms.
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-17 00:23:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:21] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] Deduced a trap composed of 14 places in 12 ms of which 1 ms to minimize.
[2021-05-17 00:23:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-17 00:23:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 00:23:21] [INFO ] Added : 21 causal constraints over 5 iterations in 32 ms. Result :sat
Minimization took 14 ms.
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-17 00:23:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:21] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] Deduced a trap composed of 14 places in 14 ms of which 5 ms to minimize.
[2021-05-17 00:23:21] [INFO ] Deduced a trap composed of 14 places in 13 ms of which 1 ms to minimize.
[2021-05-17 00:23:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 35 ms
[2021-05-17 00:23:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 00:23:21] [INFO ] Added : 36 causal constraints over 8 iterations in 37 ms. Result :sat
Minimization took 14 ms.
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-17 00:23:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:21] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] Deduced a trap composed of 14 places in 14 ms of which 0 ms to minimize.
[2021-05-17 00:23:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2021-05-17 00:23:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 00:23:21] [INFO ] Added : 17 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 121 ms.
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:21] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-17 00:23:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:21] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2021-05-17 00:23:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:23:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 00:23:22] [INFO ] Added : 33 causal constraints over 7 iterations in 93 ms. Result :sat
Minimization took 26 ms.
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 00:23:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:22] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:23:22] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2021-05-17 00:23:22] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 1 ms to minimize.
[2021-05-17 00:23:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 44 ms
[2021-05-17 00:23:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 00:23:22] [INFO ] Added : 36 causal constraints over 8 iterations in 37 ms. Result :sat
Minimization took 20 ms.
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-17 00:23:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:22] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:23:22] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 1 ms to minimize.
[2021-05-17 00:23:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2021-05-17 00:23:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 00:23:22] [INFO ] Deduced a trap composed of 25 places in 17 ms of which 0 ms to minimize.
[2021-05-17 00:23:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2021-05-17 00:23:22] [INFO ] Added : 36 causal constraints over 8 iterations in 125 ms. Result :sat
Minimization took 86 ms.
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-17 00:23:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:22] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:23:22] [INFO ] Deduced a trap composed of 13 places in 15 ms of which 0 ms to minimize.
[2021-05-17 00:23:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2021-05-17 00:23:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2021-05-17 00:23:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 00:23:22] [INFO ] Added : 36 causal constraints over 8 iterations in 119 ms. Result :sat
Minimization took 23 ms.
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 00:23:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:22] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:23:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 00:23:22] [INFO ] Added : 36 causal constraints over 8 iterations in 36 ms. Result :sat
Minimization took 13 ms.
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:22] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-17 00:23:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:23] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-17 00:23:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:23:23] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2021-05-17 00:23:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-17 00:23:23] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 00:23:23] [INFO ] Added : 22 causal constraints over 5 iterations in 71 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [2, 5, 10, -1, 3, -1, 3, 10, 5, -1, 10, 1, 1, -1, 4]
FORMULA PolyORBNT-COL-S05J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J20-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2021-05-17 00:23:23] [INFO ] Unfolded HLPN to a Petri net with 369 places and 575 transitions in 5 ms.
[2021-05-17 00:23:23] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_13943737581951259078.dot
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 20 transitions.
Incomplete random walk after 10000 steps, including 688 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :35
FORMULA PolyORBNT-COL-S05J20-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 190 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :13
Incomplete Best-First random walk after 10001 steps, including 163 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :15
Incomplete Best-First random walk after 10001 steps, including 201 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :15
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :15
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :15
Incomplete Best-First random walk after 10001 steps, including 163 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 10001 steps, including 253 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :1
[2021-05-17 00:23:23] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2021-05-17 00:23:23] [INFO ] Computed 62 place invariants in 35 ms
[2021-05-17 00:23:23] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2021-05-17 00:23:23] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 2 ms returned unsat
[2021-05-17 00:23:23] [INFO ] [Real]Absence check using 55 positive place invariants in 9 ms returned sat
[2021-05-17 00:23:23] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 3 ms returned unsat
[2021-05-17 00:23:23] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2021-05-17 00:23:23] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-17 00:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:23] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2021-05-17 00:23:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:23] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2021-05-17 00:23:23] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 2 ms returned unsat
[2021-05-17 00:23:23] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2021-05-17 00:23:23] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-17 00:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:23] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-17 00:23:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:24] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2021-05-17 00:23:24] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 12 ms returned sat
[2021-05-17 00:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:24] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2021-05-17 00:23:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:23:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 46 ms returned sat
[2021-05-17 00:23:24] [INFO ] Computed and/alt/rep : 349/889/349 causal constraints (skipped 196 transitions) in 49 ms.
[2021-05-17 00:23:24] [INFO ] Added : 17 causal constraints over 4 iterations in 291 ms. Result :sat
Minimization took 111 ms.
[2021-05-17 00:23:24] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2021-05-17 00:23:24] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-17 00:23:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:24] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2021-05-17 00:23:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:25] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2021-05-17 00:23:25] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 3 ms returned unsat
[2021-05-17 00:23:25] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-17 00:23:25] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-17 00:23:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:25] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-17 00:23:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:25] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2021-05-17 00:23:25] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 00:23:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:27] [INFO ] [Nat]Absence check using state equation in 2022 ms returned unsat
[2021-05-17 00:23:27] [INFO ] [Real]Absence check using 55 positive place invariants in 15 ms returned sat
[2021-05-17 00:23:27] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 1, 10, 1, 4, 1] Max seen :[4, 1, 1, 3, 1, 4, 1]
FORMULA PolyORBNT-COL-S05J20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 5600 steps, including 313 resets, run finished after 17 ms. (steps per millisecond=329 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 344 transition count 530
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 56 place count 319 transition count 529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 318 transition count 529
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 57 place count 318 transition count 505
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 105 place count 294 transition count 505
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 293 transition count 504
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 293 transition count 504
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 111 place count 291 transition count 502
Applied a total of 111 rules in 173 ms. Remains 291 /349 variables (removed 58) and now considering 502/555 (removed 53) transitions.
[2021-05-17 00:23:27] [INFO ] Flow matrix only has 498 transitions (discarded 4 similar events)
// Phase 1: matrix 498 rows 291 cols
[2021-05-17 00:23:27] [INFO ] Computed 57 place invariants in 14 ms
[2021-05-17 00:23:27] [INFO ] Dead Transitions using invariants and state equation in 249 ms returned [261, 262, 263, 264, 266, 269, 273, 278, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 325, 326, 327, 328, 329, 331, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 360, 361, 362, 363, 364, 366, 369, 370, 371, 372, 373, 374, 376, 379, 383, 384, 385]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[385, 384, 383, 379, 376, 374, 373, 372, 371, 370, 369, 366, 364, 363, 362, 361, 360, 358, 357, 356, 355, 354, 353, 352, 351, 350, 349, 348, 347, 346, 345, 344, 343, 342, 341, 340, 339, 338, 337, 336, 335, 334, 331, 329, 328, 327, 326, 325, 323, 322, 321, 320, 319, 318, 317, 316, 315, 314, 313, 312, 311, 310, 309, 308, 307, 306, 305, 303, 302, 301, 300, 299, 298, 297, 296, 295, 294, 293, 292, 291, 290, 289, 288, 287, 286, 285, 284, 278, 273, 269, 266, 264, 263, 262, 261]
Starting structural reductions, iteration 1 : 291/349 places, 407/555 transitions.
Applied a total of 0 rules in 13 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 291/349 places, 407/555 transitions.
Normalized transition count is 403 out of 407 initially.
// Phase 1: matrix 403 rows 291 cols
[2021-05-17 00:23:27] [INFO ] Computed 57 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 47423 resets, run finished after 2194 ms. (steps per millisecond=455 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 6924 resets, run finished after 644 ms. (steps per millisecond=1552 ) properties (out of 1) seen :3
[2021-05-17 00:23:30] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2021-05-17 00:23:30] [INFO ] Computed 57 place invariants in 8 ms
[2021-05-17 00:23:30] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2021-05-17 00:23:30] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-17 00:23:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:30] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-17 00:23:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:23:30] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 00:23:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:23:31] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2021-05-17 00:23:31] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-17 00:23:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:23:31] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-17 00:23:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:23:31] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 1 ms to minimize.
[2021-05-17 00:23:31] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2021-05-17 00:23:31] [INFO ] Deduced a trap composed of 99 places in 70 ms of which 1 ms to minimize.
[2021-05-17 00:23:31] [INFO ] Deduced a trap composed of 99 places in 73 ms of which 0 ms to minimize.
[2021-05-17 00:23:31] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 0 ms to minimize.
[2021-05-17 00:23:31] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 1 ms to minimize.
[2021-05-17 00:23:31] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 1 ms to minimize.
[2021-05-17 00:23:31] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 0 ms to minimize.
[2021-05-17 00:23:32] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 0 ms to minimize.
[2021-05-17 00:23:32] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 1 ms to minimize.
[2021-05-17 00:23:32] [INFO ] Deduced a trap composed of 101 places in 68 ms of which 0 ms to minimize.
[2021-05-17 00:23:32] [INFO ] Deduced a trap composed of 95 places in 68 ms of which 1 ms to minimize.
[2021-05-17 00:23:32] [INFO ] Deduced a trap composed of 86 places in 68 ms of which 0 ms to minimize.
[2021-05-17 00:23:32] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 0 ms to minimize.
[2021-05-17 00:23:32] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 0 ms to minimize.
[2021-05-17 00:23:32] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 1 ms to minimize.
[2021-05-17 00:23:33] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 1 ms to minimize.
[2021-05-17 00:23:33] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 1 ms to minimize.
[2021-05-17 00:23:33] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 0 ms to minimize.
[2021-05-17 00:23:33] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 6 ms to minimize.
[2021-05-17 00:23:33] [INFO ] Deduced a trap composed of 95 places in 165 ms of which 2 ms to minimize.
[2021-05-17 00:23:34] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 15 ms to minimize.
[2021-05-17 00:23:34] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 1 ms to minimize.
[2021-05-17 00:23:34] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 0 ms to minimize.
[2021-05-17 00:23:34] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
[2021-05-17 00:23:34] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 1 ms to minimize.
[2021-05-17 00:23:34] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 0 ms to minimize.
[2021-05-17 00:23:35] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 0 ms to minimize.
[2021-05-17 00:23:35] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 1 ms to minimize.
[2021-05-17 00:23:35] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
[2021-05-17 00:23:36] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 0 ms to minimize.
[2021-05-17 00:23:36] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 0 ms to minimize.
[2021-05-17 00:23:36] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 0 ms to minimize.
[2021-05-17 00:23:36] [INFO ] Deduced a trap composed of 86 places in 194 ms of which 0 ms to minimize.
[2021-05-17 00:23:36] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 1 ms to minimize.
[2021-05-17 00:23:37] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 0 ms to minimize.
[2021-05-17 00:23:38] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 0 ms to minimize.
[2021-05-17 00:23:38] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 13 ms to minimize.
[2021-05-17 00:23:39] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 0 ms to minimize.
[2021-05-17 00:23:40] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 1 ms to minimize.
[2021-05-17 00:23:43] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 1 ms to minimize.
[2021-05-17 00:23:44] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 1 ms to minimize.
[2021-05-17 00:23:44] [INFO ] Deduced a trap composed of 99 places in 68 ms of which 0 ms to minimize.
[2021-05-17 00:23:45] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 1 ms to minimize.
[2021-05-17 00:24:16] [INFO ] Deduced a trap composed of 2 places in 228 ms of which 0 ms to minimize.
[2021-05-17 00:24:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 291 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 13 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 291/291 places, 407/407 transitions.
Starting structural reductions, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 11 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2021-05-17 00:24:16] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2021-05-17 00:24:16] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-17 00:24:16] [INFO ] Implicit Places using invariants in 364 ms returned []
[2021-05-17 00:24:16] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2021-05-17 00:24:16] [INFO ] Computed 57 place invariants in 5 ms
[2021-05-17 00:24:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:24:17] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
[2021-05-17 00:24:17] [INFO ] Redundant transitions in 12 ms returned []
[2021-05-17 00:24:17] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2021-05-17 00:24:17] [INFO ] Computed 57 place invariants in 8 ms
[2021-05-17 00:24:17] [INFO ] Dead Transitions using invariants and state equation in 191 ms returned []
Finished structural reductions, in 1 iterations. Remains : 291/291 places, 407/407 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J20-UpperBounds-07
Normalized transition count is 403 out of 407 initially.
// Phase 1: matrix 403 rows 291 cols
[2021-05-17 00:24:17] [INFO ] Computed 57 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 477 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :3
[2021-05-17 00:24:17] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2021-05-17 00:24:17] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-17 00:24:17] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-17 00:24:17] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-17 00:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:24:17] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-17 00:24:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:24:17] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:24:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:24:17] [INFO ] [Nat]Absence check using 50 positive place invariants in 28 ms returned sat
[2021-05-17 00:24:17] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 00:24:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:24:17] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2021-05-17 00:24:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 00:24:18] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 0 ms to minimize.
[2021-05-17 00:24:18] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 0 ms to minimize.
[2021-05-17 00:24:18] [INFO ] Deduced a trap composed of 99 places in 60 ms of which 0 ms to minimize.
[2021-05-17 00:24:18] [INFO ] Deduced a trap composed of 99 places in 72 ms of which 0 ms to minimize.
[2021-05-17 00:24:18] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 1 ms to minimize.
[2021-05-17 00:24:18] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 1 ms to minimize.
[2021-05-17 00:24:18] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 1 ms to minimize.
[2021-05-17 00:24:18] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 8 ms to minimize.
[2021-05-17 00:24:19] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 13 ms to minimize.
[2021-05-17 00:24:19] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 12 ms to minimize.
[2021-05-17 00:24:19] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 1 ms to minimize.
[2021-05-17 00:24:19] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 0 ms to minimize.
[2021-05-17 00:24:19] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 0 ms to minimize.
[2021-05-17 00:24:19] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 0 ms to minimize.
[2021-05-17 00:24:19] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 0 ms to minimize.
[2021-05-17 00:24:20] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 1 ms to minimize.
[2021-05-17 00:24:20] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 1 ms to minimize.
[2021-05-17 00:24:20] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 0 ms to minimize.
[2021-05-17 00:24:20] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 0 ms to minimize.
[2021-05-17 00:24:20] [INFO ] Deduced a trap composed of 86 places in 68 ms of which 1 ms to minimize.
[2021-05-17 00:24:20] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 0 ms to minimize.
[2021-05-17 00:24:21] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 1 ms to minimize.
[2021-05-17 00:24:21] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 0 ms to minimize.
[2021-05-17 00:24:21] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 1 ms to minimize.
[2021-05-17 00:24:21] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 0 ms to minimize.
[2021-05-17 00:24:21] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 0 ms to minimize.
[2021-05-17 00:24:21] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 0 ms to minimize.
[2021-05-17 00:24:22] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 0 ms to minimize.
[2021-05-17 00:24:22] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 1 ms to minimize.
[2021-05-17 00:24:22] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 0 ms to minimize.
[2021-05-17 00:24:22] [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 291 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 8 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2021-05-17 00:24:22] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2021-05-17 00:24:22] [INFO ] Computed 57 place invariants in 16 ms
[2021-05-17 00:24:23] [INFO ] Dead Transitions using invariants and state equation in 250 ms returned []
Finished structural reductions, in 1 iterations. Remains : 291/291 places, 407/407 transitions.
Normalized transition count is 403 out of 407 initially.
// Phase 1: matrix 403 rows 291 cols
[2021-05-17 00:24:23] [INFO ] Computed 57 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47306 resets, run finished after 2159 ms. (steps per millisecond=463 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 6874 resets, run finished after 680 ms. (steps per millisecond=1470 ) properties (out of 1) seen :3
[2021-05-17 00:24:25] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2021-05-17 00:24:25] [INFO ] Computed 57 place invariants in 5 ms
[2021-05-17 00:24:26] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-17 00:24:26] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 00:24:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:24:26] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-17 00:24:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:24:26] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:24:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:24:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-17 00:24:26] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-17 00:24:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:24:26] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2021-05-17 00:24:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 00:24:26] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 0 ms to minimize.
[2021-05-17 00:24:26] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 0 ms to minimize.
[2021-05-17 00:24:26] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 0 ms to minimize.
[2021-05-17 00:24:26] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 1 ms to minimize.
[2021-05-17 00:24:26] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 0 ms to minimize.
[2021-05-17 00:24:27] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 1 ms to minimize.
[2021-05-17 00:24:27] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 1 ms to minimize.
[2021-05-17 00:24:27] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 1 ms to minimize.
[2021-05-17 00:24:27] [INFO ] Deduced a trap composed of 89 places in 193 ms of which 0 ms to minimize.
[2021-05-17 00:24:27] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 1 ms to minimize.
[2021-05-17 00:24:27] [INFO ] Deduced a trap composed of 101 places in 73 ms of which 0 ms to minimize.
[2021-05-17 00:24:28] [INFO ] Deduced a trap composed of 95 places in 78 ms of which 0 ms to minimize.
[2021-05-17 00:24:28] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 1 ms to minimize.
[2021-05-17 00:24:28] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 1 ms to minimize.
[2021-05-17 00:24:28] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 1 ms to minimize.
[2021-05-17 00:24:28] [INFO ] Deduced a trap composed of 87 places in 225 ms of which 0 ms to minimize.
[2021-05-17 00:24:28] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 0 ms to minimize.
[2021-05-17 00:24:29] [INFO ] Deduced a trap composed of 81 places in 375 ms of which 0 ms to minimize.
[2021-05-17 00:24:29] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 0 ms to minimize.
[2021-05-17 00:24:29] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 1 ms to minimize.
[2021-05-17 00:24:29] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 1 ms to minimize.
[2021-05-17 00:24:30] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 1 ms to minimize.
[2021-05-17 00:24:30] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 0 ms to minimize.
[2021-05-17 00:24:30] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 1 ms to minimize.
[2021-05-17 00:24:30] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 0 ms to minimize.
[2021-05-17 00:24:30] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 0 ms to minimize.
[2021-05-17 00:24:30] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 0 ms to minimize.
[2021-05-17 00:24:31] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 0 ms to minimize.
[2021-05-17 00:24:31] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 1 ms to minimize.
[2021-05-17 00:24:31] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 0 ms to minimize.
[2021-05-17 00:24:32] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 1 ms to minimize.
[2021-05-17 00:24:32] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 0 ms to minimize.
[2021-05-17 00:24:32] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 1 ms to minimize.
[2021-05-17 00:24:32] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 1 ms to minimize.
[2021-05-17 00:24:32] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 0 ms to minimize.
[2021-05-17 00:24:32] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 0 ms to minimize.
[2021-05-17 00:24:34] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 0 ms to minimize.
[2021-05-17 00:24:34] [INFO ] Deduced a trap composed of 93 places in 262 ms of which 0 ms to minimize.
[2021-05-17 00:24:35] [INFO ] Deduced a trap composed of 86 places in 432 ms of which 0 ms to minimize.
[2021-05-17 00:24:36] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 0 ms to minimize.
[2021-05-17 00:24:39] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 0 ms to minimize.
[2021-05-17 00:24:41] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 1 ms to minimize.
[2021-05-17 00:24:41] [INFO ] Deduced a trap composed of 99 places in 75 ms of which 0 ms to minimize.
[2021-05-17 00:24:42] [INFO ] Deduced a trap composed of 89 places in 279 ms of which 1 ms to minimize.
[2021-05-17 00:25:11] [INFO ] Deduced a trap composed of 2 places in 164 ms of which 1 ms to minimize.
[2021-05-17 00:25:11] [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 291 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 10 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 291/291 places, 407/407 transitions.
Starting structural reductions, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 10 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2021-05-17 00:25:11] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2021-05-17 00:25:11] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-17 00:25:11] [INFO ] Implicit Places using invariants in 429 ms returned []
[2021-05-17 00:25:11] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2021-05-17 00:25:11] [INFO ] Computed 57 place invariants in 11 ms
[2021-05-17 00:25:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:25:12] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
[2021-05-17 00:25:12] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-17 00:25:12] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2021-05-17 00:25:12] [INFO ] Computed 57 place invariants in 6 ms
[2021-05-17 00:25:12] [INFO ] Dead Transitions using invariants and state equation in 374 ms returned []
Finished structural reductions, in 1 iterations. Remains : 291/291 places, 407/407 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J20-UpperBounds-07 in 55391 ms.
[2021-05-17 00:25:13] [INFO ] Flatten gal took : 130 ms
[2021-05-17 00:25:13] [INFO ] Applying decomposition
[2021-05-17 00:25:13] [INFO ] Flatten gal took : 44 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/graph7307439847337505621.txt, -o, /tmp/graph7307439847337505621.bin, -w, /tmp/graph7307439847337505621.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/graph7307439847337505621.bin, -l, -1, -v, -w, /tmp/graph7307439847337505621.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 00:25:13] [INFO ] Decomposing Gal with order
[2021-05-17 00:25:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 00:25:13] [INFO ] Removed a total of 361 redundant transitions.
[2021-05-17 00:25:13] [INFO ] Flatten gal took : 138 ms
[2021-05-17 00:25:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 170 labels/synchronizations in 28 ms.
[2021-05-17 00:25:13] [INFO ] Time to serialize gal into /tmp/UpperBounds17488763873431600428.gal : 14 ms
[2021-05-17 00:25:13] [INFO ] Time to serialize properties into /tmp/UpperBounds1544912742712940336.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds17488763873431600428.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds1544912742712940336.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/UpperBounds17488763873431600428.gal -t CGAL -reachable-file /tmp/UpperBounds1544912742712940336.prop --nowitness
Loading property file /tmp/UpperBounds1544912742712940336.prop.
Detected timeout of ITS tools.
[2021-05-17 00:45:51] [INFO ] Applying decomposition
[2021-05-17 00:45:51] [INFO ] Flatten gal took : 87 ms
[2021-05-17 00:45:51] [INFO ] Decomposing Gal with order
[2021-05-17 00:45:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 00:45:51] [INFO ] Removed a total of 1504 redundant transitions.
[2021-05-17 00:45:51] [INFO ] Flatten gal took : 212 ms
[2021-05-17 00:45:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2021-05-17 00:45:51] [INFO ] Time to serialize gal into /tmp/UpperBounds4651380427419612175.gal : 23 ms
[2021-05-17 00:45:51] [INFO ] Time to serialize properties into /tmp/UpperBounds3398884422429157477.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds4651380427419612175.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3398884422429157477.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/UpperBounds4651380427419612175.gal -t CGAL -reachable-file /tmp/UpperBounds3398884422429157477.prop --nowitness
Loading property file /tmp/UpperBounds3398884422429157477.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,6.81146e+08,99.1768,2409816,854979,24,3.30061e+06,1604,1008,1.31115e+06,48,1501,0
Total reachable state count : 681145700
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property PolyORBNT-COL-S05J20-UpperBounds-07 :0 <= NotifyEventJobQueuedE.NotifyEventJobQueuedE_0 <= 3
FORMULA PolyORBNT-COL-S05J20-UpperBounds-07 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-S05J20-UpperBounds-07,0,118.962,2414304,1,0,3.77258e+06,1604,2100,5.00219e+06,60,1501,18782
BK_STOP 1621212471216
--------------------
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-S05J20"
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-S05J20, 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-162089268200363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J20.tgz
mv PolyORBNT-COL-S05J20 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 ;