Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r179-tall-165277026600010.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is Peterson-COL-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026600010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 7.3K Apr 30 09:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 09:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 30 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 45K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-5-UpperBounds-00
FORMULA_NAME Peterson-COL-5-UpperBounds-01
FORMULA_NAME Peterson-COL-5-UpperBounds-02
FORMULA_NAME Peterson-COL-5-UpperBounds-03
FORMULA_NAME Peterson-COL-5-UpperBounds-04
FORMULA_NAME Peterson-COL-5-UpperBounds-05
FORMULA_NAME Peterson-COL-5-UpperBounds-06
FORMULA_NAME Peterson-COL-5-UpperBounds-07
FORMULA_NAME Peterson-COL-5-UpperBounds-08
FORMULA_NAME Peterson-COL-5-UpperBounds-09
FORMULA_NAME Peterson-COL-5-UpperBounds-10
FORMULA_NAME Peterson-COL-5-UpperBounds-11
FORMULA_NAME Peterson-COL-5-UpperBounds-12
FORMULA_NAME Peterson-COL-5-UpperBounds-13
FORMULA_NAME Peterson-COL-5-UpperBounds-14
FORMULA_NAME Peterson-COL-5-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652823853196

Running Version 0
[2022-05-17 21:44:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 21:44:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:44:14] [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.
[2022-05-17 21:44:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 21:44:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 569 ms
[2022-05-17 21:44:15] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-17 21:44:15] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 3 ms.
[2022-05-17 21:44:15] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_2178597559088618376.dot
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 21:44:15] [INFO ] Computed 1 place invariants in 6 ms
FORMULA Peterson-COL-5-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-17 21:44:15] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions in 30 ms.
[2022-05-17 21:44:15] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 21:44:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 21:44:15] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-17 21:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:15] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 21:44:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-17 21:44:15] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 21:44:15] [INFO ] Added : 11 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 21:44:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 21:44:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:15] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-17 21:44:15] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 21:44:15] [INFO ] Added : 11 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:15] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 21:44:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:15] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 21:44:15] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 21:44:15] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 21:44:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:15] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 21:44:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:15] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 21:44:15] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 21:44:15] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:15] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 21:44:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-17 21:44:15] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 21:44:15] [INFO ] Added : 11 causal constraints over 4 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:15] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 21:44:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:16] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 21:44:16] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 21:44:16] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 21:44:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:16] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 21:44:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 21:44:16] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 21:44:16] [INFO ] Added : 11 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:16] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 21:44:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:16] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 21:44:16] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 21:44:16] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:16] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 21:44:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:16] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 21:44:16] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 21:44:16] [INFO ] Added : 12 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:16] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 21:44:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:16] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 21:44:16] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 21:44:16] [INFO ] Added : 11 causal constraints over 4 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 21:44:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 21:44:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 21:44:16] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 21:44:16] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6]
[2022-05-17 21:44:16] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions in 14 ms.
[2022-05-17 21:44:16] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_9124955056548247935.dot
Deduced a syphon composed of 30 places in 10 ms
Reduce places removed 30 places and 60 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 11) seen :41
FORMULA Peterson-COL-5-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :18
FORMULA Peterson-COL-5-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-5-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :12
[2022-05-17 21:44:16] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 21:44:16] [INFO ] Computed 23 place invariants in 20 ms
[2022-05-17 21:44:16] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2022-05-17 21:44:16] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 12 ms returned sat
[2022-05-17 21:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:17] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2022-05-17 21:44:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2022-05-17 21:44:17] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-17 21:44:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:17] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2022-05-17 21:44:17] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-05-17 21:44:17] [INFO ] [Nat]Added 230 Read/Feed constraints in 47 ms returned sat
[2022-05-17 21:44:17] [INFO ] Deduced a trap composed of 145 places in 232 ms of which 5 ms to minimize.
[2022-05-17 21:44:18] [INFO ] Deduced a trap composed of 108 places in 274 ms of which 2 ms to minimize.
[2022-05-17 21:44:18] [INFO ] Deduced a trap composed of 117 places in 228 ms of which 2 ms to minimize.
[2022-05-17 21:44:18] [INFO ] Deduced a trap composed of 71 places in 250 ms of which 2 ms to minimize.
[2022-05-17 21:44:19] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 1 ms to minimize.
[2022-05-17 21:44:19] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:44:19] [INFO ] Deduced a trap composed of 93 places in 204 ms of which 0 ms to minimize.
[2022-05-17 21:44:19] [INFO ] Deduced a trap composed of 124 places in 205 ms of which 1 ms to minimize.
[2022-05-17 21:44:20] [INFO ] Deduced a trap composed of 105 places in 202 ms of which 1 ms to minimize.
[2022-05-17 21:44:20] [INFO ] Deduced a trap composed of 174 places in 197 ms of which 1 ms to minimize.
[2022-05-17 21:44:20] [INFO ] Deduced a trap composed of 183 places in 205 ms of which 1 ms to minimize.
[2022-05-17 21:44:20] [INFO ] Deduced a trap composed of 108 places in 216 ms of which 1 ms to minimize.
[2022-05-17 21:44:21] [INFO ] Deduced a trap composed of 141 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:44:21] [INFO ] Deduced a trap composed of 81 places in 208 ms of which 1 ms to minimize.
[2022-05-17 21:44:21] [INFO ] Deduced a trap composed of 67 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:44:22] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:44:22] [INFO ] Deduced a trap composed of 127 places in 249 ms of which 0 ms to minimize.
[2022-05-17 21:44:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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)
[2022-05-17 21:44:22] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2022-05-17 21:44:22] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-17 21:44:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:22] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2022-05-17 21:44:22] [INFO ] [Real]Added 230 Read/Feed constraints in 51 ms returned sat
[2022-05-17 21:44:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 20 ms returned sat
[2022-05-17 21:44:22] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-17 21:44:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:23] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2022-05-17 21:44:23] [INFO ] [Nat]Added 230 Read/Feed constraints in 55 ms returned sat
[2022-05-17 21:44:23] [INFO ] Deduced a trap composed of 130 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:44:23] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 1 ms to minimize.
[2022-05-17 21:44:24] [INFO ] Deduced a trap composed of 138 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:44:24] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 1 ms to minimize.
[2022-05-17 21:44:24] [INFO ] Deduced a trap composed of 128 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:44:24] [INFO ] Deduced a trap composed of 104 places in 245 ms of which 1 ms to minimize.
[2022-05-17 21:44:25] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 1 ms to minimize.
[2022-05-17 21:44:25] [INFO ] Deduced a trap composed of 127 places in 250 ms of which 0 ms to minimize.
[2022-05-17 21:44:25] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 1 ms to minimize.
[2022-05-17 21:44:26] [INFO ] Deduced a trap composed of 119 places in 159 ms of which 0 ms to minimize.
[2022-05-17 21:44:26] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 0 ms to minimize.
[2022-05-17 21:44:26] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 0 ms to minimize.
[2022-05-17 21:44:26] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 0 ms to minimize.
[2022-05-17 21:44:26] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 1 ms to minimize.
[2022-05-17 21:44:27] [INFO ] Deduced a trap composed of 93 places in 154 ms of which 1 ms to minimize.
[2022-05-17 21:44:27] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 1 ms to minimize.
[2022-05-17 21:44:27] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 1 ms to minimize.
[2022-05-17 21:44:27] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 8 ms to minimize.
[2022-05-17 21:44:27] [INFO ] Deduced a trap composed of 105 places in 151 ms of which 1 ms to minimize.
[2022-05-17 21:44: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 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)
[2022-05-17 21:44:28] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-05-17 21:44:28] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-17 21:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:28] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2022-05-17 21:44:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2022-05-17 21:44:28] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 12 ms returned sat
[2022-05-17 21:44:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:28] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2022-05-17 21:44:28] [INFO ] [Nat]Added 230 Read/Feed constraints in 45 ms returned sat
[2022-05-17 21:44:29] [INFO ] Deduced a trap composed of 145 places in 215 ms of which 1 ms to minimize.
[2022-05-17 21:44:29] [INFO ] Deduced a trap composed of 108 places in 205 ms of which 0 ms to minimize.
[2022-05-17 21:44:29] [INFO ] Deduced a trap composed of 117 places in 201 ms of which 0 ms to minimize.
[2022-05-17 21:44:29] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 1 ms to minimize.
[2022-05-17 21:44:30] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 1 ms to minimize.
[2022-05-17 21:44:30] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 1 ms to minimize.
[2022-05-17 21:44:30] [INFO ] Deduced a trap composed of 93 places in 204 ms of which 0 ms to minimize.
[2022-05-17 21:44:30] [INFO ] Deduced a trap composed of 124 places in 201 ms of which 1 ms to minimize.
[2022-05-17 21:44:31] [INFO ] Deduced a trap composed of 105 places in 202 ms of which 0 ms to minimize.
[2022-05-17 21:44:31] [INFO ] Deduced a trap composed of 174 places in 202 ms of which 0 ms to minimize.
[2022-05-17 21:44:31] [INFO ] Deduced a trap composed of 183 places in 203 ms of which 0 ms to minimize.
[2022-05-17 21:44:31] [INFO ] Deduced a trap composed of 108 places in 203 ms of which 0 ms to minimize.
[2022-05-17 21:44:32] [INFO ] Deduced a trap composed of 141 places in 201 ms of which 1 ms to minimize.
[2022-05-17 21:44:32] [INFO ] Deduced a trap composed of 81 places in 213 ms of which 0 ms to minimize.
[2022-05-17 21:44:32] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 1 ms to minimize.
[2022-05-17 21:44:32] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2022-05-17 21:44:33] [INFO ] Deduced a trap composed of 127 places in 203 ms of which 0 ms to minimize.
[2022-05-17 21:44:33] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 0 ms to minimize.
[2022-05-17 21:44:33] [INFO ] Deduced a trap composed of 216 places in 202 ms of which 1 ms to minimize.
[2022-05-17 21:44:33] [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.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)
[2022-05-17 21:44:33] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2022-05-17 21:44:33] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 11 ms returned sat
[2022-05-17 21:44:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:33] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2022-05-17 21:44:34] [INFO ] [Real]Added 230 Read/Feed constraints in 55 ms returned sat
[2022-05-17 21:44:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2022-05-17 21:44:34] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-17 21:44:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:34] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2022-05-17 21:44:34] [INFO ] [Nat]Added 230 Read/Feed constraints in 61 ms returned sat
[2022-05-17 21:44:34] [INFO ] Deduced a trap composed of 130 places in 235 ms of which 0 ms to minimize.
[2022-05-17 21:44:35] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:44:35] [INFO ] Deduced a trap composed of 138 places in 242 ms of which 0 ms to minimize.
[2022-05-17 21:44:35] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 0 ms to minimize.
[2022-05-17 21:44:35] [INFO ] Deduced a trap composed of 128 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:44:36] [INFO ] Deduced a trap composed of 104 places in 239 ms of which 1 ms to minimize.
[2022-05-17 21:44:36] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:44:36] [INFO ] Deduced a trap composed of 127 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:44:36] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2022-05-17 21:44:37] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 1 ms to minimize.
[2022-05-17 21:44:37] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 1 ms to minimize.
[2022-05-17 21:44:37] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 0 ms to minimize.
[2022-05-17 21:44:37] [INFO ] Deduced a trap composed of 53 places in 148 ms of which 8 ms to minimize.
[2022-05-17 21:44:37] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 1 ms to minimize.
[2022-05-17 21:44:38] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 1 ms to minimize.
[2022-05-17 21:44:38] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 0 ms to minimize.
[2022-05-17 21:44:38] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 1 ms to minimize.
[2022-05-17 21:44:38] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 0 ms to minimize.
[2022-05-17 21:44:38] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 1 ms to minimize.
[2022-05-17 21:44:39] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 0 ms to minimize.
[2022-05-17 21:44:39] [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 3
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)
[2022-05-17 21:44:39] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-05-17 21:44:39] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-17 21:44:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:39] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2022-05-17 21:44:39] [INFO ] [Real]Added 230 Read/Feed constraints in 48 ms returned sat
[2022-05-17 21:44:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-05-17 21:44:39] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-17 21:44:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:39] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2022-05-17 21:44:39] [INFO ] [Nat]Added 230 Read/Feed constraints in 52 ms returned sat
[2022-05-17 21:44:40] [INFO ] Deduced a trap composed of 130 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:44:40] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:44:40] [INFO ] Deduced a trap composed of 138 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:44:41] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:44:41] [INFO ] Deduced a trap composed of 128 places in 221 ms of which 1 ms to minimize.
[2022-05-17 21:44:41] [INFO ] Deduced a trap composed of 104 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:44:41] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:44:42] [INFO ] Deduced a trap composed of 127 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:44:42] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2022-05-17 21:44:42] [INFO ] Deduced a trap composed of 119 places in 142 ms of which 0 ms to minimize.
[2022-05-17 21:44:42] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 1 ms to minimize.
[2022-05-17 21:44:42] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 0 ms to minimize.
[2022-05-17 21:44:43] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 0 ms to minimize.
[2022-05-17 21:44:43] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 1 ms to minimize.
[2022-05-17 21:44:43] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 1 ms to minimize.
[2022-05-17 21:44:43] [INFO ] Deduced a trap composed of 104 places in 154 ms of which 1 ms to minimize.
[2022-05-17 21:44:43] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 1 ms to minimize.
[2022-05-17 21:44:44] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 1 ms to minimize.
[2022-05-17 21:44:44] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 0 ms to minimize.
[2022-05-17 21:44:44] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 0 ms to minimize.
[2022-05-17 21:44:44] [INFO ] Deduced a trap composed of 75 places in 170 ms of which 1 ms to minimize.
[2022-05-17 21:44: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 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.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)
[2022-05-17 21:44:44] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2022-05-17 21:44:44] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-17 21:44:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:44] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2022-05-17 21:44:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2022-05-17 21:44:45] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-17 21:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:45] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2022-05-17 21:44:45] [INFO ] [Nat]Added 230 Read/Feed constraints in 52 ms returned sat
[2022-05-17 21:44:45] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 0 ms to minimize.
[2022-05-17 21:44:45] [INFO ] Deduced a trap composed of 227 places in 213 ms of which 0 ms to minimize.
[2022-05-17 21:44:46] [INFO ] Deduced a trap composed of 201 places in 210 ms of which 1 ms to minimize.
[2022-05-17 21:44:46] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 0 ms to minimize.
[2022-05-17 21:44:46] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 0 ms to minimize.
[2022-05-17 21:44:46] [INFO ] Deduced a trap composed of 115 places in 169 ms of which 1 ms to minimize.
[2022-05-17 21:44:47] [INFO ] Deduced a trap composed of 276 places in 215 ms of which 0 ms to minimize.
[2022-05-17 21:44:47] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 0 ms to minimize.
[2022-05-17 21:44:47] [INFO ] Deduced a trap composed of 56 places in 221 ms of which 0 ms to minimize.
[2022-05-17 21:44:47] [INFO ] Deduced a trap composed of 53 places in 212 ms of which 1 ms to minimize.
[2022-05-17 21:44:48] [INFO ] Deduced a trap composed of 88 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:44:48] [INFO ] Deduced a trap composed of 136 places in 205 ms of which 1 ms to minimize.
[2022-05-17 21:44:48] [INFO ] Deduced a trap composed of 64 places in 214 ms of which 1 ms to minimize.
[2022-05-17 21:44:48] [INFO ] Deduced a trap composed of 85 places in 211 ms of which 1 ms to minimize.
[2022-05-17 21:44:49] [INFO ] Deduced a trap composed of 56 places in 209 ms of which 1 ms to minimize.
[2022-05-17 21:44:49] [INFO ] Deduced a trap composed of 138 places in 194 ms of which 1 ms to minimize.
[2022-05-17 21:44:49] [INFO ] Deduced a trap composed of 85 places in 194 ms of which 0 ms to minimize.
[2022-05-17 21:44:49] [INFO ] Deduced a trap composed of 134 places in 193 ms of which 0 ms to minimize.
[2022-05-17 21:44:50] [INFO ] Deduced a trap composed of 138 places in 199 ms of which 1 ms to minimize.
[2022-05-17 21:44:50] [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 5
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) : [6, 6, 6, 6, 6, 6] Max seen :[5, 2, 5, 2, 2, 1]
Support contains 216 out of 834 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 834 transition count 1092
Reduce places removed 150 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 300 rules applied. Total rules applied 450 place count 684 transition count 942
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 600 place count 534 transition count 942
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 600 place count 534 transition count 912
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 660 place count 504 transition count 912
Applied a total of 660 rules in 119 ms. Remains 504 /834 variables (removed 330) and now considering 912/1242 (removed 330) transitions.
Finished structural reductions, in 1 iterations. Remains : 504/834 places, 912/1242 transitions.
Normalized transition count is 792 out of 912 initially.
// Phase 1: matrix 792 rows 504 cols
[2022-05-17 21:44:50] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9278 ms. (steps per millisecond=107 ) properties (out of 6) seen :24
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1796 ms. (steps per millisecond=556 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3349 ms. (steps per millisecond=298 ) properties (out of 6) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1770 ms. (steps per millisecond=564 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3312 ms. (steps per millisecond=301 ) properties (out of 6) seen :24
FORMULA Peterson-COL-5-UpperBounds-09 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-5-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-5-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-17 21:45:09] [INFO ] Flow matrix only has 792 transitions (discarded 120 similar events)
// Phase 1: matrix 792 rows 504 cols
[2022-05-17 21:45:09] [INFO ] Computed 23 place invariants in 19 ms
[2022-05-17 21:45:09] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 21:45:09] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 11 ms returned sat
[2022-05-17 21:45:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:10] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2022-05-17 21:45:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 21:45:10] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-17 21:45:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:10] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2022-05-17 21:45:10] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-05-17 21:45:10] [INFO ] [Nat]Added 230 Read/Feed constraints in 31 ms returned sat
[2022-05-17 21:45:10] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2022-05-17 21:45:10] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 0 ms to minimize.
[2022-05-17 21:45:10] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 0 ms to minimize.
[2022-05-17 21:45:10] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 1 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 0 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 0 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 1 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 0 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 1 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 1 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 1 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 0 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 0 ms to minimize.
[2022-05-17 21:45:13] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 0 ms to minimize.
[2022-05-17 21:45:13] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 1 ms to minimize.
[2022-05-17 21:45:13] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 0 ms to minimize.
[2022-05-17 21:45:13] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 1 ms to minimize.
[2022-05-17 21:45:13] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2022-05-17 21:45:13] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 0 ms to minimize.
[2022-05-17 21:45:14] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 0 ms to minimize.
[2022-05-17 21:45:14] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 0 ms to minimize.
[2022-05-17 21:45:14] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2022-05-17 21:45:14] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2022-05-17 21:45:14] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2022-05-17 21:45:14] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2022-05-17 21:45:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 29 trap constraints in 4423 ms
[2022-05-17 21:45:14] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2022-05-17 21:45:14] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 21:45:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:14] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2022-05-17 21:45:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-17 21:45:15] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-17 21:45:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:15] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-05-17 21:45:15] [INFO ] [Nat]Added 230 Read/Feed constraints in 28 ms returned sat
[2022-05-17 21:45:15] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2022-05-17 21:45:15] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 0 ms to minimize.
[2022-05-17 21:45:15] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 0 ms to minimize.
[2022-05-17 21:45:15] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2022-05-17 21:45:15] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 0 ms to minimize.
[2022-05-17 21:45:16] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 0 ms to minimize.
[2022-05-17 21:45:16] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 0 ms to minimize.
[2022-05-17 21:45:16] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2022-05-17 21:45:16] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 0 ms to minimize.
[2022-05-17 21:45:16] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 0 ms to minimize.
[2022-05-17 21:45:16] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 1 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 0 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 1 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 0 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 0 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 1 ms to minimize.
[2022-05-17 21:45:18] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 0 ms to minimize.
[2022-05-17 21:45:18] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 1 ms to minimize.
[2022-05-17 21:45:18] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 0 ms to minimize.
[2022-05-17 21:45:18] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 0 ms to minimize.
[2022-05-17 21:45:18] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 0 ms to minimize.
[2022-05-17 21:45:18] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 1 ms to minimize.
[2022-05-17 21:45:19] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 0 ms to minimize.
[2022-05-17 21:45:19] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2022-05-17 21:45:19] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2022-05-17 21:45:19] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2022-05-17 21:45:19] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2022-05-17 21:45:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 29 trap constraints in 4387 ms
[2022-05-17 21:45:19] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 21:45:19] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 21:45:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:19] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-05-17 21:45:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2022-05-17 21:45:19] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 21:45:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:20] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2022-05-17 21:45:20] [INFO ] [Nat]Added 230 Read/Feed constraints in 29 ms returned sat
[2022-05-17 21:45:20] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2022-05-17 21:45:20] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2022-05-17 21:45:20] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 1 ms to minimize.
[2022-05-17 21:45:20] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2022-05-17 21:45:20] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 0 ms to minimize.
[2022-05-17 21:45:20] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 0 ms to minimize.
[2022-05-17 21:45:21] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 1 ms to minimize.
[2022-05-17 21:45:21] [INFO ] Deduced a trap composed of 141 places in 113 ms of which 0 ms to minimize.
[2022-05-17 21:45:21] [INFO ] Deduced a trap composed of 102 places in 90 ms of which 1 ms to minimize.
[2022-05-17 21:45:21] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 0 ms to minimize.
[2022-05-17 21:45:21] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-17 21:45:21] [INFO ] Deduced a trap composed of 137 places in 88 ms of which 0 ms to minimize.
[2022-05-17 21:45:21] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 0 ms to minimize.
[2022-05-17 21:45:22] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 0 ms to minimize.
[2022-05-17 21:45:22] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 1 ms to minimize.
[2022-05-17 21:45:22] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 1 ms to minimize.
[2022-05-17 21:45:22] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 0 ms to minimize.
[2022-05-17 21:45:22] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2022-05-17 21:45:22] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-05-17 21:45:22] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 0 ms to minimize.
[2022-05-17 21:45:22] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 0 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 0 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 0 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 1 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 0 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 0 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 114 places in 85 ms of which 0 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 0 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 0 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 1 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 0 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 0 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 1 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 1 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 0 ms to minimize.
[2022-05-17 21:45:26] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 1 ms to minimize.
[2022-05-17 21:45:26] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 0 ms to minimize.
[2022-05-17 21:45:26] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:45:26] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 0 ms to minimize.
[2022-05-17 21:45:26] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 0 ms to minimize.
[2022-05-17 21:45:26] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 0 ms to minimize.
[2022-05-17 21:45:26] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 1 ms to minimize.
[2022-05-17 21:45:27] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2022-05-17 21:45:27] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 1 ms to minimize.
[2022-05-17 21:45:27] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 0 ms to minimize.
[2022-05-17 21:45:27] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 0 ms to minimize.
[2022-05-17 21:45:27] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 0 ms to minimize.
[2022-05-17 21:45:27] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 0 ms to minimize.
[2022-05-17 21:45:27] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 1 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 0 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 1 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 0 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 0 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 0 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 1 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 1 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 1 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 0 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 0 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 0 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:45:30] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2022-05-17 21:45:30] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 0 ms to minimize.
[2022-05-17 21:45:30] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:45:30] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2022-05-17 21:45:30] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:45:30] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2022-05-17 21:45:30] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 0 ms to minimize.
[2022-05-17 21:45:31] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 0 ms to minimize.
[2022-05-17 21:45:31] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 0 ms to minimize.
[2022-05-17 21:45:31] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 0 ms to minimize.
[2022-05-17 21:45:31] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:45:31] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 0 ms to minimize.
[2022-05-17 21:45:31] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 0 ms to minimize.
[2022-05-17 21:45:31] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 1 ms to minimize.
[2022-05-17 21:45:32] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 1 ms to minimize.
[2022-05-17 21:45:32] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 0 ms to minimize.
[2022-05-17 21:45:32] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2022-05-17 21:45:32] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:45:32] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2022-05-17 21:45:32] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 1 ms to minimize.
[2022-05-17 21:45:32] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2022-05-17 21:45:32] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2022-05-17 21:45:33] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 0 ms to minimize.
[2022-05-17 21:45:33] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:45:33] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 0 ms to minimize.
[2022-05-17 21:45:33] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:45:33] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2022-05-17 21:45:33] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 1 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 0 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 0 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 0 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:45:35] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 1 ms to minimize.
[2022-05-17 21:45:35] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:45:35] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2022-05-17 21:45:35] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2022-05-17 21:45:35] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 0 ms to minimize.
[2022-05-17 21:45:35] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 1 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 8 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 1 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 0 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 0 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 0 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 0 ms to minimize.
[2022-05-17 21:46:05] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 0 ms to minimize.
[2022-05-17 21:46:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.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) : [5, 5, 6] Max seen :[5, 5, 1]
FORMULA Peterson-COL-5-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 912/912 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 504 transition count 857
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 449 transition count 857
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 110 place count 449 transition count 708
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 408 place count 300 transition count 708
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 468 place count 270 transition count 678
Applied a total of 468 rules in 50 ms. Remains 270 /504 variables (removed 234) and now considering 678/912 (removed 234) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/504 places, 678/912 transitions.
Normalized transition count is 558 out of 678 initially.
// Phase 1: matrix 558 rows 270 cols
[2022-05-17 21:46:05] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1636 ms. (steps per millisecond=611 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 504 ms. (steps per millisecond=1984 ) properties (out of 1) seen :1
[2022-05-17 21:46:07] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 270 cols
[2022-05-17 21:46:07] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 21:46:07] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 21:46:07] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 21:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:07] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2022-05-17 21:46:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 21:46:07] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 21:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:07] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2022-05-17 21:46:07] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-05-17 21:46:07] [INFO ] [Nat]Added 230 Read/Feed constraints in 21 ms returned sat
[2022-05-17 21:46:07] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2022-05-17 21:46:07] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:46:07] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2022-05-17 21:46:07] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 0 ms to minimize.
[2022-05-17 21:46:08] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:46:08] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:46:08] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:46:08] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2022-05-17 21:46:08] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:46:08] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 0 ms to minimize.
[2022-05-17 21:46:08] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2022-05-17 21:46:08] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2022-05-17 21:46:08] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2022-05-17 21:46:08] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2022-05-17 21:46:08] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:46:08] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:46:09] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:46:09] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2022-05-17 21:46:09] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2022-05-17 21:46:09] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2022-05-17 21:46:09] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 1 ms to minimize.
[2022-05-17 21:46:09] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2022-05-17 21:46:09] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:46:09] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:46:09] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2022-05-17 21:46:09] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:46:09] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2022-05-17 21:46:09] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:46:10] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:46:10] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:46:10] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:46:10] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 0 ms to minimize.
[2022-05-17 21:46:10] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:46:10] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2022-05-17 21:46:10] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2022-05-17 21:46:10] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2022-05-17 21:46:10] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2022-05-17 21:46:10] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:46:10] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:46:10] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 0 ms to minimize.
[2022-05-17 21:46:11] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:46:11] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:46:11] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:46:11] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2022-05-17 21:46:11] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2022-05-17 21:46:11] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:46:11] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2022-05-17 21:46:11] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2022-05-17 21:46:11] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:46:11] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2022-05-17 21:46:11] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:46:11] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:46:11] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 0 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 57 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 0 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 0 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 0 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 0 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 0 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2022-05-17 21:46:20] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2022-05-17 21:46:24] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2022-05-17 21:46:24] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2022-05-17 21:46:24] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 0 ms to minimize.
[2022-05-17 21:46:25] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:46:25] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2022-05-17 21:46:26] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:46:26] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2022-05-17 21:46:26] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:46:52] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2022-05-17 21:46:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 678/678 transitions.
Applied a total of 0 rules in 21 ms. Remains 270 /270 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/270 places, 678/678 transitions.
Starting structural reductions, iteration 0 : 270/270 places, 678/678 transitions.
Applied a total of 0 rules in 17 ms. Remains 270 /270 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2022-05-17 21:46:52] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 270 cols
[2022-05-17 21:46:52] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 21:46:52] [INFO ] Implicit Places using invariants in 167 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 169 ms to find 6 implicit places.
[2022-05-17 21:46:52] [INFO ] Redundant transitions in 39 ms returned []
[2022-05-17 21:46:52] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 21:46:52] [INFO ] Computed 17 place invariants in 13 ms
[2022-05-17 21:46:52] [INFO ] Dead Transitions using invariants and state equation in 215 ms returned []
Starting structural reductions, iteration 1 : 264/270 places, 678/678 transitions.
Applied a total of 0 rules in 14 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2022-05-17 21:46:53] [INFO ] Redundant transitions in 16 ms returned []
[2022-05-17 21:46:53] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 21:46:53] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 21:46:53] [INFO ] Dead Transitions using invariants and state equation in 244 ms returned []
Finished structural reductions, in 2 iterations. Remains : 264/270 places, 678/678 transitions.
Normalized transition count is 558 out of 678 initially.
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 21:46:53] [INFO ] Computed 17 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1417 ms. (steps per millisecond=705 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 1) seen :1
[2022-05-17 21:46:55] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 21:46:55] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 21:46:55] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 21:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:55] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2022-05-17 21:46:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 21:46:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:55] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-17 21:46:55] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-05-17 21:46:55] [INFO ] [Nat]Added 230 Read/Feed constraints in 23 ms returned sat
[2022-05-17 21:46:55] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2022-05-17 21:46:55] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2022-05-17 21:46:55] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:46:55] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2022-05-17 21:46:55] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2022-05-17 21:46:55] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 0 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 0 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 0 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 62 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 0 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 0 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 0 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 0 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 0 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:47:40] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2022-05-17 21:47:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 13 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 678/678 transitions.
Starting structural reductions, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 14 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2022-05-17 21:47:40] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 21:47:40] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 21:47:40] [INFO ] Implicit Places using invariants in 145 ms returned []
[2022-05-17 21:47:40] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 21:47:40] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 21:47:40] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-05-17 21:47:41] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2022-05-17 21:47:41] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-17 21:47:41] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 21:47:41] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 21:47:41] [INFO ] Dead Transitions using invariants and state equation in 202 ms returned []
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 678/678 transitions.
Starting property specific reduction for Peterson-COL-5-UpperBounds-10
Normalized transition count is 558 out of 678 initially.
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 21:47:41] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2022-05-17 21:47:41] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 21:47:41] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 21:47:41] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 21:47:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:41] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2022-05-17 21:47:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:47:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 21:47:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:41] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-17 21:47:41] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-05-17 21:47:41] [INFO ] [Nat]Added 230 Read/Feed constraints in 20 ms returned sat
[2022-05-17 21:47:41] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 0 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 0 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 0 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 0 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 0 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 0 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 62 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 0 ms to minimize.
[2022-05-17 21:47:46] [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) : [6] Max seen :[1]
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 11 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 678/678 transitions.
Normalized transition count is 558 out of 678 initially.
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 21:47:46] [INFO ] Computed 17 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1456 ms. (steps per millisecond=686 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=2087 ) properties (out of 1) seen :1
[2022-05-17 21:47:48] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 21:47:48] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 21:47:48] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 21:47:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:48] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2022-05-17 21:47:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:47:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 21:47:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:49] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-17 21:47:49] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-05-17 21:47:49] [INFO ] [Nat]Added 230 Read/Feed constraints in 21 ms returned sat
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 0 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 0 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 62 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2022-05-17 21:47:57] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2022-05-17 21:47:57] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:47:57] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:47:57] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:47:57] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:57] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2022-05-17 21:47:57] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2022-05-17 21:48:34] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 0 ms to minimize.
[2022-05-17 21:48:34] [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) : [6] Max seen :[1]
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 10 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 678/678 transitions.
Starting structural reductions, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 9 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2022-05-17 21:48:34] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 21:48:34] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 21:48:34] [INFO ] Implicit Places using invariants in 205 ms returned []
[2022-05-17 21:48:34] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 21:48:34] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 21:48:34] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-05-17 21:48:35] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 971 ms to find 0 implicit places.
[2022-05-17 21:48:35] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 21:48:35] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 21:48:35] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 21:48:35] [INFO ] Dead Transitions using invariants and state equation in 210 ms returned []
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 678/678 transitions.
Ending property specific reduction for Peterson-COL-5-UpperBounds-10 in 53668 ms.
[2022-05-17 21:48:35] [INFO ] Flatten gal took : 106 ms
[2022-05-17 21:48:35] [INFO ] Applying decomposition
[2022-05-17 21:48:35] [INFO ] Flatten gal took : 68 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/graph7462272845040847118.txt, -o, /tmp/graph7462272845040847118.bin, -w, /tmp/graph7462272845040847118.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/graph7462272845040847118.bin, -l, -1, -v, -w, /tmp/graph7462272845040847118.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-17 21:48:35] [INFO ] Decomposing Gal with order
[2022-05-17 21:48:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 21:48:35] [INFO ] Removed a total of 912 redundant transitions.
[2022-05-17 21:48:35] [INFO ] Flatten gal took : 137 ms
[2022-05-17 21:48:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 242 labels/synchronizations in 20 ms.
[2022-05-17 21:48:36] [INFO ] Time to serialize gal into /tmp/UpperBounds17838571617835752692.gal : 10 ms
[2022-05-17 21:48:36] [INFO ] Time to serialize properties into /tmp/UpperBounds2904654365393276322.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/UpperBounds17838571617835752692.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds2904654365393276322.prop, --nowitness, --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/UpperBounds17838571617835752692.gal -t CGAL -reachable-file /tmp/UpperBounds2904654365393276322.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds2904654365393276322.prop.
Detected timeout of ITS tools.
[2022-05-17 22:10:18] [INFO ] Applying decomposition
[2022-05-17 22:10:18] [INFO ] Flatten gal took : 264 ms
[2022-05-17 22:10:18] [INFO ] Decomposing Gal with order
[2022-05-17 22:10:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:10:19] [INFO ] Removed a total of 1367 redundant transitions.
[2022-05-17 22:10:19] [INFO ] Flatten gal took : 272 ms
[2022-05-17 22:10:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2022-05-17 22:10:19] [INFO ] Time to serialize gal into /tmp/UpperBounds5677453988632045108.gal : 25 ms
[2022-05-17 22:10:19] [INFO ] Time to serialize properties into /tmp/UpperBounds14996060675491265825.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/UpperBounds5677453988632045108.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14996060675491265825.prop, --nowitness, --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/UpperBounds5677453988632045108.gal -t CGAL -reachable-file /tmp/UpperBounds14996060675491265825.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds14996060675491265825.prop.
Detected timeout of ITS tools.
[2022-05-17 22:31:58] [INFO ] Flatten gal took : 292 ms
[2022-05-17 22:31:58] [INFO ] Input system was already deterministic with 678 transitions.
[2022-05-17 22:31:58] [INFO ] Transformed 264 places.
[2022-05-17 22:31:58] [INFO ] Transformed 678 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
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
[2022-05-17 22:32:00] [INFO ] Time to serialize gal into /tmp/UpperBounds15307257162732713905.gal : 208 ms
[2022-05-17 22:32:00] [INFO ] Time to serialize properties into /tmp/UpperBounds15734884074295433186.prop : 3 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/UpperBounds15307257162732713905.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15734884074295433186.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/UpperBounds15307257162732713905.gal -t CGAL -reachable-file /tmp/UpperBounds15734884074295433186.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/UpperBounds15734884074295433186.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="Peterson-COL-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is Peterson-COL-5, 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 r179-tall-165277026600010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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