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-162089268400435.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-S10J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089268400435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K 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 93K 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:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 09:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 09:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 13:05 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 95K 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-S10J80-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621219527495

Running Version 0
[2021-05-17 02:45:29] [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 02:45:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 02:45:29] [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 02:45:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 02:45:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 555 ms
[2021-05-17 02:45:29] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2021-05-17 02:45:29] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2021-05-17 02:45:29] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2021-05-17 02:45:29] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2021-05-17 02:45:29] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2021-05-17 02:45:29] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2021-05-17 02:45:29] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2021-05-17 02:45:29] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 3 ms.
[2021-05-17 02:45:29] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_14503833534368050149.dot
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 02:45:29] [INFO ] Computed 13 place invariants in 7 ms
FORMULA PolyORBNT-COL-S10J80-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-01 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-17 02:45:29] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 3470 transitions in 33 ms.
[2021-05-17 02:45:29] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 02:45:29] [INFO ] Computed 13 place invariants in 12 ms
[2021-05-17 02:45:29] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-17 02:45:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-17 02:45:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:29] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-17 02:45:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:45:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 02:45:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:45:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:29] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-17 02:45:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:45:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 02:45:30] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 3 ms to minimize.
[2021-05-17 02:45:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2021-05-17 02:45:30] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 02:45:30] [INFO ] Added : 23 causal constraints over 5 iterations in 393 ms. Result :sat
Minimization took 148 ms.
[2021-05-17 02:45:30] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:45:30] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:45:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:30] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-17 02:45:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:45:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 02:45:30] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:45:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:30] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-17 02:45:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 02:45:30] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 1 ms to minimize.
[2021-05-17 02:45:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2021-05-17 02:45:30] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-17 02:45:30] [INFO ] Added : 17 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 132 ms.
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 02:45:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 02:45:31] [INFO ] Deduced a trap composed of 13 places in 9 ms of which 0 ms to minimize.
[2021-05-17 02:45:31] [INFO ] Deduced a trap composed of 14 places in 8 ms of which 0 ms to minimize.
[2021-05-17 02:45:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 24 ms
[2021-05-17 02:45:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 02:45:31] [INFO ] Added : 36 causal constraints over 8 iterations in 34 ms. Result :sat
Minimization took 12 ms.
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 02:45:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 02:45:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 02:45:31] [INFO ] Added : 36 causal constraints over 8 iterations in 35 ms. Result :sat
Minimization took 11 ms.
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 02:45:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 02:45:31] [INFO ] Deduced a trap composed of 13 places in 8 ms of which 1 ms to minimize.
[2021-05-17 02:45:31] [INFO ] Deduced a trap composed of 14 places in 8 ms of which 1 ms to minimize.
[2021-05-17 02:45:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 23 ms
[2021-05-17 02:45:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 02:45:31] [INFO ] Added : 36 causal constraints over 8 iterations in 34 ms. Result :sat
Minimization took 12 ms.
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-17 02:45:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 02:45:31] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2021-05-17 02:45:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-17 02:45:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 02:45:31] [INFO ] Added : 22 causal constraints over 5 iterations in 83 ms. Result :sat
Minimization took 71 ms.
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 02:45:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 02:45:31] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 1 ms to minimize.
[2021-05-17 02:45:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2021-05-17 02:45:31] [INFO ] Added : 36 causal constraints over 8 iterations in 66 ms. Result :sat
Minimization took 11 ms.
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:31] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-17 02:45:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:31] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-17 02:45:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 02:45:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 02:45:31] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2021-05-17 02:45:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2021-05-17 02:45:32] [INFO ] Added : 36 causal constraints over 8 iterations in 130 ms. Result :sat
Minimization took 16 ms.
[2021-05-17 02:45:32] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-17 02:45:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:45:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 02:45:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:45:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:45:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:45:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:32] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-17 02:45:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 02:45:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 02:45:32] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2021-05-17 02:45:32] [INFO ] Deduced a trap composed of 25 places in 15 ms of which 0 ms to minimize.
[2021-05-17 02:45:32] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 1 ms to minimize.
[2021-05-17 02:45:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 70 ms
[2021-05-17 02:45:32] [INFO ] Added : 36 causal constraints over 8 iterations in 166 ms. Result :sat
Minimization took 10 ms.
[2021-05-17 02:45:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 02:45:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:45:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:32] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-17 02:45:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:45:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:45:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-17 02:45:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:32] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-17 02:45:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 02:45:32] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 0 ms to minimize.
[2021-05-17 02:45:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2021-05-17 02:45:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 02:45:32] [INFO ] Added : 21 causal constraints over 5 iterations in 198 ms. Result :sat
Minimization took 168 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 10, -1, -1, -1, 4, 1, 10, -1, -1, 1, 10]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2021-05-17 02:45:32] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 3470 transitions in 17 ms.
[2021-05-17 02:45:32] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_9632295695986421094.dot
Deduced a syphon composed of 80 places in 12 ms
Reduce places removed 80 places and 80 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 10) seen :1
FORMULA PolyORBNT-COL-S10J80-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :10
FORMULA PolyORBNT-COL-S10J80-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
[2021-05-17 02:45:33] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2021-05-17 02:45:33] [INFO ] Computed 192 place invariants in 303 ms
[2021-05-17 02:45:33] [INFO ] [Real]Absence check using 185 positive place invariants in 50 ms returned sat
[2021-05-17 02:45:33] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 35 ms returned sat
[2021-05-17 02:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:34] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2021-05-17 02:45:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:45:34] [INFO ] [Nat]Absence check using 185 positive place invariants in 57 ms returned sat
[2021-05-17 02:45:34] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 37 ms returned sat
[2021-05-17 02:45:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:36] [INFO ] [Nat]Absence check using state equation in 1483 ms returned sat
[2021-05-17 02:45:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:45:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 02:45:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 3279 ms returned unknown
[2021-05-17 02:45:39] [INFO ] [Real]Absence check using 185 positive place invariants in 51 ms returned sat
[2021-05-17 02:45:39] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 37 ms returned sat
[2021-05-17 02:45:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:40] [INFO ] [Real]Absence check using state equation in 929 ms returned sat
[2021-05-17 02:45:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:45:41] [INFO ] [Nat]Absence check using 185 positive place invariants in 54 ms returned sat
[2021-05-17 02:45:41] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 38 ms returned sat
[2021-05-17 02:45:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:43] [INFO ] [Nat]Absence check using state equation in 2066 ms returned sat
[2021-05-17 02:45:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 02:45:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 2727 ms returned unknown
[2021-05-17 02:45:46] [INFO ] [Real]Absence check using 185 positive place invariants in 54 ms returned sat
[2021-05-17 02:45:46] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 42 ms returned sat
[2021-05-17 02:45:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:47] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2021-05-17 02:45:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:45:47] [INFO ] [Nat]Absence check using 185 positive place invariants in 51 ms returned sat
[2021-05-17 02:45:47] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 43 ms returned sat
[2021-05-17 02:45:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:48] [INFO ] [Nat]Absence check using state equation in 815 ms returned sat
[2021-05-17 02:45:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2021-05-17 02:45:48] [INFO ] Deduced a trap composed of 426 places in 628 ms of which 3 ms to minimize.
[2021-05-17 02:45:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 852 ms
[2021-05-17 02:45:49] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 415 ms.
[2021-05-17 02:45:51] [INFO ] Deduced a trap composed of 19 places in 840 ms of which 1 ms to minimize.
[2021-05-17 02:45:53] [INFO ] Deduced a trap composed of 9 places in 1167 ms of which 12 ms to minimize.
[2021-05-17 02:45:53] [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 2
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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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 02:45:53] [INFO ] [Real]Absence check using 185 positive place invariants in 54 ms returned sat
[2021-05-17 02:45:53] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 43 ms returned sat
[2021-05-17 02:45:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:55] [INFO ] [Real]Absence check using state equation in 1517 ms returned sat
[2021-05-17 02:45:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:45:55] [INFO ] [Nat]Absence check using 185 positive place invariants in 55 ms returned sat
[2021-05-17 02:45:55] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 43 ms returned sat
[2021-05-17 02:45:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:45:56] [INFO ] [Nat]Absence check using state equation in 1106 ms returned sat
[2021-05-17 02:45:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 02:45:57] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 375 ms.
[2021-05-17 02:45:58] [INFO ] Deduced a trap composed of 19 places in 555 ms of which 1 ms to minimize.
[2021-05-17 02:45:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 816 ms
[2021-05-17 02:45:59] [INFO ] Added : 35 causal constraints over 7 iterations in 2745 ms. Result :sat
[2021-05-17 02:45:59] [INFO ] [Real]Absence check using 185 positive place invariants in 50 ms returned sat
[2021-05-17 02:45:59] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 62 ms returned sat
[2021-05-17 02:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:46:00] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2021-05-17 02:46:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:46:00] [INFO ] [Nat]Absence check using 185 positive place invariants in 51 ms returned sat
[2021-05-17 02:46:00] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 42 ms returned sat
[2021-05-17 02:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:46:01] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2021-05-17 02:46:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2021-05-17 02:46:02] [INFO ] Deduced a trap composed of 426 places in 672 ms of which 1 ms to minimize.
[2021-05-17 02:46:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 880 ms
[2021-05-17 02:46:02] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 272 ms.
[2021-05-17 02:46:05] [INFO ] Deduced a trap composed of 19 places in 932 ms of which 1 ms to minimize.
[2021-05-17 02:46:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1644 ms
[2021-05-17 02:46:06] [INFO ] Deduced a trap composed of 9 places in 966 ms of which 1 ms to minimize.
[2021-05-17 02:46:06] [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 4
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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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 02:46:06] [INFO ] [Real]Absence check using 185 positive place invariants in 66 ms returned sat
[2021-05-17 02:46:06] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 33 ms returned sat
[2021-05-17 02:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:46:07] [INFO ] [Real]Absence check using state equation in 961 ms returned sat
[2021-05-17 02:46:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:46:08] [INFO ] [Nat]Absence check using 185 positive place invariants in 51 ms returned sat
[2021-05-17 02:46:08] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 34 ms returned unsat
[2021-05-17 02:46:08] [INFO ] [Real]Absence check using 185 positive place invariants in 50 ms returned sat
[2021-05-17 02:46:08] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 33 ms returned sat
[2021-05-17 02:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:46:09] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2021-05-17 02:46:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:46:09] [INFO ] [Nat]Absence check using 185 positive place invariants in 51 ms returned sat
[2021-05-17 02:46:09] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 39 ms returned sat
[2021-05-17 02:46:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:46:12] [INFO ] [Nat]Absence check using state equation in 2722 ms returned sat
[2021-05-17 02:46:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 954 ms returned sat
[2021-05-17 02:46:13] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 266 ms.
[2021-05-17 02:46:15] [INFO ] Deduced a trap composed of 9 places in 993 ms of which 1 ms to minimize.
[2021-05-17 02:46:15] [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 6
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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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 02:46:15] [INFO ] [Real]Absence check using 185 positive place invariants in 49 ms returned sat
[2021-05-17 02:46:15] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 34 ms returned sat
[2021-05-17 02:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:46:16] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2021-05-17 02:46:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:46:16] [INFO ] [Nat]Absence check using 185 positive place invariants in 52 ms returned sat
[2021-05-17 02:46:16] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 34 ms returned sat
[2021-05-17 02:46:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:46:21] [INFO ] [Nat]Absence check using state equation in 4640 ms returned unknown
Current structural bounds on expressions (after SMT) : [10, 10, 2147483647, 2147483647, 2147483647, 1, 2147483647, 10] Max seen :[1, 2, 0, 0, 0, 1, 0, 2]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 15600 steps, including 934 resets, run finished after 172 ms. (steps per millisecond=90 ) properties (out of 7) seen :7 could not realise parikh vector
Support contains 167 out of 1614 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1604 transition count 3388
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 1602 transition count 3386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 1600 transition count 3386
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 18 place count 1600 transition count 3302
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 186 place count 1516 transition count 3302
Applied a total of 186 rules in 479 ms. Remains 1516 /1614 variables (removed 98) and now considering 3302/3390 (removed 88) transitions.
[2021-05-17 02:46:22] [INFO ] Flow matrix only has 3293 transitions (discarded 9 similar events)
// Phase 1: matrix 3293 rows 1516 cols
[2021-05-17 02:46:22] [INFO ] Computed 182 place invariants in 142 ms
[2021-05-17 02:46:25] [INFO ] Dead Transitions using invariants and state equation in 3599 ms returned [2209, 2210, 2211, 2212, 2213, 2214, 2215, 2216, 2217, 2218, 2219, 2220, 2221, 2222, 2223, 2224, 2225, 2226, 2227, 2228, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2237, 2238, 2239, 2240, 2241, 2242, 2243, 2244, 2245, 2246, 2247, 2248, 2250, 2251, 2252, 2253, 2254, 2256, 2259, 2260, 2261, 2262, 2263, 2264, 2265, 2266, 2267, 2268, 2269, 2270, 2271, 2272, 2273, 2274, 2275, 2276, 2277, 2278, 2279, 2280, 2281, 2282, 2283, 2285, 2286, 2287, 2288, 2289, 2291, 2294, 2295, 2296, 2297, 2298, 2299, 2301, 2304, 2308, 2309, 2310, 2311, 2312, 2313, 2314, 2315, 2316, 2317, 2318, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 2326, 2327, 2328, 2329, 2330, 2331, 2332, 2333, 2334, 2335, 2336, 2337, 2338, 2339, 2341, 2342, 2343, 2344, 2345, 2347, 2350, 2351, 2352, 2353, 2354, 2355, 2357, 2360, 2364, 2365, 2366, 2367, 2368, 2369, 2370, 2372, 2375, 2379, 2384, 2385, 2386, 2387, 2388, 2389, 2390, 2391, 2392, 2393, 2394, 2395, 2396, 2397, 2398, 2399, 2400, 2401, 2402, 2403, 2404, 2405, 2406, 2407, 2408, 2409, 2410, 2411, 2412, 2413, 2414, 2415, 2416, 2417, 2418, 2419, 2420, 2421, 2422, 2423, 2425, 2426, 2427, 2428, 2429, 2431, 2434, 2435, 2436, 2437, 2438, 2439, 2441, 2444, 2448, 2449, 2450, 2451, 2452, 2453, 2454, 2456, 2459, 2463, 2468, 2469, 2470, 2471, 2472, 2473, 2474, 2475, 2477, 2480, 2484, 2489, 2495, 2496, 2497, 2498, 2499, 2500, 2501, 2502, 2503, 2504, 2505, 2506, 2507, 2508, 2509, 2510, 2511, 2512, 2513, 2514, 2515, 2516, 2517, 2518, 2519, 2520, 2521, 2522, 2523, 2524, 2525, 2526, 2527, 2528, 2529, 2530, 2531, 2532, 2533, 2534, 2535, 2536, 2537, 2538, 2539, 2540, 2541, 2542, 2543, 2545, 2546, 2547, 2548, 2549, 2551, 2554, 2555, 2556, 2557, 2558, 2559, 2561, 2564, 2568, 2569, 2570, 2571, 2572, 2573, 2574, 2576, 2579, 2583, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2597, 2600, 2604, 2609, 2615, 2616, 2617, 2618, 2619, 2620, 2621, 2622, 2623, 2625, 2628, 2632, 2637, 2643, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2669, 2670, 2671, 2672, 2673, 2674, 2675, 2676, 2677, 2678, 2679, 2680, 2681, 2682, 2683, 2684, 2685, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2693, 2694, 2695, 2696, 2697, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2710, 2711, 2712, 2713, 2714, 2716, 2719, 2720, 2721, 2722, 2723, 2724, 2726, 2729, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2741, 2744, 2748, 2753, 2754, 2755, 2756, 2757, 2758, 2759, 2760, 2762, 2765, 2769, 2774, 2780, 2781, 2782, 2783, 2784, 2785, 2786, 2787, 2788, 2790, 2793, 2797, 2802, 2808, 2815, 2816, 2817, 2818, 2819, 2820, 2821, 2822, 2823, 2824, 2826, 2829, 2833, 2838, 2844, 2851, 2859, 2860, 2861, 2862, 2863, 2864, 2865, 2866, 2867, 2868, 2869, 2870, 2871, 2872, 2873, 2874, 2875, 2876, 2877, 2878, 2879, 2880, 2881, 2882, 2883, 2884, 2885, 2886, 2887, 2888, 2889, 2890, 2891, 2892, 2893, 2894, 2895, 2896, 2897, 2898, 2899, 2900, 2901, 2902, 2903, 2904, 2905, 2906, 2907, 2908, 2909, 2910, 2911, 2912, 2913, 2914, 2915, 2916, 2917, 2918, 2919, 2920, 2921, 2922, 2923, 2924, 2925, 2926, 2927, 2928, 2930, 2931, 2932, 2933, 2934, 2936, 2939, 2940, 2941, 2942, 2943, 2944, 2946, 2949, 2953, 2954, 2955, 2956, 2957, 2958, 2959, 2961, 2964, 2968, 2973, 2974, 2975, 2976, 2977, 2978, 2979, 2980, 2982, 2985, 2989, 2994, 3000, 3001, 3002, 3003, 3004, 3005, 3006, 3007, 3008, 3010, 3013, 3017, 3022, 3028, 3035, 3036, 3037, 3038, 3039, 3040, 3041, 3042, 3043, 3044, 3046, 3049, 3053, 3058, 3064, 3071, 3079, 3080, 3081, 3082, 3083, 3084, 3085, 3086, 3087, 3088, 3089, 3091, 3094, 3098, 3103, 3109, 3116, 3124, 3133, 3134, 3135, 3136, 3137, 3138, 3139, 3140, 3141, 3142, 3143, 3144, 3146, 3149, 3153, 3158, 3164, 3171, 3179, 3188, 3198]
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions :[3198, 3188, 3179, 3171, 3164, 3158, 3153, 3149, 3146, 3144, 3143, 3142, 3141, 3140, 3139, 3138, 3137, 3136, 3135, 3134, 3133, 3124, 3116, 3109, 3103, 3098, 3094, 3091, 3089, 3088, 3087, 3086, 3085, 3084, 3083, 3082, 3081, 3080, 3079, 3071, 3064, 3058, 3053, 3049, 3046, 3044, 3043, 3042, 3041, 3040, 3039, 3038, 3037, 3036, 3035, 3028, 3022, 3017, 3013, 3010, 3008, 3007, 3006, 3005, 3004, 3003, 3002, 3001, 3000, 2994, 2989, 2985, 2982, 2980, 2979, 2978, 2977, 2976, 2975, 2974, 2973, 2968, 2964, 2961, 2959, 2958, 2957, 2956, 2955, 2954, 2953, 2949, 2946, 2944, 2943, 2942, 2941, 2940, 2939, 2936, 2934, 2933, 2932, 2931, 2930, 2928, 2927, 2926, 2925, 2924, 2923, 2922, 2921, 2920, 2919, 2918, 2917, 2916, 2915, 2914, 2913, 2912, 2911, 2910, 2909, 2908, 2907, 2906, 2905, 2904, 2903, 2902, 2901, 2900, 2899, 2898, 2897, 2896, 2895, 2894, 2893, 2892, 2891, 2890, 2889, 2888, 2887, 2886, 2885, 2884, 2883, 2882, 2881, 2880, 2879, 2878, 2877, 2876, 2875, 2874, 2873, 2872, 2871, 2870, 2869, 2868, 2867, 2866, 2865, 2864, 2863, 2862, 2861, 2860, 2859, 2851, 2844, 2838, 2833, 2829, 2826, 2824, 2823, 2822, 2821, 2820, 2819, 2818, 2817, 2816, 2815, 2808, 2802, 2797, 2793, 2790, 2788, 2787, 2786, 2785, 2784, 2783, 2782, 2781, 2780, 2774, 2769, 2765, 2762, 2760, 2759, 2758, 2757, 2756, 2755, 2754, 2753, 2748, 2744, 2741, 2739, 2738, 2737, 2736, 2735, 2734, 2733, 2729, 2726, 2724, 2723, 2722, 2721, 2720, 2719, 2716, 2714, 2713, 2712, 2711, 2710, 2708, 2707, 2706, 2705, 2704, 2703, 2702, 2701, 2700, 2699, 2698, 2697, 2696, 2695, 2694, 2693, 2692, 2691, 2690, 2689, 2688, 2687, 2686, 2685, 2684, 2683, 2682, 2681, 2680, 2679, 2678, 2677, 2676, 2675, 2674, 2673, 2672, 2671, 2670, 2669, 2668, 2667, 2666, 2665, 2664, 2663, 2662, 2661, 2660, 2659, 2658, 2657, 2656, 2655, 2654, 2653, 2652, 2651, 2650, 2643, 2637, 2632, 2628, 2625, 2623, 2622, 2621, 2620, 2619, 2618, 2617, 2616, 2615, 2609, 2604, 2600, 2597, 2595, 2594, 2593, 2592, 2591, 2590, 2589, 2588, 2583, 2579, 2576, 2574, 2573, 2572, 2571, 2570, 2569, 2568, 2564, 2561, 2559, 2558, 2557, 2556, 2555, 2554, 2551, 2549, 2548, 2547, 2546, 2545, 2543, 2542, 2541, 2540, 2539, 2538, 2537, 2536, 2535, 2534, 2533, 2532, 2531, 2530, 2529, 2528, 2527, 2526, 2525, 2524, 2523, 2522, 2521, 2520, 2519, 2518, 2517, 2516, 2515, 2514, 2513, 2512, 2511, 2510, 2509, 2508, 2507, 2506, 2505, 2504, 2503, 2502, 2501, 2500, 2499, 2498, 2497, 2496, 2495, 2489, 2484, 2480, 2477, 2475, 2474, 2473, 2472, 2471, 2470, 2469, 2468, 2463, 2459, 2456, 2454, 2453, 2452, 2451, 2450, 2449, 2448, 2444, 2441, 2439, 2438, 2437, 2436, 2435, 2434, 2431, 2429, 2428, 2427, 2426, 2425, 2423, 2422, 2421, 2420, 2419, 2418, 2417, 2416, 2415, 2414, 2413, 2412, 2411, 2410, 2409, 2408, 2407, 2406, 2405, 2404, 2403, 2402, 2401, 2400, 2399, 2398, 2397, 2396, 2395, 2394, 2393, 2392, 2391, 2390, 2389, 2388, 2387, 2386, 2385, 2384, 2379, 2375, 2372, 2370, 2369, 2368, 2367, 2366, 2365, 2364, 2360, 2357, 2355, 2354, 2353, 2352, 2351, 2350, 2347, 2345, 2344, 2343, 2342, 2341, 2339, 2338, 2337, 2336, 2335, 2334, 2333, 2332, 2331, 2330, 2329, 2328, 2327, 2326, 2325, 2324, 2323, 2322, 2321, 2320, 2319, 2318, 2317, 2316, 2315, 2314, 2313, 2312, 2311, 2310, 2309, 2308, 2304, 2301, 2299, 2298, 2297, 2296, 2295, 2294, 2291, 2289, 2288, 2287, 2286, 2285, 2283, 2282, 2281, 2280, 2279, 2278, 2277, 2276, 2275, 2274, 2273, 2272, 2271, 2270, 2269, 2268, 2267, 2266, 2265, 2264, 2263, 2262, 2261, 2260, 2259, 2256, 2254, 2253, 2252, 2251, 2250, 2248, 2247, 2246, 2245, 2244, 2243, 2242, 2241, 2240, 2239, 2238, 2237, 2236, 2235, 2234, 2233, 2232, 2231, 2230, 2228, 2227, 2226, 2225, 2224, 2223, 2222, 2221, 2220, 2219, 2218, 2217, 2216, 2215, 2214, 2213, 2212, 2211, 2210, 2209]
Starting structural reductions, iteration 1 : 1516/1614 places, 2687/3390 transitions.
Applied a total of 0 rules in 165 ms. Remains 1516 /1516 variables (removed 0) and now considering 2687/2687 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1516/1614 places, 2687/3390 transitions.
Normalized transition count is 2678 out of 2687 initially.
// Phase 1: matrix 2678 rows 1516 cols
[2021-05-17 02:46:26] [INFO ] Computed 182 place invariants in 170 ms
Incomplete random walk after 1000000 steps, including 67270 resets, run finished after 10201 ms. (steps per millisecond=98 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 6152 resets, run finished after 1894 ms. (steps per millisecond=527 ) properties (out of 7) seen :9
Incomplete Best-First random walk after 1000001 steps, including 6311 resets, run finished after 1935 ms. (steps per millisecond=516 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 1000001 steps, including 6429 resets, run finished after 1852 ms. (steps per millisecond=539 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 6094 resets, run finished after 1853 ms. (steps per millisecond=539 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 6187 resets, run finished after 1827 ms. (steps per millisecond=547 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 6478 resets, run finished after 2715 ms. (steps per millisecond=368 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 5140 resets, run finished after 2534 ms. (steps per millisecond=394 ) properties (out of 7) seen :10
[2021-05-17 02:46:51] [INFO ] Flow matrix only has 2678 transitions (discarded 9 similar events)
// Phase 1: matrix 2678 rows 1516 cols
[2021-05-17 02:46:51] [INFO ] Computed 182 place invariants in 102 ms
[2021-05-17 02:46:51] [INFO ] [Real]Absence check using 176 positive place invariants in 40 ms returned sat
[2021-05-17 02:46:51] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 24 ms returned sat
[2021-05-17 02:46:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:46:51] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2021-05-17 02:46:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:46:52] [INFO ] [Nat]Absence check using 176 positive place invariants in 43 ms returned sat
[2021-05-17 02:46:52] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 26 ms returned sat
[2021-05-17 02:46:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:46:53] [INFO ] [Nat]Absence check using state equation in 932 ms returned sat
[2021-05-17 02:46:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:46:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 33 ms returned sat
[2021-05-17 02:46:53] [INFO ] Deduced a trap composed of 666 places in 596 ms of which 1 ms to minimize.
[2021-05-17 02:46:54] [INFO ] Deduced a trap composed of 676 places in 616 ms of which 1 ms to minimize.
[2021-05-17 02:46:55] [INFO ] Deduced a trap composed of 664 places in 584 ms of which 1 ms to minimize.
[2021-05-17 02:46:55] [INFO ] Deduced a trap composed of 666 places in 590 ms of which 1 ms to minimize.
[2021-05-17 02:46:56] [INFO ] Deduced a trap composed of 668 places in 602 ms of which 1 ms to minimize.
[2021-05-17 02:46:57] [INFO ] Deduced a trap composed of 668 places in 605 ms of which 1 ms to minimize.
[2021-05-17 02:46:57] [INFO ] Deduced a trap composed of 664 places in 552 ms of which 1 ms to minimize.
[2021-05-17 02:46:58] [INFO ] Deduced a trap composed of 666 places in 556 ms of which 2 ms to minimize.
[2021-05-17 02:46:59] [INFO ] Deduced a trap composed of 684 places in 605 ms of which 1 ms to minimize.
[2021-05-17 02:47:00] [INFO ] Deduced a trap composed of 660 places in 596 ms of which 1 ms to minimize.
[2021-05-17 02:47:00] [INFO ] Deduced a trap composed of 664 places in 613 ms of which 1 ms to minimize.
[2021-05-17 02:47:01] [INFO ] Deduced a trap composed of 676 places in 591 ms of which 1 ms to minimize.
[2021-05-17 02:47:02] [INFO ] Deduced a trap composed of 664 places in 595 ms of which 14 ms to minimize.
[2021-05-17 02:47:02] [INFO ] Deduced a trap composed of 664 places in 557 ms of which 5 ms to minimize.
[2021-05-17 02:47:03] [INFO ] Deduced a trap composed of 662 places in 581 ms of which 1 ms to minimize.
[2021-05-17 02:47:04] [INFO ] Deduced a trap composed of 672 places in 605 ms of which 1 ms to minimize.
[2021-05-17 02:47:05] [INFO ] Deduced a trap composed of 678 places in 623 ms of which 1 ms to minimize.
[2021-05-17 02:47:06] [INFO ] Deduced a trap composed of 670 places in 634 ms of which 1 ms to minimize.
[2021-05-17 02:47:06] [INFO ] Deduced a trap composed of 670 places in 592 ms of which 1 ms to minimize.
[2021-05-17 02:47:07] [INFO ] Deduced a trap composed of 680 places in 664 ms of which 1 ms to minimize.
[2021-05-17 02:47:10] [INFO ] Deduced a trap composed of 672 places in 639 ms of which 2 ms to minimize.
[2021-05-17 02:47:10] [INFO ] Deduced a trap composed of 662 places in 574 ms of which 1 ms to minimize.
[2021-05-17 02:47:11] [INFO ] Deduced a trap composed of 666 places in 575 ms of which 1 ms to minimize.
[2021-05-17 02:47:12] [INFO ] Deduced a trap composed of 680 places in 586 ms of which 1 ms to minimize.
[2021-05-17 02:47:13] [INFO ] Deduced a trap composed of 672 places in 590 ms of which 1 ms to minimize.
[2021-05-17 02:47:14] [INFO ] Deduced a trap composed of 678 places in 606 ms of which 1 ms to minimize.
[2021-05-17 02:47:14] [INFO ] Deduced a trap composed of 666 places in 558 ms of which 1 ms to minimize.
[2021-05-17 02:47:15] [INFO ] Deduced a trap composed of 674 places in 560 ms of which 1 ms to minimize.
[2021-05-17 02:47:16] [INFO ] Deduced a trap composed of 658 places in 573 ms of which 1 ms to minimize.
[2021-05-17 02:47:16] [INFO ] Deduced a trap composed of 666 places in 601 ms of which 26 ms to minimize.
[2021-05-17 02:47:18] [INFO ] Deduced a trap composed of 676 places in 592 ms of which 1 ms to minimize.
[2021-05-17 02:47:18] [INFO ] Deduced a trap composed of 666 places in 577 ms of which 1 ms to minimize.
[2021-05-17 02:47:19] [INFO ] Deduced a trap composed of 678 places in 574 ms of which 1 ms to minimize.
[2021-05-17 02:47:20] [INFO ] Deduced a trap composed of 680 places in 581 ms of which 2 ms to minimize.
[2021-05-17 02:47:21] [INFO ] Deduced a trap composed of 668 places in 582 ms of which 1 ms to minimize.
[2021-05-17 02:47:21] [INFO ] Deduced a trap composed of 672 places in 725 ms of which 32 ms to minimize.
[2021-05-17 02:47:22] [INFO ] Deduced a trap composed of 678 places in 617 ms of which 1 ms to minimize.
[2021-05-17 02:47:23] [INFO ] Deduced a trap composed of 670 places in 591 ms of which 1 ms to minimize.
[2021-05-17 02:47:24] [INFO ] Deduced a trap composed of 664 places in 625 ms of which 21 ms to minimize.
[2021-05-17 02:47:25] [INFO ] Deduced a trap composed of 664 places in 576 ms of which 1 ms to minimize.
[2021-05-17 02:47:25] [INFO ] Deduced a trap composed of 668 places in 624 ms of which 1 ms to minimize.
[2021-05-17 02:47:27] [INFO ] Deduced a trap composed of 664 places in 585 ms of which 1 ms to minimize.
[2021-05-17 02:47:27] [INFO ] Deduced a trap composed of 666 places in 638 ms of which 2 ms to minimize.
[2021-05-17 02:47:28] [INFO ] Deduced a trap composed of 668 places in 944 ms of which 1 ms to minimize.
[2021-05-17 02:47:29] [INFO ] Deduced a trap composed of 682 places in 647 ms of which 5 ms to minimize.
[2021-05-17 02:47:30] [INFO ] Deduced a trap composed of 674 places in 602 ms of which 1 ms to minimize.
[2021-05-17 02:47:31] [INFO ] Deduced a trap composed of 662 places in 618 ms of which 10 ms to minimize.
[2021-05-17 02:47:31] [INFO ] Deduced a trap composed of 664 places in 613 ms of which 1 ms to minimize.
[2021-05-17 02:47:35] [INFO ] Deduced a trap composed of 672 places in 646 ms of which 2 ms to minimize.
[2021-05-17 02:47:35] [INFO ] Deduced a trap composed of 672 places in 721 ms of which 1 ms to minimize.
[2021-05-17 02:47:37] [INFO ] Deduced a trap composed of 664 places in 954 ms of which 1 ms to minimize.
[2021-05-17 02:47:37] [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 02:47:37] [INFO ] [Real]Absence check using 176 positive place invariants in 47 ms returned sat
[2021-05-17 02:47:37] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 28 ms returned sat
[2021-05-17 02:47:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:47:37] [INFO ] [Real]Absence check using state equation in 720 ms returned sat
[2021-05-17 02:47:38] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-17 02:47:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:47:38] [INFO ] [Nat]Absence check using 176 positive place invariants in 44 ms returned sat
[2021-05-17 02:47:38] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 25 ms returned sat
[2021-05-17 02:47:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:47:39] [INFO ] [Nat]Absence check using state equation in 738 ms returned sat
[2021-05-17 02:47:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 32 ms returned sat
[2021-05-17 02:47:39] [INFO ] Deduced a trap composed of 674 places in 558 ms of which 1 ms to minimize.
[2021-05-17 02:47:40] [INFO ] Deduced a trap composed of 668 places in 580 ms of which 1 ms to minimize.
[2021-05-17 02:47:41] [INFO ] Deduced a trap composed of 672 places in 707 ms of which 1 ms to minimize.
[2021-05-17 02:47:41] [INFO ] Deduced a trap composed of 674 places in 652 ms of which 1 ms to minimize.
[2021-05-17 02:47:42] [INFO ] Deduced a trap composed of 678 places in 610 ms of which 1 ms to minimize.
[2021-05-17 02:47:43] [INFO ] Deduced a trap composed of 644 places in 605 ms of which 1 ms to minimize.
[2021-05-17 02:47:44] [INFO ] Deduced a trap composed of 666 places in 638 ms of which 1 ms to minimize.
[2021-05-17 02:47:44] [INFO ] Deduced a trap composed of 678 places in 699 ms of which 1 ms to minimize.
[2021-05-17 02:47:45] [INFO ] Deduced a trap composed of 686 places in 561 ms of which 1 ms to minimize.
[2021-05-17 02:47:46] [INFO ] Deduced a trap composed of 672 places in 570 ms of which 1 ms to minimize.
[2021-05-17 02:47:47] [INFO ] Deduced a trap composed of 680 places in 598 ms of which 1 ms to minimize.
[2021-05-17 02:47:47] [INFO ] Deduced a trap composed of 678 places in 730 ms of which 1 ms to minimize.
[2021-05-17 02:47:48] [INFO ] Deduced a trap composed of 672 places in 662 ms of which 1 ms to minimize.
[2021-05-17 02:47:49] [INFO ] Deduced a trap composed of 664 places in 728 ms of which 1 ms to minimize.
[2021-05-17 02:47:50] [INFO ] Deduced a trap composed of 680 places in 595 ms of which 1 ms to minimize.
[2021-05-17 02:47:50] [INFO ] Deduced a trap composed of 658 places in 562 ms of which 1 ms to minimize.
[2021-05-17 02:47:51] [INFO ] Deduced a trap composed of 678 places in 630 ms of which 1 ms to minimize.
[2021-05-17 02:47:52] [INFO ] Deduced a trap composed of 668 places in 545 ms of which 1 ms to minimize.
[2021-05-17 02:47:53] [INFO ] Deduced a trap composed of 672 places in 577 ms of which 1 ms to minimize.
[2021-05-17 02:47:54] [INFO ] Deduced a trap composed of 664 places in 622 ms of which 1 ms to minimize.
[2021-05-17 02:47:55] [INFO ] Deduced a trap composed of 652 places in 574 ms of which 1 ms to minimize.
[2021-05-17 02:47:56] [INFO ] Deduced a trap composed of 662 places in 598 ms of which 1 ms to minimize.
[2021-05-17 02:47:56] [INFO ] Deduced a trap composed of 663 places in 661 ms of which 1 ms to minimize.
[2021-05-17 02:47:57] [INFO ] Deduced a trap composed of 676 places in 586 ms of which 1 ms to minimize.
[2021-05-17 02:47:58] [INFO ] Deduced a trap composed of 682 places in 573 ms of which 1 ms to minimize.
[2021-05-17 02:48:00] [INFO ] Deduced a trap composed of 664 places in 657 ms of which 1 ms to minimize.
[2021-05-17 02:48:01] [INFO ] Deduced a trap composed of 668 places in 943 ms of which 1 ms to minimize.
[2021-05-17 02:48:02] [INFO ] Deduced a trap composed of 666 places in 612 ms of which 1 ms to minimize.
[2021-05-17 02:48:03] [INFO ] Deduced a trap composed of 664 places in 604 ms of which 1 ms to minimize.
[2021-05-17 02:48:04] [INFO ] Deduced a trap composed of 656 places in 607 ms of which 1 ms to minimize.
[2021-05-17 02:48:05] [INFO ] Deduced a trap composed of 674 places in 554 ms of which 1 ms to minimize.
[2021-05-17 02:48:06] [INFO ] Deduced a trap composed of 666 places in 610 ms of which 1 ms to minimize.
[2021-05-17 02:48:07] [INFO ] Deduced a trap composed of 664 places in 563 ms of which 1 ms to minimize.
[2021-05-17 02:48:07] [INFO ] Deduced a trap composed of 674 places in 533 ms of which 1 ms to minimize.
[2021-05-17 02:48:08] [INFO ] Deduced a trap composed of 660 places in 582 ms of which 1 ms to minimize.
[2021-05-17 02:48:09] [INFO ] Deduced a trap composed of 678 places in 589 ms of which 1 ms to minimize.
[2021-05-17 02:48:11] [INFO ] Deduced a trap composed of 672 places in 588 ms of which 1 ms to minimize.
[2021-05-17 02:48:13] [INFO ] Deduced a trap composed of 670 places in 559 ms of which 1 ms to minimize.
[2021-05-17 02:48:16] [INFO ] Deduced a trap composed of 658 places in 613 ms of which 1 ms to minimize.
[2021-05-17 02:48:17] [INFO ] Deduced a trap composed of 666 places in 774 ms of which 1 ms to minimize.
[2021-05-17 02:48:18] [INFO ] Deduced a trap composed of 674 places in 703 ms of which 1 ms to minimize.
[2021-05-17 02:48:19] [INFO ] Deduced a trap composed of 682 places in 607 ms of which 1 ms to minimize.
[2021-05-17 02:48:20] [INFO ] Deduced a trap composed of 668 places in 598 ms of which 1 ms to minimize.
[2021-05-17 02:48:21] [INFO ] Deduced a trap composed of 670 places in 636 ms of which 1 ms to minimize.
[2021-05-17 02:48:22] [INFO ] Deduced a trap composed of 678 places in 599 ms of which 1 ms to minimize.
[2021-05-17 02:48:23] [INFO ] Deduced a trap composed of 10 places in 838 ms of which 1 ms to minimize.
[2021-05-17 02:48:23] [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)
[2021-05-17 02:48:24] [INFO ] [Real]Absence check using 176 positive place invariants in 46 ms returned sat
[2021-05-17 02:48:24] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 27 ms returned unsat
[2021-05-17 02:48:24] [INFO ] [Real]Absence check using 176 positive place invariants in 49 ms returned sat
[2021-05-17 02:48:24] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 27 ms returned unsat
[2021-05-17 02:48:24] [INFO ] [Real]Absence check using 176 positive place invariants in 47 ms returned sat
[2021-05-17 02:48:24] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 27 ms returned unsat
[2021-05-17 02:48:24] [INFO ] [Real]Absence check using 176 positive place invariants in 48 ms returned sat
[2021-05-17 02:48:24] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 21 ms returned unsat
[2021-05-17 02:48:24] [INFO ] [Real]Absence check using 176 positive place invariants in 57 ms returned sat
[2021-05-17 02:48:24] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 10, 1, 1, 1, 1, 4] Max seen :[3, 3, 1, 1, 1, 1, 4]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 1516 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1516/1516 places, 2687/2687 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1516 transition count 2686
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1515 transition count 2686
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 2 place count 1515 transition count 2605
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 164 place count 1434 transition count 2605
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 1433 transition count 2604
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 1433 transition count 2604
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 170 place count 1431 transition count 2602
Applied a total of 170 rules in 394 ms. Remains 1431 /1516 variables (removed 85) and now considering 2602/2687 (removed 85) transitions.
Finished structural reductions, in 1 iterations. Remains : 1431/1516 places, 2602/2687 transitions.
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:48:25] [INFO ] Computed 182 place invariants in 92 ms
Incomplete random walk after 1000000 steps, including 70548 resets, run finished after 8499 ms. (steps per millisecond=117 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 6548 resets, run finished after 1731 ms. (steps per millisecond=577 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 6480 resets, run finished after 1814 ms. (steps per millisecond=551 ) properties (out of 2) seen :4
[2021-05-17 02:48:37] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:48:37] [INFO ] Computed 182 place invariants in 76 ms
[2021-05-17 02:48:37] [INFO ] [Real]Absence check using 175 positive place invariants in 51 ms returned sat
[2021-05-17 02:48:37] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 32 ms returned sat
[2021-05-17 02:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:48:38] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2021-05-17 02:48:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:48:38] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2021-05-17 02:48:38] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2021-05-17 02:48:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:48:39] [INFO ] [Nat]Absence check using state equation in 762 ms returned sat
[2021-05-17 02:48:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:48:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 25 ms returned sat
[2021-05-17 02:48:40] [INFO ] Deduced a trap composed of 572 places in 609 ms of which 1 ms to minimize.
[2021-05-17 02:48:40] [INFO ] Deduced a trap composed of 570 places in 517 ms of which 1 ms to minimize.
[2021-05-17 02:48:41] [INFO ] Deduced a trap composed of 564 places in 505 ms of which 1 ms to minimize.
[2021-05-17 02:48:42] [INFO ] Deduced a trap composed of 566 places in 529 ms of which 1 ms to minimize.
[2021-05-17 02:48:42] [INFO ] Deduced a trap composed of 572 places in 532 ms of which 1 ms to minimize.
[2021-05-17 02:48:43] [INFO ] Deduced a trap composed of 578 places in 528 ms of which 1 ms to minimize.
[2021-05-17 02:48:43] [INFO ] Deduced a trap composed of 570 places in 524 ms of which 1 ms to minimize.
[2021-05-17 02:48:44] [INFO ] Deduced a trap composed of 586 places in 517 ms of which 1 ms to minimize.
[2021-05-17 02:48:45] [INFO ] Deduced a trap composed of 568 places in 507 ms of which 1 ms to minimize.
[2021-05-17 02:48:45] [INFO ] Deduced a trap composed of 574 places in 530 ms of which 1 ms to minimize.
[2021-05-17 02:48:46] [INFO ] Deduced a trap composed of 566 places in 548 ms of which 1 ms to minimize.
[2021-05-17 02:48:47] [INFO ] Deduced a trap composed of 570 places in 518 ms of which 1 ms to minimize.
[2021-05-17 02:48:47] [INFO ] Deduced a trap composed of 572 places in 490 ms of which 1 ms to minimize.
[2021-05-17 02:48:48] [INFO ] Deduced a trap composed of 562 places in 508 ms of which 1 ms to minimize.
[2021-05-17 02:48:48] [INFO ] Deduced a trap composed of 578 places in 527 ms of which 1 ms to minimize.
[2021-05-17 02:48:49] [INFO ] Deduced a trap composed of 580 places in 528 ms of which 1 ms to minimize.
[2021-05-17 02:48:50] [INFO ] Deduced a trap composed of 572 places in 505 ms of which 1 ms to minimize.
[2021-05-17 02:48:50] [INFO ] Deduced a trap composed of 570 places in 525 ms of which 1 ms to minimize.
[2021-05-17 02:48:51] [INFO ] Deduced a trap composed of 572 places in 492 ms of which 0 ms to minimize.
[2021-05-17 02:48:51] [INFO ] Deduced a trap composed of 574 places in 524 ms of which 1 ms to minimize.
[2021-05-17 02:48:52] [INFO ] Deduced a trap composed of 574 places in 505 ms of which 1 ms to minimize.
[2021-05-17 02:48:53] [INFO ] Deduced a trap composed of 566 places in 520 ms of which 1 ms to minimize.
[2021-05-17 02:48:53] [INFO ] Deduced a trap composed of 574 places in 555 ms of which 1 ms to minimize.
[2021-05-17 02:48:54] [INFO ] Deduced a trap composed of 558 places in 540 ms of which 1 ms to minimize.
[2021-05-17 02:48:55] [INFO ] Deduced a trap composed of 568 places in 511 ms of which 1 ms to minimize.
[2021-05-17 02:48:55] [INFO ] Deduced a trap composed of 574 places in 536 ms of which 1 ms to minimize.
[2021-05-17 02:48:56] [INFO ] Deduced a trap composed of 578 places in 488 ms of which 1 ms to minimize.
[2021-05-17 02:48:57] [INFO ] Deduced a trap composed of 570 places in 489 ms of which 1 ms to minimize.
[2021-05-17 02:48:58] [INFO ] Deduced a trap composed of 576 places in 524 ms of which 1 ms to minimize.
[2021-05-17 02:48:58] [INFO ] Deduced a trap composed of 576 places in 513 ms of which 1 ms to minimize.
[2021-05-17 02:48:59] [INFO ] Deduced a trap composed of 558 places in 511 ms of which 1 ms to minimize.
[2021-05-17 02:49:00] [INFO ] Deduced a trap composed of 568 places in 547 ms of which 1 ms to minimize.
[2021-05-17 02:49:00] [INFO ] Deduced a trap composed of 564 places in 504 ms of which 1 ms to minimize.
[2021-05-17 02:49:01] [INFO ] Deduced a trap composed of 578 places in 497 ms of which 1 ms to minimize.
[2021-05-17 02:49:01] [INFO ] Deduced a trap composed of 580 places in 530 ms of which 1 ms to minimize.
[2021-05-17 02:49:04] [INFO ] Deduced a trap composed of 568 places in 517 ms of which 1 ms to minimize.
[2021-05-17 02:49:04] [INFO ] Deduced a trap composed of 574 places in 511 ms of which 1 ms to minimize.
[2021-05-17 02:49:05] [INFO ] Deduced a trap composed of 572 places in 523 ms of which 1 ms to minimize.
[2021-05-17 02:49:06] [INFO ] Deduced a trap composed of 574 places in 494 ms of which 1 ms to minimize.
[2021-05-17 02:49:07] [INFO ] Deduced a trap composed of 574 places in 525 ms of which 1 ms to minimize.
[2021-05-17 02:49:09] [INFO ] Deduced a trap composed of 572 places in 575 ms of which 1 ms to minimize.
[2021-05-17 02:49:09] [INFO ] Deduced a trap composed of 580 places in 558 ms of which 1 ms to minimize.
[2021-05-17 02:49:10] [INFO ] Deduced a trap composed of 582 places in 592 ms of which 1 ms to minimize.
[2021-05-17 02:49:11] [INFO ] Deduced a trap composed of 570 places in 569 ms of which 1 ms to minimize.
[2021-05-17 02:49:12] [INFO ] Deduced a trap composed of 568 places in 601 ms of which 1 ms to minimize.
[2021-05-17 02:49:14] [INFO ] Deduced a trap composed of 558 places in 1006 ms of which 1 ms to minimize.
[2021-05-17 02:49:15] [INFO ] Deduced a trap composed of 568 places in 540 ms of which 1 ms to minimize.
[2021-05-17 02:49:15] [INFO ] Deduced a trap composed of 576 places in 646 ms of which 1 ms to minimize.
[2021-05-17 02:49:16] [INFO ] Deduced a trap composed of 564 places in 512 ms of which 1 ms to minimize.
[2021-05-17 02:49:17] [INFO ] Deduced a trap composed of 572 places in 672 ms of which 2 ms to minimize.
[2021-05-17 02:49:18] [INFO ] Deduced a trap composed of 572 places in 527 ms of which 1 ms to minimize.
[2021-05-17 02:49:19] [INFO ] Deduced a trap composed of 568 places in 549 ms of which 1 ms to minimize.
[2021-05-17 02:49:22] [INFO ] Deduced a trap composed of 576 places in 482 ms of which 1 ms to minimize.
[2021-05-17 02:49:23] [INFO ] Deduced a trap composed of 574 places in 488 ms of which 1 ms to minimize.
[2021-05-17 02:49:24] [INFO ] Deduced a trap composed of 9 places in 733 ms of which 1 ms to minimize.
[2021-05-17 02:49:24] [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 02:49:24] [INFO ] [Real]Absence check using 175 positive place invariants in 52 ms returned sat
[2021-05-17 02:49:24] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2021-05-17 02:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:49:25] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2021-05-17 02:49:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:49:25] [INFO ] [Nat]Absence check using 175 positive place invariants in 41 ms returned sat
[2021-05-17 02:49:25] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2021-05-17 02:49:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:49:26] [INFO ] [Nat]Absence check using state equation in 955 ms returned sat
[2021-05-17 02:49:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 65 ms returned sat
[2021-05-17 02:49:27] [INFO ] Deduced a trap composed of 556 places in 473 ms of which 1 ms to minimize.
[2021-05-17 02:49:27] [INFO ] Deduced a trap composed of 578 places in 485 ms of which 1 ms to minimize.
[2021-05-17 02:49:28] [INFO ] Deduced a trap composed of 558 places in 719 ms of which 1 ms to minimize.
[2021-05-17 02:49:29] [INFO ] Deduced a trap composed of 564 places in 636 ms of which 1 ms to minimize.
[2021-05-17 02:49:30] [INFO ] Deduced a trap composed of 572 places in 1029 ms of which 2 ms to minimize.
[2021-05-17 02:49:30] [INFO ] Deduced a trap composed of 574 places in 556 ms of which 1 ms to minimize.
[2021-05-17 02:49:31] [INFO ] Deduced a trap composed of 570 places in 572 ms of which 1 ms to minimize.
[2021-05-17 02:49:32] [INFO ] Deduced a trap composed of 566 places in 554 ms of which 1 ms to minimize.
[2021-05-17 02:49:33] [INFO ] Deduced a trap composed of 572 places in 543 ms of which 1 ms to minimize.
[2021-05-17 02:49:33] [INFO ] Deduced a trap composed of 566 places in 598 ms of which 2 ms to minimize.
[2021-05-17 02:49:34] [INFO ] Deduced a trap composed of 568 places in 542 ms of which 1 ms to minimize.
[2021-05-17 02:49:35] [INFO ] Deduced a trap composed of 584 places in 1024 ms of which 1 ms to minimize.
[2021-05-17 02:49:36] [INFO ] Deduced a trap composed of 572 places in 534 ms of which 1 ms to minimize.
[2021-05-17 02:49:37] [INFO ] Deduced a trap composed of 576 places in 524 ms of which 1 ms to minimize.
[2021-05-17 02:49:37] [INFO ] Deduced a trap composed of 562 places in 543 ms of which 1 ms to minimize.
[2021-05-17 02:49:38] [INFO ] Deduced a trap composed of 568 places in 528 ms of which 1 ms to minimize.
[2021-05-17 02:49:39] [INFO ] Deduced a trap composed of 566 places in 532 ms of which 1 ms to minimize.
[2021-05-17 02:49:40] [INFO ] Deduced a trap composed of 558 places in 1026 ms of which 1 ms to minimize.
[2021-05-17 02:49:40] [INFO ] Deduced a trap composed of 564 places in 543 ms of which 1 ms to minimize.
[2021-05-17 02:49:41] [INFO ] Deduced a trap composed of 566 places in 539 ms of which 1 ms to minimize.
[2021-05-17 02:49:42] [INFO ] Deduced a trap composed of 572 places in 564 ms of which 1 ms to minimize.
[2021-05-17 02:49:43] [INFO ] Deduced a trap composed of 566 places in 576 ms of which 1 ms to minimize.
[2021-05-17 02:49:43] [INFO ] Deduced a trap composed of 560 places in 534 ms of which 1 ms to minimize.
[2021-05-17 02:49:44] [INFO ] Deduced a trap composed of 582 places in 533 ms of which 1 ms to minimize.
[2021-05-17 02:49:45] [INFO ] Deduced a trap composed of 584 places in 499 ms of which 1 ms to minimize.
[2021-05-17 02:50:11] [INFO ] Deduced a trap composed of 9 places in 723 ms of which 1 ms to minimize.
[2021-05-17 02:50: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 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 2 out of 1431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 67 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Starting structural reductions, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 68 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2021-05-17 02:50:11] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:50:11] [INFO ] Computed 182 place invariants in 65 ms
[2021-05-17 02:50:12] [INFO ] Implicit Places using invariants in 1380 ms returned []
[2021-05-17 02:50:12] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:50:12] [INFO ] Computed 182 place invariants in 69 ms
[2021-05-17 02:50:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:50:19] [INFO ] Implicit Places using invariants and state equation in 7336 ms returned []
Implicit Place search using SMT with State Equation took 8721 ms to find 0 implicit places.
[2021-05-17 02:50:20] [INFO ] Redundant transitions in 97 ms returned []
[2021-05-17 02:50:20] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:50:20] [INFO ] Computed 182 place invariants in 92 ms
[2021-05-17 02:50:21] [INFO ] Dead Transitions using invariants and state equation in 1307 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J80-UpperBounds-00
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:50:21] [INFO ] Computed 182 place invariants in 76 ms
Incomplete random walk after 10000 steps, including 683 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2021-05-17 02:50:21] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:50:21] [INFO ] Computed 182 place invariants in 72 ms
[2021-05-17 02:50:21] [INFO ] [Real]Absence check using 175 positive place invariants in 41 ms returned sat
[2021-05-17 02:50:21] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2021-05-17 02:50:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:50:22] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2021-05-17 02:50:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:50:22] [INFO ] [Nat]Absence check using 175 positive place invariants in 44 ms returned sat
[2021-05-17 02:50:22] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2021-05-17 02:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:50:23] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2021-05-17 02:50:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:50:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 28 ms returned sat
[2021-05-17 02:50:24] [INFO ] Deduced a trap composed of 572 places in 531 ms of which 1 ms to minimize.
[2021-05-17 02:50:24] [INFO ] Deduced a trap composed of 570 places in 554 ms of which 1 ms to minimize.
[2021-05-17 02:50:25] [INFO ] Deduced a trap composed of 564 places in 522 ms of which 1 ms to minimize.
[2021-05-17 02:50:26] [INFO ] Deduced a trap composed of 566 places in 532 ms of which 1 ms to minimize.
[2021-05-17 02:50:26] [INFO ] Deduced a trap composed of 572 places in 553 ms of which 1 ms to minimize.
[2021-05-17 02:50:27] [INFO ] Deduced a trap composed of 578 places in 522 ms of which 1 ms to minimize.
[2021-05-17 02:50:27] [INFO ] Deduced a trap composed of 570 places in 554 ms of which 1 ms to minimize.
[2021-05-17 02:50:27] [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 1431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 59 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2021-05-17 02:50:28] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:50:28] [INFO ] Computed 182 place invariants in 66 ms
[2021-05-17 02:50:29] [INFO ] Dead Transitions using invariants and state equation in 1182 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:50:29] [INFO ] Computed 182 place invariants in 67 ms
Incomplete random walk after 1000000 steps, including 70549 resets, run finished after 8692 ms. (steps per millisecond=115 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 6475 resets, run finished after 1821 ms. (steps per millisecond=549 ) properties (out of 1) seen :3
[2021-05-17 02:50:39] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:50:39] [INFO ] Computed 182 place invariants in 70 ms
[2021-05-17 02:50:40] [INFO ] [Real]Absence check using 175 positive place invariants in 40 ms returned sat
[2021-05-17 02:50:40] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2021-05-17 02:50:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:50:40] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2021-05-17 02:50:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:50:40] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2021-05-17 02:50:40] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2021-05-17 02:50:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:50:41] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2021-05-17 02:50:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:50:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 24 ms returned sat
[2021-05-17 02:50:42] [INFO ] Deduced a trap composed of 572 places in 553 ms of which 1 ms to minimize.
[2021-05-17 02:50:42] [INFO ] Deduced a trap composed of 570 places in 522 ms of which 1 ms to minimize.
[2021-05-17 02:50:43] [INFO ] Deduced a trap composed of 564 places in 517 ms of which 1 ms to minimize.
[2021-05-17 02:50:44] [INFO ] Deduced a trap composed of 566 places in 518 ms of which 1 ms to minimize.
[2021-05-17 02:50:44] [INFO ] Deduced a trap composed of 572 places in 517 ms of which 1 ms to minimize.
[2021-05-17 02:50:45] [INFO ] Deduced a trap composed of 578 places in 516 ms of which 1 ms to minimize.
[2021-05-17 02:50:46] [INFO ] Deduced a trap composed of 570 places in 525 ms of which 1 ms to minimize.
[2021-05-17 02:50:46] [INFO ] Deduced a trap composed of 586 places in 618 ms of which 1 ms to minimize.
[2021-05-17 02:50:47] [INFO ] Deduced a trap composed of 568 places in 521 ms of which 1 ms to minimize.
[2021-05-17 02:50:48] [INFO ] Deduced a trap composed of 574 places in 532 ms of which 1 ms to minimize.
[2021-05-17 02:50:48] [INFO ] Deduced a trap composed of 566 places in 520 ms of which 1 ms to minimize.
[2021-05-17 02:50:49] [INFO ] Deduced a trap composed of 570 places in 552 ms of which 1 ms to minimize.
[2021-05-17 02:50:49] [INFO ] Deduced a trap composed of 572 places in 557 ms of which 1 ms to minimize.
[2021-05-17 02:50:50] [INFO ] Deduced a trap composed of 562 places in 541 ms of which 1 ms to minimize.
[2021-05-17 02:50:51] [INFO ] Deduced a trap composed of 578 places in 562 ms of which 1 ms to minimize.
[2021-05-17 02:50:52] [INFO ] Deduced a trap composed of 580 places in 1030 ms of which 1 ms to minimize.
[2021-05-17 02:50:53] [INFO ] Deduced a trap composed of 572 places in 1028 ms of which 2 ms to minimize.
[2021-05-17 02:50:54] [INFO ] Deduced a trap composed of 570 places in 976 ms of which 1 ms to minimize.
[2021-05-17 02:50:55] [INFO ] Deduced a trap composed of 572 places in 563 ms of which 1 ms to minimize.
[2021-05-17 02:50:56] [INFO ] Deduced a trap composed of 574 places in 886 ms of which 1 ms to minimize.
[2021-05-17 02:50:57] [INFO ] Deduced a trap composed of 574 places in 1024 ms of which 1 ms to minimize.
[2021-05-17 02:50:58] [INFO ] Deduced a trap composed of 566 places in 1044 ms of which 1 ms to minimize.
[2021-05-17 02:50:59] [INFO ] Deduced a trap composed of 574 places in 1022 ms of which 1 ms to minimize.
[2021-05-17 02:51:01] [INFO ] Deduced a trap composed of 558 places in 1061 ms of which 1 ms to minimize.
[2021-05-17 02:51:02] [INFO ] Deduced a trap composed of 568 places in 1063 ms of which 3 ms to minimize.
[2021-05-17 02:51:03] [INFO ] Deduced a trap composed of 574 places in 1039 ms of which 1 ms to minimize.
[2021-05-17 02:51:04] [INFO ] Deduced a trap composed of 578 places in 1055 ms of which 2 ms to minimize.
[2021-05-17 02:51:05] [INFO ] Deduced a trap composed of 570 places in 535 ms of which 1 ms to minimize.
[2021-05-17 02:51:06] [INFO ] Deduced a trap composed of 576 places in 557 ms of which 1 ms to minimize.
[2021-05-17 02:51:06] [INFO ] Deduced a trap composed of 576 places in 531 ms of which 1 ms to minimize.
[2021-05-17 02:51:07] [INFO ] Deduced a trap composed of 558 places in 509 ms of which 1 ms to minimize.
[2021-05-17 02:51:08] [INFO ] Deduced a trap composed of 568 places in 503 ms of which 1 ms to minimize.
[2021-05-17 02:51:09] [INFO ] Deduced a trap composed of 564 places in 503 ms of which 1 ms to minimize.
[2021-05-17 02:51:09] [INFO ] Deduced a trap composed of 578 places in 518 ms of which 1 ms to minimize.
[2021-05-17 02:51:10] [INFO ] Deduced a trap composed of 580 places in 505 ms of which 2 ms to minimize.
[2021-05-17 02:51:12] [INFO ] Deduced a trap composed of 568 places in 597 ms of which 1 ms to minimize.
[2021-05-17 02:51:13] [INFO ] Deduced a trap composed of 574 places in 625 ms of which 1 ms to minimize.
[2021-05-17 02:51:14] [INFO ] Deduced a trap composed of 572 places in 529 ms of which 1 ms to minimize.
[2021-05-17 02:51:15] [INFO ] Deduced a trap composed of 574 places in 505 ms of which 1 ms to minimize.
[2021-05-17 02:51:16] [INFO ] Deduced a trap composed of 574 places in 528 ms of which 1 ms to minimize.
[2021-05-17 02:51:17] [INFO ] Deduced a trap composed of 572 places in 496 ms of which 2 ms to minimize.
[2021-05-17 02:51:18] [INFO ] Deduced a trap composed of 580 places in 499 ms of which 1 ms to minimize.
[2021-05-17 02:51:19] [INFO ] Deduced a trap composed of 582 places in 536 ms of which 1 ms to minimize.
[2021-05-17 02:51:20] [INFO ] Deduced a trap composed of 570 places in 499 ms of which 1 ms to minimize.
[2021-05-17 02:51:20] [INFO ] Deduced a trap composed of 568 places in 493 ms of which 1 ms to minimize.
[2021-05-17 02:51:22] [INFO ] Deduced a trap composed of 558 places in 480 ms of which 1 ms to minimize.
[2021-05-17 02:51:23] [INFO ] Deduced a trap composed of 568 places in 776 ms of which 1 ms to minimize.
[2021-05-17 02:51:24] [INFO ] Deduced a trap composed of 576 places in 544 ms of which 1 ms to minimize.
[2021-05-17 02:51:24] [INFO ] Deduced a trap composed of 564 places in 497 ms of which 1 ms to minimize.
[2021-05-17 02:51:25] [INFO ] Deduced a trap composed of 572 places in 546 ms of which 3 ms to minimize.
[2021-05-17 02:51:26] [INFO ] Deduced a trap composed of 572 places in 550 ms of which 1 ms to minimize.
[2021-05-17 02:51:26] [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 1431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 63 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Starting structural reductions, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 57 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2021-05-17 02:51:26] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:51:26] [INFO ] Computed 182 place invariants in 87 ms
[2021-05-17 02:51:27] [INFO ] Implicit Places using invariants in 1233 ms returned []
[2021-05-17 02:51:27] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:51:27] [INFO ] Computed 182 place invariants in 64 ms
[2021-05-17 02:51:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:51:36] [INFO ] Implicit Places using invariants and state equation in 8924 ms returned []
Implicit Place search using SMT with State Equation took 10159 ms to find 0 implicit places.
[2021-05-17 02:51:36] [INFO ] Redundant transitions in 35 ms returned []
[2021-05-17 02:51:36] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:51:36] [INFO ] Computed 182 place invariants in 63 ms
[2021-05-17 02:51:37] [INFO ] Dead Transitions using invariants and state equation in 1314 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J80-UpperBounds-00 in 76251 ms.
Starting property specific reduction for PolyORBNT-COL-S10J80-UpperBounds-03
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:51:37] [INFO ] Computed 182 place invariants in 76 ms
Incomplete random walk after 10000 steps, including 699 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :3
[2021-05-17 02:51:37] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:51:37] [INFO ] Computed 182 place invariants in 68 ms
[2021-05-17 02:51:38] [INFO ] [Real]Absence check using 175 positive place invariants in 42 ms returned sat
[2021-05-17 02:51:38] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2021-05-17 02:51:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:51:38] [INFO ] [Real]Absence check using state equation in 737 ms returned sat
[2021-05-17 02:51:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:51:39] [INFO ] [Nat]Absence check using 175 positive place invariants in 44 ms returned sat
[2021-05-17 02:51:39] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 32 ms returned sat
[2021-05-17 02:51:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:51:40] [INFO ] [Nat]Absence check using state equation in 994 ms returned sat
[2021-05-17 02:51:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:51:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 71 ms returned sat
[2021-05-17 02:51:40] [INFO ] Deduced a trap composed of 556 places in 531 ms of which 1 ms to minimize.
[2021-05-17 02:51:41] [INFO ] Deduced a trap composed of 578 places in 550 ms of which 1 ms to minimize.
[2021-05-17 02:51:42] [INFO ] Deduced a trap composed of 558 places in 526 ms of which 1 ms to minimize.
[2021-05-17 02:51:42] [INFO ] Deduced a trap composed of 564 places in 560 ms of which 1 ms to minimize.
[2021-05-17 02:51:43] [INFO ] Deduced a trap composed of 572 places in 495 ms of which 1 ms to minimize.
[2021-05-17 02:51:43] [INFO ] Deduced a trap composed of 574 places in 508 ms of which 1 ms to minimize.
[2021-05-17 02:51:44] [INFO ] Deduced a trap composed of 9 places in 724 ms of which 1 ms to minimize.
[2021-05-17 02:51:44] [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 1431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 65 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2021-05-17 02:51:44] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:51:44] [INFO ] Computed 182 place invariants in 63 ms
[2021-05-17 02:51:46] [INFO ] Dead Transitions using invariants and state equation in 1625 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:51:46] [INFO ] Computed 182 place invariants in 78 ms
Incomplete random walk after 1000000 steps, including 70494 resets, run finished after 8282 ms. (steps per millisecond=120 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 6540 resets, run finished after 1668 ms. (steps per millisecond=599 ) properties (out of 1) seen :3
[2021-05-17 02:51:56] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:51:56] [INFO ] Computed 182 place invariants in 69 ms
[2021-05-17 02:51:56] [INFO ] [Real]Absence check using 175 positive place invariants in 42 ms returned sat
[2021-05-17 02:51:56] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2021-05-17 02:51:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:51:57] [INFO ] [Real]Absence check using state equation in 731 ms returned sat
[2021-05-17 02:51:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:51:57] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2021-05-17 02:51:57] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2021-05-17 02:51:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:51:58] [INFO ] [Nat]Absence check using state equation in 943 ms returned sat
[2021-05-17 02:51:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:51:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 70 ms returned sat
[2021-05-17 02:51:59] [INFO ] Deduced a trap composed of 556 places in 1085 ms of which 1 ms to minimize.
[2021-05-17 02:52:00] [INFO ] Deduced a trap composed of 578 places in 527 ms of which 1 ms to minimize.
[2021-05-17 02:52:01] [INFO ] Deduced a trap composed of 558 places in 538 ms of which 1 ms to minimize.
[2021-05-17 02:52:01] [INFO ] Deduced a trap composed of 564 places in 529 ms of which 1 ms to minimize.
[2021-05-17 02:52:02] [INFO ] Deduced a trap composed of 572 places in 537 ms of which 1 ms to minimize.
[2021-05-17 02:52:02] [INFO ] Deduced a trap composed of 574 places in 529 ms of which 1 ms to minimize.
[2021-05-17 02:52:03] [INFO ] Deduced a trap composed of 570 places in 534 ms of which 1 ms to minimize.
[2021-05-17 02:52:04] [INFO ] Deduced a trap composed of 566 places in 519 ms of which 1 ms to minimize.
[2021-05-17 02:52:05] [INFO ] Deduced a trap composed of 572 places in 544 ms of which 2 ms to minimize.
[2021-05-17 02:52:05] [INFO ] Deduced a trap composed of 566 places in 552 ms of which 1 ms to minimize.
[2021-05-17 02:52:06] [INFO ] Deduced a trap composed of 568 places in 548 ms of which 1 ms to minimize.
[2021-05-17 02:52:07] [INFO ] Deduced a trap composed of 584 places in 548 ms of which 1 ms to minimize.
[2021-05-17 02:52:07] [INFO ] Deduced a trap composed of 572 places in 539 ms of which 1 ms to minimize.
[2021-05-17 02:52:08] [INFO ] Deduced a trap composed of 576 places in 516 ms of which 1 ms to minimize.
[2021-05-17 02:52:09] [INFO ] Deduced a trap composed of 562 places in 529 ms of which 1 ms to minimize.
[2021-05-17 02:52:09] [INFO ] Deduced a trap composed of 568 places in 562 ms of which 1 ms to minimize.
[2021-05-17 02:52:10] [INFO ] Deduced a trap composed of 566 places in 550 ms of which 1 ms to minimize.
[2021-05-17 02:52:11] [INFO ] Deduced a trap composed of 558 places in 562 ms of which 1 ms to minimize.
[2021-05-17 02:52:11] [INFO ] Deduced a trap composed of 564 places in 546 ms of which 1 ms to minimize.
[2021-05-17 02:52:12] [INFO ] Deduced a trap composed of 566 places in 529 ms of which 1 ms to minimize.
[2021-05-17 02:52:13] [INFO ] Deduced a trap composed of 572 places in 563 ms of which 1 ms to minimize.
[2021-05-17 02:52:14] [INFO ] Deduced a trap composed of 566 places in 554 ms of which 1 ms to minimize.
[2021-05-17 02:52:14] [INFO ] Deduced a trap composed of 560 places in 510 ms of which 1 ms to minimize.
[2021-05-17 02:52:15] [INFO ] Deduced a trap composed of 582 places in 513 ms of which 1 ms to minimize.
[2021-05-17 02:52:16] [INFO ] Deduced a trap composed of 584 places in 515 ms of which 1 ms to minimize.
[2021-05-17 02:52:43] [INFO ] Deduced a trap composed of 9 places in 753 ms of which 1 ms to minimize.
[2021-05-17 02:52:43] [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 1431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 54 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Starting structural reductions, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 73 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2021-05-17 02:52:43] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:52:43] [INFO ] Computed 182 place invariants in 68 ms
[2021-05-17 02:52:44] [INFO ] Implicit Places using invariants in 1363 ms returned []
[2021-05-17 02:52:44] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:52:44] [INFO ] Computed 182 place invariants in 65 ms
[2021-05-17 02:52:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:52:53] [INFO ] Implicit Places using invariants and state equation in 8478 ms returned []
Implicit Place search using SMT with State Equation took 9875 ms to find 0 implicit places.
[2021-05-17 02:52:53] [INFO ] Redundant transitions in 52 ms returned []
[2021-05-17 02:52:53] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2021-05-17 02:52:53] [INFO ] Computed 182 place invariants in 61 ms
[2021-05-17 02:52:54] [INFO ] Dead Transitions using invariants and state equation in 1307 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J80-UpperBounds-03 in 76965 ms.
[2021-05-17 02:52:55] [INFO ] Flatten gal took : 302 ms
[2021-05-17 02:52:55] [INFO ] Applying decomposition
[2021-05-17 02:52:55] [INFO ] Flatten gal took : 220 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/graph11716386552453056641.txt, -o, /tmp/graph11716386552453056641.bin, -w, /tmp/graph11716386552453056641.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/graph11716386552453056641.bin, -l, -1, -v, -w, /tmp/graph11716386552453056641.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 02:52:56] [INFO ] Decomposing Gal with order
[2021-05-17 02:52:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 02:52:56] [INFO ] Removed a total of 2636 redundant transitions.
[2021-05-17 02:52:56] [INFO ] Flatten gal took : 690 ms
[2021-05-17 02:52:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 700 labels/synchronizations in 91 ms.
[2021-05-17 02:52:57] [INFO ] Time to serialize gal into /tmp/UpperBounds11534379125261854798.gal : 185 ms
[2021-05-17 02:52:57] [INFO ] Time to serialize properties into /tmp/UpperBounds5714055045710098269.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/UpperBounds11534379125261854798.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds5714055045710098269.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/UpperBounds11534379125261854798.gal -t CGAL -reachable-file /tmp/UpperBounds5714055045710098269.prop --nowitness
Loading property file /tmp/UpperBounds5714055045710098269.prop.
Detected timeout of ITS tools.
[2021-05-17 03:15:28] [INFO ] Applying decomposition
[2021-05-17 03:15:31] [INFO ] Flatten gal took : 2851 ms
[2021-05-17 03:15:31] [INFO ] Decomposing Gal with order
[2021-05-17 03:15:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 03:15:38] [INFO ] Removed a total of 11519 redundant transitions.
[2021-05-17 03:15:38] [INFO ] Flatten gal took : 5005 ms
[2021-05-17 03:15:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 286 ms.
[2021-05-17 03:15:39] [INFO ] Time to serialize gal into /tmp/UpperBounds1652065498385744223.gal : 67 ms
[2021-05-17 03:15:39] [INFO ] Time to serialize properties into /tmp/UpperBounds7268303817422841248.prop : 6 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/UpperBounds1652065498385744223.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7268303817422841248.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/UpperBounds1652065498385744223.gal -t CGAL -reachable-file /tmp/UpperBounds7268303817422841248.prop --nowitness
Loading property file /tmp/UpperBounds7268303817422841248.prop.
Detected timeout of ITS tools.
[2021-05-17 03:38:10] [INFO ] Flatten gal took : 1208 ms
[2021-05-17 03:38:12] [INFO ] Input system was already deterministic with 2602 transitions.
[2021-05-17 03:38:12] [INFO ] Transformed 1431 places.
[2021-05-17 03:38:12] [INFO ] Transformed 2602 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 03:38:42] [INFO ] Time to serialize gal into /tmp/UpperBounds3681729635341191022.gal : 34 ms
[2021-05-17 03:38:42] [INFO ] Time to serialize properties into /tmp/UpperBounds4177200805304499459.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/UpperBounds3681729635341191022.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds4177200805304499459.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J80"
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-S10J80, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r159-oct2-162089268400435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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