About the Execution of ITS-Tools for Peterson-COL-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16247.920 | 3600000.00 | 2350350.00 | 665929.30 | 8 8 7 7 8 7 8 8 8 ? 8 8 8 ? 8 8 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128100595.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-COL-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128100595
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 114K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 08:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 08:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 47K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-7-UpperBounds-00
FORMULA_NAME Peterson-COL-7-UpperBounds-01
FORMULA_NAME Peterson-COL-7-UpperBounds-02
FORMULA_NAME Peterson-COL-7-UpperBounds-03
FORMULA_NAME Peterson-COL-7-UpperBounds-04
FORMULA_NAME Peterson-COL-7-UpperBounds-05
FORMULA_NAME Peterson-COL-7-UpperBounds-06
FORMULA_NAME Peterson-COL-7-UpperBounds-07
FORMULA_NAME Peterson-COL-7-UpperBounds-08
FORMULA_NAME Peterson-COL-7-UpperBounds-09
FORMULA_NAME Peterson-COL-7-UpperBounds-10
FORMULA_NAME Peterson-COL-7-UpperBounds-11
FORMULA_NAME Peterson-COL-7-UpperBounds-12
FORMULA_NAME Peterson-COL-7-UpperBounds-13
FORMULA_NAME Peterson-COL-7-UpperBounds-14
FORMULA_NAME Peterson-COL-7-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1621015987317
Running Version 0
[2021-05-14 18:13:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 18:13:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 18:13:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-14 18:13:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 18:13:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 560 ms
[2021-05-14 18:13:22] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2021-05-14 18:13:22] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 3 ms.
[2021-05-14 18:13:22] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_6334659393558208205.dot
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2021-05-14 18:13:22] [INFO ] Computed 1 place invariants in 4 ms
FORMULA Peterson-COL-7-UpperBounds-07 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-06 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-14 18:13:22] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions in 65 ms.
[2021-05-14 18:13:22] [INFO ] Unfolded HLPN properties in 1 ms.
// Phase 1: matrix 14 rows 9 cols
[2021-05-14 18:13:22] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-14 18:13:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 18:13:22] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 18:13:22] [INFO ] Added : 11 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 5 ms.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-14 18:13:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-14 18:13:22] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-14 18:13:22] [INFO ] Added : 11 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-14 18:13:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 18:13:22] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 18:13:22] [INFO ] Added : 11 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-14 18:13:22] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 18:13:22] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-14 18:13:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 18:13:22] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-14 18:13:22] [INFO ] Added : 12 causal constraints over 4 iterations in 20 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 18:13:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-14 18:13:22] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 18:13:22] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-14 18:13:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-14 18:13:22] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-14 18:13:22] [INFO ] Added : 12 causal constraints over 4 iterations in 17 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 18:13:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-14 18:13:22] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 18:13:22] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 3 ms.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 18:13:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-14 18:13:22] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 18:13:22] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 18:13:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-14 18:13:22] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 18:13:22] [INFO ] Added : 12 causal constraints over 4 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-14 18:13:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 18:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-14 18:13:22] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 18:13:22] [INFO ] Added : 12 causal constraints over 4 iterations in 9 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
[2021-05-14 18:13:22] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions in 32 ms.
[2021-05-14 18:13:22] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_2378404222830752581.dot
Deduced a syphon composed of 56 places in 19 ms
Reduce places removed 56 places and 112 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 11) seen :63
FORMULA Peterson-COL-7-UpperBounds-15 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-7-UpperBounds-14 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-7-UpperBounds-11 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :22
FORMULA Peterson-COL-7-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :12
FORMULA Peterson-COL-7-UpperBounds-08 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :25
FORMULA Peterson-COL-7-UpperBounds-12 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-7-UpperBounds-10 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-14 18:13:23] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2021-05-14 18:13:23] [INFO ] Computed 31 place invariants in 28 ms
[2021-05-14 18:13:24] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2021-05-14 18:13:24] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 15 ms returned sat
[2021-05-14 18:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:24] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2021-05-14 18:13:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:13:25] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2021-05-14 18:13:25] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-14 18:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:26] [INFO ] [Nat]Absence check using state equation in 855 ms returned sat
[2021-05-14 18:13:26] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:13:26] [INFO ] [Nat]Added 546 Read/Feed constraints in 227 ms returned sat
[2021-05-14 18:13:39] [INFO ] Deduced a trap composed of 100 places in 13286 ms of which 5 ms to minimize.
[2021-05-14 18:13: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 18:13:39] [INFO ] [Real]Absence check using 23 positive place invariants in 36 ms returned sat
[2021-05-14 18:13:39] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2021-05-14 18:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:40] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2021-05-14 18:13:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:13:41] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2021-05-14 18:13:41] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-14 18:13:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:41] [INFO ] [Nat]Absence check using state equation in 808 ms returned sat
[2021-05-14 18:13:42] [INFO ] [Nat]Added 546 Read/Feed constraints in 178 ms returned sat
[2021-05-14 18:13:43] [INFO ] Deduced a trap composed of 73 places in 858 ms of which 2 ms to minimize.
[2021-05-14 18:13:44] [INFO ] Deduced a trap composed of 197 places in 935 ms of which 3 ms to minimize.
[2021-05-14 18:13:45] [INFO ] Deduced a trap composed of 78 places in 913 ms of which 3 ms to minimize.
[2021-05-14 18:13:46] [INFO ] Deduced a trap composed of 104 places in 874 ms of which 2 ms to minimize.
[2021-05-14 18:13: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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 18:13:46] [INFO ] [Real]Absence check using 23 positive place invariants in 32 ms returned sat
[2021-05-14 18:13:46] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2021-05-14 18:13:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:47] [INFO ] [Real]Absence check using state equation in 838 ms returned sat
[2021-05-14 18:13:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:13:47] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2021-05-14 18:13:47] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-14 18:13:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:48] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2021-05-14 18:13:48] [INFO ] [Nat]Added 546 Read/Feed constraints in 197 ms returned sat
[2021-05-14 18:13:49] [INFO ] Deduced a trap composed of 167 places in 876 ms of which 1 ms to minimize.
[2021-05-14 18:13:50] [INFO ] Deduced a trap composed of 70 places in 926 ms of which 1 ms to minimize.
[2021-05-14 18:13:51] [INFO ] Deduced a trap composed of 20 places in 875 ms of which 2 ms to minimize.
[2021-05-14 18:13:52] [INFO ] Deduced a trap composed of 204 places in 930 ms of which 2 ms to minimize.
[2021-05-14 18:13: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 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)
[2021-05-14 18:13:52] [INFO ] [Real]Absence check using 23 positive place invariants in 33 ms returned sat
[2021-05-14 18:13:52] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2021-05-14 18:13:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:53] [INFO ] [Real]Absence check using state equation in 873 ms returned sat
[2021-05-14 18:13:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:13:54] [INFO ] [Nat]Absence check using 23 positive place invariants in 64 ms returned sat
[2021-05-14 18:13:54] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-14 18:13:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:13:54] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2021-05-14 18:13:55] [INFO ] [Nat]Added 546 Read/Feed constraints in 205 ms returned sat
[2021-05-14 18:13:55] [INFO ] Deduced a trap composed of 21 places in 848 ms of which 1 ms to minimize.
[2021-05-14 18:13:56] [INFO ] Deduced a trap composed of 17 places in 779 ms of which 3 ms to minimize.
[2021-05-14 18:13:57] [INFO ] Deduced a trap composed of 21 places in 797 ms of which 1 ms to minimize.
[2021-05-14 18:13:58] [INFO ] Deduced a trap composed of 110 places in 760 ms of which 1 ms to minimize.
[2021-05-14 18:13:59] [INFO ] Deduced a trap composed of 272 places in 816 ms of which 1 ms to minimize.
[2021-05-14 18:13:59] [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)
Current structural bounds on expressions (after SMT) : [8, 8, 8, 8] Max seen :[7, 7, 1, 1]
Support contains 960 out of 1992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 1 with 392 rules applied. Total rules applied 784 place count 1600 transition count 2704
Applied a total of 784 rules in 300 ms. Remains 1600 /1992 variables (removed 392) and now considering 2704/3096 (removed 392) transitions.
Finished structural reductions, in 1 iterations. Remains : 1600/1992 places, 2704/3096 transitions.
Normalized transition count is 2368 out of 2704 initially.
// Phase 1: matrix 2368 rows 1600 cols
[2021-05-14 18:13:59] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 17614 ms. (steps per millisecond=56 ) properties (out of 4) seen :18
FORMULA Peterson-COL-7-UpperBounds-01 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2282 ms. (steps per millisecond=438 ) properties (out of 3) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1728 ms. (steps per millisecond=578 ) properties (out of 3) seen :7
Interrupted Best-First random walk after 684308 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=136 ) properties seen :{0=3, 2=3}
[2021-05-14 18:14:35] [INFO ] Flow matrix only has 2368 transitions (discarded 336 similar events)
// Phase 1: matrix 2368 rows 1600 cols
[2021-05-14 18:14:35] [INFO ] Computed 31 place invariants in 11 ms
[2021-05-14 18:14:35] [INFO ] [Real]Absence check using 23 positive place invariants in 28 ms returned sat
[2021-05-14 18:14:35] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-14 18:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:14:36] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2021-05-14 18:14:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:14:36] [INFO ] [Nat]Absence check using 23 positive place invariants in 28 ms returned sat
[2021-05-14 18:14:36] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-14 18:14:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:14:37] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2021-05-14 18:14:37] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:14:37] [INFO ] [Nat]Added 546 Read/Feed constraints in 167 ms returned sat
[2021-05-14 18:14:38] [INFO ] Deduced a trap composed of 14 places in 664 ms of which 2 ms to minimize.
[2021-05-14 18:14:38] [INFO ] Deduced a trap composed of 170 places in 661 ms of which 2 ms to minimize.
[2021-05-14 18:14:39] [INFO ] Deduced a trap composed of 38 places in 665 ms of which 2 ms to minimize.
[2021-05-14 18:14:40] [INFO ] Deduced a trap composed of 12 places in 716 ms of which 1 ms to minimize.
[2021-05-14 18:14:41] [INFO ] Deduced a trap composed of 48 places in 658 ms of which 2 ms to minimize.
[2021-05-14 18:14:41] [INFO ] Deduced a trap composed of 60 places in 630 ms of which 1 ms to minimize.
[2021-05-14 18:14:42] [INFO ] Deduced a trap composed of 100 places in 655 ms of which 8 ms to minimize.
[2021-05-14 18:14:43] [INFO ] Deduced a trap composed of 55 places in 649 ms of which 9 ms to minimize.
[2021-05-14 18:14:44] [INFO ] Deduced a trap composed of 71 places in 650 ms of which 2 ms to minimize.
[2021-05-14 18:14:44] [INFO ] Deduced a trap composed of 15 places in 648 ms of which 1 ms to minimize.
[2021-05-14 18:14:45] [INFO ] Deduced a trap composed of 22 places in 653 ms of which 1 ms to minimize.
[2021-05-14 18:14:55] [INFO ] Deduced a trap composed of 71 places in 680 ms of which 3 ms to minimize.
[2021-05-14 18:14:56] [INFO ] Deduced a trap composed of 22 places in 625 ms of which 1 ms to minimize.
[2021-05-14 18:14:57] [INFO ] Deduced a trap composed of 38 places in 677 ms of which 1 ms to minimize.
[2021-05-14 18:14:57] [INFO ] Deduced a trap composed of 130 places in 666 ms of which 1 ms to minimize.
[2021-05-14 18:14:58] [INFO ] Deduced a trap composed of 205 places in 694 ms of which 1 ms to minimize.
[2021-05-14 18:14:59] [INFO ] Deduced a trap composed of 246 places in 638 ms of which 1 ms to minimize.
[2021-05-14 18:15:00] [INFO ] Deduced a trap composed of 130 places in 709 ms of which 1 ms to minimize.
[2021-05-14 18:15:00] [INFO ] Deduced a trap composed of 64 places in 699 ms of which 2 ms to minimize.
[2021-05-14 18:15:01] [INFO ] Deduced a trap composed of 56 places in 675 ms of which 2 ms to minimize.
[2021-05-14 18:15:02] [INFO ] Deduced a trap composed of 156 places in 654 ms of which 5 ms to minimize.
[2021-05-14 18:15:03] [INFO ] Deduced a trap composed of 75 places in 688 ms of which 1 ms to minimize.
[2021-05-14 18:15:03] [INFO ] Deduced a trap composed of 83 places in 683 ms of which 1 ms to minimize.
[2021-05-14 18:15:04] [INFO ] Deduced a trap composed of 75 places in 643 ms of which 2 ms to minimize.
[2021-05-14 18:15:05] [INFO ] Deduced a trap composed of 42 places in 697 ms of which 1 ms to minimize.
[2021-05-14 18:15:06] [INFO ] Deduced a trap composed of 15 places in 657 ms of which 1 ms to minimize.
[2021-05-14 18:15:06] [INFO ] Deduced a trap composed of 62 places in 655 ms of which 1 ms to minimize.
[2021-05-14 18:15:07] [INFO ] Deduced a trap composed of 141 places in 628 ms of which 1 ms to minimize.
[2021-05-14 18:15:08] [INFO ] Deduced a trap composed of 22 places in 643 ms of which 1 ms to minimize.
[2021-05-14 18:15:09] [INFO ] Deduced a trap composed of 27 places in 687 ms of which 2 ms to minimize.
[2021-05-14 18:15:09] [INFO ] Deduced a trap composed of 83 places in 688 ms of which 2 ms to minimize.
[2021-05-14 18:15:10] [INFO ] Deduced a trap composed of 15 places in 674 ms of which 2 ms to minimize.
[2021-05-14 18:15:11] [INFO ] Deduced a trap composed of 52 places in 644 ms of which 1 ms to minimize.
[2021-05-14 18:15:12] [INFO ] Deduced a trap composed of 22 places in 691 ms of which 2 ms to minimize.
[2021-05-14 18:15:12] [INFO ] Deduced a trap composed of 89 places in 653 ms of which 1 ms to minimize.
[2021-05-14 18:15:13] [INFO ] Deduced a trap composed of 21 places in 676 ms of which 1 ms to minimize.
[2021-05-14 18:15:14] [INFO ] Deduced a trap composed of 60 places in 674 ms of which 1 ms to minimize.
[2021-05-14 18:15:15] [INFO ] Deduced a trap composed of 102 places in 678 ms of which 2 ms to minimize.
[2021-05-14 18:15:16] [INFO ] Deduced a trap composed of 16 places in 690 ms of which 1 ms to minimize.
[2021-05-14 18:15:16] [INFO ] Deduced a trap composed of 168 places in 680 ms of which 1 ms to minimize.
[2021-05-14 18:15:17] [INFO ] Deduced a trap composed of 72 places in 670 ms of which 1 ms to minimize.
[2021-05-14 18:15:18] [INFO ] Deduced a trap composed of 33 places in 675 ms of which 1 ms to minimize.
[2021-05-14 18:15:19] [INFO ] Deduced a trap composed of 50 places in 681 ms of which 1 ms to minimize.
[2021-05-14 18:15:19] [INFO ] Deduced a trap composed of 46 places in 705 ms of which 1 ms to minimize.
[2021-05-14 18:15:20] [INFO ] Deduced a trap composed of 61 places in 689 ms of which 1 ms to minimize.
[2021-05-14 18:15:21] [INFO ] Deduced a trap composed of 108 places in 685 ms of which 2 ms to minimize.
[2021-05-14 18:15:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 18:15:21] [INFO ] [Real]Absence check using 23 positive place invariants in 26 ms returned sat
[2021-05-14 18:15:21] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-14 18:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:15:22] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2021-05-14 18:15:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:15:22] [INFO ] [Nat]Absence check using 23 positive place invariants in 30 ms returned sat
[2021-05-14 18:15:22] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-14 18:15:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:15:23] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2021-05-14 18:15:23] [INFO ] [Nat]Added 546 Read/Feed constraints in 166 ms returned sat
[2021-05-14 18:15:24] [INFO ] Deduced a trap composed of 174 places in 670 ms of which 1 ms to minimize.
[2021-05-14 18:15:24] [INFO ] Deduced a trap composed of 174 places in 611 ms of which 1 ms to minimize.
[2021-05-14 18:15:25] [INFO ] Deduced a trap composed of 22 places in 611 ms of which 1 ms to minimize.
[2021-05-14 18:15:26] [INFO ] Deduced a trap composed of 81 places in 610 ms of which 1 ms to minimize.
[2021-05-14 18:15:26] [INFO ] Deduced a trap composed of 141 places in 611 ms of which 1 ms to minimize.
[2021-05-14 18:15:27] [INFO ] Deduced a trap composed of 103 places in 596 ms of which 1 ms to minimize.
[2021-05-14 18:15:28] [INFO ] Deduced a trap composed of 79 places in 610 ms of which 1 ms to minimize.
[2021-05-14 18:15:28] [INFO ] Deduced a trap composed of 99 places in 588 ms of which 11 ms to minimize.
[2021-05-14 18:15:29] [INFO ] Deduced a trap composed of 85 places in 624 ms of which 2 ms to minimize.
[2021-05-14 18:15:30] [INFO ] Deduced a trap composed of 184 places in 571 ms of which 1 ms to minimize.
[2021-05-14 18:15:31] [INFO ] Deduced a trap composed of 166 places in 583 ms of which 1 ms to minimize.
[2021-05-14 18:15:31] [INFO ] Deduced a trap composed of 149 places in 704 ms of which 1 ms to minimize.
[2021-05-14 18:15:32] [INFO ] Deduced a trap composed of 136 places in 686 ms of which 2 ms to minimize.
[2021-05-14 18:15:33] [INFO ] Deduced a trap composed of 237 places in 849 ms of which 1 ms to minimize.
[2021-05-14 18:15:34] [INFO ] Deduced a trap composed of 170 places in 707 ms of which 1 ms to minimize.
[2021-05-14 18:15:35] [INFO ] Deduced a trap composed of 22 places in 700 ms of which 1 ms to minimize.
[2021-05-14 18:15:35] [INFO ] Deduced a trap composed of 193 places in 722 ms of which 1 ms to minimize.
[2021-05-14 18:15:36] [INFO ] Deduced a trap composed of 123 places in 655 ms of which 2 ms to minimize.
[2021-05-14 18:15:37] [INFO ] Deduced a trap composed of 73 places in 641 ms of which 1 ms to minimize.
[2021-05-14 18:15:38] [INFO ] Deduced a trap composed of 85 places in 670 ms of which 2 ms to minimize.
[2021-05-14 18:15:38] [INFO ] Deduced a trap composed of 30 places in 663 ms of which 1 ms to minimize.
[2021-05-14 18:15:39] [INFO ] Deduced a trap composed of 232 places in 751 ms of which 1 ms to minimize.
[2021-05-14 18:15:40] [INFO ] Deduced a trap composed of 169 places in 755 ms of which 2 ms to minimize.
[2021-05-14 18:15:41] [INFO ] Deduced a trap composed of 233 places in 767 ms of which 1 ms to minimize.
[2021-05-14 18:15:42] [INFO ] Deduced a trap composed of 300 places in 705 ms of which 2 ms to minimize.
[2021-05-14 18:15:43] [INFO ] Deduced a trap composed of 197 places in 755 ms of which 1 ms to minimize.
[2021-05-14 18:15:43] [INFO ] Deduced a trap composed of 171 places in 698 ms of which 1 ms to minimize.
[2021-05-14 18:15:52] [INFO ] Deduced a trap composed of 178 places in 732 ms of which 1 ms to minimize.
[2021-05-14 18:15:53] [INFO ] Deduced a trap composed of 230 places in 736 ms of which 1 ms to minimize.
[2021-05-14 18:15:54] [INFO ] Deduced a trap composed of 339 places in 734 ms of which 1 ms to minimize.
[2021-05-14 18:15:55] [INFO ] Deduced a trap composed of 285 places in 707 ms of which 2 ms to minimize.
[2021-05-14 18:15:56] [INFO ] Deduced a trap composed of 335 places in 721 ms of which 1 ms to minimize.
[2021-05-14 18:15:57] [INFO ] Deduced a trap composed of 178 places in 737 ms of which 1 ms to minimize.
[2021-05-14 18:15:57] [INFO ] Deduced a trap composed of 269 places in 702 ms of which 1 ms to minimize.
[2021-05-14 18:15:58] [INFO ] Deduced a trap composed of 153 places in 723 ms of which 1 ms to minimize.
[2021-05-14 18:15:59] [INFO ] Deduced a trap composed of 158 places in 694 ms of which 2 ms to minimize.
[2021-05-14 18:16:00] [INFO ] Deduced a trap composed of 143 places in 688 ms of which 1 ms to minimize.
[2021-05-14 18:16:01] [INFO ] Deduced a trap composed of 229 places in 689 ms of which 1 ms to minimize.
[2021-05-14 18:16:01] [INFO ] Deduced a trap composed of 135 places in 738 ms of which 2 ms to minimize.
[2021-05-14 18:16:02] [INFO ] Deduced a trap composed of 203 places in 728 ms of which 1 ms to minimize.
[2021-05-14 18:16:03] [INFO ] Deduced a trap composed of 151 places in 701 ms of which 1 ms to minimize.
[2021-05-14 18:16:04] [INFO ] Deduced a trap composed of 15 places in 646 ms of which 2 ms to minimize.
[2021-05-14 18:16:05] [INFO ] Deduced a trap composed of 93 places in 689 ms of which 1 ms to minimize.
[2021-05-14 18:16:05] [INFO ] Deduced a trap composed of 17 places in 708 ms of which 1 ms to minimize.
[2021-05-14 18:16:06] [INFO ] Deduced a trap composed of 20 places in 736 ms of which 1 ms to minimize.
[2021-05-14 18:16:07] [INFO ] Deduced a trap composed of 57 places in 740 ms of which 1 ms to minimize.
[2021-05-14 18:16:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 18:16:07] [INFO ] [Real]Absence check using 23 positive place invariants in 27 ms returned sat
[2021-05-14 18:16:07] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-14 18:16:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:16:08] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2021-05-14 18:16:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:16:08] [INFO ] [Nat]Absence check using 23 positive place invariants in 27 ms returned sat
[2021-05-14 18:16:08] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-14 18:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:16:09] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2021-05-14 18:16:09] [INFO ] [Nat]Added 546 Read/Feed constraints in 140 ms returned sat
[2021-05-14 18:16:10] [INFO ] Deduced a trap composed of 33 places in 726 ms of which 1 ms to minimize.
[2021-05-14 18:16:11] [INFO ] Deduced a trap composed of 38 places in 761 ms of which 2 ms to minimize.
[2021-05-14 18:16:11] [INFO ] Deduced a trap composed of 12 places in 704 ms of which 1 ms to minimize.
[2021-05-14 18:16:12] [INFO ] Deduced a trap composed of 249 places in 604 ms of which 1 ms to minimize.
[2021-05-14 18:16:13] [INFO ] Deduced a trap composed of 75 places in 623 ms of which 1 ms to minimize.
[2021-05-14 18:16:14] [INFO ] Deduced a trap composed of 33 places in 625 ms of which 1 ms to minimize.
[2021-05-14 18:16:14] [INFO ] Deduced a trap composed of 282 places in 580 ms of which 1 ms to minimize.
[2021-05-14 18:16:15] [INFO ] Deduced a trap composed of 220 places in 565 ms of which 1 ms to minimize.
[2021-05-14 18:16:16] [INFO ] Deduced a trap composed of 87 places in 567 ms of which 1 ms to minimize.
[2021-05-14 18:16:16] [INFO ] Deduced a trap composed of 349 places in 569 ms of which 1 ms to minimize.
[2021-05-14 18:16:17] [INFO ] Deduced a trap composed of 323 places in 611 ms of which 1 ms to minimize.
[2021-05-14 18:16:18] [INFO ] Deduced a trap composed of 169 places in 630 ms of which 1 ms to minimize.
[2021-05-14 18:16:18] [INFO ] Deduced a trap composed of 172 places in 648 ms of which 2 ms to minimize.
[2021-05-14 18:16:19] [INFO ] Deduced a trap composed of 21 places in 611 ms of which 1 ms to minimize.
[2021-05-14 18:16:20] [INFO ] Deduced a trap composed of 39 places in 740 ms of which 1 ms to minimize.
[2021-05-14 18:16:21] [INFO ] Deduced a trap composed of 93 places in 720 ms of which 1 ms to minimize.
[2021-05-14 18:16:21] [INFO ] Deduced a trap composed of 99 places in 767 ms of which 1 ms to minimize.
[2021-05-14 18:16:22] [INFO ] Deduced a trap composed of 101 places in 725 ms of which 1 ms to minimize.
[2021-05-14 18:16:23] [INFO ] Deduced a trap composed of 176 places in 738 ms of which 1 ms to minimize.
[2021-05-14 18:16:24] [INFO ] Deduced a trap composed of 61 places in 735 ms of which 1 ms to minimize.
[2021-05-14 18:16:25] [INFO ] Deduced a trap composed of 142 places in 698 ms of which 1 ms to minimize.
[2021-05-14 18:16:26] [INFO ] Deduced a trap composed of 42 places in 779 ms of which 2 ms to minimize.
[2021-05-14 18:16:26] [INFO ] Deduced a trap composed of 39 places in 761 ms of which 2 ms to minimize.
[2021-05-14 18:16:27] [INFO ] Deduced a trap composed of 15 places in 724 ms of which 1 ms to minimize.
[2021-05-14 18:16:28] [INFO ] Deduced a trap composed of 28 places in 708 ms of which 1 ms to minimize.
[2021-05-14 18:16:29] [INFO ] Deduced a trap composed of 55 places in 683 ms of which 1 ms to minimize.
[2021-05-14 18:16:30] [INFO ] Deduced a trap composed of 146 places in 740 ms of which 1 ms to minimize.
[2021-05-14 18:16:30] [INFO ] Deduced a trap composed of 45 places in 746 ms of which 1 ms to minimize.
[2021-05-14 18:16:31] [INFO ] Deduced a trap composed of 15 places in 757 ms of which 1 ms to minimize.
[2021-05-14 18:16:32] [INFO ] Deduced a trap composed of 139 places in 673 ms of which 2 ms to minimize.
[2021-05-14 18:16:33] [INFO ] Deduced a trap composed of 51 places in 739 ms of which 1 ms to minimize.
[2021-05-14 18:16:34] [INFO ] Deduced a trap composed of 42 places in 751 ms of which 2 ms to minimize.
[2021-05-14 18:16:35] [INFO ] Deduced a trap composed of 27 places in 746 ms of which 1 ms to minimize.
[2021-05-14 18:16:35] [INFO ] Deduced a trap composed of 21 places in 702 ms of which 1 ms to minimize.
[2021-05-14 18:16:36] [INFO ] Deduced a trap composed of 76 places in 745 ms of which 1 ms to minimize.
[2021-05-14 18:16:37] [INFO ] Deduced a trap composed of 123 places in 733 ms of which 1 ms to minimize.
[2021-05-14 18:16:38] [INFO ] Deduced a trap composed of 54 places in 759 ms of which 2 ms to minimize.
[2021-05-14 18:16:39] [INFO ] Deduced a trap composed of 105 places in 705 ms of which 2 ms to minimize.
[2021-05-14 18:16:39] [INFO ] Deduced a trap composed of 22 places in 714 ms of which 1 ms to minimize.
[2021-05-14 18:16:40] [INFO ] Deduced a trap composed of 60 places in 726 ms of which 1 ms to minimize.
[2021-05-14 18:16:41] [INFO ] Deduced a trap composed of 48 places in 734 ms of which 1 ms to minimize.
[2021-05-14 18:16:42] [INFO ] Deduced a trap composed of 125 places in 737 ms of which 1 ms to minimize.
[2021-05-14 18:16:43] [INFO ] Deduced a trap composed of 27 places in 729 ms of which 2 ms to minimize.
[2021-05-14 18:16:44] [INFO ] Deduced a trap composed of 28 places in 775 ms of which 2 ms to minimize.
[2021-05-14 18:16:44] [INFO ] Deduced a trap composed of 21 places in 706 ms of which 1 ms to minimize.
[2021-05-14 18:16:45] [INFO ] Deduced a trap composed of 125 places in 684 ms of which 1 ms to minimize.
[2021-05-14 18:16:46] [INFO ] Deduced a trap composed of 15 places in 754 ms of which 1 ms to minimize.
[2021-05-14 18:16:47] [INFO ] Deduced a trap composed of 53 places in 764 ms of which 2 ms to minimize.
[2021-05-14 18:16:48] [INFO ] Deduced a trap composed of 312 places in 807 ms of which 1 ms to minimize.
[2021-05-14 18:16:49] [INFO ] Deduced a trap composed of 221 places in 740 ms of which 1 ms to minimize.
[2021-05-14 18:16:49] [INFO ] Deduced a trap composed of 147 places in 723 ms of which 1 ms to minimize.
[2021-05-14 18:16:50] [INFO ] Deduced a trap composed of 283 places in 736 ms of which 1 ms to minimize.
[2021-05-14 18:16:51] [INFO ] Deduced a trap composed of 193 places in 735 ms of which 1 ms to minimize.
[2021-05-14 18:16:52] [INFO ] Deduced a trap composed of 242 places in 740 ms of which 1 ms to minimize.
[2021-05-14 18:16:53] [INFO ] Deduced a trap composed of 211 places in 742 ms of which 1 ms to minimize.
[2021-05-14 18:16:54] [INFO ] Deduced a trap composed of 184 places in 771 ms of which 1 ms to minimize.
[2021-05-14 18:16:54] [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) : [8, 8, 8] Max seen :[7, 1, 5]
Support contains 512 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 2704/2704 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1600 transition count 2312
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 1 with 392 rules applied. Total rules applied 784 place count 1208 transition count 2312
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 784 place count 1208 transition count 2256
Deduced a syphon composed of 56 places in 5 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 896 place count 1152 transition count 2256
Applied a total of 896 rules in 208 ms. Remains 1152 /1600 variables (removed 448) and now considering 2256/2704 (removed 448) transitions.
Finished structural reductions, in 1 iterations. Remains : 1152/1600 places, 2256/2704 transitions.
Normalized transition count is 1920 out of 2256 initially.
// Phase 1: matrix 1920 rows 1152 cols
[2021-05-14 18:16:54] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 11333 ms. (steps per millisecond=88 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2218 ms. (steps per millisecond=450 ) properties (out of 3) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1670 ms. (steps per millisecond=598 ) properties (out of 3) seen :6
Interrupted Best-First random walk after 700994 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=140 ) properties seen :{0=3, 2=3}
[2021-05-14 18:17:14] [INFO ] Flow matrix only has 1920 transitions (discarded 336 similar events)
// Phase 1: matrix 1920 rows 1152 cols
[2021-05-14 18:17:14] [INFO ] Computed 31 place invariants in 6 ms
[2021-05-14 18:17:14] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2021-05-14 18:17:14] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-14 18:17:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:17:15] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2021-05-14 18:17:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:17:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2021-05-14 18:17:15] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-14 18:17:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:17:15] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2021-05-14 18:17:15] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:17:15] [INFO ] [Nat]Added 546 Read/Feed constraints in 100 ms returned sat
[2021-05-14 18:17:16] [INFO ] Deduced a trap composed of 25 places in 410 ms of which 1 ms to minimize.
[2021-05-14 18:17:16] [INFO ] Deduced a trap composed of 76 places in 455 ms of which 1 ms to minimize.
[2021-05-14 18:17:17] [INFO ] Deduced a trap composed of 140 places in 408 ms of which 1 ms to minimize.
[2021-05-14 18:17:17] [INFO ] Deduced a trap composed of 246 places in 429 ms of which 1 ms to minimize.
[2021-05-14 18:17:18] [INFO ] Deduced a trap composed of 140 places in 437 ms of which 1 ms to minimize.
[2021-05-14 18:17:18] [INFO ] Deduced a trap composed of 68 places in 436 ms of which 1 ms to minimize.
[2021-05-14 18:17:19] [INFO ] Deduced a trap composed of 57 places in 411 ms of which 1 ms to minimize.
[2021-05-14 18:17:19] [INFO ] Deduced a trap composed of 21 places in 413 ms of which 1 ms to minimize.
[2021-05-14 18:17:20] [INFO ] Deduced a trap composed of 11 places in 405 ms of which 1 ms to minimize.
[2021-05-14 18:17:20] [INFO ] Deduced a trap composed of 51 places in 407 ms of which 1 ms to minimize.
[2021-05-14 18:17:21] [INFO ] Deduced a trap composed of 148 places in 440 ms of which 0 ms to minimize.
[2021-05-14 18:17:21] [INFO ] Deduced a trap composed of 55 places in 409 ms of which 1 ms to minimize.
[2021-05-14 18:17:22] [INFO ] Deduced a trap composed of 35 places in 446 ms of which 1 ms to minimize.
[2021-05-14 18:17:22] [INFO ] Deduced a trap composed of 142 places in 401 ms of which 1 ms to minimize.
[2021-05-14 18:17:23] [INFO ] Deduced a trap composed of 116 places in 447 ms of which 1 ms to minimize.
[2021-05-14 18:17:23] [INFO ] Deduced a trap composed of 20 places in 429 ms of which 1 ms to minimize.
[2021-05-14 18:17:24] [INFO ] Deduced a trap composed of 50 places in 453 ms of which 1 ms to minimize.
[2021-05-14 18:17:24] [INFO ] Deduced a trap composed of 21 places in 443 ms of which 1 ms to minimize.
[2021-05-14 18:17:25] [INFO ] Deduced a trap composed of 65 places in 452 ms of which 1 ms to minimize.
[2021-05-14 18:17:25] [INFO ] Deduced a trap composed of 17 places in 456 ms of which 1 ms to minimize.
[2021-05-14 18:17:26] [INFO ] Deduced a trap composed of 231 places in 454 ms of which 1 ms to minimize.
[2021-05-14 18:17:26] [INFO ] Deduced a trap composed of 25 places in 439 ms of which 1 ms to minimize.
[2021-05-14 18:17:27] [INFO ] Deduced a trap composed of 17 places in 490 ms of which 1 ms to minimize.
[2021-05-14 18:17:27] [INFO ] Deduced a trap composed of 101 places in 424 ms of which 1 ms to minimize.
[2021-05-14 18:17:28] [INFO ] Deduced a trap composed of 38 places in 427 ms of which 1 ms to minimize.
[2021-05-14 18:17:28] [INFO ] Deduced a trap composed of 36 places in 468 ms of which 1 ms to minimize.
[2021-05-14 18:17:29] [INFO ] Deduced a trap composed of 14 places in 412 ms of which 1 ms to minimize.
[2021-05-14 18:17:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 27 trap constraints in 13390 ms
[2021-05-14 18:17:29] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2021-05-14 18:17:29] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-14 18:17:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:17:29] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2021-05-14 18:17:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:17:30] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2021-05-14 18:17:30] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-14 18:17:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:17:30] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2021-05-14 18:17:30] [INFO ] [Nat]Added 546 Read/Feed constraints in 121 ms returned sat
[2021-05-14 18:17:31] [INFO ] Deduced a trap composed of 28 places in 465 ms of which 1 ms to minimize.
[2021-05-14 18:17:31] [INFO ] Deduced a trap composed of 112 places in 423 ms of which 1 ms to minimize.
[2021-05-14 18:17:32] [INFO ] Deduced a trap composed of 11 places in 430 ms of which 1 ms to minimize.
[2021-05-14 18:17:32] [INFO ] Deduced a trap composed of 191 places in 417 ms of which 1 ms to minimize.
[2021-05-14 18:17:33] [INFO ] Deduced a trap composed of 143 places in 428 ms of which 1 ms to minimize.
[2021-05-14 18:17:33] [INFO ] Deduced a trap composed of 191 places in 349 ms of which 1 ms to minimize.
[2021-05-14 18:17:33] [INFO ] Deduced a trap composed of 213 places in 332 ms of which 1 ms to minimize.
[2021-05-14 18:17:34] [INFO ] Deduced a trap composed of 53 places in 363 ms of which 0 ms to minimize.
[2021-05-14 18:17:34] [INFO ] Deduced a trap composed of 229 places in 424 ms of which 1 ms to minimize.
[2021-05-14 18:17:35] [INFO ] Deduced a trap composed of 146 places in 361 ms of which 2 ms to minimize.
[2021-05-14 18:17:35] [INFO ] Deduced a trap composed of 117 places in 341 ms of which 1 ms to minimize.
[2021-05-14 18:17:36] [INFO ] Deduced a trap composed of 105 places in 328 ms of which 1 ms to minimize.
[2021-05-14 18:17:36] [INFO ] Deduced a trap composed of 118 places in 409 ms of which 1 ms to minimize.
[2021-05-14 18:17:37] [INFO ] Deduced a trap composed of 15 places in 437 ms of which 1 ms to minimize.
[2021-05-14 18:17:37] [INFO ] Deduced a trap composed of 60 places in 374 ms of which 1 ms to minimize.
[2021-05-14 18:17:37] [INFO ] Deduced a trap composed of 68 places in 345 ms of which 1 ms to minimize.
[2021-05-14 18:17:38] [INFO ] Deduced a trap composed of 107 places in 371 ms of which 1 ms to minimize.
[2021-05-14 18:17:38] [INFO ] Deduced a trap composed of 49 places in 384 ms of which 1 ms to minimize.
[2021-05-14 18:17:39] [INFO ] Deduced a trap composed of 44 places in 338 ms of which 0 ms to minimize.
[2021-05-14 18:17:39] [INFO ] Deduced a trap composed of 68 places in 349 ms of which 0 ms to minimize.
[2021-05-14 18:17:40] [INFO ] Deduced a trap composed of 11 places in 346 ms of which 1 ms to minimize.
[2021-05-14 18:17:40] [INFO ] Deduced a trap composed of 19 places in 358 ms of which 1 ms to minimize.
[2021-05-14 18:17:40] [INFO ] Deduced a trap composed of 37 places in 326 ms of which 1 ms to minimize.
[2021-05-14 18:17:41] [INFO ] Deduced a trap composed of 61 places in 374 ms of which 1 ms to minimize.
[2021-05-14 18:17:41] [INFO ] Deduced a trap composed of 37 places in 333 ms of which 1 ms to minimize.
[2021-05-14 18:17:42] [INFO ] Deduced a trap composed of 47 places in 343 ms of which 1 ms to minimize.
[2021-05-14 18:17:42] [INFO ] Deduced a trap composed of 77 places in 341 ms of which 1 ms to minimize.
[2021-05-14 18:17:42] [INFO ] Deduced a trap composed of 103 places in 362 ms of which 1 ms to minimize.
[2021-05-14 18:17:43] [INFO ] Deduced a trap composed of 57 places in 366 ms of which 1 ms to minimize.
[2021-05-14 18:17:43] [INFO ] Deduced a trap composed of 11 places in 364 ms of which 1 ms to minimize.
[2021-05-14 18:17:44] [INFO ] Deduced a trap composed of 47 places in 354 ms of which 1 ms to minimize.
[2021-05-14 18:17:44] [INFO ] Deduced a trap composed of 120 places in 368 ms of which 1 ms to minimize.
[2021-05-14 18:17:45] [INFO ] Deduced a trap composed of 38 places in 342 ms of which 1 ms to minimize.
[2021-05-14 18:17:45] [INFO ] Deduced a trap composed of 98 places in 377 ms of which 0 ms to minimize.
[2021-05-14 18:17:45] [INFO ] Deduced a trap composed of 133 places in 363 ms of which 1 ms to minimize.
[2021-05-14 18:17:46] [INFO ] Deduced a trap composed of 95 places in 362 ms of which 1 ms to minimize.
[2021-05-14 18:17:46] [INFO ] Deduced a trap composed of 108 places in 350 ms of which 1 ms to minimize.
[2021-05-14 18:17:47] [INFO ] Deduced a trap composed of 79 places in 367 ms of which 1 ms to minimize.
[2021-05-14 18:17:47] [INFO ] Deduced a trap composed of 114 places in 336 ms of which 0 ms to minimize.
[2021-05-14 18:17:48] [INFO ] Deduced a trap composed of 156 places in 328 ms of which 1 ms to minimize.
[2021-05-14 18:17:48] [INFO ] Deduced a trap composed of 101 places in 336 ms of which 1 ms to minimize.
[2021-05-14 18:17:48] [INFO ] Deduced a trap composed of 89 places in 364 ms of which 1 ms to minimize.
[2021-05-14 18:17:49] [INFO ] Deduced a trap composed of 85 places in 495 ms of which 1 ms to minimize.
[2021-05-14 18:17:49] [INFO ] Deduced a trap composed of 23 places in 403 ms of which 1 ms to minimize.
[2021-05-14 18:17:50] [INFO ] Deduced a trap composed of 96 places in 435 ms of which 1 ms to minimize.
[2021-05-14 18:17:50] [INFO ] Deduced a trap composed of 118 places in 425 ms of which 1 ms to minimize.
[2021-05-14 18:17:51] [INFO ] Deduced a trap composed of 40 places in 418 ms of which 1 ms to minimize.
[2021-05-14 18:17:51] [INFO ] Deduced a trap composed of 36 places in 459 ms of which 0 ms to minimize.
[2021-05-14 18:17:52] [INFO ] Deduced a trap composed of 52 places in 472 ms of which 1 ms to minimize.
[2021-05-14 18:17:52] [INFO ] Deduced a trap composed of 34 places in 443 ms of which 1 ms to minimize.
[2021-05-14 18:17:53] [INFO ] Deduced a trap composed of 32 places in 454 ms of which 1 ms to minimize.
[2021-05-14 18:17:53] [INFO ] Deduced a trap composed of 76 places in 443 ms of which 1 ms to minimize.
[2021-05-14 18:17:54] [INFO ] Deduced a trap composed of 96 places in 444 ms of which 1 ms to minimize.
[2021-05-14 18:17:55] [INFO ] Deduced a trap composed of 144 places in 444 ms of which 1 ms to minimize.
[2021-05-14 18:17:55] [INFO ] Deduced a trap composed of 130 places in 437 ms of which 1 ms to minimize.
[2021-05-14 18:17:55] [INFO ] Deduced a trap composed of 109 places in 367 ms of which 1 ms to minimize.
[2021-05-14 18:17:56] [INFO ] Deduced a trap composed of 113 places in 370 ms of which 1 ms to minimize.
[2021-05-14 18:17:56] [INFO ] Deduced a trap composed of 169 places in 469 ms of which 1 ms to minimize.
[2021-05-14 18:17:57] [INFO ] Deduced a trap composed of 30 places in 355 ms of which 1 ms to minimize.
[2021-05-14 18:17:57] [INFO ] Deduced a trap composed of 49 places in 451 ms of which 1 ms to minimize.
[2021-05-14 18:17:58] [INFO ] Deduced a trap composed of 55 places in 450 ms of which 1 ms to minimize.
[2021-05-14 18:17:58] [INFO ] Deduced a trap composed of 141 places in 464 ms of which 1 ms to minimize.
[2021-05-14 18:17:59] [INFO ] Deduced a trap composed of 39 places in 464 ms of which 1 ms to minimize.
[2021-05-14 18:17:59] [INFO ] Deduced a trap composed of 74 places in 455 ms of which 1 ms to minimize.
[2021-05-14 18:18:00] [INFO ] Deduced a trap composed of 242 places in 469 ms of which 1 ms to minimize.
[2021-05-14 18:18:00] [INFO ] Deduced a trap composed of 99 places in 451 ms of which 1 ms to minimize.
[2021-05-14 18:18:01] [INFO ] Deduced a trap composed of 42 places in 474 ms of which 4 ms to minimize.
[2021-05-14 18:18:02] [INFO ] Deduced a trap composed of 181 places in 421 ms of which 1 ms to minimize.
[2021-05-14 18:18:02] [INFO ] Deduced a trap composed of 114 places in 463 ms of which 1 ms to minimize.
[2021-05-14 18:18:03] [INFO ] Deduced a trap composed of 182 places in 471 ms of which 1 ms to minimize.
[2021-05-14 18:18:03] [INFO ] Deduced a trap composed of 20 places in 496 ms of which 1 ms to minimize.
[2021-05-14 18:18:04] [INFO ] Deduced a trap composed of 136 places in 430 ms of which 1 ms to minimize.
[2021-05-14 18:18:04] [INFO ] Deduced a trap composed of 47 places in 502 ms of which 1 ms to minimize.
[2021-05-14 18:18:05] [INFO ] Deduced a trap composed of 30 places in 465 ms of which 1 ms to minimize.
[2021-05-14 18:18:05] [INFO ] Deduced a trap composed of 241 places in 467 ms of which 1 ms to minimize.
[2021-05-14 18:18:06] [INFO ] Deduced a trap composed of 236 places in 473 ms of which 1 ms to minimize.
[2021-05-14 18:18:06] [INFO ] Deduced a trap composed of 101 places in 409 ms of which 1 ms to minimize.
[2021-05-14 18:18:07] [INFO ] Deduced a trap composed of 51 places in 398 ms of which 1 ms to minimize.
[2021-05-14 18:18:07] [INFO ] Deduced a trap composed of 11 places in 495 ms of which 1 ms to minimize.
[2021-05-14 18:18:08] [INFO ] Deduced a trap composed of 126 places in 447 ms of which 0 ms to minimize.
[2021-05-14 18:18:08] [INFO ] Deduced a trap composed of 41 places in 468 ms of which 1 ms to minimize.
[2021-05-14 18:18:09] [INFO ] Deduced a trap composed of 46 places in 477 ms of which 1 ms to minimize.
[2021-05-14 18:18:09] [INFO ] Deduced a trap composed of 67 places in 480 ms of which 1 ms to minimize.
[2021-05-14 18:18:10] [INFO ] Deduced a trap composed of 203 places in 426 ms of which 1 ms to minimize.
[2021-05-14 18:18:10] [INFO ] Deduced a trap composed of 128 places in 408 ms of which 0 ms to minimize.
[2021-05-14 18:18:11] [INFO ] Deduced a trap composed of 201 places in 450 ms of which 1 ms to minimize.
[2021-05-14 18:18:12] [INFO ] Deduced a trap composed of 55 places in 470 ms of which 1 ms to minimize.
[2021-05-14 18:18:12] [INFO ] Deduced a trap composed of 161 places in 458 ms of which 1 ms to minimize.
[2021-05-14 18:18:13] [INFO ] Deduced a trap composed of 188 places in 480 ms of which 0 ms to minimize.
[2021-05-14 18:18:13] [INFO ] Deduced a trap composed of 204 places in 469 ms of which 1 ms to minimize.
[2021-05-14 18:18:14] [INFO ] Deduced a trap composed of 181 places in 468 ms of which 1 ms to minimize.
[2021-05-14 18:18:14] [INFO ] Deduced a trap composed of 63 places in 464 ms of which 1 ms to minimize.
[2021-05-14 18:18:15] [INFO ] Deduced a trap composed of 124 places in 460 ms of which 1 ms to minimize.
[2021-05-14 18:18:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 18:18:15] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2021-05-14 18:18:15] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-14 18:18:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:18:15] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2021-05-14 18:18:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:18:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2021-05-14 18:18:15] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-14 18:18:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:18:16] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2021-05-14 18:18:16] [INFO ] [Nat]Added 546 Read/Feed constraints in 136 ms returned sat
[2021-05-14 18:18:17] [INFO ] Deduced a trap composed of 40 places in 464 ms of which 1 ms to minimize.
[2021-05-14 18:18:17] [INFO ] Deduced a trap composed of 59 places in 520 ms of which 1 ms to minimize.
[2021-05-14 18:18:18] [INFO ] Deduced a trap composed of 63 places in 530 ms of which 1 ms to minimize.
[2021-05-14 18:18:18] [INFO ] Deduced a trap composed of 13 places in 466 ms of which 1 ms to minimize.
[2021-05-14 18:18:19] [INFO ] Deduced a trap composed of 38 places in 481 ms of which 1 ms to minimize.
[2021-05-14 18:18:19] [INFO ] Deduced a trap composed of 33 places in 491 ms of which 1 ms to minimize.
[2021-05-14 18:18:20] [INFO ] Deduced a trap composed of 32 places in 490 ms of which 1 ms to minimize.
[2021-05-14 18:18:21] [INFO ] Deduced a trap composed of 17 places in 508 ms of which 1 ms to minimize.
[2021-05-14 18:18:21] [INFO ] Deduced a trap composed of 148 places in 524 ms of which 1 ms to minimize.
[2021-05-14 18:18:22] [INFO ] Deduced a trap composed of 91 places in 516 ms of which 1 ms to minimize.
[2021-05-14 18:18:22] [INFO ] Deduced a trap composed of 55 places in 466 ms of which 1 ms to minimize.
[2021-05-14 18:18:23] [INFO ] Deduced a trap composed of 20 places in 533 ms of which 1 ms to minimize.
[2021-05-14 18:18:23] [INFO ] Deduced a trap composed of 51 places in 517 ms of which 1 ms to minimize.
[2021-05-14 18:18:24] [INFO ] Deduced a trap composed of 72 places in 501 ms of which 1 ms to minimize.
[2021-05-14 18:18:25] [INFO ] Deduced a trap composed of 127 places in 468 ms of which 1 ms to minimize.
[2021-05-14 18:18:25] [INFO ] Deduced a trap composed of 49 places in 518 ms of which 1 ms to minimize.
[2021-05-14 18:18:26] [INFO ] Deduced a trap composed of 59 places in 533 ms of which 1 ms to minimize.
[2021-05-14 18:18:26] [INFO ] Deduced a trap composed of 112 places in 498 ms of which 1 ms to minimize.
[2021-05-14 18:18:27] [INFO ] Deduced a trap composed of 44 places in 463 ms of which 1 ms to minimize.
[2021-05-14 18:18:27] [INFO ] Deduced a trap composed of 32 places in 513 ms of which 1 ms to minimize.
[2021-05-14 18:18:28] [INFO ] Deduced a trap composed of 25 places in 522 ms of which 1 ms to minimize.
[2021-05-14 18:18:29] [INFO ] Deduced a trap composed of 130 places in 524 ms of which 1 ms to minimize.
[2021-05-14 18:18:29] [INFO ] Deduced a trap composed of 24 places in 525 ms of which 1 ms to minimize.
[2021-05-14 18:18:30] [INFO ] Deduced a trap composed of 11 places in 528 ms of which 1 ms to minimize.
[2021-05-14 18:18:30] [INFO ] Deduced a trap composed of 55 places in 514 ms of which 1 ms to minimize.
[2021-05-14 18:18:31] [INFO ] Deduced a trap composed of 80 places in 478 ms of which 1 ms to minimize.
[2021-05-14 18:18:31] [INFO ] Deduced a trap composed of 24 places in 522 ms of which 1 ms to minimize.
[2021-05-14 18:18:32] [INFO ] Deduced a trap composed of 39 places in 525 ms of which 1 ms to minimize.
[2021-05-14 18:18:33] [INFO ] Deduced a trap composed of 20 places in 507 ms of which 1 ms to minimize.
[2021-05-14 18:18:33] [INFO ] Deduced a trap composed of 52 places in 505 ms of which 1 ms to minimize.
[2021-05-14 18:18:34] [INFO ] Deduced a trap composed of 63 places in 500 ms of which 1 ms to minimize.
[2021-05-14 18:18:34] [INFO ] Deduced a trap composed of 42 places in 482 ms of which 1 ms to minimize.
[2021-05-14 18:18:35] [INFO ] Deduced a trap composed of 11 places in 481 ms of which 1 ms to minimize.
[2021-05-14 18:18:35] [INFO ] Deduced a trap composed of 76 places in 478 ms of which 1 ms to minimize.
[2021-05-14 18:18:36] [INFO ] Deduced a trap composed of 60 places in 495 ms of which 1 ms to minimize.
[2021-05-14 18:18:37] [INFO ] Deduced a trap composed of 25 places in 481 ms of which 1 ms to minimize.
[2021-05-14 18:18:37] [INFO ] Deduced a trap composed of 11 places in 503 ms of which 1 ms to minimize.
[2021-05-14 18:18:38] [INFO ] Deduced a trap composed of 160 places in 505 ms of which 1 ms to minimize.
[2021-05-14 18:18:38] [INFO ] Deduced a trap composed of 24 places in 485 ms of which 1 ms to minimize.
[2021-05-14 18:18:39] [INFO ] Deduced a trap composed of 11 places in 497 ms of which 1 ms to minimize.
[2021-05-14 18:18:39] [INFO ] Deduced a trap composed of 73 places in 491 ms of which 1 ms to minimize.
[2021-05-14 18:18:40] [INFO ] Deduced a trap composed of 62 places in 498 ms of which 1 ms to minimize.
[2021-05-14 18:18:40] [INFO ] Deduced a trap composed of 204 places in 491 ms of which 1 ms to minimize.
[2021-05-14 18:18:41] [INFO ] Deduced a trap composed of 139 places in 492 ms of which 1 ms to minimize.
[2021-05-14 18:18:42] [INFO ] Deduced a trap composed of 243 places in 515 ms of which 0 ms to minimize.
[2021-05-14 18:18:42] [INFO ] Deduced a trap composed of 231 places in 513 ms of which 1 ms to minimize.
[2021-05-14 18:18:43] [INFO ] Deduced a trap composed of 250 places in 502 ms of which 1 ms to minimize.
[2021-05-14 18:18:43] [INFO ] Deduced a trap composed of 145 places in 478 ms of which 1 ms to minimize.
[2021-05-14 18:18:44] [INFO ] Deduced a trap composed of 186 places in 515 ms of which 1 ms to minimize.
[2021-05-14 18:18:44] [INFO ] Deduced a trap composed of 93 places in 489 ms of which 1 ms to minimize.
[2021-05-14 18:18:45] [INFO ] Deduced a trap composed of 32 places in 476 ms of which 1 ms to minimize.
[2021-05-14 18:18:46] [INFO ] Deduced a trap composed of 117 places in 499 ms of which 1 ms to minimize.
[2021-05-14 18:18:46] [INFO ] Deduced a trap composed of 20 places in 466 ms of which 1 ms to minimize.
[2021-05-14 18:18:47] [INFO ] Deduced a trap composed of 34 places in 487 ms of which 2 ms to minimize.
[2021-05-14 18:18:47] [INFO ] Deduced a trap composed of 50 places in 456 ms of which 1 ms to minimize.
[2021-05-14 18:18:48] [INFO ] Deduced a trap composed of 32 places in 466 ms of which 1 ms to minimize.
[2021-05-14 18:18:48] [INFO ] Deduced a trap composed of 44 places in 471 ms of which 1 ms to minimize.
[2021-05-14 18:18:49] [INFO ] Deduced a trap composed of 117 places in 466 ms of which 1 ms to minimize.
[2021-05-14 18:18:49] [INFO ] Deduced a trap composed of 131 places in 495 ms of which 1 ms to minimize.
[2021-05-14 18:18:50] [INFO ] Deduced a trap composed of 80 places in 499 ms of which 0 ms to minimize.
[2021-05-14 18:18:50] [INFO ] Deduced a trap composed of 56 places in 508 ms of which 1 ms to minimize.
[2021-05-14 18:18:51] [INFO ] Deduced a trap composed of 14 places in 470 ms of which 1 ms to minimize.
[2021-05-14 18:18:52] [INFO ] Deduced a trap composed of 62 places in 466 ms of which 1 ms to minimize.
[2021-05-14 18:18:52] [INFO ] Deduced a trap composed of 64 places in 512 ms of which 1 ms to minimize.
[2021-05-14 18:18:53] [INFO ] Deduced a trap composed of 82 places in 451 ms of which 1 ms to minimize.
[2021-05-14 18:18:53] [INFO ] Deduced a trap composed of 67 places in 487 ms of which 1 ms to minimize.
[2021-05-14 18:18:54] [INFO ] Deduced a trap composed of 98 places in 485 ms of which 1 ms to minimize.
[2021-05-14 18:18:54] [INFO ] Deduced a trap composed of 107 places in 470 ms of which 1 ms to minimize.
[2021-05-14 18:18:55] [INFO ] Deduced a trap composed of 33 places in 479 ms of which 1 ms to minimize.
[2021-05-14 18:18:55] [INFO ] Deduced a trap composed of 69 places in 490 ms of which 1 ms to minimize.
[2021-05-14 18:18:56] [INFO ] Deduced a trap composed of 58 places in 462 ms of which 1 ms to minimize.
[2021-05-14 18:18:56] [INFO ] Deduced a trap composed of 85 places in 454 ms of which 1 ms to minimize.
[2021-05-14 18:18:57] [INFO ] Deduced a trap composed of 107 places in 451 ms of which 1 ms to minimize.
[2021-05-14 18:18:57] [INFO ] Deduced a trap composed of 63 places in 441 ms of which 1 ms to minimize.
[2021-05-14 18:18:58] [INFO ] Deduced a trap composed of 92 places in 503 ms of which 1 ms to minimize.
[2021-05-14 18:18:59] [INFO ] Deduced a trap composed of 54 places in 472 ms of which 1 ms to minimize.
[2021-05-14 18:18:59] [INFO ] Deduced a trap composed of 87 places in 509 ms of which 6 ms to minimize.
[2021-05-14 18:19:00] [INFO ] Deduced a trap composed of 115 places in 519 ms of which 1 ms to minimize.
[2021-05-14 18:19:00] [INFO ] Deduced a trap composed of 158 places in 507 ms of which 1 ms to minimize.
[2021-05-14 18:19:01] [INFO ] Deduced a trap composed of 144 places in 505 ms of which 1 ms to minimize.
[2021-05-14 18:19:01] [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) : [7, 8, 8] Max seen :[7, 1, 6]
FORMULA Peterson-COL-7-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 456 out of 1152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1152/1152 places, 2256/2256 transitions.
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 48 Pre rules applied. Total rules applied 0 place count 1152 transition count 2208
Deduced a syphon composed of 48 places in 9 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 1104 transition count 2208
Applied a total of 96 rules in 106 ms. Remains 1104 /1152 variables (removed 48) and now considering 2208/2256 (removed 48) transitions.
Finished structural reductions, in 1 iterations. Remains : 1104/1152 places, 2208/2256 transitions.
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1104 cols
[2021-05-14 18:19:01] [INFO ] Computed 31 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10359 ms. (steps per millisecond=96 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1576 ms. (steps per millisecond=634 ) properties (out of 2) seen :2
Interrupted Best-First random walk after 697052 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=139 ) properties seen :{1=4}
[2021-05-14 18:19:18] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2021-05-14 18:19:18] [INFO ] Computed 31 place invariants in 14 ms
[2021-05-14 18:19:18] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2021-05-14 18:19:18] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-14 18:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:19:19] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2021-05-14 18:19:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:19:19] [INFO ] [Nat]Absence check using 23 positive place invariants in 17 ms returned sat
[2021-05-14 18:19:19] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-14 18:19:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:19:19] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2021-05-14 18:19:19] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:19:19] [INFO ] [Nat]Added 546 Read/Feed constraints in 109 ms returned sat
[2021-05-14 18:19:20] [INFO ] Deduced a trap composed of 112 places in 397 ms of which 1 ms to minimize.
[2021-05-14 18:19:20] [INFO ] Deduced a trap composed of 99 places in 462 ms of which 1 ms to minimize.
[2021-05-14 18:19:21] [INFO ] Deduced a trap composed of 87 places in 439 ms of which 1 ms to minimize.
[2021-05-14 18:19:21] [INFO ] Deduced a trap composed of 66 places in 457 ms of which 1 ms to minimize.
[2021-05-14 18:19:22] [INFO ] Deduced a trap composed of 125 places in 438 ms of which 1 ms to minimize.
[2021-05-14 18:19:22] [INFO ] Deduced a trap composed of 42 places in 438 ms of which 1 ms to minimize.
[2021-05-14 18:19:23] [INFO ] Deduced a trap composed of 50 places in 440 ms of which 1 ms to minimize.
[2021-05-14 18:19:23] [INFO ] Deduced a trap composed of 33 places in 426 ms of which 1 ms to minimize.
[2021-05-14 18:19:24] [INFO ] Deduced a trap composed of 13 places in 441 ms of which 1 ms to minimize.
[2021-05-14 18:19:24] [INFO ] Deduced a trap composed of 13 places in 400 ms of which 0 ms to minimize.
[2021-05-14 18:19:25] [INFO ] Deduced a trap composed of 47 places in 424 ms of which 1 ms to minimize.
[2021-05-14 18:19:25] [INFO ] Deduced a trap composed of 25 places in 438 ms of which 1 ms to minimize.
[2021-05-14 18:19:26] [INFO ] Deduced a trap composed of 71 places in 431 ms of which 1 ms to minimize.
[2021-05-14 18:19:26] [INFO ] Deduced a trap composed of 43 places in 402 ms of which 1 ms to minimize.
[2021-05-14 18:19:27] [INFO ] Deduced a trap composed of 13 places in 425 ms of which 0 ms to minimize.
[2021-05-14 18:19:27] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 1 ms to minimize.
[2021-05-14 18:19:28] [INFO ] Deduced a trap composed of 174 places in 444 ms of which 1 ms to minimize.
[2021-05-14 18:19:28] [INFO ] Deduced a trap composed of 33 places in 398 ms of which 0 ms to minimize.
[2021-05-14 18:19:29] [INFO ] Deduced a trap composed of 36 places in 401 ms of which 1 ms to minimize.
[2021-05-14 18:19:29] [INFO ] Deduced a trap composed of 33 places in 435 ms of which 1 ms to minimize.
[2021-05-14 18:19:29] [INFO ] Deduced a trap composed of 13 places in 437 ms of which 1 ms to minimize.
[2021-05-14 18:19:30] [INFO ] Deduced a trap composed of 27 places in 399 ms of which 1 ms to minimize.
[2021-05-14 18:19:30] [INFO ] Deduced a trap composed of 21 places in 423 ms of which 1 ms to minimize.
[2021-05-14 18:19:31] [INFO ] Deduced a trap composed of 243 places in 409 ms of which 0 ms to minimize.
[2021-05-14 18:19:31] [INFO ] Deduced a trap composed of 96 places in 436 ms of which 1 ms to minimize.
[2021-05-14 18:19:32] [INFO ] Deduced a trap composed of 43 places in 433 ms of which 1 ms to minimize.
[2021-05-14 18:19:32] [INFO ] Deduced a trap composed of 252 places in 419 ms of which 1 ms to minimize.
[2021-05-14 18:19:33] [INFO ] Deduced a trap composed of 197 places in 397 ms of which 1 ms to minimize.
[2021-05-14 18:19:33] [INFO ] Deduced a trap composed of 43 places in 465 ms of which 1 ms to minimize.
[2021-05-14 18:19:34] [INFO ] Deduced a trap composed of 37 places in 410 ms of which 1 ms to minimize.
[2021-05-14 18:19:34] [INFO ] Deduced a trap composed of 80 places in 392 ms of which 1 ms to minimize.
[2021-05-14 18:19:35] [INFO ] Deduced a trap composed of 228 places in 390 ms of which 0 ms to minimize.
[2021-05-14 18:19:35] [INFO ] Deduced a trap composed of 17 places in 387 ms of which 0 ms to minimize.
[2021-05-14 18:19:36] [INFO ] Deduced a trap composed of 123 places in 384 ms of which 1 ms to minimize.
[2021-05-14 18:19:36] [INFO ] Deduced a trap composed of 212 places in 384 ms of which 0 ms to minimize.
[2021-05-14 18:19:36] [INFO ] Deduced a trap composed of 202 places in 347 ms of which 1 ms to minimize.
[2021-05-14 18:19:37] [INFO ] Deduced a trap composed of 61 places in 390 ms of which 1 ms to minimize.
[2021-05-14 18:19:37] [INFO ] Deduced a trap composed of 105 places in 349 ms of which 1 ms to minimize.
[2021-05-14 18:19:38] [INFO ] Deduced a trap composed of 116 places in 345 ms of which 1 ms to minimize.
[2021-05-14 18:19:38] [INFO ] Deduced a trap composed of 132 places in 359 ms of which 1 ms to minimize.
[2021-05-14 18:19:39] [INFO ] Deduced a trap composed of 100 places in 355 ms of which 1 ms to minimize.
[2021-05-14 18:19:39] [INFO ] Deduced a trap composed of 131 places in 351 ms of which 1 ms to minimize.
[2021-05-14 18:19:39] [INFO ] Deduced a trap composed of 114 places in 394 ms of which 0 ms to minimize.
[2021-05-14 18:19:40] [INFO ] Deduced a trap composed of 120 places in 408 ms of which 1 ms to minimize.
[2021-05-14 18:19:40] [INFO ] Deduced a trap composed of 112 places in 413 ms of which 0 ms to minimize.
[2021-05-14 18:19:41] [INFO ] Deduced a trap composed of 117 places in 355 ms of which 1 ms to minimize.
[2021-05-14 18:19:41] [INFO ] Deduced a trap composed of 203 places in 399 ms of which 1 ms to minimize.
[2021-05-14 18:19:42] [INFO ] Deduced a trap composed of 91 places in 405 ms of which 1 ms to minimize.
[2021-05-14 18:19:42] [INFO ] Deduced a trap composed of 53 places in 342 ms of which 1 ms to minimize.
[2021-05-14 18:19:43] [INFO ] Deduced a trap composed of 59 places in 345 ms of which 1 ms to minimize.
[2021-05-14 18:19:43] [INFO ] Deduced a trap composed of 59 places in 321 ms of which 1 ms to minimize.
[2021-05-14 18:19:43] [INFO ] Deduced a trap composed of 158 places in 306 ms of which 1 ms to minimize.
[2021-05-14 18:19:44] [INFO ] Deduced a trap composed of 145 places in 303 ms of which 1 ms to minimize.
[2021-05-14 18:19:44] [INFO ] Deduced a trap composed of 57 places in 333 ms of which 1 ms to minimize.
[2021-05-14 18:19:44] [INFO ] Deduced a trap composed of 59 places in 310 ms of which 0 ms to minimize.
[2021-05-14 18:19:45] [INFO ] Deduced a trap composed of 17 places in 441 ms of which 1 ms to minimize.
[2021-05-14 18:19:45] [INFO ] Deduced a trap composed of 116 places in 416 ms of which 0 ms to minimize.
[2021-05-14 18:19:46] [INFO ] Deduced a trap composed of 146 places in 382 ms of which 1 ms to minimize.
[2021-05-14 18:19:46] [INFO ] Deduced a trap composed of 53 places in 377 ms of which 0 ms to minimize.
[2021-05-14 18:19:47] [INFO ] Deduced a trap composed of 112 places in 383 ms of which 1 ms to minimize.
[2021-05-14 18:19:47] [INFO ] Deduced a trap composed of 56 places in 383 ms of which 1 ms to minimize.
[2021-05-14 18:19:48] [INFO ] Deduced a trap composed of 122 places in 379 ms of which 1 ms to minimize.
[2021-05-14 18:19:48] [INFO ] Deduced a trap composed of 76 places in 385 ms of which 1 ms to minimize.
[2021-05-14 18:19:49] [INFO ] Deduced a trap composed of 115 places in 375 ms of which 1 ms to minimize.
[2021-05-14 18:19:49] [INFO ] Deduced a trap composed of 56 places in 356 ms of which 1 ms to minimize.
[2021-05-14 18:19:49] [INFO ] Deduced a trap composed of 66 places in 422 ms of which 1 ms to minimize.
[2021-05-14 18:19:50] [INFO ] Deduced a trap composed of 104 places in 408 ms of which 0 ms to minimize.
[2021-05-14 18:19:50] [INFO ] Deduced a trap composed of 79 places in 400 ms of which 0 ms to minimize.
[2021-05-14 18:19:51] [INFO ] Deduced a trap composed of 99 places in 418 ms of which 1 ms to minimize.
[2021-05-14 18:19:51] [INFO ] Deduced a trap composed of 65 places in 385 ms of which 1 ms to minimize.
[2021-05-14 18:19:52] [INFO ] Deduced a trap composed of 123 places in 397 ms of which 1 ms to minimize.
[2021-05-14 18:19:52] [INFO ] Deduced a trap composed of 89 places in 393 ms of which 1 ms to minimize.
[2021-05-14 18:19:53] [INFO ] Deduced a trap composed of 129 places in 390 ms of which 1 ms to minimize.
[2021-05-14 18:19:53] [INFO ] Deduced a trap composed of 104 places in 384 ms of which 1 ms to minimize.
[2021-05-14 18:19:54] [INFO ] Deduced a trap composed of 80 places in 388 ms of which 1 ms to minimize.
[2021-05-14 18:19:54] [INFO ] Deduced a trap composed of 87 places in 407 ms of which 0 ms to minimize.
[2021-05-14 18:19:55] [INFO ] Deduced a trap composed of 41 places in 438 ms of which 29 ms to minimize.
[2021-05-14 18:19:55] [INFO ] Deduced a trap composed of 85 places in 414 ms of which 1 ms to minimize.
[2021-05-14 18:19:56] [INFO ] Deduced a trap composed of 46 places in 408 ms of which 0 ms to minimize.
[2021-05-14 18:19:56] [INFO ] Deduced a trap composed of 87 places in 398 ms of which 1 ms to minimize.
[2021-05-14 18:19:57] [INFO ] Deduced a trap composed of 62 places in 410 ms of which 1 ms to minimize.
[2021-05-14 18:19:57] [INFO ] Deduced a trap composed of 90 places in 397 ms of which 1 ms to minimize.
[2021-05-14 18:19:57] [INFO ] Deduced a trap composed of 119 places in 381 ms of which 1 ms to minimize.
[2021-05-14 18:19:58] [INFO ] Deduced a trap composed of 65 places in 381 ms of which 1 ms to minimize.
[2021-05-14 18:19:58] [INFO ] Deduced a trap composed of 38 places in 390 ms of which 1 ms to minimize.
[2021-05-14 18:19:59] [INFO ] Deduced a trap composed of 63 places in 390 ms of which 1 ms to minimize.
[2021-05-14 18:19:59] [INFO ] Deduced a trap composed of 86 places in 437 ms of which 0 ms to minimize.
[2021-05-14 18:20:00] [INFO ] Deduced a trap composed of 98 places in 397 ms of which 1 ms to minimize.
[2021-05-14 18:20:00] [INFO ] Deduced a trap composed of 79 places in 407 ms of which 1 ms to minimize.
[2021-05-14 18:20:01] [INFO ] Deduced a trap composed of 38 places in 443 ms of which 0 ms to minimize.
[2021-05-14 18:20:01] [INFO ] Deduced a trap composed of 44 places in 424 ms of which 1 ms to minimize.
[2021-05-14 18:20:02] [INFO ] Deduced a trap composed of 51 places in 355 ms of which 0 ms to minimize.
[2021-05-14 18:20:02] [INFO ] Deduced a trap composed of 60 places in 376 ms of which 1 ms to minimize.
[2021-05-14 18:20:03] [INFO ] Deduced a trap composed of 60 places in 419 ms of which 1 ms to minimize.
[2021-05-14 18:20:03] [INFO ] Deduced a trap composed of 40 places in 393 ms of which 1 ms to minimize.
[2021-05-14 18:20:03] [INFO ] Deduced a trap composed of 73 places in 292 ms of which 0 ms to minimize.
[2021-05-14 18:20:04] [INFO ] Deduced a trap composed of 121 places in 314 ms of which 0 ms to minimize.
[2021-05-14 18:20:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 18:20:04] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2021-05-14 18:20:04] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-14 18:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:20:04] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2021-05-14 18:20:04] [INFO ] [Real]Added 546 Read/Feed constraints in 81 ms returned sat
[2021-05-14 18:20:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:20:05] [INFO ] [Nat]Absence check using 23 positive place invariants in 18 ms returned sat
[2021-05-14 18:20:05] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-14 18:20:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:20:05] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2021-05-14 18:20:05] [INFO ] [Nat]Added 546 Read/Feed constraints in 106 ms returned sat
[2021-05-14 18:20:06] [INFO ] Deduced a trap composed of 42 places in 447 ms of which 1 ms to minimize.
[2021-05-14 18:20:06] [INFO ] Deduced a trap composed of 53 places in 486 ms of which 1 ms to minimize.
[2021-05-14 18:20:07] [INFO ] Deduced a trap composed of 29 places in 494 ms of which 0 ms to minimize.
[2021-05-14 18:20:07] [INFO ] Deduced a trap composed of 85 places in 490 ms of which 1 ms to minimize.
[2021-05-14 18:20:08] [INFO ] Deduced a trap composed of 97 places in 477 ms of which 1 ms to minimize.
[2021-05-14 18:20:09] [INFO ] Deduced a trap composed of 57 places in 487 ms of which 1 ms to minimize.
[2021-05-14 18:20:09] [INFO ] Deduced a trap composed of 93 places in 492 ms of which 1 ms to minimize.
[2021-05-14 18:20:10] [INFO ] Deduced a trap composed of 61 places in 449 ms of which 0 ms to minimize.
[2021-05-14 18:20:10] [INFO ] Deduced a trap composed of 94 places in 440 ms of which 1 ms to minimize.
[2021-05-14 18:20:11] [INFO ] Deduced a trap composed of 20 places in 440 ms of which 1 ms to minimize.
[2021-05-14 18:20:11] [INFO ] Deduced a trap composed of 17 places in 481 ms of which 1 ms to minimize.
[2021-05-14 18:20:12] [INFO ] Deduced a trap composed of 127 places in 505 ms of which 1 ms to minimize.
[2021-05-14 18:20:12] [INFO ] Deduced a trap composed of 48 places in 486 ms of which 1 ms to minimize.
[2021-05-14 18:20:13] [INFO ] Deduced a trap composed of 17 places in 510 ms of which 1 ms to minimize.
[2021-05-14 18:20:13] [INFO ] Deduced a trap composed of 29 places in 452 ms of which 1 ms to minimize.
[2021-05-14 18:20:14] [INFO ] Deduced a trap composed of 103 places in 457 ms of which 1 ms to minimize.
[2021-05-14 18:20:14] [INFO ] Deduced a trap composed of 57 places in 504 ms of which 0 ms to minimize.
[2021-05-14 18:20:15] [INFO ] Deduced a trap composed of 103 places in 485 ms of which 1 ms to minimize.
[2021-05-14 18:20:16] [INFO ] Deduced a trap composed of 31 places in 486 ms of which 1 ms to minimize.
[2021-05-14 18:20:16] [INFO ] Deduced a trap composed of 31 places in 436 ms of which 1 ms to minimize.
[2021-05-14 18:20:17] [INFO ] Deduced a trap composed of 92 places in 492 ms of which 1 ms to minimize.
[2021-05-14 18:20:17] [INFO ] Deduced a trap composed of 17 places in 492 ms of which 1 ms to minimize.
[2021-05-14 18:20:18] [INFO ] Deduced a trap composed of 88 places in 475 ms of which 1 ms to minimize.
[2021-05-14 18:20:18] [INFO ] Deduced a trap composed of 79 places in 493 ms of which 1 ms to minimize.
[2021-05-14 18:20:19] [INFO ] Deduced a trap composed of 46 places in 483 ms of which 1 ms to minimize.
[2021-05-14 18:20:19] [INFO ] Deduced a trap composed of 47 places in 513 ms of which 1 ms to minimize.
[2021-05-14 18:20:20] [INFO ] Deduced a trap composed of 17 places in 493 ms of which 1 ms to minimize.
[2021-05-14 18:20:20] [INFO ] Deduced a trap composed of 147 places in 486 ms of which 1 ms to minimize.
[2021-05-14 18:20:21] [INFO ] Deduced a trap composed of 129 places in 477 ms of which 1 ms to minimize.
[2021-05-14 18:20:21] [INFO ] Deduced a trap composed of 52 places in 443 ms of which 1 ms to minimize.
[2021-05-14 18:20:22] [INFO ] Deduced a trap composed of 100 places in 472 ms of which 1 ms to minimize.
[2021-05-14 18:20:23] [INFO ] Deduced a trap composed of 23 places in 507 ms of which 0 ms to minimize.
[2021-05-14 18:20:23] [INFO ] Deduced a trap composed of 147 places in 491 ms of which 1 ms to minimize.
[2021-05-14 18:20:24] [INFO ] Deduced a trap composed of 177 places in 471 ms of which 1 ms to minimize.
[2021-05-14 18:20:24] [INFO ] Deduced a trap composed of 121 places in 503 ms of which 1 ms to minimize.
[2021-05-14 18:20:25] [INFO ] Deduced a trap composed of 113 places in 491 ms of which 1 ms to minimize.
[2021-05-14 18:20:25] [INFO ] Deduced a trap composed of 83 places in 482 ms of which 0 ms to minimize.
[2021-05-14 18:20:26] [INFO ] Deduced a trap composed of 127 places in 486 ms of which 1 ms to minimize.
[2021-05-14 18:20:26] [INFO ] Deduced a trap composed of 52 places in 483 ms of which 0 ms to minimize.
[2021-05-14 18:20:27] [INFO ] Deduced a trap composed of 36 places in 449 ms of which 1 ms to minimize.
[2021-05-14 18:20:27] [INFO ] Deduced a trap composed of 82 places in 502 ms of which 1 ms to minimize.
[2021-05-14 18:20:28] [INFO ] Deduced a trap composed of 53 places in 489 ms of which 1 ms to minimize.
[2021-05-14 18:20:29] [INFO ] Deduced a trap composed of 74 places in 443 ms of which 0 ms to minimize.
[2021-05-14 18:20:29] [INFO ] Deduced a trap composed of 43 places in 504 ms of which 1 ms to minimize.
[2021-05-14 18:20:30] [INFO ] Deduced a trap composed of 70 places in 509 ms of which 1 ms to minimize.
[2021-05-14 18:20:30] [INFO ] Deduced a trap composed of 11 places in 449 ms of which 0 ms to minimize.
[2021-05-14 18:20:31] [INFO ] Deduced a trap composed of 80 places in 502 ms of which 1 ms to minimize.
[2021-05-14 18:20:31] [INFO ] Deduced a trap composed of 72 places in 522 ms of which 1 ms to minimize.
[2021-05-14 18:20:32] [INFO ] Deduced a trap composed of 47 places in 454 ms of which 1 ms to minimize.
[2021-05-14 18:20:32] [INFO ] Deduced a trap composed of 35 places in 496 ms of which 1 ms to minimize.
[2021-05-14 18:20:33] [INFO ] Deduced a trap composed of 212 places in 513 ms of which 1 ms to minimize.
[2021-05-14 18:20:34] [INFO ] Deduced a trap composed of 223 places in 505 ms of which 1 ms to minimize.
[2021-05-14 18:20:34] [INFO ] Deduced a trap composed of 178 places in 505 ms of which 4 ms to minimize.
[2021-05-14 18:20:35] [INFO ] Deduced a trap composed of 199 places in 497 ms of which 1 ms to minimize.
[2021-05-14 18:20:35] [INFO ] Deduced a trap composed of 112 places in 509 ms of which 1 ms to minimize.
[2021-05-14 18:20:36] [INFO ] Deduced a trap composed of 222 places in 448 ms of which 1 ms to minimize.
[2021-05-14 18:20:36] [INFO ] Deduced a trap composed of 116 places in 515 ms of which 1 ms to minimize.
[2021-05-14 18:20:37] [INFO ] Deduced a trap composed of 178 places in 503 ms of which 1 ms to minimize.
[2021-05-14 18:20:37] [INFO ] Deduced a trap composed of 144 places in 514 ms of which 1 ms to minimize.
[2021-05-14 18:20:38] [INFO ] Deduced a trap composed of 133 places in 510 ms of which 0 ms to minimize.
[2021-05-14 18:20:39] [INFO ] Deduced a trap composed of 112 places in 504 ms of which 1 ms to minimize.
[2021-05-14 18:20:39] [INFO ] Deduced a trap composed of 173 places in 510 ms of which 1 ms to minimize.
[2021-05-14 18:20:40] [INFO ] Deduced a trap composed of 150 places in 486 ms of which 2 ms to minimize.
[2021-05-14 18:20:40] [INFO ] Deduced a trap composed of 204 places in 502 ms of which 1 ms to minimize.
[2021-05-14 18:20:41] [INFO ] Deduced a trap composed of 196 places in 498 ms of which 1 ms to minimize.
[2021-05-14 18:20:41] [INFO ] Deduced a trap composed of 142 places in 478 ms of which 1 ms to minimize.
[2021-05-14 18:20:42] [INFO ] Deduced a trap composed of 100 places in 484 ms of which 1 ms to minimize.
[2021-05-14 18:20:43] [INFO ] Deduced a trap composed of 135 places in 467 ms of which 0 ms to minimize.
[2021-05-14 18:20:43] [INFO ] Deduced a trap composed of 100 places in 455 ms of which 1 ms to minimize.
[2021-05-14 18:20:44] [INFO ] Deduced a trap composed of 144 places in 485 ms of which 0 ms to minimize.
[2021-05-14 18:20:44] [INFO ] Deduced a trap composed of 147 places in 498 ms of which 1 ms to minimize.
[2021-05-14 18:20:45] [INFO ] Deduced a trap composed of 134 places in 461 ms of which 1 ms to minimize.
[2021-05-14 18:20:45] [INFO ] Deduced a trap composed of 109 places in 502 ms of which 1 ms to minimize.
[2021-05-14 18:20:46] [INFO ] Deduced a trap composed of 103 places in 462 ms of which 1 ms to minimize.
[2021-05-14 18:20:46] [INFO ] Deduced a trap composed of 99 places in 458 ms of which 1 ms to minimize.
[2021-05-14 18:20:47] [INFO ] Deduced a trap composed of 230 places in 479 ms of which 1 ms to minimize.
[2021-05-14 18:20:48] [INFO ] Deduced a trap composed of 175 places in 488 ms of which 1 ms to minimize.
[2021-05-14 18:20:48] [INFO ] Deduced a trap composed of 162 places in 491 ms of which 1 ms to minimize.
[2021-05-14 18:20:49] [INFO ] Deduced a trap composed of 31 places in 456 ms of which 1 ms to minimize.
[2021-05-14 18:20:49] [INFO ] Deduced a trap composed of 11 places in 438 ms of which 1 ms to minimize.
[2021-05-14 18:20:50] [INFO ] Deduced a trap composed of 81 places in 474 ms of which 1 ms to minimize.
[2021-05-14 18:20: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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [8, 8] Max seen :[1, 6]
Support contains 456 out of 1104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 31 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1104/1104 places, 2208/2208 transitions.
Starting structural reductions, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 30 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2021-05-14 18:20:50] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2021-05-14 18:20:50] [INFO ] Computed 31 place invariants in 5 ms
[2021-05-14 18:20:50] [INFO ] Implicit Places using invariants in 524 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 532 ms to find 8 implicit places.
[2021-05-14 18:20:51] [INFO ] Redundant transitions in 162 ms returned []
[2021-05-14 18:20:51] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2021-05-14 18:20:51] [INFO ] Computed 23 place invariants in 8 ms
[2021-05-14 18:20:52] [INFO ] Dead Transitions using invariants and state equation in 993 ms returned []
Starting structural reductions, iteration 1 : 1096/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 46 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2021-05-14 18:20:52] [INFO ] Redundant transitions in 172 ms returned []
[2021-05-14 18:20:52] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2021-05-14 18:20:52] [INFO ] Computed 23 place invariants in 6 ms
[2021-05-14 18:20:53] [INFO ] Dead Transitions using invariants and state equation in 963 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1096/1104 places, 2208/2208 transitions.
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2021-05-14 18:20:53] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10449 ms. (steps per millisecond=95 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1572 ms. (steps per millisecond=636 ) properties (out of 2) seen :3
Interrupted Best-First random walk after 672887 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=134 ) properties seen :{1=1}
[2021-05-14 18:21:10] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2021-05-14 18:21:10] [INFO ] Computed 23 place invariants in 14 ms
[2021-05-14 18:21:10] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2021-05-14 18:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:21:10] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2021-05-14 18:21:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:21:10] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2021-05-14 18:21:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:21:11] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2021-05-14 18:21:11] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:21:11] [INFO ] [Nat]Added 546 Read/Feed constraints in 104 ms returned sat
[2021-05-14 18:21:11] [INFO ] Deduced a trap composed of 36 places in 438 ms of which 1 ms to minimize.
[2021-05-14 18:21:12] [INFO ] Deduced a trap composed of 49 places in 449 ms of which 1 ms to minimize.
[2021-05-14 18:21:13] [INFO ] Deduced a trap composed of 17 places in 471 ms of which 0 ms to minimize.
[2021-05-14 18:21:13] [INFO ] Deduced a trap composed of 66 places in 427 ms of which 1 ms to minimize.
[2021-05-14 18:21:13] [INFO ] Deduced a trap composed of 50 places in 441 ms of which 1 ms to minimize.
[2021-05-14 18:21:14] [INFO ] Deduced a trap composed of 39 places in 439 ms of which 1 ms to minimize.
[2021-05-14 18:21:14] [INFO ] Deduced a trap composed of 40 places in 431 ms of which 0 ms to minimize.
[2021-05-14 18:21:15] [INFO ] Deduced a trap composed of 35 places in 427 ms of which 12 ms to minimize.
[2021-05-14 18:21:15] [INFO ] Deduced a trap composed of 24 places in 417 ms of which 1 ms to minimize.
[2021-05-14 18:21:16] [INFO ] Deduced a trap composed of 15 places in 415 ms of which 1 ms to minimize.
[2021-05-14 18:21:16] [INFO ] Deduced a trap composed of 106 places in 410 ms of which 1 ms to minimize.
[2021-05-14 18:21:17] [INFO ] Deduced a trap composed of 47 places in 341 ms of which 1 ms to minimize.
[2021-05-14 18:21:17] [INFO ] Deduced a trap composed of 54 places in 390 ms of which 1 ms to minimize.
[2021-05-14 18:21:18] [INFO ] Deduced a trap composed of 35 places in 425 ms of which 0 ms to minimize.
[2021-05-14 18:21:18] [INFO ] Deduced a trap composed of 72 places in 434 ms of which 1 ms to minimize.
[2021-05-14 18:21:19] [INFO ] Deduced a trap composed of 24 places in 437 ms of which 1 ms to minimize.
[2021-05-14 18:21:19] [INFO ] Deduced a trap composed of 19 places in 450 ms of which 1 ms to minimize.
[2021-05-14 18:21:20] [INFO ] Deduced a trap composed of 15 places in 445 ms of which 0 ms to minimize.
[2021-05-14 18:21:20] [INFO ] Deduced a trap composed of 11 places in 415 ms of which 1 ms to minimize.
[2021-05-14 18:21:21] [INFO ] Deduced a trap composed of 49 places in 404 ms of which 0 ms to minimize.
[2021-05-14 18:21:21] [INFO ] Deduced a trap composed of 95 places in 372 ms of which 0 ms to minimize.
[2021-05-14 18:21:22] [INFO ] Deduced a trap composed of 67 places in 430 ms of which 1 ms to minimize.
[2021-05-14 18:21:22] [INFO ] Deduced a trap composed of 57 places in 377 ms of which 1 ms to minimize.
[2021-05-14 18:21:22] [INFO ] Deduced a trap composed of 68 places in 378 ms of which 1 ms to minimize.
[2021-05-14 18:21:23] [INFO ] Deduced a trap composed of 61 places in 381 ms of which 1 ms to minimize.
[2021-05-14 18:21:23] [INFO ] Deduced a trap composed of 74 places in 403 ms of which 1 ms to minimize.
[2021-05-14 18:21:24] [INFO ] Deduced a trap composed of 108 places in 408 ms of which 1 ms to minimize.
[2021-05-14 18:21:24] [INFO ] Deduced a trap composed of 78 places in 399 ms of which 1 ms to minimize.
[2021-05-14 18:21:25] [INFO ] Deduced a trap composed of 127 places in 423 ms of which 1 ms to minimize.
[2021-05-14 18:21:25] [INFO ] Deduced a trap composed of 65 places in 414 ms of which 1 ms to minimize.
[2021-05-14 18:21:26] [INFO ] Deduced a trap composed of 54 places in 425 ms of which 1 ms to minimize.
[2021-05-14 18:21:26] [INFO ] Deduced a trap composed of 83 places in 408 ms of which 1 ms to minimize.
[2021-05-14 18:21:27] [INFO ] Deduced a trap composed of 74 places in 422 ms of which 1 ms to minimize.
[2021-05-14 18:21:27] [INFO ] Deduced a trap composed of 29 places in 401 ms of which 1 ms to minimize.
[2021-05-14 18:21:28] [INFO ] Deduced a trap composed of 73 places in 441 ms of which 0 ms to minimize.
[2021-05-14 18:21:28] [INFO ] Deduced a trap composed of 61 places in 409 ms of which 0 ms to minimize.
[2021-05-14 18:21:29] [INFO ] Deduced a trap composed of 62 places in 414 ms of which 1 ms to minimize.
[2021-05-14 18:21:29] [INFO ] Deduced a trap composed of 38 places in 398 ms of which 1 ms to minimize.
[2021-05-14 18:21:29] [INFO ] Deduced a trap composed of 135 places in 387 ms of which 0 ms to minimize.
[2021-05-14 18:21:30] [INFO ] Deduced a trap composed of 91 places in 423 ms of which 1 ms to minimize.
[2021-05-14 18:21:30] [INFO ] Deduced a trap composed of 66 places in 450 ms of which 1 ms to minimize.
[2021-05-14 18:21:31] [INFO ] Deduced a trap composed of 67 places in 479 ms of which 3 ms to minimize.
[2021-05-14 18:21:31] [INFO ] Deduced a trap composed of 31 places in 451 ms of which 1 ms to minimize.
[2021-05-14 18:21:32] [INFO ] Deduced a trap composed of 115 places in 442 ms of which 1 ms to minimize.
[2021-05-14 18:21:32] [INFO ] Deduced a trap composed of 103 places in 419 ms of which 1 ms to minimize.
[2021-05-14 18:21:33] [INFO ] Deduced a trap composed of 109 places in 441 ms of which 1 ms to minimize.
[2021-05-14 18:21:33] [INFO ] Deduced a trap composed of 121 places in 432 ms of which 1 ms to minimize.
[2021-05-14 18:21:34] [INFO ] Deduced a trap composed of 57 places in 381 ms of which 1 ms to minimize.
[2021-05-14 18:21:34] [INFO ] Deduced a trap composed of 39 places in 376 ms of which 1 ms to minimize.
[2021-05-14 18:21:35] [INFO ] Deduced a trap composed of 37 places in 392 ms of which 1 ms to minimize.
[2021-05-14 18:21:35] [INFO ] Deduced a trap composed of 100 places in 387 ms of which 1 ms to minimize.
[2021-05-14 18:21:36] [INFO ] Deduced a trap composed of 94 places in 404 ms of which 0 ms to minimize.
[2021-05-14 18:21:36] [INFO ] Deduced a trap composed of 109 places in 391 ms of which 1 ms to minimize.
[2021-05-14 18:21:37] [INFO ] Deduced a trap composed of 77 places in 355 ms of which 1 ms to minimize.
[2021-05-14 18:21:37] [INFO ] Deduced a trap composed of 122 places in 400 ms of which 1 ms to minimize.
[2021-05-14 18:21:37] [INFO ] Deduced a trap composed of 163 places in 402 ms of which 1 ms to minimize.
[2021-05-14 18:21:38] [INFO ] Deduced a trap composed of 173 places in 403 ms of which 1 ms to minimize.
[2021-05-14 18:21:38] [INFO ] Deduced a trap composed of 41 places in 391 ms of which 1 ms to minimize.
[2021-05-14 18:21:39] [INFO ] Deduced a trap composed of 109 places in 373 ms of which 1 ms to minimize.
[2021-05-14 18:21:39] [INFO ] Deduced a trap composed of 74 places in 395 ms of which 1 ms to minimize.
[2021-05-14 18:21:40] [INFO ] Deduced a trap composed of 93 places in 387 ms of which 1 ms to minimize.
[2021-05-14 18:21:40] [INFO ] Deduced a trap composed of 99 places in 390 ms of which 0 ms to minimize.
[2021-05-14 18:21:41] [INFO ] Deduced a trap composed of 127 places in 376 ms of which 1 ms to minimize.
[2021-05-14 18:21:41] [INFO ] Deduced a trap composed of 37 places in 434 ms of which 1 ms to minimize.
[2021-05-14 18:21:42] [INFO ] Deduced a trap composed of 13 places in 431 ms of which 0 ms to minimize.
[2021-05-14 18:21:42] [INFO ] Deduced a trap composed of 61 places in 397 ms of which 1 ms to minimize.
[2021-05-14 18:21:43] [INFO ] Deduced a trap composed of 17 places in 423 ms of which 1 ms to minimize.
[2021-05-14 18:21:43] [INFO ] Deduced a trap composed of 52 places in 393 ms of which 0 ms to minimize.
[2021-05-14 18:21:43] [INFO ] Deduced a trap composed of 95 places in 421 ms of which 1 ms to minimize.
[2021-05-14 18:21:44] [INFO ] Deduced a trap composed of 25 places in 415 ms of which 1 ms to minimize.
[2021-05-14 18:21:44] [INFO ] Deduced a trap composed of 112 places in 419 ms of which 1 ms to minimize.
[2021-05-14 18:21:45] [INFO ] Deduced a trap composed of 25 places in 372 ms of which 1 ms to minimize.
[2021-05-14 18:21:45] [INFO ] Deduced a trap composed of 105 places in 399 ms of which 1 ms to minimize.
[2021-05-14 18:21:46] [INFO ] Deduced a trap composed of 110 places in 392 ms of which 1 ms to minimize.
[2021-05-14 18:21:46] [INFO ] Deduced a trap composed of 40 places in 398 ms of which 1 ms to minimize.
[2021-05-14 18:21:47] [INFO ] Deduced a trap composed of 85 places in 391 ms of which 1 ms to minimize.
[2021-05-14 18:21:47] [INFO ] Deduced a trap composed of 137 places in 391 ms of which 1 ms to minimize.
[2021-05-14 18:21:48] [INFO ] Deduced a trap composed of 11 places in 399 ms of which 1 ms to minimize.
[2021-05-14 18:21:48] [INFO ] Deduced a trap composed of 185 places in 385 ms of which 1 ms to minimize.
[2021-05-14 18:21:48] [INFO ] Deduced a trap composed of 71 places in 403 ms of which 0 ms to minimize.
[2021-05-14 18:21:49] [INFO ] Deduced a trap composed of 43 places in 363 ms of which 0 ms to minimize.
[2021-05-14 18:21:49] [INFO ] Deduced a trap composed of 13 places in 400 ms of which 0 ms to minimize.
[2021-05-14 18:21:50] [INFO ] Deduced a trap composed of 41 places in 392 ms of which 1 ms to minimize.
[2021-05-14 18:21:50] [INFO ] Deduced a trap composed of 54 places in 368 ms of which 1 ms to minimize.
[2021-05-14 18:21:51] [INFO ] Deduced a trap composed of 58 places in 396 ms of which 1 ms to minimize.
[2021-05-14 18:21:51] [INFO ] Deduced a trap composed of 54 places in 390 ms of which 0 ms to minimize.
[2021-05-14 18:21:52] [INFO ] Deduced a trap composed of 40 places in 378 ms of which 1 ms to minimize.
[2021-05-14 18:21:52] [INFO ] Deduced a trap composed of 35 places in 376 ms of which 1 ms to minimize.
[2021-05-14 18:21:52] [INFO ] Deduced a trap composed of 50 places in 359 ms of which 1 ms to minimize.
[2021-05-14 18:21:53] [INFO ] Deduced a trap composed of 66 places in 377 ms of which 0 ms to minimize.
[2021-05-14 18:21:53] [INFO ] Deduced a trap composed of 65 places in 368 ms of which 1 ms to minimize.
[2021-05-14 18:21:54] [INFO ] Deduced a trap composed of 127 places in 375 ms of which 1 ms to minimize.
[2021-05-14 18:21:54] [INFO ] Deduced a trap composed of 110 places in 369 ms of which 0 ms to minimize.
[2021-05-14 18:21:55] [INFO ] Deduced a trap composed of 77 places in 383 ms of which 0 ms to minimize.
[2021-05-14 18:21:55] [INFO ] Deduced a trap composed of 115 places in 367 ms of which 1 ms to minimize.
[2021-05-14 18:21:56] [INFO ] Deduced a trap composed of 214 places in 401 ms of which 1 ms to minimize.
[2021-05-14 18:21:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 18:21:56] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2021-05-14 18:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:21:56] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2021-05-14 18:21:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:21:56] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2021-05-14 18:21:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:21:57] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2021-05-14 18:21:57] [INFO ] [Nat]Added 546 Read/Feed constraints in 108 ms returned sat
[2021-05-14 18:21:57] [INFO ] Deduced a trap composed of 39 places in 468 ms of which 1 ms to minimize.
[2021-05-14 18:21:58] [INFO ] Deduced a trap composed of 35 places in 487 ms of which 1 ms to minimize.
[2021-05-14 18:21:58] [INFO ] Deduced a trap composed of 24 places in 461 ms of which 1 ms to minimize.
[2021-05-14 18:21:59] [INFO ] Deduced a trap composed of 79 places in 453 ms of which 1 ms to minimize.
[2021-05-14 18:22:00] [INFO ] Deduced a trap composed of 198 places in 453 ms of which 1 ms to minimize.
[2021-05-14 18:22:00] [INFO ] Deduced a trap composed of 103 places in 456 ms of which 0 ms to minimize.
[2021-05-14 18:22:01] [INFO ] Deduced a trap composed of 76 places in 444 ms of which 1 ms to minimize.
[2021-05-14 18:22:01] [INFO ] Deduced a trap composed of 190 places in 479 ms of which 1 ms to minimize.
[2021-05-14 18:22:02] [INFO ] Deduced a trap composed of 90 places in 480 ms of which 1 ms to minimize.
[2021-05-14 18:22:02] [INFO ] Deduced a trap composed of 93 places in 497 ms of which 1 ms to minimize.
[2021-05-14 18:22:03] [INFO ] Deduced a trap composed of 99 places in 480 ms of which 0 ms to minimize.
[2021-05-14 18:22:03] [INFO ] Deduced a trap composed of 69 places in 457 ms of which 1 ms to minimize.
[2021-05-14 18:22:04] [INFO ] Deduced a trap composed of 110 places in 443 ms of which 1 ms to minimize.
[2021-05-14 18:22:04] [INFO ] Deduced a trap composed of 100 places in 482 ms of which 1 ms to minimize.
[2021-05-14 18:22:05] [INFO ] Deduced a trap composed of 20 places in 493 ms of which 1 ms to minimize.
[2021-05-14 18:22:05] [INFO ] Deduced a trap composed of 28 places in 442 ms of which 1 ms to minimize.
[2021-05-14 18:22:06] [INFO ] Deduced a trap composed of 85 places in 475 ms of which 1 ms to minimize.
[2021-05-14 18:22:06] [INFO ] Deduced a trap composed of 90 places in 434 ms of which 1 ms to minimize.
[2021-05-14 18:22:07] [INFO ] Deduced a trap composed of 65 places in 504 ms of which 0 ms to minimize.
[2021-05-14 18:22:07] [INFO ] Deduced a trap composed of 57 places in 465 ms of which 0 ms to minimize.
[2021-05-14 18:22:08] [INFO ] Deduced a trap composed of 130 places in 461 ms of which 1 ms to minimize.
[2021-05-14 18:22:08] [INFO ] Deduced a trap composed of 93 places in 482 ms of which 1 ms to minimize.
[2021-05-14 18:22:09] [INFO ] Deduced a trap composed of 141 places in 443 ms of which 1 ms to minimize.
[2021-05-14 18:22:10] [INFO ] Deduced a trap composed of 123 places in 459 ms of which 0 ms to minimize.
[2021-05-14 18:22:10] [INFO ] Deduced a trap composed of 98 places in 476 ms of which 1 ms to minimize.
[2021-05-14 18:22:11] [INFO ] Deduced a trap composed of 21 places in 493 ms of which 1 ms to minimize.
[2021-05-14 18:22:11] [INFO ] Deduced a trap composed of 39 places in 499 ms of which 1 ms to minimize.
[2021-05-14 18:22:12] [INFO ] Deduced a trap composed of 41 places in 483 ms of which 1 ms to minimize.
[2021-05-14 18:22:12] [INFO ] Deduced a trap composed of 41 places in 445 ms of which 1 ms to minimize.
[2021-05-14 18:22:13] [INFO ] Deduced a trap composed of 84 places in 487 ms of which 1 ms to minimize.
[2021-05-14 18:22:13] [INFO ] Deduced a trap composed of 33 places in 507 ms of which 0 ms to minimize.
[2021-05-14 18:22:14] [INFO ] Deduced a trap composed of 89 places in 444 ms of which 1 ms to minimize.
[2021-05-14 18:22:14] [INFO ] Deduced a trap composed of 85 places in 500 ms of which 1 ms to minimize.
[2021-05-14 18:22:15] [INFO ] Deduced a trap composed of 81 places in 506 ms of which 1 ms to minimize.
[2021-05-14 18:22:15] [INFO ] Deduced a trap composed of 46 places in 449 ms of which 1 ms to minimize.
[2021-05-14 18:22:16] [INFO ] Deduced a trap composed of 126 places in 480 ms of which 1 ms to minimize.
[2021-05-14 18:22:17] [INFO ] Deduced a trap composed of 130 places in 500 ms of which 1 ms to minimize.
[2021-05-14 18:22:17] [INFO ] Deduced a trap composed of 43 places in 451 ms of which 1 ms to minimize.
[2021-05-14 18:22:18] [INFO ] Deduced a trap composed of 29 places in 462 ms of which 1 ms to minimize.
[2021-05-14 18:22:18] [INFO ] Deduced a trap composed of 13 places in 444 ms of which 1 ms to minimize.
[2021-05-14 18:22:19] [INFO ] Deduced a trap composed of 72 places in 505 ms of which 1 ms to minimize.
[2021-05-14 18:22:19] [INFO ] Deduced a trap composed of 32 places in 422 ms of which 1 ms to minimize.
[2021-05-14 18:22:20] [INFO ] Deduced a trap composed of 72 places in 466 ms of which 1 ms to minimize.
[2021-05-14 18:22:20] [INFO ] Deduced a trap composed of 86 places in 441 ms of which 1 ms to minimize.
[2021-05-14 18:22:21] [INFO ] Deduced a trap composed of 79 places in 471 ms of which 1 ms to minimize.
[2021-05-14 18:22:21] [INFO ] Deduced a trap composed of 28 places in 414 ms of which 1 ms to minimize.
[2021-05-14 18:22:22] [INFO ] Deduced a trap composed of 103 places in 483 ms of which 1 ms to minimize.
[2021-05-14 18:22:22] [INFO ] Deduced a trap composed of 67 places in 424 ms of which 0 ms to minimize.
[2021-05-14 18:22:23] [INFO ] Deduced a trap composed of 47 places in 449 ms of which 1 ms to minimize.
[2021-05-14 18:22:23] [INFO ] Deduced a trap composed of 59 places in 455 ms of which 1 ms to minimize.
[2021-05-14 18:22:24] [INFO ] Deduced a trap composed of 127 places in 452 ms of which 1 ms to minimize.
[2021-05-14 18:22:24] [INFO ] Deduced a trap composed of 57 places in 452 ms of which 1 ms to minimize.
[2021-05-14 18:22:25] [INFO ] Deduced a trap composed of 105 places in 464 ms of which 1 ms to minimize.
[2021-05-14 18:22:25] [INFO ] Deduced a trap composed of 59 places in 458 ms of which 1 ms to minimize.
[2021-05-14 18:22:26] [INFO ] Deduced a trap composed of 149 places in 479 ms of which 1 ms to minimize.
[2021-05-14 18:22:26] [INFO ] Deduced a trap composed of 105 places in 467 ms of which 1 ms to minimize.
[2021-05-14 18:22:27] [INFO ] Deduced a trap composed of 38 places in 526 ms of which 1 ms to minimize.
[2021-05-14 18:22:27] [INFO ] Deduced a trap composed of 82 places in 479 ms of which 1 ms to minimize.
[2021-05-14 18:22:28] [INFO ] Deduced a trap composed of 80 places in 484 ms of which 1 ms to minimize.
[2021-05-14 18:22:29] [INFO ] Deduced a trap composed of 75 places in 465 ms of which 1 ms to minimize.
[2021-05-14 18:22:29] [INFO ] Deduced a trap composed of 63 places in 472 ms of which 1 ms to minimize.
[2021-05-14 18:22:30] [INFO ] Deduced a trap composed of 51 places in 463 ms of which 0 ms to minimize.
[2021-05-14 18:22:30] [INFO ] Deduced a trap composed of 70 places in 451 ms of which 1 ms to minimize.
[2021-05-14 18:22:31] [INFO ] Deduced a trap composed of 57 places in 448 ms of which 1 ms to minimize.
[2021-05-14 18:22:31] [INFO ] Deduced a trap composed of 63 places in 474 ms of which 1 ms to minimize.
[2021-05-14 18:22:32] [INFO ] Deduced a trap composed of 61 places in 476 ms of which 0 ms to minimize.
[2021-05-14 18:22:32] [INFO ] Deduced a trap composed of 94 places in 487 ms of which 1 ms to minimize.
[2021-05-14 18:22:33] [INFO ] Deduced a trap composed of 28 places in 449 ms of which 1 ms to minimize.
[2021-05-14 18:22:33] [INFO ] Deduced a trap composed of 103 places in 491 ms of which 1 ms to minimize.
[2021-05-14 18:22:34] [INFO ] Deduced a trap composed of 29 places in 438 ms of which 1 ms to minimize.
[2021-05-14 18:22:34] [INFO ] Deduced a trap composed of 50 places in 474 ms of which 1 ms to minimize.
[2021-05-14 18:22:35] [INFO ] Deduced a trap composed of 50 places in 495 ms of which 1 ms to minimize.
[2021-05-14 18:22:35] [INFO ] Deduced a trap composed of 49 places in 479 ms of which 1 ms to minimize.
[2021-05-14 18:22:36] [INFO ] Deduced a trap composed of 41 places in 495 ms of which 1 ms to minimize.
[2021-05-14 18:22:36] [INFO ] Deduced a trap composed of 87 places in 452 ms of which 1 ms to minimize.
[2021-05-14 18:22:37] [INFO ] Deduced a trap composed of 82 places in 459 ms of which 1 ms to minimize.
[2021-05-14 18:22:37] [INFO ] Deduced a trap composed of 64 places in 483 ms of which 0 ms to minimize.
[2021-05-14 18:22:38] [INFO ] Deduced a trap composed of 68 places in 487 ms of which 1 ms to minimize.
[2021-05-14 18:22:39] [INFO ] Deduced a trap composed of 88 places in 502 ms of which 1 ms to minimize.
[2021-05-14 18:22:39] [INFO ] Deduced a trap composed of 57 places in 426 ms of which 1 ms to minimize.
[2021-05-14 18:22:40] [INFO ] Deduced a trap composed of 64 places in 451 ms of which 1 ms to minimize.
[2021-05-14 18:22:40] [INFO ] Deduced a trap composed of 38 places in 470 ms of which 1 ms to minimize.
[2021-05-14 18:22:41] [INFO ] Deduced a trap composed of 26 places in 497 ms of which 1 ms to minimize.
[2021-05-14 18:22:41] [INFO ] Deduced a trap composed of 108 places in 297 ms of which 0 ms to minimize.
[2021-05-14 18:22:41] [INFO ] Deduced a trap composed of 108 places in 333 ms of which 0 ms to minimize.
[2021-05-14 18:22:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [8, 8] Max seen :[1, 6]
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 29 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1096/1096 places, 2208/2208 transitions.
Starting structural reductions, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 28 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2021-05-14 18:22:41] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2021-05-14 18:22:41] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-14 18:22:42] [INFO ] Implicit Places using invariants in 380 ms returned []
[2021-05-14 18:22:42] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2021-05-14 18:22:42] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-14 18:22:42] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:22:49] [INFO ] Implicit Places using invariants and state equation in 7418 ms returned []
Implicit Place search using SMT with State Equation took 7801 ms to find 0 implicit places.
[2021-05-14 18:22:49] [INFO ] Redundant transitions in 54 ms returned []
[2021-05-14 18:22:49] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2021-05-14 18:22:49] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-14 18:22:50] [INFO ] Dead Transitions using invariants and state equation in 949 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1096/1096 places, 2208/2208 transitions.
Starting property specific reduction for Peterson-COL-7-UpperBounds-09
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2021-05-14 18:22:50] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :1
[2021-05-14 18:22:50] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2021-05-14 18:22:50] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-14 18:22:50] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2021-05-14 18:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:22:51] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2021-05-14 18:22:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:22:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2021-05-14 18:22:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:22:51] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2021-05-14 18:22:51] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:22:52] [INFO ] [Nat]Added 546 Read/Feed constraints in 126 ms returned sat
[2021-05-14 18:22:52] [INFO ] Deduced a trap composed of 36 places in 464 ms of which 1 ms to minimize.
[2021-05-14 18:22:53] [INFO ] Deduced a trap composed of 49 places in 423 ms of which 1 ms to minimize.
[2021-05-14 18:22:53] [INFO ] Deduced a trap composed of 17 places in 439 ms of which 1 ms to minimize.
[2021-05-14 18:22:54] [INFO ] Deduced a trap composed of 66 places in 440 ms of which 1 ms to minimize.
[2021-05-14 18:22:54] [INFO ] Deduced a trap composed of 50 places in 438 ms of which 1 ms to minimize.
[2021-05-14 18:22:55] [INFO ] Deduced a trap composed of 39 places in 434 ms of which 1 ms to minimize.
[2021-05-14 18:22:55] [INFO ] Deduced a trap composed of 40 places in 428 ms of which 1 ms to minimize.
[2021-05-14 18:22:56] [INFO ] Deduced a trap composed of 35 places in 394 ms of which 0 ms to minimize.
[2021-05-14 18:22:56] [INFO ] Deduced a trap composed of 24 places in 406 ms of which 1 ms to minimize.
[2021-05-14 18:22:56] [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) : [8] Max seen :[1]
Support contains 8 out of 1096 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 1096 transition count 2103
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 991 transition count 2103
Performed 343 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 343 Pre rules applied. Total rules applied 210 place count 991 transition count 1760
Deduced a syphon composed of 343 places in 1 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 2 with 686 rules applied. Total rules applied 896 place count 648 transition count 1760
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 1008 place count 592 transition count 1704
Applied a total of 1008 rules in 86 ms. Remains 592 /1096 variables (removed 504) and now considering 1704/2208 (removed 504) transitions.
Finished structural reductions, in 1 iterations. Remains : 592/1096 places, 1704/2208 transitions.
Normalized transition count is 1368 out of 1704 initially.
// Phase 1: matrix 1368 rows 592 cols
[2021-05-14 18:22:56] [INFO ] Computed 23 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3313 ms. (steps per millisecond=301 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties (out of 1) seen :1
[2021-05-14 18:23:00] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2021-05-14 18:23:00] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-14 18:23:00] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2021-05-14 18:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:23:00] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2021-05-14 18:23:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:23:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2021-05-14 18:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:23:01] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2021-05-14 18:23:01] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:23:01] [INFO ] [Nat]Added 546 Read/Feed constraints in 83 ms returned sat
[2021-05-14 18:23:01] [INFO ] Deduced a trap composed of 16 places in 275 ms of which 0 ms to minimize.
[2021-05-14 18:23:01] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 0 ms to minimize.
[2021-05-14 18:23:02] [INFO ] Deduced a trap composed of 66 places in 224 ms of which 0 ms to minimize.
[2021-05-14 18:23:02] [INFO ] Deduced a trap composed of 92 places in 216 ms of which 1 ms to minimize.
[2021-05-14 18:23:02] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 1 ms to minimize.
[2021-05-14 18:23:03] [INFO ] Deduced a trap composed of 115 places in 209 ms of which 1 ms to minimize.
[2021-05-14 18:23:03] [INFO ] Deduced a trap composed of 68 places in 209 ms of which 0 ms to minimize.
[2021-05-14 18:23:03] [INFO ] Deduced a trap composed of 82 places in 201 ms of which 0 ms to minimize.
[2021-05-14 18:23:03] [INFO ] Deduced a trap composed of 74 places in 214 ms of which 1 ms to minimize.
[2021-05-14 18:23:04] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 1 ms to minimize.
[2021-05-14 18:23:04] [INFO ] Deduced a trap composed of 86 places in 226 ms of which 0 ms to minimize.
[2021-05-14 18:23:04] [INFO ] Deduced a trap composed of 68 places in 213 ms of which 0 ms to minimize.
[2021-05-14 18:23:04] [INFO ] Deduced a trap composed of 98 places in 233 ms of which 1 ms to minimize.
[2021-05-14 18:23:05] [INFO ] Deduced a trap composed of 48 places in 245 ms of which 1 ms to minimize.
[2021-05-14 18:23:05] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 0 ms to minimize.
[2021-05-14 18:23:05] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 0 ms to minimize.
[2021-05-14 18:23:05] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 0 ms to minimize.
[2021-05-14 18:23:06] [INFO ] Deduced a trap composed of 70 places in 232 ms of which 1 ms to minimize.
[2021-05-14 18:23:06] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 0 ms to minimize.
[2021-05-14 18:23:06] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 0 ms to minimize.
[2021-05-14 18:23:06] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 1 ms to minimize.
[2021-05-14 18:23:07] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 0 ms to minimize.
[2021-05-14 18:23:07] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 1 ms to minimize.
[2021-05-14 18:23:07] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 1 ms to minimize.
[2021-05-14 18:23:07] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 1 ms to minimize.
[2021-05-14 18:23:08] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 1 ms to minimize.
[2021-05-14 18:23:08] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 1 ms to minimize.
[2021-05-14 18:23:08] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 0 ms to minimize.
[2021-05-14 18:23:08] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 0 ms to minimize.
[2021-05-14 18:23:09] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 1 ms to minimize.
[2021-05-14 18:23:09] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 0 ms to minimize.
[2021-05-14 18:23:09] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 1 ms to minimize.
[2021-05-14 18:23:09] [INFO ] Deduced a trap composed of 51 places in 228 ms of which 1 ms to minimize.
[2021-05-14 18:23:10] [INFO ] Deduced a trap composed of 89 places in 241 ms of which 1 ms to minimize.
[2021-05-14 18:23:10] [INFO ] Deduced a trap composed of 62 places in 225 ms of which 1 ms to minimize.
[2021-05-14 18:23:10] [INFO ] Deduced a trap composed of 53 places in 197 ms of which 1 ms to minimize.
[2021-05-14 18:23:11] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 1 ms to minimize.
[2021-05-14 18:23:11] [INFO ] Deduced a trap composed of 61 places in 237 ms of which 1 ms to minimize.
[2021-05-14 18:23:11] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 1 ms to minimize.
[2021-05-14 18:23:11] [INFO ] Deduced a trap composed of 51 places in 230 ms of which 1 ms to minimize.
[2021-05-14 18:23:12] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 1 ms to minimize.
[2021-05-14 18:23:12] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 1 ms to minimize.
[2021-05-14 18:23:12] [INFO ] Deduced a trap composed of 79 places in 230 ms of which 0 ms to minimize.
[2021-05-14 18:23:12] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 0 ms to minimize.
[2021-05-14 18:23:13] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 0 ms to minimize.
[2021-05-14 18:23:13] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 0 ms to minimize.
[2021-05-14 18:23:13] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 0 ms to minimize.
[2021-05-14 18:23:13] [INFO ] Deduced a trap composed of 110 places in 165 ms of which 0 ms to minimize.
[2021-05-14 18:23:14] [INFO ] Deduced a trap composed of 95 places in 201 ms of which 0 ms to minimize.
[2021-05-14 18:23:14] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 0 ms to minimize.
[2021-05-14 18:23:14] [INFO ] Deduced a trap composed of 94 places in 222 ms of which 0 ms to minimize.
[2021-05-14 18:23:14] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 0 ms to minimize.
[2021-05-14 18:23:15] [INFO ] Deduced a trap composed of 57 places in 222 ms of which 1 ms to minimize.
[2021-05-14 18:23:15] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 0 ms to minimize.
[2021-05-14 18:23:15] [INFO ] Deduced a trap composed of 70 places in 219 ms of which 1 ms to minimize.
[2021-05-14 18:23:15] [INFO ] Deduced a trap composed of 69 places in 204 ms of which 1 ms to minimize.
[2021-05-14 18:23:16] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 0 ms to minimize.
[2021-05-14 18:23:16] [INFO ] Deduced a trap composed of 87 places in 218 ms of which 0 ms to minimize.
[2021-05-14 18:23:16] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 0 ms to minimize.
[2021-05-14 18:23:16] [INFO ] Deduced a trap composed of 56 places in 215 ms of which 0 ms to minimize.
[2021-05-14 18:23:17] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 1 ms to minimize.
[2021-05-14 18:23:17] [INFO ] Deduced a trap composed of 63 places in 208 ms of which 1 ms to minimize.
[2021-05-14 18:23:17] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 1 ms to minimize.
[2021-05-14 18:23:17] [INFO ] Deduced a trap composed of 52 places in 208 ms of which 0 ms to minimize.
[2021-05-14 18:23:18] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 1 ms to minimize.
[2021-05-14 18:23:18] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 0 ms to minimize.
[2021-05-14 18:23:18] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 0 ms to minimize.
[2021-05-14 18:23:18] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 0 ms to minimize.
[2021-05-14 18:23:18] [INFO ] Deduced a trap composed of 59 places in 198 ms of which 0 ms to minimize.
[2021-05-14 18:23:19] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 1 ms to minimize.
[2021-05-14 18:23:19] [INFO ] Deduced a trap composed of 43 places in 224 ms of which 0 ms to minimize.
[2021-05-14 18:23:19] [INFO ] Deduced a trap composed of 44 places in 193 ms of which 1 ms to minimize.
[2021-05-14 18:23:19] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 0 ms to minimize.
[2021-05-14 18:23:20] [INFO ] Deduced a trap composed of 56 places in 179 ms of which 0 ms to minimize.
[2021-05-14 18:23:20] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 0 ms to minimize.
[2021-05-14 18:23:20] [INFO ] Deduced a trap composed of 52 places in 202 ms of which 0 ms to minimize.
[2021-05-14 18:23:24] [INFO ] Deduced a trap composed of 28 places in 3443 ms of which 0 ms to minimize.
[2021-05-14 18:23:24] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 0 ms to minimize.
[2021-05-14 18:23:24] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 0 ms to minimize.
[2021-05-14 18:23:24] [INFO ] Deduced a trap composed of 63 places in 167 ms of which 1 ms to minimize.
[2021-05-14 18:23:24] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 1 ms to minimize.
[2021-05-14 18:23:25] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 1 ms to minimize.
[2021-05-14 18:23:25] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 0 ms to minimize.
[2021-05-14 18:23:25] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 1 ms to minimize.
[2021-05-14 18:23:25] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 0 ms to minimize.
[2021-05-14 18:23:25] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 1 ms to minimize.
[2021-05-14 18:23:26] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 0 ms to minimize.
[2021-05-14 18:23:26] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 0 ms to minimize.
[2021-05-14 18:23:26] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 0 ms to minimize.
[2021-05-14 18:23:26] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 0 ms to minimize.
[2021-05-14 18:23:26] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 0 ms to minimize.
[2021-05-14 18:23:27] [INFO ] Deduced a trap composed of 73 places in 167 ms of which 0 ms to minimize.
[2021-05-14 18:23:27] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 0 ms to minimize.
[2021-05-14 18:23:27] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 1 ms to minimize.
[2021-05-14 18:23:27] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 0 ms to minimize.
[2021-05-14 18:23:27] [INFO ] Deduced a trap composed of 99 places in 157 ms of which 0 ms to minimize.
[2021-05-14 18:23:28] [INFO ] Deduced a trap composed of 59 places in 157 ms of which 1 ms to minimize.
[2021-05-14 18:23:28] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 0 ms to minimize.
[2021-05-14 18:23:28] [INFO ] Deduced a trap composed of 62 places in 179 ms of which 0 ms to minimize.
[2021-05-14 18:23:28] [INFO ] Deduced a trap composed of 87 places in 186 ms of which 1 ms to minimize.
[2021-05-14 18:23:28] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2021-05-14 18:23:29] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 0 ms to minimize.
[2021-05-14 18:23:29] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 0 ms to minimize.
[2021-05-14 18:23:29] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 0 ms to minimize.
[2021-05-14 18:23:29] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2021-05-14 18:23:30] [INFO ] Deduced a trap composed of 75 places in 178 ms of which 0 ms to minimize.
[2021-05-14 18:23:30] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 0 ms to minimize.
[2021-05-14 18:23:30] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 1 ms to minimize.
[2021-05-14 18:23:30] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 0 ms to minimize.
[2021-05-14 18:23:30] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 1 ms to minimize.
[2021-05-14 18:23:31] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 1 ms to minimize.
[2021-05-14 18:23:31] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 1 ms to minimize.
[2021-05-14 18:23:31] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 0 ms to minimize.
[2021-05-14 18:23:31] [INFO ] Deduced a trap composed of 71 places in 143 ms of which 0 ms to minimize.
[2021-05-14 18:23:31] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 0 ms to minimize.
[2021-05-14 18:23:31] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 0 ms to minimize.
[2021-05-14 18:23:38] [INFO ] Deduced a trap composed of 70 places in 6640 ms of which 0 ms to minimize.
[2021-05-14 18:23:38] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 1 ms to minimize.
[2021-05-14 18:23:38] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 0 ms to minimize.
[2021-05-14 18:23:39] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 1 ms to minimize.
[2021-05-14 18:23:39] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 1 ms to minimize.
[2021-05-14 18:23:39] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 0 ms to minimize.
[2021-05-14 18:23:39] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 1 ms to minimize.
[2021-05-14 18:23:39] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 1 ms to minimize.
[2021-05-14 18:23:40] [INFO ] Deduced a trap composed of 146 places in 202 ms of which 0 ms to minimize.
[2021-05-14 18:23:40] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 0 ms to minimize.
[2021-05-14 18:23:40] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 1 ms to minimize.
[2021-05-14 18:23:40] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 3 ms to minimize.
[2021-05-14 18:23:41] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 1 ms to minimize.
[2021-05-14 18:23:41] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 1 ms to minimize.
[2021-05-14 18:23:41] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 1 ms to minimize.
[2021-05-14 18:23:41] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 0 ms to minimize.
[2021-05-14 18:23:42] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 1 ms to minimize.
[2021-05-14 18:23:42] [INFO ] Deduced a trap composed of 76 places in 169 ms of which 0 ms to minimize.
[2021-05-14 18:23:42] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 1 ms to minimize.
[2021-05-14 18:23:42] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 0 ms to minimize.
[2021-05-14 18:23:42] [INFO ] Deduced a trap composed of 56 places in 215 ms of which 0 ms to minimize.
[2021-05-14 18:23:43] [INFO ] Deduced a trap composed of 82 places in 210 ms of which 0 ms to minimize.
[2021-05-14 18:23:43] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 0 ms to minimize.
[2021-05-14 18:23:43] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 1 ms to minimize.
[2021-05-14 18:23:43] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 0 ms to minimize.
[2021-05-14 18:23:44] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 1 ms to minimize.
[2021-05-14 18:23:44] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 0 ms to minimize.
[2021-05-14 18:23:44] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 1 ms to minimize.
[2021-05-14 18:23:44] [INFO ] Deduced a trap composed of 65 places in 162 ms of which 1 ms to minimize.
[2021-05-14 18:23:45] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 1 ms to minimize.
[2021-05-14 18:23:45] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 1 ms to minimize.
[2021-05-14 18:23:45] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 0 ms to minimize.
[2021-05-14 18:23:45] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 1 ms to minimize.
[2021-05-14 18:23:45] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 1 ms to minimize.
[2021-05-14 18:23:45] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 0 ms to minimize.
[2021-05-14 18:23:46] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 1 ms to minimize.
[2021-05-14 18:23: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) : [8] Max seen :[1]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 23 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 32 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2021-05-14 18:23:46] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2021-05-14 18:23:46] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-14 18:23:46] [INFO ] Implicit Places using invariants in 326 ms returned []
[2021-05-14 18:23:46] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2021-05-14 18:23:46] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 18:23:46] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:23:55] [INFO ] Implicit Places using invariants and state equation in 9048 ms returned []
Implicit Place search using SMT with State Equation took 9383 ms to find 0 implicit places.
[2021-05-14 18:23:55] [INFO ] Redundant transitions in 23 ms returned []
[2021-05-14 18:23:55] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2021-05-14 18:23:55] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-14 18:23:56] [INFO ] Dead Transitions using invariants and state equation in 578 ms returned []
Finished structural reductions, in 1 iterations. Remains : 592/592 places, 1704/1704 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-09 in 65432 ms.
Starting property specific reduction for Peterson-COL-7-UpperBounds-13
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2021-05-14 18:23:56] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :1
[2021-05-14 18:23:56] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2021-05-14 18:23:56] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-14 18:23:56] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2021-05-14 18:23:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:23:56] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2021-05-14 18:23:56] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:23:57] [INFO ] [Real]Added 546 Read/Feed constraints in 85 ms returned sat
[2021-05-14 18:23:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:23:57] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2021-05-14 18:23:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:23:57] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2021-05-14 18:23:57] [INFO ] [Nat]Added 546 Read/Feed constraints in 104 ms returned sat
[2021-05-14 18:23:58] [INFO ] Deduced a trap composed of 35 places in 443 ms of which 0 ms to minimize.
[2021-05-14 18:23:58] [INFO ] Deduced a trap composed of 91 places in 448 ms of which 0 ms to minimize.
[2021-05-14 18:23:59] [INFO ] Deduced a trap composed of 110 places in 439 ms of which 1 ms to minimize.
[2021-05-14 18:23:59] [INFO ] Deduced a trap composed of 72 places in 457 ms of which 0 ms to minimize.
[2021-05-14 18:24:00] [INFO ] Deduced a trap composed of 74 places in 434 ms of which 1 ms to minimize.
[2021-05-14 18:24:00] [INFO ] Deduced a trap composed of 53 places in 478 ms of which 3 ms to minimize.
[2021-05-14 18:24:01] [INFO ] Deduced a trap composed of 95 places in 472 ms of which 1 ms to minimize.
[2021-05-14 18:24:01] [INFO ] Deduced a trap composed of 70 places in 477 ms of which 1 ms to minimize.
[2021-05-14 18:24:02] [INFO ] Deduced a trap composed of 43 places in 488 ms of which 1 ms to minimize.
[2021-05-14 18:24:02] [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) : [448] Max seen :[4]
Support contains 448 out of 1096 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 1096 transition count 2200
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1088 transition count 2200
Applied a total of 16 rules in 50 ms. Remains 1088 /1096 variables (removed 8) and now considering 2200/2208 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1096 places, 2200/2208 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2021-05-14 18:24:02] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10206 ms. (steps per millisecond=97 ) properties (out of 1) seen :6
Interrupted Best-First random walk after 709364 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=141 ) properties seen :{0=3}
[2021-05-14 18:24:17] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2021-05-14 18:24:17] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-14 18:24:17] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2021-05-14 18:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:24:18] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2021-05-14 18:24:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:24:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2021-05-14 18:24:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:24:18] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2021-05-14 18:24:18] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:24:18] [INFO ] [Nat]Added 546 Read/Feed constraints in 107 ms returned sat
[2021-05-14 18:24:19] [INFO ] Deduced a trap composed of 219 places in 466 ms of which 1 ms to minimize.
[2021-05-14 18:24:20] [INFO ] Deduced a trap composed of 147 places in 496 ms of which 0 ms to minimize.
[2021-05-14 18:24:20] [INFO ] Deduced a trap composed of 131 places in 501 ms of which 1 ms to minimize.
[2021-05-14 18:24:21] [INFO ] Deduced a trap composed of 25 places in 439 ms of which 1 ms to minimize.
[2021-05-14 18:24:21] [INFO ] Deduced a trap composed of 69 places in 468 ms of which 0 ms to minimize.
[2021-05-14 18:24:22] [INFO ] Deduced a trap composed of 32 places in 553 ms of which 1 ms to minimize.
[2021-05-14 18:24:22] [INFO ] Deduced a trap composed of 28 places in 435 ms of which 1 ms to minimize.
[2021-05-14 18:24:23] [INFO ] Deduced a trap composed of 13 places in 459 ms of which 1 ms to minimize.
[2021-05-14 18:24:23] [INFO ] Deduced a trap composed of 86 places in 438 ms of which 1 ms to minimize.
[2021-05-14 18:24:24] [INFO ] Deduced a trap composed of 133 places in 503 ms of which 1 ms to minimize.
[2021-05-14 18:24:24] [INFO ] Deduced a trap composed of 89 places in 427 ms of which 1 ms to minimize.
[2021-05-14 18:24:25] [INFO ] Deduced a trap composed of 76 places in 477 ms of which 1 ms to minimize.
[2021-05-14 18:24:25] [INFO ] Deduced a trap composed of 93 places in 474 ms of which 1 ms to minimize.
[2021-05-14 18:24:26] [INFO ] Deduced a trap composed of 62 places in 430 ms of which 1 ms to minimize.
[2021-05-14 18:24:26] [INFO ] Deduced a trap composed of 41 places in 470 ms of which 1 ms to minimize.
[2021-05-14 18:24:27] [INFO ] Deduced a trap composed of 140 places in 476 ms of which 1 ms to minimize.
[2021-05-14 18:24:27] [INFO ] Deduced a trap composed of 77 places in 466 ms of which 1 ms to minimize.
[2021-05-14 18:24:28] [INFO ] Deduced a trap composed of 93 places in 468 ms of which 1 ms to minimize.
[2021-05-14 18:24:28] [INFO ] Deduced a trap composed of 59 places in 479 ms of which 1 ms to minimize.
[2021-05-14 18:24:29] [INFO ] Deduced a trap composed of 53 places in 435 ms of which 1 ms to minimize.
[2021-05-14 18:24:29] [INFO ] Deduced a trap composed of 96 places in 464 ms of which 0 ms to minimize.
[2021-05-14 18:24:30] [INFO ] Deduced a trap composed of 82 places in 470 ms of which 1 ms to minimize.
[2021-05-14 18:24:31] [INFO ] Deduced a trap composed of 35 places in 432 ms of which 1 ms to minimize.
[2021-05-14 18:24:31] [INFO ] Deduced a trap composed of 35 places in 492 ms of which 0 ms to minimize.
[2021-05-14 18:24:32] [INFO ] Deduced a trap composed of 33 places in 488 ms of which 1 ms to minimize.
[2021-05-14 18:24:32] [INFO ] Deduced a trap composed of 28 places in 482 ms of which 0 ms to minimize.
[2021-05-14 18:24:33] [INFO ] Deduced a trap composed of 28 places in 468 ms of which 1 ms to minimize.
[2021-05-14 18:24:33] [INFO ] Deduced a trap composed of 104 places in 449 ms of which 1 ms to minimize.
[2021-05-14 18:24:34] [INFO ] Deduced a trap composed of 108 places in 463 ms of which 1 ms to minimize.
[2021-05-14 18:24:34] [INFO ] Deduced a trap composed of 61 places in 377 ms of which 1 ms to minimize.
[2021-05-14 18:24:35] [INFO ] Deduced a trap composed of 86 places in 389 ms of which 1 ms to minimize.
[2021-05-14 18:24:35] [INFO ] Deduced a trap composed of 71 places in 406 ms of which 1 ms to minimize.
[2021-05-14 18:24:36] [INFO ] Deduced a trap composed of 115 places in 426 ms of which 1 ms to minimize.
[2021-05-14 18:24:36] [INFO ] Deduced a trap composed of 81 places in 377 ms of which 1 ms to minimize.
[2021-05-14 18:24:37] [INFO ] Deduced a trap composed of 29 places in 473 ms of which 1 ms to minimize.
[2021-05-14 18:24:37] [INFO ] Deduced a trap composed of 24 places in 480 ms of which 1 ms to minimize.
[2021-05-14 18:24:38] [INFO ] Deduced a trap composed of 20 places in 448 ms of which 1 ms to minimize.
[2021-05-14 18:24:38] [INFO ] Deduced a trap composed of 33 places in 435 ms of which 1 ms to minimize.
[2021-05-14 18:24:39] [INFO ] Deduced a trap composed of 21 places in 440 ms of which 1 ms to minimize.
[2021-05-14 18:24:39] [INFO ] Deduced a trap composed of 14 places in 440 ms of which 1 ms to minimize.
[2021-05-14 18:24:40] [INFO ] Deduced a trap composed of 28 places in 432 ms of which 1 ms to minimize.
[2021-05-14 18:24:40] [INFO ] Deduced a trap composed of 45 places in 473 ms of which 0 ms to minimize.
[2021-05-14 18:24:41] [INFO ] Deduced a trap composed of 77 places in 471 ms of which 1 ms to minimize.
[2021-05-14 18:24:41] [INFO ] Deduced a trap composed of 50 places in 476 ms of which 0 ms to minimize.
[2021-05-14 18:24:42] [INFO ] Deduced a trap composed of 107 places in 455 ms of which 1 ms to minimize.
[2021-05-14 18:24:42] [INFO ] Deduced a trap composed of 24 places in 471 ms of which 0 ms to minimize.
[2021-05-14 18:24:43] [INFO ] Deduced a trap composed of 15 places in 448 ms of which 1 ms to minimize.
[2021-05-14 18:24:43] [INFO ] Deduced a trap composed of 54 places in 405 ms of which 1 ms to minimize.
[2021-05-14 18:24:44] [INFO ] Deduced a trap composed of 61 places in 374 ms of which 2 ms to minimize.
[2021-05-14 18:24:44] [INFO ] Deduced a trap composed of 115 places in 394 ms of which 1 ms to minimize.
[2021-05-14 18:24:45] [INFO ] Deduced a trap composed of 55 places in 397 ms of which 1 ms to minimize.
[2021-05-14 18:24:45] [INFO ] Deduced a trap composed of 68 places in 443 ms of which 1 ms to minimize.
[2021-05-14 18:24:46] [INFO ] Deduced a trap composed of 25 places in 447 ms of which 1 ms to minimize.
[2021-05-14 18:24:46] [INFO ] Deduced a trap composed of 68 places in 427 ms of which 1 ms to minimize.
[2021-05-14 18:24:46] [INFO ] Deduced a trap composed of 138 places in 424 ms of which 1 ms to minimize.
[2021-05-14 18:24:47] [INFO ] Deduced a trap composed of 59 places in 424 ms of which 1 ms to minimize.
[2021-05-14 18:24:47] [INFO ] Deduced a trap composed of 58 places in 460 ms of which 1 ms to minimize.
[2021-05-14 18:24:48] [INFO ] Deduced a trap composed of 88 places in 392 ms of which 1 ms to minimize.
[2021-05-14 18:24:48] [INFO ] Deduced a trap composed of 76 places in 398 ms of which 1 ms to minimize.
[2021-05-14 18:24:49] [INFO ] Deduced a trap composed of 54 places in 465 ms of which 1 ms to minimize.
[2021-05-14 18:24:49] [INFO ] Deduced a trap composed of 46 places in 413 ms of which 1 ms to minimize.
[2021-05-14 18:24:50] [INFO ] Deduced a trap composed of 42 places in 447 ms of which 1 ms to minimize.
[2021-05-14 18:24:50] [INFO ] Deduced a trap composed of 136 places in 425 ms of which 1 ms to minimize.
[2021-05-14 18:24:51] [INFO ] Deduced a trap composed of 64 places in 436 ms of which 1 ms to minimize.
[2021-05-14 18:24:51] [INFO ] Deduced a trap composed of 228 places in 446 ms of which 1 ms to minimize.
[2021-05-14 18:24:52] [INFO ] Deduced a trap composed of 217 places in 431 ms of which 1 ms to minimize.
[2021-05-14 18:24:52] [INFO ] Deduced a trap composed of 90 places in 478 ms of which 1 ms to minimize.
[2021-05-14 18:24:53] [INFO ] Deduced a trap composed of 65 places in 483 ms of which 2 ms to minimize.
[2021-05-14 18:24:53] [INFO ] Deduced a trap composed of 199 places in 457 ms of which 1 ms to minimize.
[2021-05-14 18:24:54] [INFO ] Deduced a trap composed of 57 places in 441 ms of which 1 ms to minimize.
[2021-05-14 18:24:55] [INFO ] Deduced a trap composed of 34 places in 466 ms of which 1 ms to minimize.
[2021-05-14 18:24:55] [INFO ] Deduced a trap composed of 20 places in 439 ms of which 1 ms to minimize.
[2021-05-14 18:24:55] [INFO ] Deduced a trap composed of 20 places in 417 ms of which 1 ms to minimize.
[2021-05-14 18:24:56] [INFO ] Deduced a trap composed of 34 places in 456 ms of which 1 ms to minimize.
[2021-05-14 18:24:56] [INFO ] Deduced a trap composed of 17 places in 430 ms of which 1 ms to minimize.
[2021-05-14 18:24:57] [INFO ] Deduced a trap composed of 27 places in 407 ms of which 0 ms to minimize.
[2021-05-14 18:24:57] [INFO ] Deduced a trap composed of 17 places in 432 ms of which 1 ms to minimize.
[2021-05-14 18:24:58] [INFO ] Deduced a trap composed of 33 places in 430 ms of which 1 ms to minimize.
[2021-05-14 18:24:58] [INFO ] Deduced a trap composed of 11 places in 433 ms of which 1 ms to minimize.
[2021-05-14 18:24:59] [INFO ] Deduced a trap composed of 29 places in 432 ms of which 1 ms to minimize.
[2021-05-14 18:24:59] [INFO ] Deduced a trap composed of 100 places in 389 ms of which 1 ms to minimize.
[2021-05-14 18:25:00] [INFO ] Deduced a trap composed of 141 places in 393 ms of which 1 ms to minimize.
[2021-05-14 18:25:00] [INFO ] Deduced a trap composed of 107 places in 379 ms of which 0 ms to minimize.
[2021-05-14 18:25:01] [INFO ] Deduced a trap composed of 137 places in 363 ms of which 1 ms to minimize.
[2021-05-14 18:25:01] [INFO ] Deduced a trap composed of 86 places in 371 ms of which 1 ms to minimize.
[2021-05-14 18:25:02] [INFO ] Deduced a trap composed of 114 places in 224 ms of which 0 ms to minimize.
[2021-05-14 18:25:02] [INFO ] Deduced a trap composed of 125 places in 223 ms of which 1 ms to minimize.
[2021-05-14 18:25:02] [INFO ] Trap strengthening (SAT) tested/added 88/87 trap constraints in 43476 ms
[2021-05-14 18:25:02] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 136 ms.
[2021-05-14 18:25:03] [INFO ] Added : 20 causal constraints over 4 iterations in 874 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [448] Max seen :[6]
Incomplete Parikh walk after 625900 steps, including 1000 resets, run finished after 6292 ms. (steps per millisecond=99 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 40 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 39 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2021-05-14 18:25:09] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2021-05-14 18:25:09] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-14 18:25:10] [INFO ] Implicit Places using invariants in 443 ms returned []
[2021-05-14 18:25:10] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2021-05-14 18:25:10] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-14 18:25:10] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:25:16] [INFO ] Implicit Places using invariants and state equation in 6703 ms returned []
Implicit Place search using SMT with State Equation took 7148 ms to find 0 implicit places.
[2021-05-14 18:25:16] [INFO ] Redundant transitions in 36 ms returned []
[2021-05-14 18:25:16] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2021-05-14 18:25:16] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-14 18:25:17] [INFO ] Dead Transitions using invariants and state equation in 977 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2021-05-14 18:25:17] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10125 ms. (steps per millisecond=98 ) properties (out of 1) seen :7
Interrupted Best-First random walk after 694838 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=138 ) properties seen :{0=3}
[2021-05-14 18:25:33] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2021-05-14 18:25:33] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-14 18:25:33] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned sat
[2021-05-14 18:25:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:25:33] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2021-05-14 18:25:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:25:33] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2021-05-14 18:25:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:25:34] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2021-05-14 18:25:34] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:25:34] [INFO ] [Nat]Added 546 Read/Feed constraints in 112 ms returned sat
[2021-05-14 18:25:34] [INFO ] Deduced a trap composed of 13 places in 515 ms of which 1 ms to minimize.
[2021-05-14 18:25:35] [INFO ] Deduced a trap composed of 32 places in 546 ms of which 1 ms to minimize.
[2021-05-14 18:25:35] [INFO ] Deduced a trap composed of 21 places in 443 ms of which 1 ms to minimize.
[2021-05-14 18:25:36] [INFO ] Deduced a trap composed of 57 places in 446 ms of which 1 ms to minimize.
[2021-05-14 18:25:37] [INFO ] Deduced a trap composed of 94 places in 442 ms of which 1 ms to minimize.
[2021-05-14 18:25:37] [INFO ] Deduced a trap composed of 45 places in 447 ms of which 1 ms to minimize.
[2021-05-14 18:25:38] [INFO ] Deduced a trap composed of 57 places in 494 ms of which 1 ms to minimize.
[2021-05-14 18:25:38] [INFO ] Deduced a trap composed of 85 places in 497 ms of which 1 ms to minimize.
[2021-05-14 18:25:39] [INFO ] Deduced a trap composed of 70 places in 489 ms of which 0 ms to minimize.
[2021-05-14 18:25:39] [INFO ] Deduced a trap composed of 57 places in 494 ms of which 0 ms to minimize.
[2021-05-14 18:25:40] [INFO ] Deduced a trap composed of 86 places in 483 ms of which 1 ms to minimize.
[2021-05-14 18:25:40] [INFO ] Deduced a trap composed of 157 places in 470 ms of which 1 ms to minimize.
[2021-05-14 18:25:41] [INFO ] Deduced a trap composed of 89 places in 468 ms of which 1 ms to minimize.
[2021-05-14 18:25:41] [INFO ] Deduced a trap composed of 96 places in 495 ms of which 1 ms to minimize.
[2021-05-14 18:25:42] [INFO ] Deduced a trap composed of 134 places in 490 ms of which 0 ms to minimize.
[2021-05-14 18:25:43] [INFO ] Deduced a trap composed of 128 places in 497 ms of which 1 ms to minimize.
[2021-05-14 18:25:43] [INFO ] Deduced a trap composed of 110 places in 445 ms of which 1 ms to minimize.
[2021-05-14 18:25:44] [INFO ] Deduced a trap composed of 41 places in 491 ms of which 1 ms to minimize.
[2021-05-14 18:25:44] [INFO ] Deduced a trap composed of 37 places in 471 ms of which 1 ms to minimize.
[2021-05-14 18:25:45] [INFO ] Deduced a trap composed of 77 places in 503 ms of which 1 ms to minimize.
[2021-05-14 18:25:45] [INFO ] Deduced a trap composed of 33 places in 482 ms of which 1 ms to minimize.
[2021-05-14 18:25:46] [INFO ] Deduced a trap composed of 58 places in 491 ms of which 1 ms to minimize.
[2021-05-14 18:25:46] [INFO ] Deduced a trap composed of 74 places in 448 ms of which 1 ms to minimize.
[2021-05-14 18:25:47] [INFO ] Deduced a trap composed of 73 places in 479 ms of which 1 ms to minimize.
[2021-05-14 18:25:47] [INFO ] Deduced a trap composed of 74 places in 447 ms of which 1 ms to minimize.
[2021-05-14 18:25:48] [INFO ] Deduced a trap composed of 13 places in 489 ms of which 1 ms to minimize.
[2021-05-14 18:25:48] [INFO ] Deduced a trap composed of 115 places in 490 ms of which 1 ms to minimize.
[2021-05-14 18:25:49] [INFO ] Deduced a trap composed of 43 places in 490 ms of which 1 ms to minimize.
[2021-05-14 18:25:49] [INFO ] Deduced a trap composed of 39 places in 450 ms of which 1 ms to minimize.
[2021-05-14 18:25:50] [INFO ] Deduced a trap composed of 61 places in 461 ms of which 1 ms to minimize.
[2021-05-14 18:25:51] [INFO ] Deduced a trap composed of 157 places in 467 ms of which 1 ms to minimize.
[2021-05-14 18:25:51] [INFO ] Deduced a trap composed of 31 places in 447 ms of which 1 ms to minimize.
[2021-05-14 18:25:52] [INFO ] Deduced a trap composed of 21 places in 473 ms of which 1 ms to minimize.
[2021-05-14 18:25:52] [INFO ] Deduced a trap composed of 66 places in 478 ms of which 17 ms to minimize.
[2021-05-14 18:25:53] [INFO ] Deduced a trap composed of 61 places in 463 ms of which 1 ms to minimize.
[2021-05-14 18:25:53] [INFO ] Deduced a trap composed of 69 places in 436 ms of which 1 ms to minimize.
[2021-05-14 18:25:54] [INFO ] Deduced a trap composed of 60 places in 485 ms of which 1 ms to minimize.
[2021-05-14 18:25:54] [INFO ] Deduced a trap composed of 95 places in 495 ms of which 1 ms to minimize.
[2021-05-14 18:25:55] [INFO ] Deduced a trap composed of 82 places in 470 ms of which 1 ms to minimize.
[2021-05-14 18:25:55] [INFO ] Deduced a trap composed of 11 places in 463 ms of which 1 ms to minimize.
[2021-05-14 18:25:56] [INFO ] Deduced a trap composed of 144 places in 430 ms of which 1 ms to minimize.
[2021-05-14 18:25:56] [INFO ] Deduced a trap composed of 150 places in 397 ms of which 1 ms to minimize.
[2021-05-14 18:25:57] [INFO ] Deduced a trap composed of 73 places in 449 ms of which 0 ms to minimize.
[2021-05-14 18:25:57] [INFO ] Deduced a trap composed of 84 places in 437 ms of which 1 ms to minimize.
[2021-05-14 18:25:58] [INFO ] Deduced a trap composed of 113 places in 439 ms of which 1 ms to minimize.
[2021-05-14 18:25:58] [INFO ] Deduced a trap composed of 106 places in 442 ms of which 1 ms to minimize.
[2021-05-14 18:25:59] [INFO ] Deduced a trap composed of 115 places in 436 ms of which 0 ms to minimize.
[2021-05-14 18:25:59] [INFO ] Deduced a trap composed of 207 places in 463 ms of which 1 ms to minimize.
[2021-05-14 18:26:00] [INFO ] Deduced a trap composed of 87 places in 437 ms of which 1 ms to minimize.
[2021-05-14 18:26:00] [INFO ] Deduced a trap composed of 130 places in 478 ms of which 1 ms to minimize.
[2021-05-14 18:26:01] [INFO ] Deduced a trap composed of 49 places in 437 ms of which 1 ms to minimize.
[2021-05-14 18:26:01] [INFO ] Deduced a trap composed of 46 places in 432 ms of which 0 ms to minimize.
[2021-05-14 18:26:02] [INFO ] Deduced a trap composed of 118 places in 374 ms of which 1 ms to minimize.
[2021-05-14 18:26:02] [INFO ] Deduced a trap composed of 83 places in 374 ms of which 1 ms to minimize.
[2021-05-14 18:26:02] [INFO ] Deduced a trap composed of 77 places in 345 ms of which 1 ms to minimize.
[2021-05-14 18:26:03] [INFO ] Deduced a trap composed of 69 places in 351 ms of which 1 ms to minimize.
[2021-05-14 18:26:03] [INFO ] Deduced a trap composed of 97 places in 395 ms of which 0 ms to minimize.
[2021-05-14 18:26:04] [INFO ] Deduced a trap composed of 125 places in 379 ms of which 1 ms to minimize.
[2021-05-14 18:26:04] [INFO ] Deduced a trap composed of 100 places in 346 ms of which 0 ms to minimize.
[2021-05-14 18:26:05] [INFO ] Deduced a trap composed of 137 places in 348 ms of which 1 ms to minimize.
[2021-05-14 18:26:05] [INFO ] Deduced a trap composed of 95 places in 374 ms of which 0 ms to minimize.
[2021-05-14 18:26:06] [INFO ] Deduced a trap composed of 87 places in 388 ms of which 1 ms to minimize.
[2021-05-14 18:26:06] [INFO ] Deduced a trap composed of 96 places in 387 ms of which 1 ms to minimize.
[2021-05-14 18:26:07] [INFO ] Deduced a trap composed of 51 places in 481 ms of which 1 ms to minimize.
[2021-05-14 18:26:07] [INFO ] Deduced a trap composed of 51 places in 435 ms of which 1 ms to minimize.
[2021-05-14 18:26:07] [INFO ] Deduced a trap composed of 103 places in 428 ms of which 1 ms to minimize.
[2021-05-14 18:26:08] [INFO ] Deduced a trap composed of 53 places in 419 ms of which 1 ms to minimize.
[2021-05-14 18:26:09] [INFO ] Deduced a trap composed of 17 places in 525 ms of which 1 ms to minimize.
[2021-05-14 18:26:09] [INFO ] Deduced a trap composed of 13 places in 499 ms of which 1 ms to minimize.
[2021-05-14 18:26:10] [INFO ] Deduced a trap composed of 63 places in 408 ms of which 1 ms to minimize.
[2021-05-14 18:26:10] [INFO ] Deduced a trap composed of 158 places in 400 ms of which 1 ms to minimize.
[2021-05-14 18:26:11] [INFO ] Deduced a trap composed of 85 places in 407 ms of which 0 ms to minimize.
[2021-05-14 18:26:11] [INFO ] Deduced a trap composed of 15 places in 490 ms of which 1 ms to minimize.
[2021-05-14 18:26:12] [INFO ] Deduced a trap composed of 84 places in 396 ms of which 0 ms to minimize.
[2021-05-14 18:26:12] [INFO ] Deduced a trap composed of 115 places in 375 ms of which 1 ms to minimize.
[2021-05-14 18:26:13] [INFO ] Deduced a trap composed of 69 places in 383 ms of which 1 ms to minimize.
[2021-05-14 18:26:13] [INFO ] Deduced a trap composed of 83 places in 488 ms of which 0 ms to minimize.
[2021-05-14 18:26:14] [INFO ] Deduced a trap composed of 62 places in 423 ms of which 1 ms to minimize.
[2021-05-14 18:26:14] [INFO ] Deduced a trap composed of 96 places in 471 ms of which 1 ms to minimize.
[2021-05-14 18:26:15] [INFO ] Deduced a trap composed of 60 places in 475 ms of which 1 ms to minimize.
[2021-05-14 18:26:15] [INFO ] Deduced a trap composed of 81 places in 465 ms of which 0 ms to minimize.
[2021-05-14 18:26:16] [INFO ] Deduced a trap composed of 113 places in 458 ms of which 1 ms to minimize.
[2021-05-14 18:26:16] [INFO ] Deduced a trap composed of 96 places in 435 ms of which 1 ms to minimize.
[2021-05-14 18:26:17] [INFO ] Deduced a trap composed of 51 places in 439 ms of which 1 ms to minimize.
[2021-05-14 18:26:17] [INFO ] Deduced a trap composed of 80 places in 393 ms of which 0 ms to minimize.
[2021-05-14 18:26:18] [INFO ] Deduced a trap composed of 84 places in 441 ms of which 1 ms to minimize.
[2021-05-14 18:26:18] [INFO ] Deduced a trap composed of 43 places in 393 ms of which 1 ms to minimize.
[2021-05-14 18:26:18] [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) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 25 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 28 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2021-05-14 18:26:18] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2021-05-14 18:26:18] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-14 18:26:19] [INFO ] Implicit Places using invariants in 429 ms returned []
[2021-05-14 18:26:19] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2021-05-14 18:26:19] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-14 18:26:19] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:26:26] [INFO ] Implicit Places using invariants and state equation in 7146 ms returned []
Implicit Place search using SMT with State Equation took 7583 ms to find 0 implicit places.
[2021-05-14 18:26:26] [INFO ] Redundant transitions in 36 ms returned []
[2021-05-14 18:26:26] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2021-05-14 18:26:26] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-14 18:26:27] [INFO ] Dead Transitions using invariants and state equation in 852 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2021-05-14 18:26:27] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10236 ms. (steps per millisecond=97 ) properties (out of 1) seen :6
Interrupted Best-First random walk after 680951 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=136 ) properties seen :{0=4}
[2021-05-14 18:26:42] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2021-05-14 18:26:42] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-14 18:26:42] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2021-05-14 18:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 18:26:43] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2021-05-14 18:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 18:26:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2021-05-14 18:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 18:26:43] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2021-05-14 18:26:43] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:26:43] [INFO ] [Nat]Added 546 Read/Feed constraints in 110 ms returned sat
[2021-05-14 18:26:44] [INFO ] Deduced a trap composed of 13 places in 476 ms of which 1 ms to minimize.
[2021-05-14 18:26:44] [INFO ] Deduced a trap composed of 32 places in 487 ms of which 1 ms to minimize.
[2021-05-14 18:26:45] [INFO ] Deduced a trap composed of 21 places in 483 ms of which 1 ms to minimize.
[2021-05-14 18:26:45] [INFO ] Deduced a trap composed of 57 places in 496 ms of which 1 ms to minimize.
[2021-05-14 18:26:58] [INFO ] Deduced a trap composed of 94 places in 12398 ms of which 1 ms to minimize.
[2021-05-14 18:26:58] [INFO ] Deduced a trap composed of 45 places in 449 ms of which 1 ms to minimize.
[2021-05-14 18:26:59] [INFO ] Deduced a trap composed of 57 places in 438 ms of which 1 ms to minimize.
[2021-05-14 18:26:59] [INFO ] Deduced a trap composed of 85 places in 498 ms of which 1 ms to minimize.
[2021-05-14 18:27:00] [INFO ] Deduced a trap composed of 70 places in 492 ms of which 1 ms to minimize.
[2021-05-14 18:27:01] [INFO ] Deduced a trap composed of 57 places in 500 ms of which 3 ms to minimize.
[2021-05-14 18:27:01] [INFO ] Deduced a trap composed of 86 places in 482 ms of which 1 ms to minimize.
[2021-05-14 18:27:02] [INFO ] Deduced a trap composed of 157 places in 479 ms of which 1 ms to minimize.
[2021-05-14 18:27:02] [INFO ] Deduced a trap composed of 89 places in 484 ms of which 1 ms to minimize.
[2021-05-14 18:27:03] [INFO ] Deduced a trap composed of 96 places in 481 ms of which 1 ms to minimize.
[2021-05-14 18:27:03] [INFO ] Deduced a trap composed of 134 places in 460 ms of which 1 ms to minimize.
[2021-05-14 18:27:04] [INFO ] Deduced a trap composed of 128 places in 451 ms of which 1 ms to minimize.
[2021-05-14 18:27:04] [INFO ] Deduced a trap composed of 110 places in 497 ms of which 1 ms to minimize.
[2021-05-14 18:27:05] [INFO ] Deduced a trap composed of 41 places in 447 ms of which 1 ms to minimize.
[2021-05-14 18:27:05] [INFO ] Deduced a trap composed of 37 places in 474 ms of which 1 ms to minimize.
[2021-05-14 18:27:06] [INFO ] Deduced a trap composed of 77 places in 443 ms of which 1 ms to minimize.
[2021-05-14 18:27:06] [INFO ] Deduced a trap composed of 33 places in 488 ms of which 1 ms to minimize.
[2021-05-14 18:27:07] [INFO ] Deduced a trap composed of 58 places in 441 ms of which 1 ms to minimize.
[2021-05-14 18:27:07] [INFO ] Deduced a trap composed of 74 places in 488 ms of which 1 ms to minimize.
[2021-05-14 18:27:08] [INFO ] Deduced a trap composed of 73 places in 495 ms of which 1 ms to minimize.
[2021-05-14 18:27:09] [INFO ] Deduced a trap composed of 74 places in 490 ms of which 1 ms to minimize.
[2021-05-14 18:27:09] [INFO ] Deduced a trap composed of 13 places in 475 ms of which 1 ms to minimize.
[2021-05-14 18:27:10] [INFO ] Deduced a trap composed of 115 places in 470 ms of which 1 ms to minimize.
[2021-05-14 18:27:10] [INFO ] Deduced a trap composed of 43 places in 476 ms of which 0 ms to minimize.
[2021-05-14 18:27:11] [INFO ] Deduced a trap composed of 39 places in 475 ms of which 1 ms to minimize.
[2021-05-14 18:27:11] [INFO ] Deduced a trap composed of 61 places in 441 ms of which 1 ms to minimize.
[2021-05-14 18:27:12] [INFO ] Deduced a trap composed of 157 places in 442 ms of which 1 ms to minimize.
[2021-05-14 18:27:12] [INFO ] Deduced a trap composed of 31 places in 439 ms of which 1 ms to minimize.
[2021-05-14 18:27:13] [INFO ] Deduced a trap composed of 21 places in 446 ms of which 1 ms to minimize.
[2021-05-14 18:27:13] [INFO ] Deduced a trap composed of 66 places in 501 ms of which 1 ms to minimize.
[2021-05-14 18:27:14] [INFO ] Deduced a trap composed of 61 places in 489 ms of which 1 ms to minimize.
[2021-05-14 18:27:14] [INFO ] Deduced a trap composed of 69 places in 490 ms of which 1 ms to minimize.
[2021-05-14 18:27:15] [INFO ] Deduced a trap composed of 60 places in 488 ms of which 1 ms to minimize.
[2021-05-14 18:27:15] [INFO ] Deduced a trap composed of 95 places in 486 ms of which 1 ms to minimize.
[2021-05-14 18:27:16] [INFO ] Deduced a trap composed of 82 places in 439 ms of which 1 ms to minimize.
[2021-05-14 18:27:16] [INFO ] Deduced a trap composed of 11 places in 495 ms of which 1 ms to minimize.
[2021-05-14 18:27:17] [INFO ] Deduced a trap composed of 144 places in 431 ms of which 1 ms to minimize.
[2021-05-14 18:27:17] [INFO ] Deduced a trap composed of 150 places in 443 ms of which 1 ms to minimize.
[2021-05-14 18:27:18] [INFO ] Deduced a trap composed of 73 places in 447 ms of which 1 ms to minimize.
[2021-05-14 18:27:18] [INFO ] Deduced a trap composed of 84 places in 444 ms of which 1 ms to minimize.
[2021-05-14 18:27:19] [INFO ] Deduced a trap composed of 113 places in 422 ms of which 1 ms to minimize.
[2021-05-14 18:27:19] [INFO ] Deduced a trap composed of 106 places in 458 ms of which 1 ms to minimize.
[2021-05-14 18:27:20] [INFO ] Deduced a trap composed of 115 places in 407 ms of which 1 ms to minimize.
[2021-05-14 18:27:20] [INFO ] Deduced a trap composed of 207 places in 424 ms of which 1 ms to minimize.
[2021-05-14 18:27:21] [INFO ] Deduced a trap composed of 87 places in 451 ms of which 1 ms to minimize.
[2021-05-14 18:27:21] [INFO ] Deduced a trap composed of 130 places in 428 ms of which 0 ms to minimize.
[2021-05-14 18:27:22] [INFO ] Deduced a trap composed of 49 places in 448 ms of which 1 ms to minimize.
[2021-05-14 18:27:22] [INFO ] Deduced a trap composed of 46 places in 408 ms of which 1 ms to minimize.
[2021-05-14 18:27:23] [INFO ] Deduced a trap composed of 118 places in 353 ms of which 0 ms to minimize.
[2021-05-14 18:27:23] [INFO ] Deduced a trap composed of 83 places in 380 ms of which 0 ms to minimize.
[2021-05-14 18:27:24] [INFO ] Deduced a trap composed of 77 places in 375 ms of which 1 ms to minimize.
[2021-05-14 18:27:24] [INFO ] Deduced a trap composed of 69 places in 377 ms of which 1 ms to minimize.
[2021-05-14 18:27:25] [INFO ] Deduced a trap composed of 97 places in 353 ms of which 0 ms to minimize.
[2021-05-14 18:27:25] [INFO ] Deduced a trap composed of 125 places in 352 ms of which 1 ms to minimize.
[2021-05-14 18:27:25] [INFO ] Deduced a trap composed of 100 places in 366 ms of which 1 ms to minimize.
[2021-05-14 18:27:26] [INFO ] Deduced a trap composed of 137 places in 370 ms of which 1 ms to minimize.
[2021-05-14 18:27:26] [INFO ] Deduced a trap composed of 95 places in 374 ms of which 0 ms to minimize.
[2021-05-14 18:27:27] [INFO ] Deduced a trap composed of 87 places in 372 ms of which 1 ms to minimize.
[2021-05-14 18:27:27] [INFO ] Deduced a trap composed of 96 places in 374 ms of which 1 ms to minimize.
[2021-05-14 18:27:28] [INFO ] Deduced a trap composed of 51 places in 485 ms of which 1 ms to minimize.
[2021-05-14 18:27:28] [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) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 24 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 23 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2021-05-14 18:27:28] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2021-05-14 18:27:28] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-14 18:27:28] [INFO ] Implicit Places using invariants in 388 ms returned []
[2021-05-14 18:27:28] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2021-05-14 18:27:28] [INFO ] Computed 23 place invariants in 6 ms
[2021-05-14 18:27:29] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 18:27:34] [INFO ] Implicit Places using invariants and state equation in 6359 ms returned []
Implicit Place search using SMT with State Equation took 6747 ms to find 0 implicit places.
[2021-05-14 18:27:34] [INFO ] Redundant transitions in 36 ms returned []
[2021-05-14 18:27:34] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2021-05-14 18:27:34] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-14 18:27:35] [INFO ] Dead Transitions using invariants and state equation in 921 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-13 in 219677 ms.
[2021-05-14 18:27:40] [INFO ] Flatten gal took : 181 ms
[2021-05-14 18:27:41] [INFO ] Applying decomposition
[2021-05-14 18:27:41] [INFO ] Flatten gal took : 124 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/graph14644011845687307306.txt, -o, /tmp/graph14644011845687307306.bin, -w, /tmp/graph14644011845687307306.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/graph14644011845687307306.bin, -l, -1, -v, -w, /tmp/graph14644011845687307306.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 18:27:41] [INFO ] Decomposing Gal with order
[2021-05-14 18:27:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 18:27:41] [INFO ] Removed a total of 3174 redundant transitions.
[2021-05-14 18:27:41] [INFO ] Flatten gal took : 211 ms
[2021-05-14 18:27:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 67 ms.
[2021-05-14 18:27:42] [INFO ] Time to serialize gal into /tmp/UpperBounds14815760956172157609.gal : 21 ms
[2021-05-14 18:27:42] [INFO ] Time to serialize properties into /tmp/UpperBounds9713860206977740124.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/UpperBounds14815760956172157609.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9713860206977740124.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/UpperBounds14815760956172157609.gal -t CGAL -reachable-file /tmp/UpperBounds9713860206977740124.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds9713860206977740124.prop.
Detected timeout of ITS tools.
[2021-05-14 18:52:40] [INFO ] Applying decomposition
[2021-05-14 18:52:40] [INFO ] Flatten gal took : 382 ms
[2021-05-14 18:52:40] [INFO ] Decomposing Gal with order
[2021-05-14 18:52:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 18:52:41] [INFO ] Removed a total of 3336 redundant transitions.
[2021-05-14 18:52:41] [INFO ] Flatten gal took : 449 ms
[2021-05-14 18:52:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 68 ms.
[2021-05-14 18:52:41] [INFO ] Time to serialize gal into /tmp/UpperBounds5498697702998439327.gal : 50 ms
[2021-05-14 18:52:41] [INFO ] Time to serialize properties into /tmp/UpperBounds12264441236976629206.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds5498697702998439327.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12264441236976629206.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/UpperBounds5498697702998439327.gal -t CGAL -reachable-file /tmp/UpperBounds12264441236976629206.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds12264441236976629206.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-7"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-COL-7, 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 r140-tall-162089128100595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-7.tgz
mv Peterson-COL-7 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;