MCC'2022- Execution of r179-tall-165277026700034

About the Execution of 2021-gold for Peterson-PT-7

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16245.176	3600000.00	2901632.00	475599.00	8 ? 7 ? 8 7 7 ? ? 1 1 1 ? 1 1 1	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 283K Apr 30 10:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 30 10:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 190K Apr 30 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 861K Apr 30 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 168K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 481K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 122K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 417K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 59K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.3M May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652824228795

Running Version 0
[2022-05-17 21:50:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 21:50:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:50:30] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2022-05-17 21:50:30] [INFO ] Transformed 1992 places.
[2022-05-17 21:50:30] [INFO ] Transformed 3096 transitions.
[2022-05-17 21:50:30] [INFO ] Found NUPN structural information;
[2022-05-17 21:50:30] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_2_0_5, IsEndLoop_0_3_6, IsEndLoop_0_2_7, EndTurn_4_2, EndTurn_4_1, EndTurn_7_0, EndTurn_6_0, EndTurn_5_0, IsEndLoop_7_6_7, IsEndLoop_6_6_7, IsEndLoop_5_6_7, BeginLoop_1_4_2, BeginLoop_0_4_2, BeginLoop_3_0_4, BeginLoop_3_6_3, BeginLoop_0_6_5, BeginLoop_3_6_5, BeginLoop_4_2_7, BeginLoop_7_1_7, BeginLoop_5_1_7, BeginLoop_6_1_7, BeginLoop_4_1_7, BeginLoop_7_0_7, BeginLoop_6_0_7, BeginLoop_5_0_7, TestAlone_2_4_0, TestAlone_2_5_0, TestAlone_3_6_1, TestAlone_3_0_2, TestAlone_1_5_5, TestAlone_0_5_5, TestAlone_3_5_6, TestAlone_2_5_6, TestIdentity_4_2_1, TestIdentity_4_3_1, TestIdentity_7_2_1, TestIdentity_5_2_1, TestIdentity_6_2_1, TestIdentity_7_6_0, TestIdentity_6_6_0, TestIdentity_5_6_0, TestIdentity_0_2_3, TestIdentity_1_2_3, TestIdentity_1_1_6, TestIdentity_0_2_6, TestIdentity_2_4_4, TestIdentity_1_4_4, TestIdentity_4_5_7, TestIdentity_6_4_7, TestIdentity_5_4_7, TestIdentity_7_4_7, TestIdentity_4_4_7, TestIdentity_6_3_7, TestIdentity_5_3_7, TestIdentity_7_3_7, CS_0, CS_2, AskForSection_2_5, AskForSection_0_5]
[2022-05-17 21:50:30] [INFO ] Parsed PT model containing 1992 places and 3096 transitions in 187 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 90 ms.
FORMULA Peterson-PT-7-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2760 out of 3096 initially.
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 21:50:30] [INFO ] Computed 31 place invariants in 48 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 11) seen :19
FORMULA Peterson-PT-7-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :16
[2022-05-17 21:50:31] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 21:50:31] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-17 21:50:31] [INFO ] [Real]Absence check using 23 positive place invariants in 45 ms returned unsat
[2022-05-17 21:50:32] [INFO ] [Real]Absence check using 23 positive place invariants in 36 ms returned sat
[2022-05-17 21:50:32] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:50:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:32] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2022-05-17 21:50:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:50:33] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2022-05-17 21:50:33] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-17 21:50:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:34] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2022-05-17 21:50:34] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 21:50:34] [INFO ] [Nat]Added 546 Read/Feed constraints in 143 ms returned sat
[2022-05-17 21:50:35] [INFO ] Deduced a trap composed of 68 places in 1069 ms of which 10 ms to minimize.
[2022-05-17 21:50:36] [INFO ] Deduced a trap composed of 89 places in 1038 ms of which 3 ms to minimize.
[2022-05-17 21:50:37] [INFO ] Deduced a trap composed of 56 places in 1055 ms of which 5 ms to minimize.
[2022-05-17 21:50:38] [INFO ] Deduced a trap composed of 56 places in 943 ms of which 3 ms to minimize.
[2022-05-17 21:50:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:50:39] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2022-05-17 21:50:39] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:50:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:39] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2022-05-17 21:50:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:50:40] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2022-05-17 21:50:40] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:50:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:41] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2022-05-17 21:50:41] [INFO ] [Nat]Added 546 Read/Feed constraints in 200 ms returned sat
[2022-05-17 21:50:42] [INFO ] Deduced a trap composed of 85 places in 944 ms of which 3 ms to minimize.
[2022-05-17 21:50:43] [INFO ] Deduced a trap composed of 120 places in 937 ms of which 1 ms to minimize.
[2022-05-17 21:50:44] [INFO ] Deduced a trap composed of 120 places in 931 ms of which 2 ms to minimize.
[2022-05-17 21:50:45] [INFO ] Deduced a trap composed of 120 places in 892 ms of which 2 ms to minimize.
[2022-05-17 21:50:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:50:45] [INFO ] [Real]Absence check using 23 positive place invariants in 36 ms returned sat
[2022-05-17 21:50:45] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:46] [INFO ] [Real]Absence check using state equation in 781 ms returned sat
[2022-05-17 21:50:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:50:46] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2022-05-17 21:50:46] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 21:50:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:47] [INFO ] [Nat]Absence check using state equation in 770 ms returned sat
[2022-05-17 21:50:47] [INFO ] [Nat]Added 546 Read/Feed constraints in 148 ms returned sat
[2022-05-17 21:50:48] [INFO ] Deduced a trap composed of 68 places in 1041 ms of which 4 ms to minimize.
[2022-05-17 21:50:49] [INFO ] Deduced a trap composed of 89 places in 1039 ms of which 1 ms to minimize.
[2022-05-17 21:50:51] [INFO ] Deduced a trap composed of 56 places in 1036 ms of which 1 ms to minimize.
[2022-05-17 21:50:52] [INFO ] Deduced a trap composed of 56 places in 1035 ms of which 1 ms to minimize.
[2022-05-17 21:50: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 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:50:52] [INFO ] [Real]Absence check using 23 positive place invariants in 34 ms returned sat
[2022-05-17 21:50:52] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:53] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2022-05-17 21:50:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:50:53] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2022-05-17 21:50:53] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:54] [INFO ] [Nat]Absence check using state equation in 775 ms returned sat
[2022-05-17 21:50:54] [INFO ] [Nat]Added 546 Read/Feed constraints in 154 ms returned sat
[2022-05-17 21:50:55] [INFO ] Deduced a trap composed of 34 places in 727 ms of which 1 ms to minimize.
[2022-05-17 21:50:56] [INFO ] Deduced a trap composed of 34 places in 724 ms of which 2 ms to minimize.
[2022-05-17 21:50:57] [INFO ] Deduced a trap composed of 60 places in 727 ms of which 1 ms to minimize.
[2022-05-17 21:50:57] [INFO ] Deduced a trap composed of 60 places in 703 ms of which 1 ms to minimize.
[2022-05-17 21:50:58] [INFO ] Deduced a trap composed of 45 places in 704 ms of which 1 ms to minimize.
[2022-05-17 21:50:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:50:58] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2022-05-17 21:50:58] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:50:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:59] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2022-05-17 21:50:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:51:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 44 ms returned sat
[2022-05-17 21:51:00] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:51:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:51:00] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2022-05-17 21:51:00] [INFO ] [Nat]Added 546 Read/Feed constraints in 140 ms returned sat
[2022-05-17 21:51:01] [INFO ] Deduced a trap composed of 62 places in 734 ms of which 1 ms to minimize.
[2022-05-17 21:51:02] [INFO ] Deduced a trap composed of 63 places in 730 ms of which 1 ms to minimize.
[2022-05-17 21:51:03] [INFO ] Deduced a trap composed of 63 places in 730 ms of which 1 ms to minimize.
[2022-05-17 21:51:04] [INFO ] Deduced a trap composed of 74 places in 755 ms of which 1 ms to minimize.
[2022-05-17 21:51:05] [INFO ] Deduced a trap composed of 142 places in 733 ms of which 1 ms to minimize.
[2022-05-17 21:51:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:51:05] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2022-05-17 21:51:05] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:51:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:51:06] [INFO ] [Real]Absence check using state equation in 762 ms returned sat
[2022-05-17 21:51:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:51:06] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2022-05-17 21:51:06] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:51:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:51:07] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2022-05-17 21:51:07] [INFO ] [Nat]Added 546 Read/Feed constraints in 159 ms returned sat
[2022-05-17 21:51:08] [INFO ] Deduced a trap composed of 17 places in 740 ms of which 1 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 13 places in 738 ms of which 1 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 13 places in 774 ms of which 2 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 108 places in 732 ms of which 1 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 17 places in 753 ms of which 1 ms to minimize.
[2022-05-17 21:51:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:51:11] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2022-05-17 21:51:12] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:51:12] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2022-05-17 21:51:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:51:13] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2022-05-17 21:51:13] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:51:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:51:13] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2022-05-17 21:51:14] [INFO ] [Nat]Added 546 Read/Feed constraints in 159 ms returned sat
[2022-05-17 21:51:14] [INFO ] Deduced a trap composed of 25 places in 888 ms of which 1 ms to minimize.
[2022-05-17 21:51:15] [INFO ] Deduced a trap composed of 168 places in 898 ms of which 2 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 36 places in 879 ms of which 1 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 70 places in 876 ms of which 2 ms to minimize.
[2022-05-17 21:51:17] [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 7
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, 448, 56, 448, 8, 1, 1, 1] Max seen :[8, 3, 7, 3, 1, 0, 0, 0]
FORMULA Peterson-PT-7-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 514 out of 1992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 1992 transition count 2706
Reduce places removed 390 places and 0 transitions.
Performed 391 Post agglomeration using F-continuation condition.Transition count delta: 391
Iterating post reduction 1 with 781 rules applied. Total rules applied 1171 place count 1602 transition count 2315
Reduce places removed 391 places and 0 transitions.
Iterating post reduction 2 with 391 rules applied. Total rules applied 1562 place count 1211 transition count 2315
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 1562 place count 1211 transition count 2259
Deduced a syphon composed of 56 places in 5 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1674 place count 1155 transition count 2259
Applied a total of 1674 rules in 295 ms. Remains 1155 /1992 variables (removed 837) and now considering 2259/3096 (removed 837) transitions.
Finished structural reductions, in 1 iterations. Remains : 1155/1992 places, 2259/3096 transitions.
Normalized transition count is 1923 out of 2259 initially.
// Phase 1: matrix 1923 rows 1155 cols
[2022-05-17 21:51:18] [INFO ] Computed 31 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10092 ms. (steps per millisecond=99 ) properties (out of 7) seen :19
Interrupted Best-First random walk after 780896 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=156 ) properties seen :{0=2, 1=5, 2=2, 3=1}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1893 ms. (steps per millisecond=528 ) properties (out of 7) seen :9
Interrupted Best-First random walk after 815132 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=162 ) properties seen :{0=2, 1=4, 2=2}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1535 ms. (steps per millisecond=651 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1464 ms. (steps per millisecond=683 ) properties (out of 7) seen :18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1466 ms. (steps per millisecond=682 ) properties (out of 7) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1462 ms. (steps per millisecond=683 ) properties (out of 7) seen :18
[2022-05-17 21:51:46] [INFO ] Flow matrix only has 1923 transitions (discarded 336 similar events)
// Phase 1: matrix 1923 rows 1155 cols
[2022-05-17 21:51:46] [INFO ] Computed 31 place invariants in 6 ms
[2022-05-17 21:51:46] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2022-05-17 21:51:46] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:51:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:51:46] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2022-05-17 21:51:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:51:47] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 21:51:47] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:51:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:51:47] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2022-05-17 21:51:47] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 21:51:47] [INFO ] [Nat]Added 546 Read/Feed constraints in 87 ms returned sat
[2022-05-17 21:51:48] [INFO ] Deduced a trap composed of 23 places in 507 ms of which 1 ms to minimize.
[2022-05-17 21:51:48] [INFO ] Deduced a trap composed of 17 places in 496 ms of which 1 ms to minimize.
[2022-05-17 21:51:49] [INFO ] Deduced a trap composed of 23 places in 530 ms of which 30 ms to minimize.
[2022-05-17 21:51:50] [INFO ] Deduced a trap composed of 11 places in 503 ms of which 6 ms to minimize.
[2022-05-17 21:51:50] [INFO ] Deduced a trap composed of 40 places in 506 ms of which 1 ms to minimize.
[2022-05-17 21:51:51] [INFO ] Deduced a trap composed of 40 places in 503 ms of which 1 ms to minimize.
[2022-05-17 21:51:51] [INFO ] Deduced a trap composed of 37 places in 498 ms of which 1 ms to minimize.
[2022-05-17 21:51:52] [INFO ] Deduced a trap composed of 11 places in 499 ms of which 1 ms to minimize.
[2022-05-17 21:51:52] [INFO ] Deduced a trap composed of 13 places in 506 ms of which 2 ms to minimize.
[2022-05-17 21:51:53] [INFO ] Deduced a trap composed of 34 places in 495 ms of which 1 ms to minimize.
[2022-05-17 21:51:54] [INFO ] Deduced a trap composed of 63 places in 501 ms of which 1 ms to minimize.
[2022-05-17 21:51:54] [INFO ] Deduced a trap composed of 40 places in 497 ms of which 1 ms to minimize.
[2022-05-17 21:51:55] [INFO ] Deduced a trap composed of 11 places in 492 ms of which 1 ms to minimize.
[2022-05-17 21:51:55] [INFO ] Deduced a trap composed of 33 places in 496 ms of which 1 ms to minimize.
[2022-05-17 21:51:56] [INFO ] Deduced a trap composed of 13 places in 502 ms of which 1 ms to minimize.
[2022-05-17 21:51:56] [INFO ] Deduced a trap composed of 61 places in 497 ms of which 1 ms to minimize.
[2022-05-17 21:51:57] [INFO ] Deduced a trap composed of 73 places in 496 ms of which 1 ms to minimize.
[2022-05-17 21:51:58] [INFO ] Deduced a trap composed of 61 places in 505 ms of which 0 ms to minimize.
[2022-05-17 21:51:58] [INFO ] Deduced a trap composed of 11 places in 494 ms of which 1 ms to minimize.
[2022-05-17 21:51:59] [INFO ] Deduced a trap composed of 17 places in 498 ms of which 1 ms to minimize.
[2022-05-17 21:51:59] [INFO ] Deduced a trap composed of 37 places in 490 ms of which 1 ms to minimize.
[2022-05-17 21:52:00] [INFO ] Deduced a trap composed of 37 places in 493 ms of which 1 ms to minimize.
[2022-05-17 21:52:00] [INFO ] Deduced a trap composed of 37 places in 496 ms of which 1 ms to minimize.
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 37 places in 488 ms of which 1 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 31 places in 520 ms of which 1 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 25 places in 503 ms of which 1 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 25 places in 504 ms of which 1 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 25 places in 494 ms of which 1 ms to minimize.
[2022-05-17 21:52:04] [INFO ] Deduced a trap composed of 25 places in 508 ms of which 1 ms to minimize.
[2022-05-17 21:52:04] [INFO ] Deduced a trap composed of 25 places in 516 ms of which 1 ms to minimize.
[2022-05-17 21:52:05] [INFO ] Deduced a trap composed of 25 places in 499 ms of which 1 ms to minimize.
[2022-05-17 21:52:06] [INFO ] Deduced a trap composed of 27 places in 521 ms of which 16 ms to minimize.
[2022-05-17 21:52:06] [INFO ] Deduced a trap composed of 57 places in 461 ms of which 1 ms to minimize.
[2022-05-17 21:52:07] [INFO ] Deduced a trap composed of 76 places in 476 ms of which 1 ms to minimize.
[2022-05-17 21:52:07] [INFO ] Deduced a trap composed of 76 places in 491 ms of which 1 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 17 places in 473 ms of which 1 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 11 places in 478 ms of which 1 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 13 places in 473 ms of which 1 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 11 places in 494 ms of which 1 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 41 places in 472 ms of which 1 ms to minimize.
[2022-05-17 21:52:11] [INFO ] Deduced a trap composed of 41 places in 476 ms of which 1 ms to minimize.
[2022-05-17 21:52:11] [INFO ] Deduced a trap composed of 41 places in 471 ms of which 1 ms to minimize.
[2022-05-17 21:52:12] [INFO ] Deduced a trap composed of 11 places in 466 ms of which 1 ms to minimize.
[2022-05-17 21:52:12] [INFO ] Deduced a trap composed of 15 places in 488 ms of which 1 ms to minimize.
[2022-05-17 21:52:13] [INFO ] Deduced a trap composed of 56 places in 464 ms of which 1 ms to minimize.
[2022-05-17 21:52:13] [INFO ] Deduced a trap composed of 57 places in 488 ms of which 1 ms to minimize.
[2022-05-17 21:52:14] [INFO ] Deduced a trap composed of 117 places in 447 ms of which 1 ms to minimize.
[2022-05-17 21:52:14] [INFO ] Deduced a trap composed of 75 places in 431 ms of which 1 ms to minimize.
[2022-05-17 21:52:15] [INFO ] Deduced a trap composed of 76 places in 440 ms of which 1 ms to minimize.
[2022-05-17 21:52:15] [INFO ] Deduced a trap composed of 76 places in 442 ms of which 1 ms to minimize.
[2022-05-17 21:52:16] [INFO ] Deduced a trap composed of 95 places in 442 ms of which 1 ms to minimize.
[2022-05-17 21:52:17] [INFO ] Deduced a trap composed of 29 places in 446 ms of which 1 ms to minimize.
[2022-05-17 21:52:17] [INFO ] Deduced a trap composed of 148 places in 420 ms of which 0 ms to minimize.
[2022-05-17 21:52:17] [INFO ] Deduced a trap composed of 144 places in 326 ms of which 1 ms to minimize.
[2022-05-17 21:52:18] [INFO ] Deduced a trap composed of 95 places in 321 ms of which 1 ms to minimize.
[2022-05-17 21:52:18] [INFO ] Deduced a trap composed of 94 places in 420 ms of which 1 ms to minimize.
[2022-05-17 21:52:19] [INFO ] Deduced a trap composed of 40 places in 358 ms of which 1 ms to minimize.
[2022-05-17 21:52:19] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 31521 ms
[2022-05-17 21:52:19] [INFO ] Computed and/alt/rep : 1803/5003/1803 causal constraints (skipped 112 transitions) in 106 ms.
[2022-05-17 21:52:31] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:52:32] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned sat
[2022-05-17 21:52:32] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:52:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:32] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2022-05-17 21:52:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:52:32] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2022-05-17 21:52:32] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:52:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:33] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2022-05-17 21:52:33] [INFO ] [Nat]Added 546 Read/Feed constraints in 90 ms returned sat
[2022-05-17 21:52:33] [INFO ] Deduced a trap composed of 19 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:52:34] [INFO ] Deduced a trap composed of 11 places in 412 ms of which 0 ms to minimize.
[2022-05-17 21:52:34] [INFO ] Deduced a trap composed of 11 places in 421 ms of which 1 ms to minimize.
[2022-05-17 21:52:35] [INFO ] Deduced a trap composed of 19 places in 412 ms of which 1 ms to minimize.
[2022-05-17 21:52:35] [INFO ] Deduced a trap composed of 43 places in 420 ms of which 1 ms to minimize.
[2022-05-17 21:52:36] [INFO ] Deduced a trap composed of 45 places in 412 ms of which 1 ms to minimize.
[2022-05-17 21:52:36] [INFO ] Deduced a trap composed of 53 places in 417 ms of which 1 ms to minimize.
[2022-05-17 21:52:37] [INFO ] Deduced a trap composed of 43 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:52:37] [INFO ] Deduced a trap composed of 43 places in 406 ms of which 1 ms to minimize.
[2022-05-17 21:52:38] [INFO ] Deduced a trap composed of 53 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:52:38] [INFO ] Deduced a trap composed of 53 places in 407 ms of which 1 ms to minimize.
[2022-05-17 21:52:39] [INFO ] Deduced a trap composed of 28 places in 431 ms of which 1 ms to minimize.
[2022-05-17 21:52:39] [INFO ] Deduced a trap composed of 41 places in 423 ms of which 1 ms to minimize.
[2022-05-17 21:52:40] [INFO ] Deduced a trap composed of 25 places in 435 ms of which 1 ms to minimize.
[2022-05-17 21:52:40] [INFO ] Deduced a trap composed of 41 places in 424 ms of which 1 ms to minimize.
[2022-05-17 21:52:41] [INFO ] Deduced a trap composed of 11 places in 430 ms of which 1 ms to minimize.
[2022-05-17 21:52:41] [INFO ] Deduced a trap composed of 31 places in 438 ms of which 1 ms to minimize.
[2022-05-17 21:52:42] [INFO ] Deduced a trap composed of 11 places in 427 ms of which 1 ms to minimize.
[2022-05-17 21:52:42] [INFO ] Deduced a trap composed of 41 places in 419 ms of which 1 ms to minimize.
[2022-05-17 21:52:43] [INFO ] Deduced a trap composed of 42 places in 420 ms of which 1 ms to minimize.
[2022-05-17 21:52:43] [INFO ] Deduced a trap composed of 42 places in 433 ms of which 1 ms to minimize.
[2022-05-17 21:52:44] [INFO ] Deduced a trap composed of 59 places in 428 ms of which 1 ms to minimize.
[2022-05-17 21:52:44] [INFO ] Deduced a trap composed of 13 places in 441 ms of which 19 ms to minimize.
[2022-05-17 21:52:45] [INFO ] Deduced a trap composed of 23 places in 422 ms of which 1 ms to minimize.
[2022-05-17 21:52:45] [INFO ] Deduced a trap composed of 40 places in 421 ms of which 1 ms to minimize.
[2022-05-17 21:52:46] [INFO ] Deduced a trap composed of 23 places in 443 ms of which 0 ms to minimize.
[2022-05-17 21:52:46] [INFO ] Deduced a trap composed of 23 places in 424 ms of which 1 ms to minimize.
[2022-05-17 21:52:47] [INFO ] Deduced a trap composed of 23 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:52:47] [INFO ] Deduced a trap composed of 14 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:52:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 29 trap constraints in 14355 ms
[2022-05-17 21:52:47] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2022-05-17 21:52:47] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:52:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:48] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2022-05-17 21:52:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:52:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2022-05-17 21:52:48] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:49] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2022-05-17 21:52:49] [INFO ] [Nat]Added 546 Read/Feed constraints in 89 ms returned sat
[2022-05-17 21:52:49] [INFO ] Deduced a trap composed of 23 places in 491 ms of which 0 ms to minimize.
[2022-05-17 21:52:50] [INFO ] Deduced a trap composed of 17 places in 499 ms of which 1 ms to minimize.
[2022-05-17 21:52:50] [INFO ] Deduced a trap composed of 23 places in 488 ms of which 1 ms to minimize.
[2022-05-17 21:52:51] [INFO ] Deduced a trap composed of 11 places in 500 ms of which 1 ms to minimize.
[2022-05-17 21:52:51] [INFO ] Deduced a trap composed of 40 places in 493 ms of which 1 ms to minimize.
[2022-05-17 21:52:52] [INFO ] Deduced a trap composed of 40 places in 491 ms of which 1 ms to minimize.
[2022-05-17 21:52:53] [INFO ] Deduced a trap composed of 37 places in 478 ms of which 1 ms to minimize.
[2022-05-17 21:52:53] [INFO ] Deduced a trap composed of 11 places in 493 ms of which 1 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 13 places in 467 ms of which 1 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 34 places in 493 ms of which 1 ms to minimize.
[2022-05-17 21:52:55] [INFO ] Deduced a trap composed of 63 places in 503 ms of which 1 ms to minimize.
[2022-05-17 21:52:55] [INFO ] Deduced a trap composed of 40 places in 493 ms of which 1 ms to minimize.
[2022-05-17 21:52:56] [INFO ] Deduced a trap composed of 11 places in 502 ms of which 1 ms to minimize.
[2022-05-17 21:52:56] [INFO ] Deduced a trap composed of 33 places in 503 ms of which 1 ms to minimize.
[2022-05-17 21:52:57] [INFO ] Deduced a trap composed of 13 places in 509 ms of which 1 ms to minimize.
[2022-05-17 21:52:58] [INFO ] Deduced a trap composed of 61 places in 494 ms of which 1 ms to minimize.
[2022-05-17 21:52:58] [INFO ] Deduced a trap composed of 73 places in 519 ms of which 1 ms to minimize.
[2022-05-17 21:52:59] [INFO ] Deduced a trap composed of 61 places in 533 ms of which 1 ms to minimize.
[2022-05-17 21:52:59] [INFO ] Deduced a trap composed of 11 places in 500 ms of which 1 ms to minimize.
[2022-05-17 21:53:00] [INFO ] Deduced a trap composed of 17 places in 503 ms of which 1 ms to minimize.
[2022-05-17 21:53:01] [INFO ] Deduced a trap composed of 37 places in 499 ms of which 1 ms to minimize.
[2022-05-17 21:53:01] [INFO ] Deduced a trap composed of 37 places in 499 ms of which 1 ms to minimize.
[2022-05-17 21:53:02] [INFO ] Deduced a trap composed of 37 places in 496 ms of which 1 ms to minimize.
[2022-05-17 21:53:02] [INFO ] Deduced a trap composed of 37 places in 490 ms of which 1 ms to minimize.
[2022-05-17 21:53:03] [INFO ] Deduced a trap composed of 31 places in 514 ms of which 1 ms to minimize.
[2022-05-17 21:53:03] [INFO ] Deduced a trap composed of 25 places in 510 ms of which 1 ms to minimize.
[2022-05-17 21:53:04] [INFO ] Deduced a trap composed of 25 places in 503 ms of which 1 ms to minimize.
[2022-05-17 21:53:05] [INFO ] Deduced a trap composed of 25 places in 505 ms of which 1 ms to minimize.
[2022-05-17 21:53:05] [INFO ] Deduced a trap composed of 25 places in 496 ms of which 1 ms to minimize.
[2022-05-17 21:53:06] [INFO ] Deduced a trap composed of 25 places in 499 ms of which 1 ms to minimize.
[2022-05-17 21:53:06] [INFO ] Deduced a trap composed of 25 places in 497 ms of which 1 ms to minimize.
[2022-05-17 21:53:07] [INFO ] Deduced a trap composed of 27 places in 499 ms of which 0 ms to minimize.
[2022-05-17 21:53:08] [INFO ] Deduced a trap composed of 57 places in 484 ms of which 1 ms to minimize.
[2022-05-17 21:53:08] [INFO ] Deduced a trap composed of 76 places in 466 ms of which 1 ms to minimize.
[2022-05-17 21:53:09] [INFO ] Deduced a trap composed of 76 places in 472 ms of which 0 ms to minimize.
[2022-05-17 21:53:09] [INFO ] Deduced a trap composed of 17 places in 460 ms of which 1 ms to minimize.
[2022-05-17 21:53:10] [INFO ] Deduced a trap composed of 11 places in 464 ms of which 1 ms to minimize.
[2022-05-17 21:53:10] [INFO ] Deduced a trap composed of 13 places in 466 ms of which 1 ms to minimize.
[2022-05-17 21:53:11] [INFO ] Deduced a trap composed of 11 places in 465 ms of which 1 ms to minimize.
[2022-05-17 21:53:11] [INFO ] Deduced a trap composed of 41 places in 462 ms of which 1 ms to minimize.
[2022-05-17 21:53:12] [INFO ] Deduced a trap composed of 41 places in 463 ms of which 1 ms to minimize.
[2022-05-17 21:53:12] [INFO ] Deduced a trap composed of 41 places in 471 ms of which 1 ms to minimize.
[2022-05-17 21:53:13] [INFO ] Deduced a trap composed of 11 places in 472 ms of which 1 ms to minimize.
[2022-05-17 21:53:13] [INFO ] Deduced a trap composed of 15 places in 493 ms of which 1 ms to minimize.
[2022-05-17 21:53:14] [INFO ] Deduced a trap composed of 56 places in 474 ms of which 1 ms to minimize.
[2022-05-17 21:53:15] [INFO ] Deduced a trap composed of 57 places in 471 ms of which 0 ms to minimize.
[2022-05-17 21:53:15] [INFO ] Deduced a trap composed of 117 places in 447 ms of which 13 ms to minimize.
[2022-05-17 21:53:16] [INFO ] Deduced a trap composed of 75 places in 440 ms of which 1 ms to minimize.
[2022-05-17 21:53:16] [INFO ] Deduced a trap composed of 76 places in 440 ms of which 1 ms to minimize.
[2022-05-17 21:53:17] [INFO ] Deduced a trap composed of 76 places in 449 ms of which 1 ms to minimize.
[2022-05-17 21:53:17] [INFO ] Deduced a trap composed of 95 places in 438 ms of which 1 ms to minimize.
[2022-05-17 21:53:18] [INFO ] Deduced a trap composed of 29 places in 442 ms of which 1 ms to minimize.
[2022-05-17 21:53:18] [INFO ] Deduced a trap composed of 148 places in 428 ms of which 1 ms to minimize.
[2022-05-17 21:53:18] [INFO ] Deduced a trap composed of 144 places in 336 ms of which 1 ms to minimize.
[2022-05-17 21:53:19] [INFO ] Deduced a trap composed of 95 places in 327 ms of which 1 ms to minimize.
[2022-05-17 21:53:19] [INFO ] Deduced a trap composed of 94 places in 421 ms of which 0 ms to minimize.
[2022-05-17 21:53:20] [INFO ] Deduced a trap composed of 40 places in 393 ms of which 0 ms to minimize.
[2022-05-17 21:53:20] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 31311 ms
[2022-05-17 21:53:20] [INFO ] Computed and/alt/rep : 1803/5003/1803 causal constraints (skipped 112 transitions) in 101 ms.
[2022-05-17 21:53:33] [INFO ] Deduced a trap composed of 2 places in 538 ms of which 1 ms to minimize.
[2022-05-17 21:53:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:53:33] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2022-05-17 21:53:33] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:53:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:53:34] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2022-05-17 21:53:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:53:34] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2022-05-17 21:53:34] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:53:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:53:35] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2022-05-17 21:53:35] [INFO ] [Nat]Added 546 Read/Feed constraints in 77 ms returned sat
[2022-05-17 21:53:35] [INFO ] Deduced a trap composed of 13 places in 431 ms of which 1 ms to minimize.
[2022-05-17 21:53:36] [INFO ] Deduced a trap composed of 13 places in 432 ms of which 1 ms to minimize.
[2022-05-17 21:53:36] [INFO ] Deduced a trap composed of 11 places in 432 ms of which 0 ms to minimize.
[2022-05-17 21:53:37] [INFO ] Deduced a trap composed of 33 places in 396 ms of which 1 ms to minimize.
[2022-05-17 21:53:37] [INFO ] Deduced a trap composed of 33 places in 387 ms of which 1 ms to minimize.
[2022-05-17 21:53:37] [INFO ] Deduced a trap composed of 71 places in 402 ms of which 1 ms to minimize.
[2022-05-17 21:53:38] [INFO ] Deduced a trap composed of 70 places in 370 ms of which 1 ms to minimize.
[2022-05-17 21:53:38] [INFO ] Deduced a trap composed of 30 places in 388 ms of which 0 ms to minimize.
[2022-05-17 21:53:39] [INFO ] Deduced a trap composed of 33 places in 402 ms of which 1 ms to minimize.
[2022-05-17 21:53:39] [INFO ] Deduced a trap composed of 49 places in 385 ms of which 0 ms to minimize.
[2022-05-17 21:53:40] [INFO ] Deduced a trap composed of 68 places in 386 ms of which 1 ms to minimize.
[2022-05-17 21:53:40] [INFO ] Deduced a trap composed of 68 places in 377 ms of which 1 ms to minimize.
[2022-05-17 21:53:41] [INFO ] Deduced a trap composed of 68 places in 381 ms of which 0 ms to minimize.
[2022-05-17 21:53:41] [INFO ] Deduced a trap composed of 68 places in 380 ms of which 1 ms to minimize.
[2022-05-17 21:53:42] [INFO ] Deduced a trap composed of 68 places in 393 ms of which 1 ms to minimize.
[2022-05-17 21:53:42] [INFO ] Deduced a trap composed of 68 places in 378 ms of which 0 ms to minimize.
[2022-05-17 21:53:42] [INFO ] Deduced a trap composed of 68 places in 378 ms of which 0 ms to minimize.
[2022-05-17 21:53:43] [INFO ] Deduced a trap composed of 123 places in 389 ms of which 1 ms to minimize.
[2022-05-17 21:53:43] [INFO ] Deduced a trap composed of 32 places in 391 ms of which 0 ms to minimize.
[2022-05-17 21:53:44] [INFO ] Deduced a trap composed of 32 places in 393 ms of which 1 ms to minimize.
[2022-05-17 21:53:44] [INFO ] Deduced a trap composed of 32 places in 394 ms of which 0 ms to minimize.
[2022-05-17 21:53:45] [INFO ] Deduced a trap composed of 13 places in 408 ms of which 1 ms to minimize.
[2022-05-17 21:53:45] [INFO ] Deduced a trap composed of 121 places in 383 ms of which 1 ms to minimize.
[2022-05-17 21:53:46] [INFO ] Deduced a trap composed of 33 places in 381 ms of which 1 ms to minimize.
[2022-05-17 21:53:46] [INFO ] Deduced a trap composed of 33 places in 377 ms of which 1 ms to minimize.
[2022-05-17 21:53:47] [INFO ] Deduced a trap composed of 53 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:53:47] [INFO ] Deduced a trap composed of 53 places in 373 ms of which 1 ms to minimize.
[2022-05-17 21:53:47] [INFO ] Deduced a trap composed of 53 places in 380 ms of which 1 ms to minimize.
[2022-05-17 21:53:48] [INFO ] Deduced a trap composed of 53 places in 375 ms of which 1 ms to minimize.
[2022-05-17 21:53:48] [INFO ] Deduced a trap composed of 53 places in 371 ms of which 1 ms to minimize.
[2022-05-17 21:53:49] [INFO ] Deduced a trap composed of 53 places in 374 ms of which 1 ms to minimize.
[2022-05-17 21:53:49] [INFO ] Deduced a trap composed of 53 places in 378 ms of which 1 ms to minimize.
[2022-05-17 21:53:50] [INFO ] Deduced a trap composed of 17 places in 427 ms of which 1 ms to minimize.
[2022-05-17 21:53:50] [INFO ] Deduced a trap composed of 17 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:53:51] [INFO ] Deduced a trap composed of 122 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:53:51] [INFO ] Deduced a trap composed of 64 places in 420 ms of which 0 ms to minimize.
[2022-05-17 21:53:52] [INFO ] Deduced a trap composed of 135 places in 423 ms of which 0 ms to minimize.
[2022-05-17 21:53:52] [INFO ] Deduced a trap composed of 136 places in 424 ms of which 1 ms to minimize.
[2022-05-17 21:53:53] [INFO ] Deduced a trap composed of 135 places in 417 ms of which 1 ms to minimize.
[2022-05-17 21:53:53] [INFO ] Deduced a trap composed of 11 places in 452 ms of which 1 ms to minimize.
[2022-05-17 21:53:54] [INFO ] Deduced a trap composed of 38 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:53:54] [INFO ] Deduced a trap composed of 114 places in 397 ms of which 1 ms to minimize.
[2022-05-17 21:53:55] [INFO ] Deduced a trap composed of 31 places in 415 ms of which 1 ms to minimize.
[2022-05-17 21:53:55] [INFO ] Deduced a trap composed of 11 places in 372 ms of which 1 ms to minimize.
[2022-05-17 21:53:56] [INFO ] Deduced a trap composed of 11 places in 364 ms of which 1 ms to minimize.
[2022-05-17 21:53:56] [INFO ] Deduced a trap composed of 11 places in 376 ms of which 1 ms to minimize.
[2022-05-17 21:53:56] [INFO ] Deduced a trap composed of 57 places in 315 ms of which 1 ms to minimize.
[2022-05-17 21:53:57] [INFO ] Deduced a trap composed of 37 places in 332 ms of which 1 ms to minimize.
[2022-05-17 21:53:57] [INFO ] Deduced a trap composed of 49 places in 320 ms of which 1 ms to minimize.
[2022-05-17 21:53:58] [INFO ] Deduced a trap composed of 49 places in 315 ms of which 1 ms to minimize.
[2022-05-17 21:53:58] [INFO ] Deduced a trap composed of 53 places in 313 ms of which 1 ms to minimize.
[2022-05-17 21:53:58] [INFO ] Deduced a trap composed of 49 places in 303 ms of which 1 ms to minimize.
[2022-05-17 21:53:59] [INFO ] Deduced a trap composed of 49 places in 317 ms of which 1 ms to minimize.
[2022-05-17 21:53:59] [INFO ] Deduced a trap composed of 95 places in 333 ms of which 0 ms to minimize.
[2022-05-17 21:54:00] [INFO ] Deduced a trap composed of 15 places in 410 ms of which 0 ms to minimize.
[2022-05-17 21:54:00] [INFO ] Deduced a trap composed of 72 places in 351 ms of which 1 ms to minimize.
[2022-05-17 21:54:00] [INFO ] Deduced a trap composed of 106 places in 318 ms of which 2 ms to minimize.
[2022-05-17 21:54:01] [INFO ] Deduced a trap composed of 106 places in 331 ms of which 1 ms to minimize.
[2022-05-17 21:54:01] [INFO ] Deduced a trap composed of 49 places in 322 ms of which 0 ms to minimize.
[2022-05-17 21:54:01] [INFO ] Deduced a trap composed of 91 places in 254 ms of which 1 ms to minimize.
[2022-05-17 21:54:02] [INFO ] Deduced a trap composed of 106 places in 329 ms of which 1 ms to minimize.
[2022-05-17 21:54:02] [INFO ] Deduced a trap composed of 106 places in 331 ms of which 0 ms to minimize.
[2022-05-17 21:54:03] [INFO ] Deduced a trap composed of 63 places in 339 ms of which 1 ms to minimize.
[2022-05-17 21:54:03] [INFO ] Deduced a trap composed of 49 places in 325 ms of which 0 ms to minimize.
[2022-05-17 21:54:04] [INFO ] Deduced a trap composed of 82 places in 365 ms of which 0 ms to minimize.
[2022-05-17 21:54:04] [INFO ] Deduced a trap composed of 75 places in 333 ms of which 1 ms to minimize.
[2022-05-17 21:54:04] [INFO ] Deduced a trap composed of 38 places in 333 ms of which 1 ms to minimize.
[2022-05-17 21:54:05] [INFO ] Deduced a trap composed of 38 places in 335 ms of which 1 ms to minimize.
[2022-05-17 21:54:05] [INFO ] Deduced a trap composed of 81 places in 332 ms of which 1 ms to minimize.
[2022-05-17 21:54:06] [INFO ] Deduced a trap composed of 116 places in 331 ms of which 0 ms to minimize.
[2022-05-17 21:54:06] [INFO ] Deduced a trap composed of 47 places in 335 ms of which 1 ms to minimize.
[2022-05-17 21:54:06] [INFO ] Deduced a trap composed of 29 places in 344 ms of which 1 ms to minimize.
[2022-05-17 21:54:07] [INFO ] Deduced a trap composed of 139 places in 248 ms of which 1 ms to minimize.
[2022-05-17 21:54:07] [INFO ] Deduced a trap composed of 40 places in 360 ms of which 0 ms to minimize.
[2022-05-17 21:54:08] [INFO ] Deduced a trap composed of 89 places in 301 ms of which 1 ms to minimize.
[2022-05-17 21:54:08] [INFO ] Deduced a trap composed of 27 places in 376 ms of which 0 ms to minimize.
[2022-05-17 21:54:08] [INFO ] Deduced a trap composed of 40 places in 370 ms of which 1 ms to minimize.
[2022-05-17 21:54:09] [INFO ] Deduced a trap composed of 69 places in 400 ms of which 1 ms to minimize.
[2022-05-17 21:54:09] [INFO ] Deduced a trap composed of 30 places in 367 ms of which 0 ms to minimize.
[2022-05-17 21:54:10] [INFO ] Deduced a trap composed of 97 places in 356 ms of which 1 ms to minimize.
[2022-05-17 21:54:10] [INFO ] Deduced a trap composed of 40 places in 348 ms of which 1 ms to minimize.
[2022-05-17 21:54:11] [INFO ] Deduced a trap composed of 31 places in 364 ms of which 0 ms to minimize.
[2022-05-17 21:54:11] [INFO ] Deduced a trap composed of 61 places in 307 ms of which 1 ms to minimize.
[2022-05-17 21:54:11] [INFO ] Deduced a trap composed of 94 places in 266 ms of which 1 ms to minimize.
[2022-05-17 21:54:12] [INFO ] Deduced a trap composed of 101 places in 276 ms of which 0 ms to minimize.
[2022-05-17 21:54:12] [INFO ] Deduced a trap composed of 73 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:54:12] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:54:13] [INFO ] Deduced a trap composed of 73 places in 221 ms of which 1 ms to minimize.
[2022-05-17 21:54:13] [INFO ] Deduced a trap composed of 120 places in 170 ms of which 1 ms to minimize.
[2022-05-17 21:54:13] [INFO ] Deduced a trap composed of 135 places in 159 ms of which 0 ms to minimize.
[2022-05-17 21:54:13] [INFO ] Deduced a trap composed of 107 places in 165 ms of which 0 ms to minimize.
[2022-05-17 21:54:14] [INFO ] Deduced a trap composed of 106 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:54:14] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 0 ms to minimize.
[2022-05-17 21:54:15] [INFO ] Deduced a trap composed of 15 places in 439 ms of which 1 ms to minimize.
[2022-05-17 21:54:15] [INFO ] Deduced a trap composed of 51 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:54:16] [INFO ] Deduced a trap composed of 42 places in 385 ms of which 1 ms to minimize.
[2022-05-17 21:54:16] [INFO ] Deduced a trap composed of 25 places in 316 ms of which 1 ms to minimize.
[2022-05-17 21:54:17] [INFO ] Deduced a trap composed of 127 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:54:17] [INFO ] Deduced a trap composed of 115 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:54:17] [INFO ] Deduced a trap composed of 115 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:54:17] [INFO ] Deduced a trap composed of 115 places in 234 ms of which 0 ms to minimize.
[2022-05-17 21:54:18] [INFO ] Deduced a trap composed of 115 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:54:18] [INFO ] Deduced a trap composed of 134 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:54:18] [INFO ] Deduced a trap composed of 108 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:54:19] [INFO ] Deduced a trap composed of 115 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:54:19] [INFO ] Deduced a trap composed of 115 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:54:19] [INFO ] Deduced a trap composed of 2 places in 543 ms of which 1 ms to minimize.
[2022-05-17 21:54:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:54:20] [INFO ] [Real]Absence check using 23 positive place invariants in 26 ms returned sat
[2022-05-17 21:54:20] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:54:20] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2022-05-17 21:54:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:54:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 21:54:20] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:54:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:54:21] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2022-05-17 21:54:21] [INFO ] [Nat]Added 546 Read/Feed constraints in 84 ms returned sat
[2022-05-17 21:54:21] [INFO ] Deduced a trap composed of 15 places in 342 ms of which 1 ms to minimize.
[2022-05-17 21:54:22] [INFO ] Deduced a trap composed of 25 places in 336 ms of which 1 ms to minimize.
[2022-05-17 21:54:22] [INFO ] Deduced a trap composed of 23 places in 315 ms of which 0 ms to minimize.
[2022-05-17 21:54:22] [INFO ] Deduced a trap composed of 59 places in 317 ms of which 0 ms to minimize.
[2022-05-17 21:54:23] [INFO ] Deduced a trap composed of 59 places in 309 ms of which 1 ms to minimize.
[2022-05-17 21:54:23] [INFO ] Deduced a trap composed of 59 places in 319 ms of which 0 ms to minimize.
[2022-05-17 21:54:23] [INFO ] Deduced a trap composed of 59 places in 309 ms of which 1 ms to minimize.
[2022-05-17 21:54:24] [INFO ] Deduced a trap composed of 59 places in 306 ms of which 1 ms to minimize.
[2022-05-17 21:54:24] [INFO ] Deduced a trap composed of 40 places in 311 ms of which 1 ms to minimize.
[2022-05-17 21:54:25] [INFO ] Deduced a trap composed of 55 places in 311 ms of which 0 ms to minimize.
[2022-05-17 21:54:25] [INFO ] Deduced a trap composed of 55 places in 306 ms of which 0 ms to minimize.
[2022-05-17 21:54:25] [INFO ] Deduced a trap composed of 59 places in 309 ms of which 1 ms to minimize.
[2022-05-17 21:54:26] [INFO ] Deduced a trap composed of 55 places in 308 ms of which 1 ms to minimize.
[2022-05-17 21:54:26] [INFO ] Deduced a trap composed of 55 places in 311 ms of which 1 ms to minimize.
[2022-05-17 21:54:26] [INFO ] Deduced a trap composed of 40 places in 315 ms of which 1 ms to minimize.
[2022-05-17 21:54:27] [INFO ] Deduced a trap composed of 23 places in 316 ms of which 0 ms to minimize.
[2022-05-17 21:54:27] [INFO ] Deduced a trap composed of 13 places in 321 ms of which 0 ms to minimize.
[2022-05-17 21:54:28] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 1 ms to minimize.
[2022-05-17 21:54:28] [INFO ] Deduced a trap composed of 13 places in 313 ms of which 0 ms to minimize.
[2022-05-17 21:54:28] [INFO ] Deduced a trap composed of 24 places in 318 ms of which 1 ms to minimize.
[2022-05-17 21:54:29] [INFO ] Deduced a trap composed of 13 places in 323 ms of which 1 ms to minimize.
[2022-05-17 21:54:29] [INFO ] Deduced a trap composed of 63 places in 285 ms of which 0 ms to minimize.
[2022-05-17 21:54:29] [INFO ] Deduced a trap composed of 82 places in 282 ms of which 0 ms to minimize.
[2022-05-17 21:54:30] [INFO ] Deduced a trap composed of 120 places in 281 ms of which 1 ms to minimize.
[2022-05-17 21:54:30] [INFO ] Deduced a trap composed of 97 places in 286 ms of which 1 ms to minimize.
[2022-05-17 21:54:31] [INFO ] Deduced a trap composed of 116 places in 291 ms of which 1 ms to minimize.
[2022-05-17 21:54:31] [INFO ] Deduced a trap composed of 61 places in 292 ms of which 1 ms to minimize.
[2022-05-17 21:54:31] [INFO ] Deduced a trap composed of 116 places in 264 ms of which 1 ms to minimize.
[2022-05-17 21:54:32] [INFO ] Deduced a trap composed of 116 places in 269 ms of which 1 ms to minimize.
[2022-05-17 21:54:32] [INFO ] Deduced a trap composed of 82 places in 257 ms of which 1 ms to minimize.
[2022-05-17 21:54:32] [INFO ] Deduced a trap composed of 82 places in 268 ms of which 0 ms to minimize.
[2022-05-17 21:54:33] [INFO ] Deduced a trap composed of 82 places in 251 ms of which 0 ms to minimize.
[2022-05-17 21:54:33] [INFO ] Deduced a trap composed of 97 places in 252 ms of which 0 ms to minimize.
[2022-05-17 21:54:33] [INFO ] Deduced a trap composed of 97 places in 257 ms of which 0 ms to minimize.
[2022-05-17 21:54:33] [INFO ] Deduced a trap composed of 97 places in 257 ms of which 0 ms to minimize.
[2022-05-17 21:54:34] [INFO ] Deduced a trap composed of 78 places in 264 ms of which 1 ms to minimize.
[2022-05-17 21:54:34] [INFO ] Deduced a trap composed of 82 places in 257 ms of which 1 ms to minimize.
[2022-05-17 21:54:34] [INFO ] Deduced a trap composed of 101 places in 213 ms of which 1 ms to minimize.
[2022-05-17 21:54:35] [INFO ] Deduced a trap composed of 120 places in 214 ms of which 1 ms to minimize.
[2022-05-17 21:54:35] [INFO ] Deduced a trap composed of 120 places in 221 ms of which 1 ms to minimize.
[2022-05-17 21:54:35] [INFO ] Deduced a trap composed of 120 places in 220 ms of which 0 ms to minimize.
[2022-05-17 21:54:36] [INFO ] Deduced a trap composed of 97 places in 217 ms of which 0 ms to minimize.
[2022-05-17 21:54:36] [INFO ] Deduced a trap composed of 72 places in 234 ms of which 0 ms to minimize.
[2022-05-17 21:54:36] [INFO ] Deduced a trap composed of 94 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:54:36] [INFO ] Deduced a trap composed of 105 places in 193 ms of which 0 ms to minimize.
[2022-05-17 21:54:37] [INFO ] Deduced a trap composed of 75 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:54:37] [INFO ] Deduced a trap composed of 15 places in 301 ms of which 1 ms to minimize.
[2022-05-17 21:54:38] [INFO ] Deduced a trap composed of 42 places in 365 ms of which 1 ms to minimize.
[2022-05-17 21:54:38] [INFO ] Deduced a trap composed of 11 places in 382 ms of which 0 ms to minimize.
[2022-05-17 21:54:38] [INFO ] Deduced a trap composed of 51 places in 294 ms of which 1 ms to minimize.
[2022-05-17 21:54:39] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 1 ms to minimize.
[2022-05-17 21:54:39] [INFO ] Deduced a trap composed of 97 places in 205 ms of which 1 ms to minimize.
[2022-05-17 21:54:40] [INFO ] Deduced a trap composed of 13 places in 356 ms of which 1 ms to minimize.
[2022-05-17 21:54:40] [INFO ] Deduced a trap composed of 70 places in 243 ms of which 1 ms to minimize.
[2022-05-17 21:54:41] [INFO ] Deduced a trap composed of 53 places in 448 ms of which 1 ms to minimize.
[2022-05-17 21:54:41] [INFO ] Deduced a trap composed of 72 places in 459 ms of which 1 ms to minimize.
[2022-05-17 21:54:42] [INFO ] Deduced a trap composed of 72 places in 460 ms of which 1 ms to minimize.
[2022-05-17 21:54:42] [INFO ] Deduced a trap composed of 80 places in 462 ms of which 1 ms to minimize.
[2022-05-17 21:54:43] [INFO ] Deduced a trap composed of 64 places in 458 ms of which 1 ms to minimize.
[2022-05-17 21:54:43] [INFO ] Deduced a trap composed of 47 places in 446 ms of which 1 ms to minimize.
[2022-05-17 21:54:44] [INFO ] Deduced a trap composed of 11 places in 456 ms of which 1 ms to minimize.
[2022-05-17 21:54:44] [INFO ] Deduced a trap composed of 78 places in 441 ms of which 1 ms to minimize.
[2022-05-17 21:54:45] [INFO ] Deduced a trap composed of 78 places in 438 ms of which 1 ms to minimize.
[2022-05-17 21:54:45] [INFO ] Deduced a trap composed of 78 places in 432 ms of which 0 ms to minimize.
[2022-05-17 21:54:46] [INFO ] Deduced a trap composed of 78 places in 436 ms of which 1 ms to minimize.
[2022-05-17 21:54:46] [INFO ] Deduced a trap composed of 114 places in 431 ms of which 1 ms to minimize.
[2022-05-17 21:54:47] [INFO ] Deduced a trap composed of 97 places in 422 ms of which 1 ms to minimize.
[2022-05-17 21:54:47] [INFO ] Deduced a trap composed of 23 places in 437 ms of which 1 ms to minimize.
[2022-05-17 21:54:48] [INFO ] Deduced a trap composed of 27 places in 423 ms of which 0 ms to minimize.
[2022-05-17 21:54:48] [INFO ] Deduced a trap composed of 23 places in 445 ms of which 1 ms to minimize.
[2022-05-17 21:54:49] [INFO ] Deduced a trap composed of 30 places in 446 ms of which 1 ms to minimize.
[2022-05-17 21:54:49] [INFO ] Deduced a trap composed of 100 places in 362 ms of which 0 ms to minimize.
[2022-05-17 21:54:50] [INFO ] Deduced a trap composed of 100 places in 353 ms of which 0 ms to minimize.
[2022-05-17 21:54:50] [INFO ] Deduced a trap composed of 100 places in 364 ms of which 1 ms to minimize.
[2022-05-17 21:54:51] [INFO ] Deduced a trap composed of 56 places in 446 ms of which 1 ms to minimize.
[2022-05-17 21:54:52] [INFO ] Deduced a trap composed of 61 places in 386 ms of which 1 ms to minimize.
[2022-05-17 21:54:52] [INFO ] Deduced a trap composed of 118 places in 390 ms of which 1 ms to minimize.
[2022-05-17 21:54:52] [INFO ] Deduced a trap composed of 53 places in 366 ms of which 1 ms to minimize.
[2022-05-17 21:54:53] [INFO ] Deduced a trap composed of 47 places in 355 ms of which 1 ms to minimize.
[2022-05-17 21:54:53] [INFO ] Deduced a trap composed of 41 places in 355 ms of which 0 ms to minimize.
[2022-05-17 21:54:54] [INFO ] Deduced a trap composed of 75 places in 283 ms of which 1 ms to minimize.
[2022-05-17 21:54:54] [INFO ] Deduced a trap composed of 80 places in 280 ms of which 0 ms to minimize.
[2022-05-17 21:54:54] [INFO ] Deduced a trap composed of 37 places in 390 ms of which 0 ms to minimize.
[2022-05-17 21:54:55] [INFO ] Deduced a trap composed of 56 places in 393 ms of which 1 ms to minimize.
[2022-05-17 21:54:55] [INFO ] Deduced a trap composed of 25 places in 415 ms of which 1 ms to minimize.
[2022-05-17 21:54:56] [INFO ] Deduced a trap composed of 135 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:54:56] [INFO ] Deduced a trap composed of 135 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:54:56] [INFO ] Deduced a trap composed of 135 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:54:57] [INFO ] Deduced a trap composed of 135 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:54:57] [INFO ] Deduced a trap composed of 135 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:54:57] [INFO ] Trap strengthening (SAT) tested/added 91/90 trap constraints in 36229 ms
[2022-05-17 21:54:57] [INFO ] Computed and/alt/rep : 1803/5003/1803 causal constraints (skipped 112 transitions) in 82 ms.
[2022-05-17 21:55:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:55:05] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 21:55:05] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:55:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:55:06] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2022-05-17 21:55:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:55:06] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 21:55:06] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:55:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:55:06] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2022-05-17 21:55:06] [INFO ] [Nat]Added 546 Read/Feed constraints in 85 ms returned sat
[2022-05-17 21:55:07] [INFO ] Deduced a trap composed of 72 places in 341 ms of which 1 ms to minimize.
[2022-05-17 21:55:07] [INFO ] Deduced a trap composed of 107 places in 349 ms of which 0 ms to minimize.
[2022-05-17 21:55:08] [INFO ] Deduced a trap composed of 34 places in 343 ms of which 0 ms to minimize.
[2022-05-17 21:55:08] [INFO ] Deduced a trap composed of 15 places in 334 ms of which 1 ms to minimize.
[2022-05-17 21:55:08] [INFO ] Deduced a trap composed of 15 places in 339 ms of which 1 ms to minimize.
[2022-05-17 21:55:09] [INFO ] Deduced a trap composed of 29 places in 343 ms of which 0 ms to minimize.
[2022-05-17 21:55:09] [INFO ] Deduced a trap composed of 34 places in 348 ms of which 1 ms to minimize.
[2022-05-17 21:55:10] [INFO ] Deduced a trap composed of 34 places in 349 ms of which 1 ms to minimize.
[2022-05-17 21:55:10] [INFO ] Deduced a trap composed of 34 places in 346 ms of which 1 ms to minimize.
[2022-05-17 21:55:11] [INFO ] Deduced a trap composed of 34 places in 347 ms of which 1 ms to minimize.
[2022-05-17 21:55:11] [INFO ] Deduced a trap composed of 32 places in 343 ms of which 1 ms to minimize.
[2022-05-17 21:55:11] [INFO ] Deduced a trap composed of 29 places in 377 ms of which 0 ms to minimize.
[2022-05-17 21:55:12] [INFO ] Deduced a trap composed of 72 places in 329 ms of which 0 ms to minimize.
[2022-05-17 21:55:12] [INFO ] Deduced a trap composed of 15 places in 323 ms of which 1 ms to minimize.
[2022-05-17 21:55:13] [INFO ] Deduced a trap composed of 13 places in 330 ms of which 1 ms to minimize.
[2022-05-17 21:55:13] [INFO ] Deduced a trap composed of 15 places in 324 ms of which 1 ms to minimize.
[2022-05-17 21:55:13] [INFO ] Deduced a trap composed of 101 places in 332 ms of which 1 ms to minimize.
[2022-05-17 21:55:14] [INFO ] Deduced a trap composed of 72 places in 329 ms of which 0 ms to minimize.
[2022-05-17 21:55:14] [INFO ] Deduced a trap composed of 15 places in 329 ms of which 1 ms to minimize.
[2022-05-17 21:55:15] [INFO ] Deduced a trap composed of 80 places in 324 ms of which 1 ms to minimize.
[2022-05-17 21:55:15] [INFO ] Deduced a trap composed of 80 places in 329 ms of which 0 ms to minimize.
[2022-05-17 21:55:15] [INFO ] Deduced a trap composed of 80 places in 333 ms of which 1 ms to minimize.
[2022-05-17 21:55:16] [INFO ] Deduced a trap composed of 80 places in 323 ms of which 1 ms to minimize.
[2022-05-17 21:55:16] [INFO ] Deduced a trap composed of 80 places in 335 ms of which 1 ms to minimize.
[2022-05-17 21:55:17] [INFO ] Deduced a trap composed of 61 places in 317 ms of which 0 ms to minimize.
[2022-05-17 21:55:17] [INFO ] Deduced a trap composed of 61 places in 312 ms of which 1 ms to minimize.
[2022-05-17 21:55:17] [INFO ] Deduced a trap composed of 61 places in 309 ms of which 1 ms to minimize.
[2022-05-17 21:55:18] [INFO ] Deduced a trap composed of 61 places in 318 ms of which 1 ms to minimize.
[2022-05-17 21:55:18] [INFO ] Deduced a trap composed of 61 places in 313 ms of which 1 ms to minimize.
[2022-05-17 21:55:18] [INFO ] Deduced a trap composed of 61 places in 326 ms of which 1 ms to minimize.
[2022-05-17 21:55:19] [INFO ] Deduced a trap composed of 13 places in 330 ms of which 1 ms to minimize.
[2022-05-17 21:55:19] [INFO ] Deduced a trap composed of 91 places in 273 ms of which 1 ms to minimize.
[2022-05-17 21:55:20] [INFO ] Deduced a trap composed of 72 places in 277 ms of which 1 ms to minimize.
[2022-05-17 21:55:20] [INFO ] Deduced a trap composed of 89 places in 273 ms of which 1 ms to minimize.
[2022-05-17 21:55:20] [INFO ] Deduced a trap composed of 89 places in 272 ms of which 1 ms to minimize.
[2022-05-17 21:55:21] [INFO ] Deduced a trap composed of 107 places in 278 ms of which 0 ms to minimize.
[2022-05-17 21:55:21] [INFO ] Deduced a trap composed of 91 places in 277 ms of which 1 ms to minimize.
[2022-05-17 21:55:21] [INFO ] Deduced a trap composed of 91 places in 275 ms of which 0 ms to minimize.
[2022-05-17 21:55:22] [INFO ] Deduced a trap composed of 110 places in 280 ms of which 1 ms to minimize.
[2022-05-17 21:55:22] [INFO ] Deduced a trap composed of 110 places in 273 ms of which 0 ms to minimize.
[2022-05-17 21:55:22] [INFO ] Deduced a trap composed of 53 places in 275 ms of which 1 ms to minimize.
[2022-05-17 21:55:23] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 1 ms to minimize.
[2022-05-17 21:55:23] [INFO ] Deduced a trap composed of 115 places in 305 ms of which 1 ms to minimize.
[2022-05-17 21:55:23] [INFO ] Deduced a trap composed of 13 places in 288 ms of which 0 ms to minimize.
[2022-05-17 21:55:24] [INFO ] Deduced a trap composed of 139 places in 215 ms of which 1 ms to minimize.
[2022-05-17 21:55:24] [INFO ] Deduced a trap composed of 139 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:55:24] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 17660 ms
[2022-05-17 21:55:24] [INFO ] Computed and/alt/rep : 1803/5003/1803 causal constraints (skipped 112 transitions) in 90 ms.
[2022-05-17 21:55:44] [INFO ] Added : 945 causal constraints over 189 iterations in 20058 ms.(timeout) Result :sat
Minimization took 964 ms.
[2022-05-17 21:55:45] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 21:55:45] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:55:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:55:46] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2022-05-17 21:55:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:55:46] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2022-05-17 21:55:46] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:55:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:55:46] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2022-05-17 21:55:46] [INFO ] [Nat]Added 546 Read/Feed constraints in 83 ms returned sat
[2022-05-17 21:55:47] [INFO ] Deduced a trap composed of 34 places in 369 ms of which 1 ms to minimize.
[2022-05-17 21:55:47] [INFO ] Deduced a trap composed of 34 places in 354 ms of which 1 ms to minimize.
[2022-05-17 21:55:48] [INFO ] Deduced a trap composed of 34 places in 344 ms of which 1 ms to minimize.
[2022-05-17 21:55:48] [INFO ] Deduced a trap composed of 34 places in 342 ms of which 0 ms to minimize.
[2022-05-17 21:55:49] [INFO ] Deduced a trap composed of 13 places in 346 ms of which 1 ms to minimize.
[2022-05-17 21:55:49] [INFO ] Deduced a trap composed of 13 places in 346 ms of which 0 ms to minimize.
[2022-05-17 21:55:49] [INFO ] Deduced a trap composed of 13 places in 350 ms of which 0 ms to minimize.
[2022-05-17 21:55:50] [INFO ] Deduced a trap composed of 15 places in 354 ms of which 1 ms to minimize.
[2022-05-17 21:55:50] [INFO ] Deduced a trap composed of 13 places in 350 ms of which 0 ms to minimize.
[2022-05-17 21:55:51] [INFO ] Deduced a trap composed of 61 places in 355 ms of which 1 ms to minimize.
[2022-05-17 21:55:51] [INFO ] Deduced a trap composed of 61 places in 359 ms of which 0 ms to minimize.
[2022-05-17 21:55:51] [INFO ] Deduced a trap composed of 61 places in 361 ms of which 1 ms to minimize.
[2022-05-17 21:55:52] [INFO ] Deduced a trap composed of 61 places in 352 ms of which 1 ms to minimize.
[2022-05-17 21:55:52] [INFO ] Deduced a trap composed of 61 places in 347 ms of which 1 ms to minimize.
[2022-05-17 21:55:53] [INFO ] Deduced a trap composed of 97 places in 351 ms of which 1 ms to minimize.
[2022-05-17 21:55:53] [INFO ] Deduced a trap composed of 97 places in 347 ms of which 1 ms to minimize.
[2022-05-17 21:55:54] [INFO ] Deduced a trap composed of 97 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:55:54] [INFO ] Deduced a trap composed of 97 places in 343 ms of which 1 ms to minimize.
[2022-05-17 21:55:54] [INFO ] Deduced a trap composed of 97 places in 349 ms of which 1 ms to minimize.
[2022-05-17 21:55:55] [INFO ] Deduced a trap composed of 116 places in 346 ms of which 1 ms to minimize.
[2022-05-17 21:55:55] [INFO ] Deduced a trap composed of 72 places in 342 ms of which 1 ms to minimize.
[2022-05-17 21:55:56] [INFO ] Deduced a trap composed of 72 places in 362 ms of which 1 ms to minimize.
[2022-05-17 21:55:56] [INFO ] Deduced a trap composed of 84 places in 344 ms of which 1 ms to minimize.
[2022-05-17 21:55:56] [INFO ] Deduced a trap composed of 72 places in 346 ms of which 1 ms to minimize.
[2022-05-17 21:55:57] [INFO ] Deduced a trap composed of 72 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:55:57] [INFO ] Deduced a trap composed of 32 places in 348 ms of which 1 ms to minimize.
[2022-05-17 21:55:58] [INFO ] Deduced a trap composed of 40 places in 349 ms of which 1 ms to minimize.
[2022-05-17 21:55:58] [INFO ] Deduced a trap composed of 32 places in 346 ms of which 0 ms to minimize.
[2022-05-17 21:55:59] [INFO ] Deduced a trap composed of 53 places in 359 ms of which 1 ms to minimize.
[2022-05-17 21:55:59] [INFO ] Deduced a trap composed of 53 places in 360 ms of which 1 ms to minimize.
[2022-05-17 21:56:00] [INFO ] Deduced a trap composed of 27 places in 461 ms of which 1 ms to minimize.
[2022-05-17 21:56:00] [INFO ] Deduced a trap composed of 15 places in 437 ms of which 1 ms to minimize.
[2022-05-17 21:56:01] [INFO ] Deduced a trap composed of 11 places in 461 ms of which 1 ms to minimize.
[2022-05-17 21:56:01] [INFO ] Deduced a trap composed of 29 places in 442 ms of which 1 ms to minimize.
[2022-05-17 21:56:02] [INFO ] Deduced a trap composed of 29 places in 414 ms of which 1 ms to minimize.
[2022-05-17 21:56:02] [INFO ] Deduced a trap composed of 72 places in 311 ms of which 1 ms to minimize.
[2022-05-17 21:56:02] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 15733 ms
[2022-05-17 21:56:02] [INFO ] Computed and/alt/rep : 1803/5003/1803 causal constraints (skipped 112 transitions) in 118 ms.
[2022-05-17 21:56:22] [INFO ] Added : 955 causal constraints over 191 iterations in 20167 ms.(timeout) Result :sat
Minimization took 585 ms.
Current structural bounds on expressions (after SMT) : [448, 7, 448, 8, 1, 1, 1] Max seen :[7, 7, 7, 1, 0, 0, 0]
FORMULA Peterson-PT-7-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 708700 steps, including 1000 resets, run finished after 6439 ms. (steps per millisecond=110 ) properties (out of 6) seen :8 could not realise parikh vector
FORMULA Peterson-PT-7-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 497700 steps, including 1000 resets, run finished after 4547 ms. (steps per millisecond=109 ) properties (out of 5) seen :9 could not realise parikh vector
Support contains 457 out of 1155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1155/1155 places, 2259/2259 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1155 transition count 2258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1154 transition count 2258
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 2 place count 1154 transition count 2210
Deduced a syphon composed of 48 places in 4 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 98 place count 1106 transition count 2210
Applied a total of 98 rules in 101 ms. Remains 1106 /1155 variables (removed 49) and now considering 2210/2259 (removed 49) transitions.
Finished structural reductions, in 1 iterations. Remains : 1106/1155 places, 2210/2259 transitions.
Normalized transition count is 1874 out of 2210 initially.
// Phase 1: matrix 1874 rows 1106 cols
[2022-05-17 21:56:34] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9703 ms. (steps per millisecond=103 ) properties (out of 5) seen :13
Interrupted Best-First random walk after 814853 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=162 ) properties seen :{0=2, 1=2, 2=1}
Interrupted Best-First random walk after 797474 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen :{0=2, 1=2, 2=1}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1476 ms. (steps per millisecond=677 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1411 ms. (steps per millisecond=708 ) properties (out of 5) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1414 ms. (steps per millisecond=707 ) properties (out of 5) seen :11
[2022-05-17 21:56:58] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1106 cols
[2022-05-17 21:56:58] [INFO ] Computed 31 place invariants in 21 ms
[2022-05-17 21:56:58] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 21:56:58] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:56:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:56:59] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2022-05-17 21:56:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:56:59] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 21:56:59] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:57:00] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2022-05-17 21:57:00] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 21:57:00] [INFO ] [Nat]Added 546 Read/Feed constraints in 84 ms returned sat
[2022-05-17 21:57:00] [INFO ] Deduced a trap composed of 37 places in 484 ms of which 0 ms to minimize.
[2022-05-17 21:57:01] [INFO ] Deduced a trap composed of 11 places in 481 ms of which 1 ms to minimize.
[2022-05-17 21:57:01] [INFO ] Deduced a trap composed of 35 places in 482 ms of which 1 ms to minimize.
[2022-05-17 21:57:02] [INFO ] Deduced a trap composed of 15 places in 481 ms of which 0 ms to minimize.
[2022-05-17 21:57:02] [INFO ] Deduced a trap composed of 19 places in 476 ms of which 1 ms to minimize.
[2022-05-17 21:57:03] [INFO ] Deduced a trap composed of 39 places in 475 ms of which 1 ms to minimize.
[2022-05-17 21:57:03] [INFO ] Deduced a trap composed of 25 places in 485 ms of which 1 ms to minimize.
[2022-05-17 21:57:04] [INFO ] Deduced a trap composed of 49 places in 483 ms of which 1 ms to minimize.
[2022-05-17 21:57:05] [INFO ] Deduced a trap composed of 11 places in 471 ms of which 1 ms to minimize.
[2022-05-17 21:57:05] [INFO ] Deduced a trap composed of 11 places in 464 ms of which 0 ms to minimize.
[2022-05-17 21:57:06] [INFO ] Deduced a trap composed of 11 places in 466 ms of which 1 ms to minimize.
[2022-05-17 21:57:06] [INFO ] Deduced a trap composed of 15 places in 465 ms of which 0 ms to minimize.
[2022-05-17 21:57:07] [INFO ] Deduced a trap composed of 27 places in 466 ms of which 1 ms to minimize.
[2022-05-17 21:57:07] [INFO ] Deduced a trap composed of 15 places in 480 ms of which 1 ms to minimize.
[2022-05-17 21:57:08] [INFO ] Deduced a trap composed of 29 places in 479 ms of which 1 ms to minimize.
[2022-05-17 21:57:08] [INFO ] Deduced a trap composed of 71 places in 464 ms of which 1 ms to minimize.
[2022-05-17 21:57:09] [INFO ] Deduced a trap composed of 47 places in 463 ms of which 1 ms to minimize.
[2022-05-17 21:57:09] [INFO ] Deduced a trap composed of 23 places in 473 ms of which 1 ms to minimize.
[2022-05-17 21:57:10] [INFO ] Deduced a trap composed of 11 places in 476 ms of which 1 ms to minimize.
[2022-05-17 21:57:10] [INFO ] Deduced a trap composed of 11 places in 471 ms of which 1 ms to minimize.
[2022-05-17 21:57:11] [INFO ] Deduced a trap composed of 84 places in 483 ms of which 1 ms to minimize.
[2022-05-17 21:57:11] [INFO ] Deduced a trap composed of 69 places in 465 ms of which 1 ms to minimize.
[2022-05-17 21:57:12] [INFO ] Deduced a trap composed of 23 places in 466 ms of which 1 ms to minimize.
[2022-05-17 21:57:13] [INFO ] Deduced a trap composed of 41 places in 470 ms of which 1 ms to minimize.
[2022-05-17 21:57:13] [INFO ] Deduced a trap composed of 39 places in 469 ms of which 1 ms to minimize.
[2022-05-17 21:57:14] [INFO ] Deduced a trap composed of 11 places in 479 ms of which 1 ms to minimize.
[2022-05-17 21:57:14] [INFO ] Deduced a trap composed of 43 places in 440 ms of which 1 ms to minimize.
[2022-05-17 21:57:15] [INFO ] Deduced a trap composed of 71 places in 439 ms of which 1 ms to minimize.
[2022-05-17 21:57:15] [INFO ] Deduced a trap composed of 39 places in 431 ms of which 0 ms to minimize.
[2022-05-17 21:57:16] [INFO ] Deduced a trap composed of 39 places in 440 ms of which 1 ms to minimize.
[2022-05-17 21:57:16] [INFO ] Deduced a trap composed of 29 places in 439 ms of which 1 ms to minimize.
[2022-05-17 21:57:17] [INFO ] Deduced a trap composed of 41 places in 432 ms of which 1 ms to minimize.
[2022-05-17 21:57:17] [INFO ] Deduced a trap composed of 35 places in 438 ms of which 1 ms to minimize.
[2022-05-17 21:57:18] [INFO ] Deduced a trap composed of 55 places in 401 ms of which 0 ms to minimize.
[2022-05-17 21:57:18] [INFO ] Deduced a trap composed of 55 places in 397 ms of which 1 ms to minimize.
[2022-05-17 21:57:19] [INFO ] Deduced a trap composed of 55 places in 395 ms of which 1 ms to minimize.
[2022-05-17 21:57:19] [INFO ] Deduced a trap composed of 55 places in 398 ms of which 1 ms to minimize.
[2022-05-17 21:57:19] [INFO ] Deduced a trap composed of 55 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:57:20] [INFO ] Deduced a trap composed of 111 places in 390 ms of which 1 ms to minimize.
[2022-05-17 21:57:20] [INFO ] Deduced a trap composed of 111 places in 385 ms of which 1 ms to minimize.
[2022-05-17 21:57:21] [INFO ] Deduced a trap composed of 111 places in 397 ms of which 1 ms to minimize.
[2022-05-17 21:57:21] [INFO ] Deduced a trap composed of 111 places in 401 ms of which 0 ms to minimize.
[2022-05-17 21:57:22] [INFO ] Deduced a trap composed of 111 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:57:22] [INFO ] Deduced a trap composed of 93 places in 399 ms of which 1 ms to minimize.
[2022-05-17 21:57:23] [INFO ] Deduced a trap composed of 129 places in 396 ms of which 0 ms to minimize.
[2022-05-17 21:57:23] [INFO ] Deduced a trap composed of 49 places in 356 ms of which 0 ms to minimize.
[2022-05-17 21:57:23] [INFO ] Deduced a trap composed of 103 places in 281 ms of which 0 ms to minimize.
[2022-05-17 21:57:24] [INFO ] Deduced a trap composed of 103 places in 278 ms of which 1 ms to minimize.
[2022-05-17 21:57:24] [INFO ] Deduced a trap composed of 75 places in 392 ms of which 0 ms to minimize.
[2022-05-17 21:57:25] [INFO ] Deduced a trap composed of 77 places in 400 ms of which 1 ms to minimize.
[2022-05-17 21:57:25] [INFO ] Deduced a trap composed of 75 places in 398 ms of which 1 ms to minimize.
[2022-05-17 21:57:26] [INFO ] Deduced a trap composed of 75 places in 397 ms of which 1 ms to minimize.
[2022-05-17 21:57:26] [INFO ] Deduced a trap composed of 75 places in 390 ms of which 1 ms to minimize.
[2022-05-17 21:57:27] [INFO ] Deduced a trap composed of 146 places in 393 ms of which 1 ms to minimize.
[2022-05-17 21:57:27] [INFO ] Deduced a trap composed of 57 places in 417 ms of which 1 ms to minimize.
[2022-05-17 21:57:28] [INFO ] Deduced a trap composed of 33 places in 407 ms of which 1 ms to minimize.
[2022-05-17 21:57:28] [INFO ] Deduced a trap composed of 39 places in 392 ms of which 1 ms to minimize.
[2022-05-17 21:57:28] [INFO ] Deduced a trap composed of 53 places in 397 ms of which 4 ms to minimize.
[2022-05-17 21:57:29] [INFO ] Deduced a trap composed of 39 places in 394 ms of which 1 ms to minimize.
[2022-05-17 21:57:29] [INFO ] Deduced a trap composed of 53 places in 406 ms of which 1 ms to minimize.
[2022-05-17 21:57:30] [INFO ] Deduced a trap composed of 51 places in 402 ms of which 1 ms to minimize.
[2022-05-17 21:57:30] [INFO ] Deduced a trap composed of 39 places in 401 ms of which 0 ms to minimize.
[2022-05-17 21:57:31] [INFO ] Deduced a trap composed of 85 places in 337 ms of which 2 ms to minimize.
[2022-05-17 21:57:31] [INFO ] Deduced a trap composed of 111 places in 329 ms of which 1 ms to minimize.
[2022-05-17 21:57:32] [INFO ] Deduced a trap composed of 33 places in 426 ms of which 0 ms to minimize.
[2022-05-17 21:57:32] [INFO ] Deduced a trap composed of 39 places in 390 ms of which 0 ms to minimize.
[2022-05-17 21:57:33] [INFO ] Deduced a trap composed of 147 places in 326 ms of which 1 ms to minimize.
[2022-05-17 21:57:33] [INFO ] Deduced a trap composed of 51 places in 333 ms of which 1 ms to minimize.
[2022-05-17 21:57:34] [INFO ] Deduced a trap composed of 115 places in 319 ms of which 1 ms to minimize.
[2022-05-17 21:57:34] [INFO ] Deduced a trap composed of 81 places in 306 ms of which 0 ms to minimize.
[2022-05-17 21:57:34] [INFO ] Deduced a trap composed of 61 places in 277 ms of which 0 ms to minimize.
[2022-05-17 21:57:35] [INFO ] Deduced a trap composed of 57 places in 314 ms of which 1 ms to minimize.
[2022-05-17 21:57:35] [INFO ] Deduced a trap composed of 57 places in 313 ms of which 0 ms to minimize.
[2022-05-17 21:57:35] [INFO ] Deduced a trap composed of 57 places in 315 ms of which 0 ms to minimize.
[2022-05-17 21:57:36] [INFO ] Deduced a trap composed of 57 places in 308 ms of which 1 ms to minimize.
[2022-05-17 21:57:36] [INFO ] Deduced a trap composed of 97 places in 321 ms of which 1 ms to minimize.
[2022-05-17 21:57:37] [INFO ] Deduced a trap composed of 133 places in 312 ms of which 1 ms to minimize.
[2022-05-17 21:57:37] [INFO ] Deduced a trap composed of 133 places in 313 ms of which 1 ms to minimize.
[2022-05-17 21:57:37] [INFO ] Deduced a trap composed of 57 places in 299 ms of which 0 ms to minimize.
[2022-05-17 21:57:38] [INFO ] Deduced a trap composed of 109 places in 284 ms of which 1 ms to minimize.
[2022-05-17 21:57:38] [INFO ] Deduced a trap composed of 133 places in 232 ms of which 0 ms to minimize.
[2022-05-17 21:57:38] [INFO ] Deduced a trap composed of 97 places in 167 ms of which 1 ms to minimize.
[2022-05-17 21:57:38] [INFO ] Deduced a trap composed of 115 places in 179 ms of which 1 ms to minimize.
[2022-05-17 21:57:39] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 0 ms to minimize.
[2022-05-17 21:57:39] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 1 ms to minimize.
[2022-05-17 21:57:39] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 0 ms to minimize.
[2022-05-17 21:57:39] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 0 ms to minimize.
[2022-05-17 21:57:39] [INFO ] Trap strengthening (SAT) tested/added 88/87 trap constraints in 39566 ms
[2022-05-17 21:57:39] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 81 ms.
[2022-05-17 21:57:44] [INFO ] Deduced a trap composed of 2 places in 528 ms of which 1 ms to minimize.
[2022-05-17 21:57:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:57:44] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 21:57:44] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:57:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:57:45] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2022-05-17 21:57:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:57:45] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 21:57:45] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:57:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:57:46] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2022-05-17 21:57:46] [INFO ] [Nat]Added 546 Read/Feed constraints in 80 ms returned sat
[2022-05-17 21:57:46] [INFO ] Deduced a trap composed of 37 places in 472 ms of which 1 ms to minimize.
[2022-05-17 21:57:47] [INFO ] Deduced a trap composed of 11 places in 481 ms of which 0 ms to minimize.
[2022-05-17 21:57:47] [INFO ] Deduced a trap composed of 35 places in 471 ms of which 1 ms to minimize.
[2022-05-17 21:57:48] [INFO ] Deduced a trap composed of 15 places in 473 ms of which 1 ms to minimize.
[2022-05-17 21:57:49] [INFO ] Deduced a trap composed of 19 places in 507 ms of which 1 ms to minimize.
[2022-05-17 21:57:49] [INFO ] Deduced a trap composed of 39 places in 483 ms of which 1 ms to minimize.
[2022-05-17 21:57:50] [INFO ] Deduced a trap composed of 25 places in 491 ms of which 1 ms to minimize.
[2022-05-17 21:57:50] [INFO ] Deduced a trap composed of 49 places in 477 ms of which 1 ms to minimize.
[2022-05-17 21:57:51] [INFO ] Deduced a trap composed of 11 places in 487 ms of which 1 ms to minimize.
[2022-05-17 21:57:51] [INFO ] Deduced a trap composed of 11 places in 485 ms of which 1 ms to minimize.
[2022-05-17 21:57:52] [INFO ] Deduced a trap composed of 11 places in 490 ms of which 1 ms to minimize.
[2022-05-17 21:57:52] [INFO ] Deduced a trap composed of 15 places in 486 ms of which 1 ms to minimize.
[2022-05-17 21:57:53] [INFO ] Deduced a trap composed of 27 places in 485 ms of which 1 ms to minimize.
[2022-05-17 21:57:53] [INFO ] Deduced a trap composed of 15 places in 482 ms of which 1 ms to minimize.
[2022-05-17 21:57:54] [INFO ] Deduced a trap composed of 29 places in 479 ms of which 0 ms to minimize.
[2022-05-17 21:57:55] [INFO ] Deduced a trap composed of 71 places in 480 ms of which 1 ms to minimize.
[2022-05-17 21:57:55] [INFO ] Deduced a trap composed of 47 places in 479 ms of which 0 ms to minimize.
[2022-05-17 21:57:56] [INFO ] Deduced a trap composed of 23 places in 482 ms of which 1 ms to minimize.
[2022-05-17 21:57:56] [INFO ] Deduced a trap composed of 11 places in 482 ms of which 1 ms to minimize.
[2022-05-17 21:57:57] [INFO ] Deduced a trap composed of 11 places in 483 ms of which 1 ms to minimize.
[2022-05-17 21:57:57] [INFO ] Deduced a trap composed of 84 places in 473 ms of which 1 ms to minimize.
[2022-05-17 21:57:58] [INFO ] Deduced a trap composed of 69 places in 468 ms of which 1 ms to minimize.
[2022-05-17 21:57:58] [INFO ] Deduced a trap composed of 23 places in 464 ms of which 1 ms to minimize.
[2022-05-17 21:57:59] [INFO ] Deduced a trap composed of 41 places in 481 ms of which 1 ms to minimize.
[2022-05-17 21:57:59] [INFO ] Deduced a trap composed of 39 places in 470 ms of which 1 ms to minimize.
[2022-05-17 21:58:00] [INFO ] Deduced a trap composed of 11 places in 468 ms of which 1 ms to minimize.
[2022-05-17 21:58:00] [INFO ] Deduced a trap composed of 43 places in 440 ms of which 1 ms to minimize.
[2022-05-17 21:58:01] [INFO ] Deduced a trap composed of 71 places in 440 ms of which 1 ms to minimize.
[2022-05-17 21:58:01] [INFO ] Deduced a trap composed of 39 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:58:02] [INFO ] Deduced a trap composed of 39 places in 439 ms of which 1 ms to minimize.
[2022-05-17 21:58:02] [INFO ] Deduced a trap composed of 29 places in 458 ms of which 1 ms to minimize.
[2022-05-17 21:58:03] [INFO ] Deduced a trap composed of 41 places in 446 ms of which 1 ms to minimize.
[2022-05-17 21:58:04] [INFO ] Deduced a trap composed of 35 places in 450 ms of which 1 ms to minimize.
[2022-05-17 21:58:04] [INFO ] Deduced a trap composed of 55 places in 398 ms of which 1 ms to minimize.
[2022-05-17 21:58:04] [INFO ] Deduced a trap composed of 55 places in 391 ms of which 0 ms to minimize.
[2022-05-17 21:58:05] [INFO ] Deduced a trap composed of 55 places in 403 ms of which 1 ms to minimize.
[2022-05-17 21:58:05] [INFO ] Deduced a trap composed of 55 places in 397 ms of which 1 ms to minimize.
[2022-05-17 21:58:06] [INFO ] Deduced a trap composed of 55 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:58:06] [INFO ] Deduced a trap composed of 111 places in 399 ms of which 0 ms to minimize.
[2022-05-17 21:58:07] [INFO ] Deduced a trap composed of 111 places in 394 ms of which 1 ms to minimize.
[2022-05-17 21:58:07] [INFO ] Deduced a trap composed of 111 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:58:08] [INFO ] Deduced a trap composed of 111 places in 408 ms of which 1 ms to minimize.
[2022-05-17 21:58:08] [INFO ] Deduced a trap composed of 111 places in 407 ms of which 1 ms to minimize.
[2022-05-17 21:58:09] [INFO ] Deduced a trap composed of 93 places in 402 ms of which 1 ms to minimize.
[2022-05-17 21:58:09] [INFO ] Deduced a trap composed of 129 places in 398 ms of which 1 ms to minimize.
[2022-05-17 21:58:10] [INFO ] Deduced a trap composed of 49 places in 340 ms of which 1 ms to minimize.
[2022-05-17 21:58:10] [INFO ] Deduced a trap composed of 103 places in 274 ms of which 1 ms to minimize.
[2022-05-17 21:58:10] [INFO ] Deduced a trap composed of 103 places in 275 ms of which 0 ms to minimize.
[2022-05-17 21:58:11] [INFO ] Deduced a trap composed of 75 places in 399 ms of which 0 ms to minimize.
[2022-05-17 21:58:11] [INFO ] Deduced a trap composed of 77 places in 400 ms of which 1 ms to minimize.
[2022-05-17 21:58:12] [INFO ] Deduced a trap composed of 75 places in 395 ms of which 1 ms to minimize.
[2022-05-17 21:58:12] [INFO ] Deduced a trap composed of 75 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:58:13] [INFO ] Deduced a trap composed of 75 places in 392 ms of which 1 ms to minimize.
[2022-05-17 21:58:13] [INFO ] Deduced a trap composed of 146 places in 396 ms of which 1 ms to minimize.
[2022-05-17 21:58:13] [INFO ] Deduced a trap composed of 57 places in 410 ms of which 0 ms to minimize.
[2022-05-17 21:58:14] [INFO ] Deduced a trap composed of 33 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:58:14] [INFO ] Deduced a trap composed of 39 places in 387 ms of which 1 ms to minimize.
[2022-05-17 21:58:15] [INFO ] Deduced a trap composed of 53 places in 389 ms of which 1 ms to minimize.
[2022-05-17 21:58:15] [INFO ] Deduced a trap composed of 39 places in 400 ms of which 1 ms to minimize.
[2022-05-17 21:58:16] [INFO ] Deduced a trap composed of 53 places in 399 ms of which 1 ms to minimize.
[2022-05-17 21:58:16] [INFO ] Deduced a trap composed of 51 places in 395 ms of which 0 ms to minimize.
[2022-05-17 21:58:17] [INFO ] Deduced a trap composed of 39 places in 393 ms of which 1 ms to minimize.
[2022-05-17 21:58:17] [INFO ] Deduced a trap composed of 85 places in 332 ms of which 1 ms to minimize.
[2022-05-17 21:58:18] [INFO ] Deduced a trap composed of 111 places in 328 ms of which 0 ms to minimize.
[2022-05-17 21:58:18] [INFO ] Deduced a trap composed of 33 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:58:18] [INFO ] Deduced a trap composed of 39 places in 383 ms of which 0 ms to minimize.
[2022-05-17 21:58:19] [INFO ] Deduced a trap composed of 147 places in 332 ms of which 1 ms to minimize.
[2022-05-17 21:58:19] [INFO ] Deduced a trap composed of 51 places in 334 ms of which 0 ms to minimize.
[2022-05-17 21:58:20] [INFO ] Deduced a trap composed of 115 places in 307 ms of which 0 ms to minimize.
[2022-05-17 21:58:20] [INFO ] Deduced a trap composed of 81 places in 310 ms of which 1 ms to minimize.
[2022-05-17 21:58:21] [INFO ] Deduced a trap composed of 61 places in 286 ms of which 1 ms to minimize.
[2022-05-17 21:58:21] [INFO ] Deduced a trap composed of 57 places in 302 ms of which 0 ms to minimize.
[2022-05-17 21:58:21] [INFO ] Deduced a trap composed of 57 places in 302 ms of which 0 ms to minimize.
[2022-05-17 21:58:22] [INFO ] Deduced a trap composed of 57 places in 308 ms of which 1 ms to minimize.
[2022-05-17 21:58:22] [INFO ] Deduced a trap composed of 57 places in 310 ms of which 1 ms to minimize.
[2022-05-17 21:58:22] [INFO ] Deduced a trap composed of 97 places in 312 ms of which 1 ms to minimize.
[2022-05-17 21:58:23] [INFO ] Deduced a trap composed of 133 places in 305 ms of which 1 ms to minimize.
[2022-05-17 21:58:23] [INFO ] Deduced a trap composed of 133 places in 307 ms of which 1 ms to minimize.
[2022-05-17 21:58:24] [INFO ] Deduced a trap composed of 57 places in 296 ms of which 1 ms to minimize.
[2022-05-17 21:58:24] [INFO ] Deduced a trap composed of 109 places in 276 ms of which 1 ms to minimize.
[2022-05-17 21:58:24] [INFO ] Deduced a trap composed of 133 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:58:24] [INFO ] Deduced a trap composed of 97 places in 164 ms of which 1 ms to minimize.
[2022-05-17 21:58:25] [INFO ] Deduced a trap composed of 115 places in 165 ms of which 0 ms to minimize.
[2022-05-17 21:58:25] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 0 ms to minimize.
[2022-05-17 21:58:25] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 1 ms to minimize.
[2022-05-17 21:58:25] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 0 ms to minimize.
[2022-05-17 21:58:25] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 1 ms to minimize.
[2022-05-17 21:58:26] [INFO ] Trap strengthening (SAT) tested/added 88/87 trap constraints in 39707 ms
[2022-05-17 21:58:26] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 87 ms.
[2022-05-17 21:58:30] [INFO ] Added : 245 causal constraints over 49 iterations in 4439 ms. Result :unknown
[2022-05-17 21:58:30] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 21:58:30] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 21:58:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:58:31] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2022-05-17 21:58:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:58:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 21:58:31] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:58:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:58:31] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2022-05-17 21:58:31] [INFO ] [Nat]Added 546 Read/Feed constraints in 81 ms returned sat
[2022-05-17 21:58:32] [INFO ] Deduced a trap composed of 35 places in 390 ms of which 1 ms to minimize.
[2022-05-17 21:58:32] [INFO ] Deduced a trap composed of 33 places in 394 ms of which 1 ms to minimize.
[2022-05-17 21:58:33] [INFO ] Deduced a trap composed of 23 places in 426 ms of which 1 ms to minimize.
[2022-05-17 21:58:33] [INFO ] Deduced a trap composed of 23 places in 404 ms of which 1 ms to minimize.
[2022-05-17 21:58:34] [INFO ] Deduced a trap composed of 11 places in 398 ms of which 1 ms to minimize.
[2022-05-17 21:58:34] [INFO ] Deduced a trap composed of 23 places in 436 ms of which 0 ms to minimize.
[2022-05-17 21:58:34] [INFO ] Deduced a trap composed of 25 places in 407 ms of which 0 ms to minimize.
[2022-05-17 21:58:35] [INFO ] Deduced a trap composed of 41 places in 420 ms of which 1 ms to minimize.
[2022-05-17 21:58:35] [INFO ] Deduced a trap composed of 39 places in 405 ms of which 0 ms to minimize.
[2022-05-17 21:58:36] [INFO ] Deduced a trap composed of 25 places in 404 ms of which 0 ms to minimize.
[2022-05-17 21:58:36] [INFO ] Deduced a trap composed of 11 places in 415 ms of which 1 ms to minimize.
[2022-05-17 21:58:37] [INFO ] Deduced a trap composed of 11 places in 403 ms of which 1 ms to minimize.
[2022-05-17 21:58:37] [INFO ] Deduced a trap composed of 11 places in 412 ms of which 1 ms to minimize.
[2022-05-17 21:58:38] [INFO ] Deduced a trap composed of 35 places in 387 ms of which 0 ms to minimize.
[2022-05-17 21:58:38] [INFO ] Deduced a trap composed of 39 places in 395 ms of which 0 ms to minimize.
[2022-05-17 21:58:39] [INFO ] Deduced a trap composed of 53 places in 393 ms of which 1 ms to minimize.
[2022-05-17 21:58:39] [INFO ] Deduced a trap composed of 55 places in 384 ms of which 0 ms to minimize.
[2022-05-17 21:58:40] [INFO ] Deduced a trap composed of 73 places in 388 ms of which 1 ms to minimize.
[2022-05-17 21:58:40] [INFO ] Deduced a trap composed of 23 places in 385 ms of which 1 ms to minimize.
[2022-05-17 21:58:40] [INFO ] Deduced a trap composed of 138 places in 339 ms of which 1 ms to minimize.
[2022-05-17 21:58:41] [INFO ] Deduced a trap composed of 81 places in 264 ms of which 0 ms to minimize.
[2022-05-17 21:58:41] [INFO ] Deduced a trap composed of 51 places in 351 ms of which 1 ms to minimize.
[2022-05-17 21:58:42] [INFO ] Deduced a trap composed of 107 places in 336 ms of which 0 ms to minimize.
[2022-05-17 21:58:42] [INFO ] Deduced a trap composed of 89 places in 340 ms of which 0 ms to minimize.
[2022-05-17 21:58:42] [INFO ] Deduced a trap composed of 51 places in 339 ms of which 1 ms to minimize.
[2022-05-17 21:58:43] [INFO ] Deduced a trap composed of 87 places in 355 ms of which 0 ms to minimize.
[2022-05-17 21:58:43] [INFO ] Deduced a trap composed of 51 places in 340 ms of which 1 ms to minimize.
[2022-05-17 21:58:44] [INFO ] Deduced a trap composed of 51 places in 337 ms of which 1 ms to minimize.
[2022-05-17 21:58:44] [INFO ] Deduced a trap composed of 51 places in 336 ms of which 1 ms to minimize.
[2022-05-17 21:58:44] [INFO ] Deduced a trap composed of 51 places in 340 ms of which 1 ms to minimize.
[2022-05-17 21:58:45] [INFO ] Deduced a trap composed of 13 places in 402 ms of which 0 ms to minimize.
[2022-05-17 21:58:45] [INFO ] Deduced a trap composed of 41 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:58:46] [INFO ] Deduced a trap composed of 45 places in 400 ms of which 0 ms to minimize.
[2022-05-17 21:58:46] [INFO ] Deduced a trap composed of 43 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:58:47] [INFO ] Deduced a trap composed of 89 places in 353 ms of which 0 ms to minimize.
[2022-05-17 21:58:47] [INFO ] Deduced a trap composed of 27 places in 347 ms of which 1 ms to minimize.
[2022-05-17 21:58:48] [INFO ] Deduced a trap composed of 11 places in 388 ms of which 1 ms to minimize.
[2022-05-17 21:58:48] [INFO ] Deduced a trap composed of 13 places in 383 ms of which 1 ms to minimize.
[2022-05-17 21:58:48] [INFO ] Deduced a trap composed of 165 places in 359 ms of which 1 ms to minimize.
[2022-05-17 21:58:49] [INFO ] Deduced a trap composed of 165 places in 363 ms of which 1 ms to minimize.
[2022-05-17 21:58:49] [INFO ] Deduced a trap composed of 97 places in 359 ms of which 1 ms to minimize.
[2022-05-17 21:58:50] [INFO ] Deduced a trap composed of 105 places in 364 ms of which 1 ms to minimize.
[2022-05-17 21:58:50] [INFO ] Deduced a trap composed of 41 places in 370 ms of which 1 ms to minimize.
[2022-05-17 21:58:51] [INFO ] Deduced a trap composed of 33 places in 365 ms of which 0 ms to minimize.
[2022-05-17 21:58:51] [INFO ] Deduced a trap composed of 23 places in 388 ms of which 1 ms to minimize.
[2022-05-17 21:58:51] [INFO ] Deduced a trap composed of 77 places in 336 ms of which 1 ms to minimize.
[2022-05-17 21:58:52] [INFO ] Deduced a trap composed of 125 places in 329 ms of which 1 ms to minimize.
[2022-05-17 21:58:52] [INFO ] Deduced a trap composed of 157 places in 338 ms of which 0 ms to minimize.
[2022-05-17 21:58:53] [INFO ] Deduced a trap composed of 97 places in 334 ms of which 1 ms to minimize.
[2022-05-17 21:58:53] [INFO ] Deduced a trap composed of 223 places in 337 ms of which 1 ms to minimize.
[2022-05-17 21:58:53] [INFO ] Deduced a trap composed of 61 places in 332 ms of which 1 ms to minimize.
[2022-05-17 21:58:54] [INFO ] Deduced a trap composed of 115 places in 291 ms of which 1 ms to minimize.
[2022-05-17 21:58:54] [INFO ] Deduced a trap composed of 115 places in 298 ms of which 1 ms to minimize.
[2022-05-17 21:58:55] [INFO ] Deduced a trap composed of 87 places in 291 ms of which 1 ms to minimize.
[2022-05-17 21:58:55] [INFO ] Deduced a trap composed of 97 places in 293 ms of which 1 ms to minimize.
[2022-05-17 21:58:55] [INFO ] Deduced a trap composed of 97 places in 288 ms of which 1 ms to minimize.
[2022-05-17 21:58:56] [INFO ] Deduced a trap composed of 69 places in 285 ms of which 1 ms to minimize.
[2022-05-17 21:58:56] [INFO ] Deduced a trap composed of 133 places in 285 ms of which 1 ms to minimize.
[2022-05-17 21:58:56] [INFO ] Deduced a trap composed of 97 places in 284 ms of which 1 ms to minimize.
[2022-05-17 21:58:57] [INFO ] Deduced a trap composed of 77 places in 279 ms of which 1 ms to minimize.
[2022-05-17 21:58:57] [INFO ] Deduced a trap composed of 77 places in 283 ms of which 0 ms to minimize.
[2022-05-17 21:58:57] [INFO ] Deduced a trap composed of 77 places in 275 ms of which 1 ms to minimize.
[2022-05-17 21:58:58] [INFO ] Deduced a trap composed of 115 places in 283 ms of which 1 ms to minimize.
[2022-05-17 21:58:58] [INFO ] Deduced a trap composed of 115 places in 287 ms of which 0 ms to minimize.
[2022-05-17 21:58:58] [INFO ] Deduced a trap composed of 115 places in 282 ms of which 0 ms to minimize.
[2022-05-17 21:58:59] [INFO ] Deduced a trap composed of 115 places in 289 ms of which 1 ms to minimize.
[2022-05-17 21:58:59] [INFO ] Deduced a trap composed of 69 places in 289 ms of which 0 ms to minimize.
[2022-05-17 21:58:59] [INFO ] Deduced a trap composed of 69 places in 284 ms of which 1 ms to minimize.
[2022-05-17 21:59:00] [INFO ] Deduced a trap composed of 105 places in 212 ms of which 1 ms to minimize.
[2022-05-17 21:59:00] [INFO ] Deduced a trap composed of 149 places in 162 ms of which 1 ms to minimize.
[2022-05-17 21:59:00] [INFO ] Deduced a trap composed of 133 places in 166 ms of which 1 ms to minimize.
[2022-05-17 21:59:00] [INFO ] Deduced a trap composed of 133 places in 167 ms of which 0 ms to minimize.
[2022-05-17 21:59:01] [INFO ] Deduced a trap composed of 133 places in 165 ms of which 1 ms to minimize.
[2022-05-17 21:59:01] [INFO ] Deduced a trap composed of 123 places in 168 ms of which 1 ms to minimize.
[2022-05-17 21:59:01] [INFO ] Deduced a trap composed of 133 places in 174 ms of which 0 ms to minimize.
[2022-05-17 21:59:02] [INFO ] Deduced a trap composed of 29 places in 339 ms of which 1 ms to minimize.
[2022-05-17 21:59:02] [INFO ] Deduced a trap composed of 37 places in 333 ms of which 1 ms to minimize.
[2022-05-17 21:59:03] [INFO ] Deduced a trap composed of 31 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:59:04] [INFO ] Deduced a trap composed of 31 places in 393 ms of which 1 ms to minimize.
[2022-05-17 21:59:04] [INFO ] Deduced a trap composed of 101 places in 385 ms of which 1 ms to minimize.
[2022-05-17 21:59:05] [INFO ] Deduced a trap composed of 55 places in 385 ms of which 0 ms to minimize.
[2022-05-17 21:59:05] [INFO ] Deduced a trap composed of 49 places in 381 ms of which 1 ms to minimize.
[2022-05-17 21:59:05] [INFO ] Deduced a trap composed of 47 places in 376 ms of which 1 ms to minimize.
[2022-05-17 21:59:06] [INFO ] Deduced a trap composed of 35 places in 379 ms of which 0 ms to minimize.
[2022-05-17 21:59:06] [INFO ] Deduced a trap composed of 61 places in 379 ms of which 1 ms to minimize.
[2022-05-17 21:59:07] [INFO ] Deduced a trap composed of 11 places in 408 ms of which 0 ms to minimize.
[2022-05-17 21:59:07] [INFO ] Deduced a trap composed of 53 places in 349 ms of which 1 ms to minimize.
[2022-05-17 21:59:08] [INFO ] Deduced a trap composed of 69 places in 367 ms of which 1 ms to minimize.
[2022-05-17 21:59:08] [INFO ] Deduced a trap composed of 59 places in 369 ms of which 0 ms to minimize.
[2022-05-17 21:59:09] [INFO ] Deduced a trap composed of 97 places in 368 ms of which 1 ms to minimize.
[2022-05-17 21:59:09] [INFO ] Deduced a trap composed of 97 places in 369 ms of which 1 ms to minimize.
[2022-05-17 21:59:09] [INFO ] Deduced a trap composed of 79 places in 366 ms of which 0 ms to minimize.
[2022-05-17 21:59:10] [INFO ] Deduced a trap composed of 97 places in 370 ms of which 1 ms to minimize.
[2022-05-17 21:59:10] [INFO ] Deduced a trap composed of 75 places in 374 ms of which 1 ms to minimize.
[2022-05-17 21:59:11] [INFO ] Deduced a trap composed of 97 places in 371 ms of which 0 ms to minimize.
[2022-05-17 21:59:11] [INFO ] Deduced a trap composed of 97 places in 369 ms of which 0 ms to minimize.
[2022-05-17 21:59:12] [INFO ] Deduced a trap composed of 43 places in 369 ms of which 1 ms to minimize.
[2022-05-17 21:59:12] [INFO ] Deduced a trap composed of 49 places in 332 ms of which 1 ms to minimize.
[2022-05-17 21:59:12] [INFO ] Deduced a trap composed of 77 places in 262 ms of which 1 ms to minimize.
[2022-05-17 21:59:13] [INFO ] Deduced a trap composed of 129 places in 219 ms of which 0 ms to minimize.
[2022-05-17 21:59:13] [INFO ] Deduced a trap composed of 93 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:59:13] [INFO ] Deduced a trap composed of 93 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:59:14] [INFO ] Deduced a trap composed of 115 places in 269 ms of which 1 ms to minimize.
[2022-05-17 21:59:14] [INFO ] Deduced a trap composed of 115 places in 277 ms of which 0 ms to minimize.
[2022-05-17 21:59:14] [INFO ] Deduced a trap composed of 133 places in 275 ms of which 0 ms to minimize.
[2022-05-17 21:59:15] [INFO ] Deduced a trap composed of 133 places in 270 ms of which 0 ms to minimize.
[2022-05-17 21:59:15] [INFO ] Deduced a trap composed of 129 places in 268 ms of which 1 ms to minimize.
[2022-05-17 21:59:15] [INFO ] Deduced a trap composed of 75 places in 267 ms of which 1 ms to minimize.
[2022-05-17 21:59:15] [INFO ] Deduced a trap composed of 111 places in 197 ms of which 0 ms to minimize.
[2022-05-17 21:59:16] [INFO ] Deduced a trap composed of 111 places in 207 ms of which 1 ms to minimize.
[2022-05-17 21:59:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:59:16] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 21:59:16] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 21:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:59:16] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2022-05-17 21:59:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:59:16] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 21:59:16] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 21:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:59:17] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2022-05-17 21:59:17] [INFO ] [Nat]Added 546 Read/Feed constraints in 83 ms returned sat
[2022-05-17 21:59:17] [INFO ] Deduced a trap composed of 29 places in 420 ms of which 1 ms to minimize.
[2022-05-17 21:59:18] [INFO ] Deduced a trap composed of 11 places in 419 ms of which 0 ms to minimize.
[2022-05-17 21:59:18] [INFO ] Deduced a trap composed of 15 places in 411 ms of which 1 ms to minimize.
[2022-05-17 21:59:19] [INFO ] Deduced a trap composed of 21 places in 400 ms of which 1 ms to minimize.
[2022-05-17 21:59:19] [INFO ] Deduced a trap composed of 33 places in 398 ms of which 0 ms to minimize.
[2022-05-17 21:59:20] [INFO ] Deduced a trap composed of 31 places in 383 ms of which 0 ms to minimize.
[2022-05-17 21:59:20] [INFO ] Deduced a trap composed of 23 places in 381 ms of which 0 ms to minimize.
[2022-05-17 21:59:21] [INFO ] Deduced a trap composed of 33 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:59:21] [INFO ] Deduced a trap composed of 33 places in 380 ms of which 0 ms to minimize.
[2022-05-17 21:59:22] [INFO ] Deduced a trap composed of 29 places in 349 ms of which 0 ms to minimize.
[2022-05-17 21:59:22] [INFO ] Deduced a trap composed of 103 places in 341 ms of which 1 ms to minimize.
[2022-05-17 21:59:22] [INFO ] Deduced a trap composed of 133 places in 345 ms of which 0 ms to minimize.
[2022-05-17 21:59:23] [INFO ] Deduced a trap composed of 85 places in 272 ms of which 1 ms to minimize.
[2022-05-17 21:59:23] [INFO ] Deduced a trap composed of 67 places in 268 ms of which 1 ms to minimize.
[2022-05-17 21:59:23] [INFO ] Deduced a trap composed of 85 places in 273 ms of which 0 ms to minimize.
[2022-05-17 21:59:24] [INFO ] Deduced a trap composed of 101 places in 271 ms of which 0 ms to minimize.
[2022-05-17 21:59:24] [INFO ] Deduced a trap composed of 103 places in 268 ms of which 0 ms to minimize.
[2022-05-17 21:59:24] [INFO ] Deduced a trap composed of 85 places in 268 ms of which 0 ms to minimize.
[2022-05-17 21:59:25] [INFO ] Deduced a trap composed of 85 places in 269 ms of which 1 ms to minimize.
[2022-05-17 21:59:25] [INFO ] Deduced a trap composed of 73 places in 337 ms of which 1 ms to minimize.
[2022-05-17 21:59:26] [INFO ] Deduced a trap composed of 77 places in 345 ms of which 1 ms to minimize.
[2022-05-17 21:59:26] [INFO ] Deduced a trap composed of 73 places in 340 ms of which 1 ms to minimize.
[2022-05-17 21:59:26] [INFO ] Deduced a trap composed of 73 places in 337 ms of which 1 ms to minimize.
[2022-05-17 21:59:27] [INFO ] Deduced a trap composed of 77 places in 338 ms of which 1 ms to minimize.
[2022-05-17 21:59:27] [INFO ] Deduced a trap composed of 73 places in 343 ms of which 1 ms to minimize.
[2022-05-17 21:59:28] [INFO ] Deduced a trap composed of 77 places in 338 ms of which 1 ms to minimize.
[2022-05-17 21:59:28] [INFO ] Deduced a trap composed of 91 places in 333 ms of which 0 ms to minimize.
[2022-05-17 21:59:28] [INFO ] Deduced a trap composed of 127 places in 330 ms of which 0 ms to minimize.
[2022-05-17 21:59:29] [INFO ] Deduced a trap composed of 109 places in 339 ms of which 0 ms to minimize.
[2022-05-17 21:59:29] [INFO ] Deduced a trap composed of 155 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:59:30] [INFO ] Deduced a trap composed of 109 places in 353 ms of which 1 ms to minimize.
[2022-05-17 21:59:30] [INFO ] Deduced a trap composed of 188 places in 346 ms of which 1 ms to minimize.
[2022-05-17 21:59:30] [INFO ] Deduced a trap composed of 109 places in 340 ms of which 1 ms to minimize.
[2022-05-17 21:59:31] [INFO ] Deduced a trap composed of 109 places in 340 ms of which 1 ms to minimize.
[2022-05-17 21:59:31] [INFO ] Deduced a trap composed of 109 places in 334 ms of which 1 ms to minimize.
[2022-05-17 21:59:32] [INFO ] Deduced a trap composed of 109 places in 355 ms of which 1 ms to minimize.
[2022-05-17 21:59:32] [INFO ] Deduced a trap composed of 57 places in 314 ms of which 0 ms to minimize.
[2022-05-17 21:59:32] [INFO ] Deduced a trap composed of 55 places in 306 ms of which 1 ms to minimize.
[2022-05-17 21:59:33] [INFO ] Deduced a trap composed of 55 places in 306 ms of which 1 ms to minimize.
[2022-05-17 21:59:33] [INFO ] Deduced a trap composed of 91 places in 310 ms of which 1 ms to minimize.
[2022-05-17 21:59:34] [INFO ] Deduced a trap composed of 117 places in 299 ms of which 1 ms to minimize.
[2022-05-17 21:59:34] [INFO ] Deduced a trap composed of 93 places in 294 ms of which 1 ms to minimize.
[2022-05-17 21:59:34] [INFO ] Deduced a trap composed of 53 places in 296 ms of which 1 ms to minimize.
[2022-05-17 21:59:35] [INFO ] Deduced a trap composed of 57 places in 299 ms of which 1 ms to minimize.
[2022-05-17 21:59:35] [INFO ] Deduced a trap composed of 53 places in 298 ms of which 1 ms to minimize.
[2022-05-17 21:59:35] [INFO ] Deduced a trap composed of 112 places in 298 ms of which 0 ms to minimize.
[2022-05-17 21:59:36] [INFO ] Deduced a trap composed of 55 places in 299 ms of which 1 ms to minimize.
[2022-05-17 21:59:36] [INFO ] Deduced a trap composed of 35 places in 388 ms of which 0 ms to minimize.
[2022-05-17 21:59:36] [INFO ] Deduced a trap composed of 93 places in 253 ms of which 1 ms to minimize.
[2022-05-17 21:59:37] [INFO ] Deduced a trap composed of 93 places in 261 ms of which 1 ms to minimize.
[2022-05-17 21:59:37] [INFO ] Deduced a trap composed of 93 places in 261 ms of which 0 ms to minimize.
[2022-05-17 21:59:38] [INFO ] Deduced a trap composed of 43 places in 422 ms of which 1 ms to minimize.
[2022-05-17 21:59:38] [INFO ] Deduced a trap composed of 41 places in 423 ms of which 0 ms to minimize.
[2022-05-17 21:59:39] [INFO ] Deduced a trap composed of 29 places in 426 ms of which 1 ms to minimize.
[2022-05-17 21:59:39] [INFO ] Deduced a trap composed of 35 places in 422 ms of which 1 ms to minimize.
[2022-05-17 21:59:40] [INFO ] Deduced a trap composed of 77 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:59:40] [INFO ] Deduced a trap composed of 35 places in 425 ms of which 1 ms to minimize.
[2022-05-17 21:59:41] [INFO ] Deduced a trap composed of 29 places in 426 ms of which 1 ms to minimize.
[2022-05-17 21:59:41] [INFO ] Deduced a trap composed of 31 places in 428 ms of which 0 ms to minimize.
[2022-05-17 21:59:42] [INFO ] Deduced a trap composed of 77 places in 430 ms of which 0 ms to minimize.
[2022-05-17 21:59:42] [INFO ] Deduced a trap composed of 77 places in 431 ms of which 1 ms to minimize.
[2022-05-17 21:59:43] [INFO ] Deduced a trap composed of 29 places in 437 ms of which 1 ms to minimize.
[2022-05-17 21:59:43] [INFO ] Deduced a trap composed of 29 places in 428 ms of which 1 ms to minimize.
[2022-05-17 21:59:44] [INFO ] Deduced a trap composed of 27 places in 406 ms of which 1 ms to minimize.
[2022-05-17 21:59:44] [INFO ] Deduced a trap composed of 17 places in 394 ms of which 1 ms to minimize.
[2022-05-17 21:59:45] [INFO ] Deduced a trap composed of 107 places in 389 ms of which 1 ms to minimize.
[2022-05-17 21:59:45] [INFO ] Deduced a trap composed of 43 places in 390 ms of which 1 ms to minimize.
[2022-05-17 21:59:45] [INFO ] Deduced a trap composed of 75 places in 393 ms of which 1 ms to minimize.
[2022-05-17 21:59:46] [INFO ] Deduced a trap composed of 49 places in 395 ms of which 1 ms to minimize.
[2022-05-17 21:59:46] [INFO ] Deduced a trap composed of 53 places in 391 ms of which 1 ms to minimize.
[2022-05-17 21:59:47] [INFO ] Deduced a trap composed of 85 places in 396 ms of which 0 ms to minimize.
[2022-05-17 21:59:47] [INFO ] Deduced a trap composed of 13 places in 402 ms of which 1 ms to minimize.
[2022-05-17 21:59:48] [INFO ] Deduced a trap composed of 15 places in 403 ms of which 0 ms to minimize.
[2022-05-17 21:59:48] [INFO ] Deduced a trap composed of 15 places in 394 ms of which 1 ms to minimize.
[2022-05-17 21:59:49] [INFO ] Deduced a trap composed of 15 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:59:49] [INFO ] Deduced a trap composed of 47 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:59:50] [INFO ] Deduced a trap composed of 23 places in 355 ms of which 0 ms to minimize.
[2022-05-17 21:59:50] [INFO ] Deduced a trap composed of 11 places in 408 ms of which 1 ms to minimize.
[2022-05-17 21:59:51] [INFO ] Deduced a trap composed of 65 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:59:51] [INFO ] Deduced a trap composed of 59 places in 407 ms of which 1 ms to minimize.
[2022-05-17 21:59:51] [INFO ] Deduced a trap composed of 29 places in 377 ms of which 1 ms to minimize.
[2022-05-17 21:59:52] [INFO ] Deduced a trap composed of 29 places in 385 ms of which 0 ms to minimize.
[2022-05-17 21:59:52] [INFO ] Deduced a trap composed of 115 places in 294 ms of which 1 ms to minimize.
[2022-05-17 21:59:53] [INFO ] Deduced a trap composed of 133 places in 266 ms of which 1 ms to minimize.
[2022-05-17 21:59:53] [INFO ] Deduced a trap composed of 77 places in 259 ms of which 1 ms to minimize.
[2022-05-17 21:59:53] [INFO ] Deduced a trap composed of 77 places in 263 ms of which 1 ms to minimize.
[2022-05-17 21:59:54] [INFO ] Deduced a trap composed of 97 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:59:54] [INFO ] Trap strengthening (SAT) tested/added 88/87 trap constraints in 36715 ms
[2022-05-17 21:59:54] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 98 ms.
[2022-05-17 22:00:02] [INFO ] Deduced a trap composed of 2 places in 512 ms of which 1 ms to minimize.
[2022-05-17 22:00: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 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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 22:00:02] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 22:00:02] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 22:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:00:02] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2022-05-17 22:00:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:00:03] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 22:00:03] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 22:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:00:03] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2022-05-17 22:00:03] [INFO ] [Nat]Added 546 Read/Feed constraints in 77 ms returned sat
[2022-05-17 22:00:04] [INFO ] Deduced a trap composed of 29 places in 432 ms of which 1 ms to minimize.
[2022-05-17 22:00:04] [INFO ] Deduced a trap composed of 11 places in 426 ms of which 0 ms to minimize.
[2022-05-17 22:00:05] [INFO ] Deduced a trap composed of 11 places in 427 ms of which 1 ms to minimize.
[2022-05-17 22:00:05] [INFO ] Deduced a trap composed of 15 places in 427 ms of which 1 ms to minimize.
[2022-05-17 22:00:06] [INFO ] Deduced a trap composed of 29 places in 419 ms of which 1 ms to minimize.
[2022-05-17 22:00:06] [INFO ] Deduced a trap composed of 29 places in 426 ms of which 1 ms to minimize.
[2022-05-17 22:00:06] [INFO ] Deduced a trap composed of 73 places in 418 ms of which 1 ms to minimize.
[2022-05-17 22:00:07] [INFO ] Deduced a trap composed of 49 places in 421 ms of which 1 ms to minimize.
[2022-05-17 22:00:07] [INFO ] Deduced a trap composed of 59 places in 424 ms of which 0 ms to minimize.
[2022-05-17 22:00:08] [INFO ] Deduced a trap composed of 13 places in 426 ms of which 1 ms to minimize.
[2022-05-17 22:00:08] [INFO ] Deduced a trap composed of 11 places in 420 ms of which 1 ms to minimize.
[2022-05-17 22:00:09] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 0 ms to minimize.
[2022-05-17 22:00:09] [INFO ] Deduced a trap composed of 13 places in 417 ms of which 1 ms to minimize.
[2022-05-17 22:00:10] [INFO ] Deduced a trap composed of 39 places in 394 ms of which 0 ms to minimize.
[2022-05-17 22:00:10] [INFO ] Deduced a trap composed of 27 places in 393 ms of which 0 ms to minimize.
[2022-05-17 22:00:11] [INFO ] Deduced a trap composed of 31 places in 398 ms of which 1 ms to minimize.
[2022-05-17 22:00:11] [INFO ] Deduced a trap composed of 27 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:00:12] [INFO ] Deduced a trap composed of 41 places in 412 ms of which 1 ms to minimize.
[2022-05-17 22:00:12] [INFO ] Deduced a trap composed of 61 places in 414 ms of which 1 ms to minimize.
[2022-05-17 22:00:13] [INFO ] Deduced a trap composed of 11 places in 420 ms of which 1 ms to minimize.
[2022-05-17 22:00:13] [INFO ] Deduced a trap composed of 11 places in 419 ms of which 0 ms to minimize.
[2022-05-17 22:00:14] [INFO ] Deduced a trap composed of 11 places in 414 ms of which 1 ms to minimize.
[2022-05-17 22:00:14] [INFO ] Deduced a trap composed of 33 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:00:15] [INFO ] Deduced a trap composed of 29 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:00:15] [INFO ] Deduced a trap composed of 49 places in 347 ms of which 0 ms to minimize.
[2022-05-17 22:00:15] [INFO ] Deduced a trap composed of 29 places in 347 ms of which 1 ms to minimize.
[2022-05-17 22:00:16] [INFO ] Deduced a trap composed of 49 places in 349 ms of which 1 ms to minimize.
[2022-05-17 22:00:16] [INFO ] Deduced a trap composed of 29 places in 349 ms of which 1 ms to minimize.
[2022-05-17 22:00:17] [INFO ] Deduced a trap composed of 37 places in 359 ms of which 0 ms to minimize.
[2022-05-17 22:00:17] [INFO ] Deduced a trap composed of 67 places in 354 ms of which 1 ms to minimize.
[2022-05-17 22:00:17] [INFO ] Deduced a trap composed of 49 places in 347 ms of which 1 ms to minimize.
[2022-05-17 22:00:18] [INFO ] Deduced a trap composed of 73 places in 351 ms of which 1 ms to minimize.
[2022-05-17 22:00:18] [INFO ] Deduced a trap composed of 55 places in 342 ms of which 0 ms to minimize.
[2022-05-17 22:00:19] [INFO ] Deduced a trap composed of 120 places in 303 ms of which 0 ms to minimize.
[2022-05-17 22:00:19] [INFO ] Deduced a trap composed of 37 places in 252 ms of which 1 ms to minimize.
[2022-05-17 22:00:19] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 0 ms to minimize.
[2022-05-17 22:00:20] [INFO ] Deduced a trap composed of 55 places in 247 ms of which 0 ms to minimize.
[2022-05-17 22:00:20] [INFO ] Deduced a trap composed of 37 places in 245 ms of which 1 ms to minimize.
[2022-05-17 22:00:20] [INFO ] Deduced a trap composed of 120 places in 300 ms of which 0 ms to minimize.
[2022-05-17 22:00:21] [INFO ] Deduced a trap composed of 73 places in 322 ms of which 1 ms to minimize.
[2022-05-17 22:00:21] [INFO ] Deduced a trap composed of 83 places in 259 ms of which 0 ms to minimize.
[2022-05-17 22:00:21] [INFO ] Deduced a trap composed of 83 places in 258 ms of which 0 ms to minimize.
[2022-05-17 22:00:22] [INFO ] Deduced a trap composed of 83 places in 257 ms of which 1 ms to minimize.
[2022-05-17 22:00:22] [INFO ] Deduced a trap composed of 83 places in 259 ms of which 1 ms to minimize.
[2022-05-17 22:00:22] [INFO ] Deduced a trap composed of 83 places in 259 ms of which 1 ms to minimize.
[2022-05-17 22:00:23] [INFO ] Deduced a trap composed of 83 places in 261 ms of which 1 ms to minimize.
[2022-05-17 22:00:23] [INFO ] Deduced a trap composed of 83 places in 259 ms of which 1 ms to minimize.
[2022-05-17 22:00:23] [INFO ] Deduced a trap composed of 109 places in 257 ms of which 1 ms to minimize.
[2022-05-17 22:00:24] [INFO ] Deduced a trap composed of 101 places in 257 ms of which 0 ms to minimize.
[2022-05-17 22:00:24] [INFO ] Deduced a trap composed of 83 places in 265 ms of which 0 ms to minimize.
[2022-05-17 22:00:24] [INFO ] Deduced a trap composed of 109 places in 256 ms of which 0 ms to minimize.
[2022-05-17 22:00:25] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 1 ms to minimize.
[2022-05-17 22:00:25] [INFO ] Deduced a trap composed of 15 places in 417 ms of which 1 ms to minimize.
[2022-05-17 22:00:26] [INFO ] Deduced a trap composed of 17 places in 419 ms of which 1 ms to minimize.
[2022-05-17 22:00:26] [INFO ] Deduced a trap composed of 15 places in 421 ms of which 1 ms to minimize.
[2022-05-17 22:00:27] [INFO ] Deduced a trap composed of 49 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:00:27] [INFO ] Deduced a trap composed of 51 places in 389 ms of which 1 ms to minimize.
[2022-05-17 22:00:28] [INFO ] Deduced a trap composed of 39 places in 393 ms of which 0 ms to minimize.
[2022-05-17 22:00:28] [INFO ] Deduced a trap composed of 31 places in 403 ms of which 1 ms to minimize.
[2022-05-17 22:00:29] [INFO ] Deduced a trap composed of 75 places in 265 ms of which 1 ms to minimize.
[2022-05-17 22:00:29] [INFO ] Deduced a trap composed of 111 places in 274 ms of which 8 ms to minimize.
[2022-05-17 22:00:29] [INFO ] Deduced a trap composed of 111 places in 260 ms of which 1 ms to minimize.
[2022-05-17 22:00:30] [INFO ] Deduced a trap composed of 111 places in 255 ms of which 0 ms to minimize.
[2022-05-17 22:00:30] [INFO ] Deduced a trap composed of 75 places in 258 ms of which 0 ms to minimize.
[2022-05-17 22:00:30] [INFO ] Deduced a trap composed of 111 places in 254 ms of which 1 ms to minimize.
[2022-05-17 22:00:31] [INFO ] Deduced a trap composed of 111 places in 252 ms of which 1 ms to minimize.
[2022-05-17 22:00:31] [INFO ] Deduced a trap composed of 111 places in 255 ms of which 0 ms to minimize.
[2022-05-17 22:00:31] [INFO ] Deduced a trap composed of 129 places in 253 ms of which 1 ms to minimize.
[2022-05-17 22:00:31] [INFO ] Deduced a trap composed of 129 places in 258 ms of which 1 ms to minimize.
[2022-05-17 22:00:32] [INFO ] Deduced a trap composed of 129 places in 257 ms of which 1 ms to minimize.
[2022-05-17 22:00:32] [INFO ] Deduced a trap composed of 129 places in 265 ms of which 0 ms to minimize.
[2022-05-17 22:00:32] [INFO ] Deduced a trap composed of 71 places in 255 ms of which 1 ms to minimize.
[2022-05-17 22:00:33] [INFO ] Deduced a trap composed of 93 places in 221 ms of which 1 ms to minimize.
[2022-05-17 22:00:33] [INFO ] Deduced a trap composed of 125 places in 216 ms of which 0 ms to minimize.
[2022-05-17 22:00:33] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 1 ms to minimize.
[2022-05-17 22:00:33] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 0 ms to minimize.
[2022-05-17 22:00:34] [INFO ] Deduced a trap composed of 129 places in 212 ms of which 0 ms to minimize.
[2022-05-17 22:00:34] [INFO ] Deduced a trap composed of 129 places in 215 ms of which 0 ms to minimize.
[2022-05-17 22:00:34] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 1 ms to minimize.
[2022-05-17 22:00:34] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 0 ms to minimize.
[2022-05-17 22:00:34] [INFO ] Trap strengthening (SAT) tested/added 81/80 trap constraints in 31386 ms
[2022-05-17 22:00:35] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 81 ms.
[2022-05-17 22:00:47] [INFO ] Added : 700 causal constraints over 140 iterations in 13008 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [448, 448, 8, 1, 1] Max seen :[7, 7, 1, 0, 0]
Incomplete Parikh walk after 623200 steps, including 1000 resets, run finished after 5836 ms. (steps per millisecond=106 ) properties (out of 5) seen :11 could not realise parikh vector
Incomplete Parikh walk after 768700 steps, including 1000 resets, run finished after 7588 ms. (steps per millisecond=101 ) properties (out of 5) seen :13 could not realise parikh vector
Support contains 457 out of 1106 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1106/1106 places, 2210/2210 transitions.
Applied a total of 0 rules in 38 ms. Remains 1106 /1106 variables (removed 0) and now considering 2210/2210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1106/1106 places, 2210/2210 transitions.
Starting structural reductions, iteration 0 : 1106/1106 places, 2210/2210 transitions.
Applied a total of 0 rules in 39 ms. Remains 1106 /1106 variables (removed 0) and now considering 2210/2210 (removed 0) transitions.
[2022-05-17 22:01:01] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1106 cols
[2022-05-17 22:01:01] [INFO ] Computed 31 place invariants in 5 ms
[2022-05-17 22:01:01] [INFO ] Implicit Places using invariants in 485 ms returned [1090, 1091, 1092, 1093, 1094, 1103, 1104, 1105]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 489 ms to find 8 implicit places.
[2022-05-17 22:01:02] [INFO ] Redundant transitions in 121 ms returned []
[2022-05-17 22:01:02] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:01:02] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 22:01:02] [INFO ] Dead Transitions using invariants and state equation in 853 ms returned []
Starting structural reductions, iteration 1 : 1098/1106 places, 2210/2210 transitions.
Applied a total of 0 rules in 30 ms. Remains 1098 /1098 variables (removed 0) and now considering 2210/2210 (removed 0) transitions.
[2022-05-17 22:01:03] [INFO ] Redundant transitions in 37 ms returned []
[2022-05-17 22:01:03] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:01:03] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 22:01:03] [INFO ] Dead Transitions using invariants and state equation in 924 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1098/1106 places, 2210/2210 transitions.
Normalized transition count is 1874 out of 2210 initially.
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:01:03] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9655 ms. (steps per millisecond=103 ) properties (out of 5) seen :13
Interrupted Best-First random walk after 825401 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen :{0=3, 1=3, 2=1}
Interrupted Best-First random walk after 770186 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=154 ) properties seen :{0=2, 1=2}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1496 ms. (steps per millisecond=668 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1435 ms. (steps per millisecond=696 ) properties (out of 5) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1436 ms. (steps per millisecond=696 ) properties (out of 5) seen :11
[2022-05-17 22:01:27] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:01:27] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 22:01:28] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 22:01:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:01:28] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2022-05-17 22:01:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:01:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2022-05-17 22:01:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:01:29] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2022-05-17 22:01:29] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:01:29] [INFO ] [Nat]Added 546 Read/Feed constraints in 84 ms returned sat
[2022-05-17 22:01:30] [INFO ] Deduced a trap composed of 11 places in 477 ms of which 1 ms to minimize.
[2022-05-17 22:01:30] [INFO ] Deduced a trap composed of 11 places in 486 ms of which 1 ms to minimize.
[2022-05-17 22:01:31] [INFO ] Deduced a trap composed of 59 places in 491 ms of which 0 ms to minimize.
[2022-05-17 22:01:31] [INFO ] Deduced a trap composed of 43 places in 470 ms of which 1 ms to minimize.
[2022-05-17 22:01:32] [INFO ] Deduced a trap composed of 47 places in 479 ms of which 1 ms to minimize.
[2022-05-17 22:01:32] [INFO ] Deduced a trap composed of 39 places in 480 ms of which 1 ms to minimize.
[2022-05-17 22:01:33] [INFO ] Deduced a trap composed of 31 places in 460 ms of which 1 ms to minimize.
[2022-05-17 22:01:33] [INFO ] Deduced a trap composed of 59 places in 484 ms of which 1 ms to minimize.
[2022-05-17 22:01:34] [INFO ] Deduced a trap composed of 28 places in 494 ms of which 1 ms to minimize.
[2022-05-17 22:01:35] [INFO ] Deduced a trap composed of 39 places in 491 ms of which 1 ms to minimize.
[2022-05-17 22:01:35] [INFO ] Deduced a trap composed of 90 places in 493 ms of which 1 ms to minimize.
[2022-05-17 22:01:36] [INFO ] Deduced a trap composed of 90 places in 473 ms of which 1 ms to minimize.
[2022-05-17 22:01:36] [INFO ] Deduced a trap composed of 27 places in 483 ms of which 1 ms to minimize.
[2022-05-17 22:01:37] [INFO ] Deduced a trap composed of 33 places in 468 ms of which 1 ms to minimize.
[2022-05-17 22:01:37] [INFO ] Deduced a trap composed of 33 places in 470 ms of which 1 ms to minimize.
[2022-05-17 22:01:38] [INFO ] Deduced a trap composed of 80 places in 480 ms of which 1 ms to minimize.
[2022-05-17 22:01:38] [INFO ] Deduced a trap composed of 23 places in 481 ms of which 1 ms to minimize.
[2022-05-17 22:01:39] [INFO ] Deduced a trap composed of 71 places in 480 ms of which 0 ms to minimize.
[2022-05-17 22:01:39] [INFO ] Deduced a trap composed of 74 places in 481 ms of which 1 ms to minimize.
[2022-05-17 22:01:40] [INFO ] Deduced a trap composed of 15 places in 468 ms of which 1 ms to minimize.
[2022-05-17 22:01:40] [INFO ] Deduced a trap composed of 13 places in 478 ms of which 1 ms to minimize.
[2022-05-17 22:01:41] [INFO ] Deduced a trap composed of 41 places in 479 ms of which 0 ms to minimize.
[2022-05-17 22:01:42] [INFO ] Deduced a trap composed of 113 places in 487 ms of which 1 ms to minimize.
[2022-05-17 22:01:42] [INFO ] Deduced a trap composed of 39 places in 478 ms of which 1 ms to minimize.
[2022-05-17 22:01:43] [INFO ] Deduced a trap composed of 17 places in 472 ms of which 1 ms to minimize.
[2022-05-17 22:01:43] [INFO ] Deduced a trap composed of 35 places in 465 ms of which 0 ms to minimize.
[2022-05-17 22:01:44] [INFO ] Deduced a trap composed of 31 places in 469 ms of which 0 ms to minimize.
[2022-05-17 22:01:44] [INFO ] Deduced a trap composed of 15 places in 463 ms of which 1 ms to minimize.
[2022-05-17 22:01:45] [INFO ] Deduced a trap composed of 35 places in 461 ms of which 1 ms to minimize.
[2022-05-17 22:01:45] [INFO ] Deduced a trap composed of 21 places in 472 ms of which 1 ms to minimize.
[2022-05-17 22:01:46] [INFO ] Deduced a trap composed of 37 places in 468 ms of which 0 ms to minimize.
[2022-05-17 22:01:46] [INFO ] Deduced a trap composed of 64 places in 476 ms of which 3 ms to minimize.
[2022-05-17 22:01:47] [INFO ] Deduced a trap composed of 23 places in 459 ms of which 1 ms to minimize.
[2022-05-17 22:01:47] [INFO ] Deduced a trap composed of 29 places in 462 ms of which 0 ms to minimize.
[2022-05-17 22:01:48] [INFO ] Deduced a trap composed of 63 places in 459 ms of which 1 ms to minimize.
[2022-05-17 22:01:48] [INFO ] Deduced a trap composed of 11 places in 459 ms of which 1 ms to minimize.
[2022-05-17 22:01:49] [INFO ] Deduced a trap composed of 13 places in 469 ms of which 1 ms to minimize.
[2022-05-17 22:01:50] [INFO ] Deduced a trap composed of 67 places in 464 ms of which 1 ms to minimize.
[2022-05-17 22:01:50] [INFO ] Deduced a trap composed of 74 places in 765 ms of which 1 ms to minimize.
[2022-05-17 22:01:51] [INFO ] Deduced a trap composed of 89 places in 486 ms of which 1 ms to minimize.
[2022-05-17 22:01:51] [INFO ] Deduced a trap composed of 51 places in 458 ms of which 1 ms to minimize.
[2022-05-17 22:01:52] [INFO ] Deduced a trap composed of 47 places in 482 ms of which 1 ms to minimize.
[2022-05-17 22:01:53] [INFO ] Deduced a trap composed of 11 places in 481 ms of which 1 ms to minimize.
[2022-05-17 22:01:53] [INFO ] Deduced a trap composed of 51 places in 446 ms of which 1 ms to minimize.
[2022-05-17 22:01:54] [INFO ] Deduced a trap composed of 61 places in 437 ms of which 1 ms to minimize.
[2022-05-17 22:01:54] [INFO ] Deduced a trap composed of 11 places in 442 ms of which 1 ms to minimize.
[2022-05-17 22:01:55] [INFO ] Deduced a trap composed of 65 places in 475 ms of which 1 ms to minimize.
[2022-05-17 22:01:55] [INFO ] Deduced a trap composed of 11 places in 449 ms of which 1 ms to minimize.
[2022-05-17 22:01:56] [INFO ] Deduced a trap composed of 49 places in 373 ms of which 0 ms to minimize.
[2022-05-17 22:01:56] [INFO ] Deduced a trap composed of 115 places in 358 ms of which 1 ms to minimize.
[2022-05-17 22:01:56] [INFO ] Deduced a trap composed of 91 places in 356 ms of which 0 ms to minimize.
[2022-05-17 22:01:57] [INFO ] Deduced a trap composed of 53 places in 367 ms of which 1 ms to minimize.
[2022-05-17 22:01:57] [INFO ] Deduced a trap composed of 43 places in 349 ms of which 0 ms to minimize.
[2022-05-17 22:01:58] [INFO ] Deduced a trap composed of 43 places in 350 ms of which 0 ms to minimize.
[2022-05-17 22:01:58] [INFO ] Deduced a trap composed of 49 places in 352 ms of which 1 ms to minimize.
[2022-05-17 22:01:59] [INFO ] Deduced a trap composed of 129 places in 338 ms of which 1 ms to minimize.
[2022-05-17 22:01:59] [INFO ] Deduced a trap composed of 77 places in 342 ms of which 0 ms to minimize.
[2022-05-17 22:01:59] [INFO ] Deduced a trap composed of 129 places in 340 ms of which 1 ms to minimize.
[2022-05-17 22:02:00] [INFO ] Deduced a trap composed of 73 places in 341 ms of which 0 ms to minimize.
[2022-05-17 22:02:00] [INFO ] Deduced a trap composed of 95 places in 354 ms of which 1 ms to minimize.
[2022-05-17 22:02:01] [INFO ] Deduced a trap composed of 127 places in 342 ms of which 1 ms to minimize.
[2022-05-17 22:02:01] [INFO ] Deduced a trap composed of 91 places in 347 ms of which 1 ms to minimize.
[2022-05-17 22:02:01] [INFO ] Deduced a trap composed of 109 places in 325 ms of which 1 ms to minimize.
[2022-05-17 22:02:02] [INFO ] Deduced a trap composed of 91 places in 334 ms of which 1 ms to minimize.
[2022-05-17 22:02:02] [INFO ] Deduced a trap composed of 103 places in 363 ms of which 1 ms to minimize.
[2022-05-17 22:02:03] [INFO ] Deduced a trap composed of 103 places in 353 ms of which 1 ms to minimize.
[2022-05-17 22:02:03] [INFO ] Deduced a trap composed of 73 places in 356 ms of which 0 ms to minimize.
[2022-05-17 22:02:03] [INFO ] Deduced a trap composed of 109 places in 351 ms of which 0 ms to minimize.
[2022-05-17 22:02:04] [INFO ] Deduced a trap composed of 109 places in 349 ms of which 0 ms to minimize.
[2022-05-17 22:02:04] [INFO ] Deduced a trap composed of 132 places in 344 ms of which 1 ms to minimize.
[2022-05-17 22:02:05] [INFO ] Deduced a trap composed of 91 places in 342 ms of which 1 ms to minimize.
[2022-05-17 22:02:05] [INFO ] Deduced a trap composed of 115 places in 332 ms of which 1 ms to minimize.
[2022-05-17 22:02:06] [INFO ] Deduced a trap composed of 151 places in 339 ms of which 1 ms to minimize.
[2022-05-17 22:02:06] [INFO ] Deduced a trap composed of 151 places in 340 ms of which 1 ms to minimize.
[2022-05-17 22:02:06] [INFO ] Deduced a trap composed of 33 places in 365 ms of which 1 ms to minimize.
[2022-05-17 22:02:07] [INFO ] Deduced a trap composed of 81 places in 369 ms of which 0 ms to minimize.
[2022-05-17 22:02:07] [INFO ] Deduced a trap composed of 121 places in 348 ms of which 0 ms to minimize.
[2022-05-17 22:02:08] [INFO ] Deduced a trap composed of 75 places in 348 ms of which 0 ms to minimize.
[2022-05-17 22:02:08] [INFO ] Deduced a trap composed of 39 places in 361 ms of which 1 ms to minimize.
[2022-05-17 22:02:09] [INFO ] Deduced a trap composed of 39 places in 333 ms of which 1 ms to minimize.
[2022-05-17 22:02:09] [INFO ] Deduced a trap composed of 39 places in 332 ms of which 1 ms to minimize.
[2022-05-17 22:02:09] [INFO ] Deduced a trap composed of 89 places in 341 ms of which 1 ms to minimize.
[2022-05-17 22:02:10] [INFO ] Deduced a trap composed of 57 places in 341 ms of which 1 ms to minimize.
[2022-05-17 22:02:10] [INFO ] Deduced a trap composed of 69 places in 346 ms of which 1 ms to minimize.
[2022-05-17 22:02:11] [INFO ] Deduced a trap composed of 39 places in 332 ms of which 1 ms to minimize.
[2022-05-17 22:02:11] [INFO ] Deduced a trap composed of 69 places in 322 ms of which 1 ms to minimize.
[2022-05-17 22:02:11] [INFO ] Deduced a trap composed of 59 places in 315 ms of which 0 ms to minimize.
[2022-05-17 22:02:12] [INFO ] Deduced a trap composed of 59 places in 330 ms of which 1 ms to minimize.
[2022-05-17 22:02:12] [INFO ] Deduced a trap composed of 57 places in 319 ms of which 0 ms to minimize.
[2022-05-17 22:02:13] [INFO ] Deduced a trap composed of 87 places in 319 ms of which 0 ms to minimize.
[2022-05-17 22:02:13] [INFO ] Deduced a trap composed of 37 places in 331 ms of which 0 ms to minimize.
[2022-05-17 22:02:13] [INFO ] Deduced a trap composed of 57 places in 355 ms of which 1 ms to minimize.
[2022-05-17 22:02:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 22:02:14] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 22:02:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:02:14] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2022-05-17 22:02:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:02:14] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2022-05-17 22:02:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:02:15] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2022-05-17 22:02:15] [INFO ] [Nat]Added 546 Read/Feed constraints in 86 ms returned sat
[2022-05-17 22:02:15] [INFO ] Deduced a trap composed of 11 places in 465 ms of which 1 ms to minimize.
[2022-05-17 22:02:16] [INFO ] Deduced a trap composed of 11 places in 485 ms of which 1 ms to minimize.
[2022-05-17 22:02:17] [INFO ] Deduced a trap composed of 59 places in 507 ms of which 1 ms to minimize.
[2022-05-17 22:02:17] [INFO ] Deduced a trap composed of 43 places in 474 ms of which 1 ms to minimize.
[2022-05-17 22:02:18] [INFO ] Deduced a trap composed of 47 places in 494 ms of which 1 ms to minimize.
[2022-05-17 22:02:18] [INFO ] Deduced a trap composed of 39 places in 477 ms of which 1 ms to minimize.
[2022-05-17 22:02:19] [INFO ] Deduced a trap composed of 31 places in 486 ms of which 1 ms to minimize.
[2022-05-17 22:02:19] [INFO ] Deduced a trap composed of 59 places in 497 ms of which 1 ms to minimize.
[2022-05-17 22:02:20] [INFO ] Deduced a trap composed of 28 places in 478 ms of which 1 ms to minimize.
[2022-05-17 22:02:20] [INFO ] Deduced a trap composed of 39 places in 466 ms of which 1 ms to minimize.
[2022-05-17 22:02:21] [INFO ] Deduced a trap composed of 90 places in 491 ms of which 1 ms to minimize.
[2022-05-17 22:02:21] [INFO ] Deduced a trap composed of 90 places in 489 ms of which 1 ms to minimize.
[2022-05-17 22:02:22] [INFO ] Deduced a trap composed of 27 places in 479 ms of which 1 ms to minimize.
[2022-05-17 22:02:23] [INFO ] Deduced a trap composed of 33 places in 486 ms of which 1 ms to minimize.
[2022-05-17 22:02:23] [INFO ] Deduced a trap composed of 33 places in 485 ms of which 1 ms to minimize.
[2022-05-17 22:02:24] [INFO ] Deduced a trap composed of 80 places in 475 ms of which 1 ms to minimize.
[2022-05-17 22:02:24] [INFO ] Deduced a trap composed of 23 places in 471 ms of which 0 ms to minimize.
[2022-05-17 22:02:25] [INFO ] Deduced a trap composed of 71 places in 482 ms of which 1 ms to minimize.
[2022-05-17 22:02:25] [INFO ] Deduced a trap composed of 74 places in 462 ms of which 1 ms to minimize.
[2022-05-17 22:02:26] [INFO ] Deduced a trap composed of 15 places in 456 ms of which 1 ms to minimize.
[2022-05-17 22:02:26] [INFO ] Deduced a trap composed of 13 places in 465 ms of which 1 ms to minimize.
[2022-05-17 22:02:27] [INFO ] Deduced a trap composed of 41 places in 475 ms of which 0 ms to minimize.
[2022-05-17 22:02:27] [INFO ] Deduced a trap composed of 113 places in 468 ms of which 1 ms to minimize.
[2022-05-17 22:02:28] [INFO ] Deduced a trap composed of 39 places in 477 ms of which 1 ms to minimize.
[2022-05-17 22:02:28] [INFO ] Deduced a trap composed of 17 places in 474 ms of which 1 ms to minimize.
[2022-05-17 22:02:29] [INFO ] Deduced a trap composed of 35 places in 471 ms of which 1 ms to minimize.
[2022-05-17 22:02:30] [INFO ] Deduced a trap composed of 31 places in 474 ms of which 0 ms to minimize.
[2022-05-17 22:02:30] [INFO ] Deduced a trap composed of 15 places in 475 ms of which 1 ms to minimize.
[2022-05-17 22:02:31] [INFO ] Deduced a trap composed of 35 places in 478 ms of which 1 ms to minimize.
[2022-05-17 22:02:31] [INFO ] Deduced a trap composed of 21 places in 476 ms of which 1 ms to minimize.
[2022-05-17 22:02:32] [INFO ] Deduced a trap composed of 37 places in 506 ms of which 1 ms to minimize.
[2022-05-17 22:02:32] [INFO ] Deduced a trap composed of 64 places in 469 ms of which 1 ms to minimize.
[2022-05-17 22:02:33] [INFO ] Deduced a trap composed of 23 places in 470 ms of which 1 ms to minimize.
[2022-05-17 22:02:33] [INFO ] Deduced a trap composed of 29 places in 475 ms of which 1 ms to minimize.
[2022-05-17 22:02:34] [INFO ] Deduced a trap composed of 63 places in 478 ms of which 0 ms to minimize.
[2022-05-17 22:02:34] [INFO ] Deduced a trap composed of 11 places in 481 ms of which 1 ms to minimize.
[2022-05-17 22:02:35] [INFO ] Deduced a trap composed of 13 places in 483 ms of which 1 ms to minimize.
[2022-05-17 22:02:36] [INFO ] Deduced a trap composed of 67 places in 472 ms of which 0 ms to minimize.
[2022-05-17 22:02:36] [INFO ] Deduced a trap composed of 74 places in 465 ms of which 1 ms to minimize.
[2022-05-17 22:02:37] [INFO ] Deduced a trap composed of 89 places in 472 ms of which 1 ms to minimize.
[2022-05-17 22:02:37] [INFO ] Deduced a trap composed of 51 places in 486 ms of which 1 ms to minimize.
[2022-05-17 22:02:38] [INFO ] Deduced a trap composed of 47 places in 471 ms of which 1 ms to minimize.
[2022-05-17 22:02:38] [INFO ] Deduced a trap composed of 11 places in 471 ms of which 0 ms to minimize.
[2022-05-17 22:02:39] [INFO ] Deduced a trap composed of 51 places in 437 ms of which 1 ms to minimize.
[2022-05-17 22:02:39] [INFO ] Deduced a trap composed of 61 places in 431 ms of which 1 ms to minimize.
[2022-05-17 22:02:40] [INFO ] Deduced a trap composed of 11 places in 429 ms of which 1 ms to minimize.
[2022-05-17 22:02:40] [INFO ] Deduced a trap composed of 65 places in 459 ms of which 1 ms to minimize.
[2022-05-17 22:02:41] [INFO ] Deduced a trap composed of 11 places in 431 ms of which 1 ms to minimize.
[2022-05-17 22:02:41] [INFO ] Deduced a trap composed of 49 places in 356 ms of which 0 ms to minimize.
[2022-05-17 22:02:42] [INFO ] Deduced a trap composed of 115 places in 362 ms of which 0 ms to minimize.
[2022-05-17 22:02:42] [INFO ] Deduced a trap composed of 91 places in 348 ms of which 1 ms to minimize.
[2022-05-17 22:02:42] [INFO ] Deduced a trap composed of 53 places in 349 ms of which 0 ms to minimize.
[2022-05-17 22:02:43] [INFO ] Deduced a trap composed of 43 places in 361 ms of which 1 ms to minimize.
[2022-05-17 22:02:43] [INFO ] Deduced a trap composed of 43 places in 357 ms of which 1 ms to minimize.
[2022-05-17 22:02:44] [INFO ] Deduced a trap composed of 49 places in 362 ms of which 0 ms to minimize.
[2022-05-17 22:02:44] [INFO ] Deduced a trap composed of 129 places in 369 ms of which 0 ms to minimize.
[2022-05-17 22:02:45] [INFO ] Deduced a trap composed of 77 places in 336 ms of which 0 ms to minimize.
[2022-05-17 22:02:45] [INFO ] Deduced a trap composed of 129 places in 350 ms of which 1 ms to minimize.
[2022-05-17 22:02:45] [INFO ] Deduced a trap composed of 73 places in 334 ms of which 1 ms to minimize.
[2022-05-17 22:02:46] [INFO ] Deduced a trap composed of 95 places in 333 ms of which 1 ms to minimize.
[2022-05-17 22:02:46] [INFO ] Deduced a trap composed of 127 places in 342 ms of which 1 ms to minimize.
[2022-05-17 22:02:47] [INFO ] Deduced a trap composed of 91 places in 333 ms of which 1 ms to minimize.
[2022-05-17 22:02:47] [INFO ] Deduced a trap composed of 109 places in 341 ms of which 0 ms to minimize.
[2022-05-17 22:02:47] [INFO ] Deduced a trap composed of 91 places in 346 ms of which 1 ms to minimize.
[2022-05-17 22:02:48] [INFO ] Deduced a trap composed of 103 places in 339 ms of which 0 ms to minimize.
[2022-05-17 22:02:48] [INFO ] Deduced a trap composed of 103 places in 354 ms of which 1 ms to minimize.
[2022-05-17 22:02:49] [INFO ] Deduced a trap composed of 73 places in 357 ms of which 1 ms to minimize.
[2022-05-17 22:02:49] [INFO ] Deduced a trap composed of 109 places in 345 ms of which 1 ms to minimize.
[2022-05-17 22:02:49] [INFO ] Deduced a trap composed of 109 places in 339 ms of which 0 ms to minimize.
[2022-05-17 22:02:50] [INFO ] Deduced a trap composed of 132 places in 331 ms of which 1 ms to minimize.
[2022-05-17 22:02:50] [INFO ] Deduced a trap composed of 91 places in 340 ms of which 1 ms to minimize.
[2022-05-17 22:02:51] [INFO ] Deduced a trap composed of 115 places in 337 ms of which 0 ms to minimize.
[2022-05-17 22:02:51] [INFO ] Deduced a trap composed of 151 places in 346 ms of which 1 ms to minimize.
[2022-05-17 22:02:52] [INFO ] Deduced a trap composed of 151 places in 331 ms of which 1 ms to minimize.
[2022-05-17 22:02:52] [INFO ] Deduced a trap composed of 33 places in 337 ms of which 0 ms to minimize.
[2022-05-17 22:02:52] [INFO ] Deduced a trap composed of 81 places in 353 ms of which 1 ms to minimize.
[2022-05-17 22:02:53] [INFO ] Deduced a trap composed of 121 places in 331 ms of which 1 ms to minimize.
[2022-05-17 22:02:53] [INFO ] Deduced a trap composed of 75 places in 344 ms of which 1 ms to minimize.
[2022-05-17 22:02:54] [INFO ] Deduced a trap composed of 39 places in 329 ms of which 1 ms to minimize.
[2022-05-17 22:02:54] [INFO ] Deduced a trap composed of 39 places in 358 ms of which 1 ms to minimize.
[2022-05-17 22:02:55] [INFO ] Deduced a trap composed of 39 places in 347 ms of which 1 ms to minimize.
[2022-05-17 22:02:55] [INFO ] Deduced a trap composed of 89 places in 360 ms of which 1 ms to minimize.
[2022-05-17 22:02:55] [INFO ] Deduced a trap composed of 57 places in 335 ms of which 1 ms to minimize.
[2022-05-17 22:02:56] [INFO ] Deduced a trap composed of 69 places in 331 ms of which 0 ms to minimize.
[2022-05-17 22:02:56] [INFO ] Deduced a trap composed of 39 places in 334 ms of which 1 ms to minimize.
[2022-05-17 22:02:57] [INFO ] Deduced a trap composed of 69 places in 320 ms of which 1 ms to minimize.
[2022-05-17 22:02:57] [INFO ] Deduced a trap composed of 59 places in 321 ms of which 1 ms to minimize.
[2022-05-17 22:02:57] [INFO ] Deduced a trap composed of 59 places in 313 ms of which 0 ms to minimize.
[2022-05-17 22:02:58] [INFO ] Deduced a trap composed of 57 places in 319 ms of which 1 ms to minimize.
[2022-05-17 22:02:58] [INFO ] Deduced a trap composed of 87 places in 319 ms of which 1 ms to minimize.
[2022-05-17 22:02:58] [INFO ] Deduced a trap composed of 37 places in 337 ms of which 0 ms to minimize.
[2022-05-17 22:02:59] [INFO ] Deduced a trap composed of 57 places in 351 ms of which 1 ms to minimize.
[2022-05-17 22:02:59] [INFO ] Deduced a trap composed of 37 places in 360 ms of which 1 ms to minimize.
[2022-05-17 22:02: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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 22:02:59] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 22:02:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:03:00] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2022-05-17 22:03:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:03:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 22:03:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:03:00] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2022-05-17 22:03:01] [INFO ] [Nat]Added 546 Read/Feed constraints in 80 ms returned sat
[2022-05-17 22:03:01] [INFO ] Deduced a trap composed of 17 places in 398 ms of which 1 ms to minimize.
[2022-05-17 22:03:01] [INFO ] Deduced a trap composed of 13 places in 376 ms of which 0 ms to minimize.
[2022-05-17 22:03:02] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:03:02] [INFO ] Deduced a trap composed of 13 places in 376 ms of which 0 ms to minimize.
[2022-05-17 22:03:03] [INFO ] Deduced a trap composed of 29 places in 387 ms of which 0 ms to minimize.
[2022-05-17 22:03:03] [INFO ] Deduced a trap composed of 29 places in 388 ms of which 1 ms to minimize.
[2022-05-17 22:03:04] [INFO ] Deduced a trap composed of 29 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:03:04] [INFO ] Deduced a trap composed of 65 places in 393 ms of which 0 ms to minimize.
[2022-05-17 22:03:05] [INFO ] Deduced a trap composed of 65 places in 394 ms of which 1 ms to minimize.
[2022-05-17 22:03:05] [INFO ] Deduced a trap composed of 15 places in 386 ms of which 1 ms to minimize.
[2022-05-17 22:03:06] [INFO ] Deduced a trap composed of 11 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:03:06] [INFO ] Deduced a trap composed of 63 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:03:06] [INFO ] Deduced a trap composed of 15 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:03:07] [INFO ] Deduced a trap composed of 83 places in 368 ms of which 1 ms to minimize.
[2022-05-17 22:03:07] [INFO ] Deduced a trap composed of 89 places in 381 ms of which 1 ms to minimize.
[2022-05-17 22:03:08] [INFO ] Deduced a trap composed of 35 places in 385 ms of which 1 ms to minimize.
[2022-05-17 22:03:08] [INFO ] Deduced a trap composed of 35 places in 381 ms of which 1 ms to minimize.
[2022-05-17 22:03:09] [INFO ] Deduced a trap composed of 29 places in 380 ms of which 0 ms to minimize.
[2022-05-17 22:03:09] [INFO ] Deduced a trap composed of 41 places in 374 ms of which 0 ms to minimize.
[2022-05-17 22:03:10] [INFO ] Deduced a trap composed of 49 places in 356 ms of which 0 ms to minimize.
[2022-05-17 22:03:10] [INFO ] Deduced a trap composed of 47 places in 342 ms of which 1 ms to minimize.
[2022-05-17 22:03:10] [INFO ] Deduced a trap composed of 119 places in 350 ms of which 1 ms to minimize.
[2022-05-17 22:03:11] [INFO ] Deduced a trap composed of 83 places in 358 ms of which 1 ms to minimize.
[2022-05-17 22:03:11] [INFO ] Deduced a trap composed of 53 places in 357 ms of which 1 ms to minimize.
[2022-05-17 22:03:12] [INFO ] Deduced a trap composed of 57 places in 350 ms of which 1 ms to minimize.
[2022-05-17 22:03:12] [INFO ] Deduced a trap composed of 43 places in 353 ms of which 1 ms to minimize.
[2022-05-17 22:03:12] [INFO ] Deduced a trap composed of 119 places in 349 ms of which 1 ms to minimize.
[2022-05-17 22:03:13] [INFO ] Deduced a trap composed of 37 places in 345 ms of which 1 ms to minimize.
[2022-05-17 22:03:13] [INFO ] Deduced a trap composed of 53 places in 340 ms of which 1 ms to minimize.
[2022-05-17 22:03:14] [INFO ] Deduced a trap composed of 37 places in 347 ms of which 1 ms to minimize.
[2022-05-17 22:03:14] [INFO ] Deduced a trap composed of 93 places in 365 ms of which 1 ms to minimize.
[2022-05-17 22:03:15] [INFO ] Deduced a trap composed of 43 places in 359 ms of which 1 ms to minimize.
[2022-05-17 22:03:15] [INFO ] Deduced a trap composed of 53 places in 364 ms of which 1 ms to minimize.
[2022-05-17 22:03:15] [INFO ] Deduced a trap composed of 65 places in 341 ms of which 1 ms to minimize.
[2022-05-17 22:03:16] [INFO ] Deduced a trap composed of 29 places in 357 ms of which 1 ms to minimize.
[2022-05-17 22:03:16] [INFO ] Deduced a trap composed of 57 places in 440 ms of which 1 ms to minimize.
[2022-05-17 22:03:17] [INFO ] Deduced a trap composed of 104 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:03:17] [INFO ] Deduced a trap composed of 90 places in 452 ms of which 1 ms to minimize.
[2022-05-17 22:03:18] [INFO ] Deduced a trap composed of 11 places in 440 ms of which 1 ms to minimize.
[2022-05-17 22:03:18] [INFO ] Deduced a trap composed of 27 places in 454 ms of which 1 ms to minimize.
[2022-05-17 22:03:19] [INFO ] Deduced a trap composed of 17 places in 429 ms of which 1 ms to minimize.
[2022-05-17 22:03:19] [INFO ] Deduced a trap composed of 49 places in 414 ms of which 1 ms to minimize.
[2022-05-17 22:03:20] [INFO ] Deduced a trap composed of 35 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:03:20] [INFO ] Deduced a trap composed of 68 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:03:21] [INFO ] Deduced a trap composed of 35 places in 393 ms of which 1 ms to minimize.
[2022-05-17 22:03:21] [INFO ] Deduced a trap composed of 49 places in 388 ms of which 1 ms to minimize.
[2022-05-17 22:03:22] [INFO ] Deduced a trap composed of 23 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:03:22] [INFO ] Deduced a trap composed of 17 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:03:23] [INFO ] Deduced a trap composed of 59 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:03:23] [INFO ] Deduced a trap composed of 118 places in 400 ms of which 1 ms to minimize.
[2022-05-17 22:03:23] [INFO ] Deduced a trap composed of 112 places in 387 ms of which 0 ms to minimize.
[2022-05-17 22:03:24] [INFO ] Deduced a trap composed of 11 places in 394 ms of which 0 ms to minimize.
[2022-05-17 22:03:24] [INFO ] Deduced a trap composed of 59 places in 345 ms of which 1 ms to minimize.
[2022-05-17 22:03:25] [INFO ] Deduced a trap composed of 93 places in 360 ms of which 1 ms to minimize.
[2022-05-17 22:03:25] [INFO ] Deduced a trap composed of 57 places in 352 ms of which 1 ms to minimize.
[2022-05-17 22:03:26] [INFO ] Deduced a trap composed of 65 places in 285 ms of which 0 ms to minimize.
[2022-05-17 22:03:26] [INFO ] Deduced a trap composed of 71 places in 283 ms of which 1 ms to minimize.
[2022-05-17 22:03:26] [INFO ] Deduced a trap composed of 71 places in 284 ms of which 0 ms to minimize.
[2022-05-17 22:03:27] [INFO ] Deduced a trap composed of 163 places in 231 ms of which 0 ms to minimize.
[2022-05-17 22:03:27] [INFO ] Deduced a trap composed of 115 places in 225 ms of which 0 ms to minimize.
[2022-05-17 22:03:27] [INFO ] Deduced a trap composed of 111 places in 219 ms of which 0 ms to minimize.
[2022-05-17 22:03:27] [INFO ] Deduced a trap composed of 111 places in 225 ms of which 0 ms to minimize.
[2022-05-17 22:03:28] [INFO ] Deduced a trap composed of 115 places in 228 ms of which 1 ms to minimize.
[2022-05-17 22:03:28] [INFO ] Deduced a trap composed of 115 places in 228 ms of which 1 ms to minimize.
[2022-05-17 22:03:28] [INFO ] Deduced a trap composed of 115 places in 228 ms of which 0 ms to minimize.
[2022-05-17 22:03:29] [INFO ] Deduced a trap composed of 97 places in 221 ms of which 0 ms to minimize.
[2022-05-17 22:03:29] [INFO ] Deduced a trap composed of 115 places in 220 ms of which 1 ms to minimize.
[2022-05-17 22:03:29] [INFO ] Deduced a trap composed of 133 places in 328 ms of which 1 ms to minimize.
[2022-05-17 22:03:30] [INFO ] Deduced a trap composed of 93 places in 338 ms of which 1 ms to minimize.
[2022-05-17 22:03:30] [INFO ] Deduced a trap composed of 49 places in 343 ms of which 1 ms to minimize.
[2022-05-17 22:03:31] [INFO ] Deduced a trap composed of 49 places in 398 ms of which 1 ms to minimize.
[2022-05-17 22:03:31] [INFO ] Deduced a trap composed of 29 places in 410 ms of which 1 ms to minimize.
[2022-05-17 22:03:32] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:03:32] [INFO ] Deduced a trap composed of 11 places in 398 ms of which 0 ms to minimize.
[2022-05-17 22:03:33] [INFO ] Deduced a trap composed of 71 places in 389 ms of which 0 ms to minimize.
[2022-05-17 22:03:33] [INFO ] Deduced a trap composed of 53 places in 389 ms of which 1 ms to minimize.
[2022-05-17 22:03:33] [INFO ] Deduced a trap composed of 83 places in 390 ms of which 1 ms to minimize.
[2022-05-17 22:03:34] [INFO ] Deduced a trap composed of 64 places in 387 ms of which 1 ms to minimize.
[2022-05-17 22:03:34] [INFO ] Deduced a trap composed of 55 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:03:35] [INFO ] Deduced a trap composed of 83 places in 411 ms of which 1 ms to minimize.
[2022-05-17 22:03:35] [INFO ] Deduced a trap composed of 37 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:03:36] [INFO ] Deduced a trap composed of 83 places in 385 ms of which 0 ms to minimize.
[2022-05-17 22:03:36] [INFO ] Deduced a trap composed of 37 places in 383 ms of which 0 ms to minimize.
[2022-05-17 22:03:37] [INFO ] Deduced a trap composed of 31 places in 374 ms of which 1 ms to minimize.
[2022-05-17 22:03:37] [INFO ] Deduced a trap composed of 59 places in 379 ms of which 1 ms to minimize.
[2022-05-17 22:03:38] [INFO ] Deduced a trap composed of 99 places in 407 ms of which 1 ms to minimize.
[2022-05-17 22:03:38] [INFO ] Deduced a trap composed of 57 places in 403 ms of which 1 ms to minimize.
[2022-05-17 22:03:39] [INFO ] Deduced a trap composed of 11 places in 415 ms of which 1 ms to minimize.
[2022-05-17 22:03:39] [INFO ] Deduced a trap composed of 43 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:03:39] [INFO ] Deduced a trap composed of 41 places in 378 ms of which 1 ms to minimize.
[2022-05-17 22:03:40] [INFO ] Deduced a trap composed of 41 places in 378 ms of which 0 ms to minimize.
[2022-05-17 22:03:40] [INFO ] Deduced a trap composed of 47 places in 313 ms of which 1 ms to minimize.
[2022-05-17 22:03:41] [INFO ] Deduced a trap composed of 129 places in 327 ms of which 1 ms to minimize.
[2022-05-17 22:03:41] [INFO ] Deduced a trap composed of 133 places in 321 ms of which 1 ms to minimize.
[2022-05-17 22:03:41] [INFO ] Deduced a trap composed of 129 places in 316 ms of which 0 ms to minimize.
[2022-05-17 22:03:42] [INFO ] Deduced a trap composed of 129 places in 322 ms of which 1 ms to minimize.
[2022-05-17 22:03:42] [INFO ] Deduced a trap composed of 101 places in 323 ms of which 0 ms to minimize.
[2022-05-17 22:03:43] [INFO ] Deduced a trap composed of 119 places in 329 ms of which 1 ms to minimize.
[2022-05-17 22:03:43] [INFO ] Deduced a trap composed of 119 places in 341 ms of which 1 ms to minimize.
[2022-05-17 22:03:43] [INFO ] Deduced a trap composed of 119 places in 334 ms of which 0 ms to minimize.
[2022-05-17 22:03:44] [INFO ] Deduced a trap composed of 101 places in 322 ms of which 0 ms to minimize.
[2022-05-17 22:03:44] [INFO ] Deduced a trap composed of 65 places in 342 ms of which 1 ms to minimize.
[2022-05-17 22:03:45] [INFO ] Deduced a trap composed of 47 places in 341 ms of which 0 ms to minimize.
[2022-05-17 22:03:45] [INFO ] Deduced a trap composed of 65 places in 291 ms of which 0 ms to minimize.
[2022-05-17 22:03:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 22:03:45] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 22:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:03:46] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2022-05-17 22:03:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:03:46] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 22:03:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:03:46] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2022-05-17 22:03:46] [INFO ] [Nat]Added 546 Read/Feed constraints in 88 ms returned sat
[2022-05-17 22:03:47] [INFO ] Deduced a trap composed of 19 places in 316 ms of which 1 ms to minimize.
[2022-05-17 22:03:47] [INFO ] Deduced a trap composed of 15 places in 312 ms of which 0 ms to minimize.
[2022-05-17 22:03:47] [INFO ] Deduced a trap composed of 33 places in 309 ms of which 1 ms to minimize.
[2022-05-17 22:03:48] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 0 ms to minimize.
[2022-05-17 22:03:48] [INFO ] Deduced a trap composed of 17 places in 321 ms of which 1 ms to minimize.
[2022-05-17 22:03:48] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 1 ms to minimize.
[2022-05-17 22:03:49] [INFO ] Deduced a trap composed of 11 places in 304 ms of which 1 ms to minimize.
[2022-05-17 22:03:49] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 1 ms to minimize.
[2022-05-17 22:03:50] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 1 ms to minimize.
[2022-05-17 22:03:50] [INFO ] Deduced a trap composed of 73 places in 283 ms of which 0 ms to minimize.
[2022-05-17 22:03:50] [INFO ] Deduced a trap composed of 121 places in 286 ms of which 0 ms to minimize.
[2022-05-17 22:03:51] [INFO ] Deduced a trap composed of 121 places in 293 ms of which 1 ms to minimize.
[2022-05-17 22:03:51] [INFO ] Deduced a trap composed of 125 places in 293 ms of which 1 ms to minimize.
[2022-05-17 22:03:51] [INFO ] Deduced a trap composed of 51 places in 304 ms of which 1 ms to minimize.
[2022-05-17 22:03:52] [INFO ] Deduced a trap composed of 51 places in 283 ms of which 1 ms to minimize.
[2022-05-17 22:03:52] [INFO ] Deduced a trap composed of 51 places in 292 ms of which 1 ms to minimize.
[2022-05-17 22:03:52] [INFO ] Deduced a trap composed of 57 places in 287 ms of which 1 ms to minimize.
[2022-05-17 22:03:53] [INFO ] Deduced a trap composed of 91 places in 286 ms of which 1 ms to minimize.
[2022-05-17 22:03:53] [INFO ] Deduced a trap composed of 55 places in 288 ms of which 1 ms to minimize.
[2022-05-17 22:03:53] [INFO ] Deduced a trap composed of 97 places in 295 ms of which 1 ms to minimize.
[2022-05-17 22:03:54] [INFO ] Deduced a trap composed of 35 places in 286 ms of which 0 ms to minimize.
[2022-05-17 22:03:54] [INFO ] Deduced a trap composed of 73 places in 282 ms of which 0 ms to minimize.
[2022-05-17 22:03:55] [INFO ] Deduced a trap composed of 51 places in 290 ms of which 0 ms to minimize.
[2022-05-17 22:03:55] [INFO ] Deduced a trap composed of 61 places in 283 ms of which 0 ms to minimize.
[2022-05-17 22:03:55] [INFO ] Deduced a trap composed of 79 places in 285 ms of which 0 ms to minimize.
[2022-05-17 22:03:56] [INFO ] Deduced a trap composed of 35 places in 282 ms of which 1 ms to minimize.
[2022-05-17 22:03:56] [INFO ] Deduced a trap composed of 35 places in 281 ms of which 1 ms to minimize.
[2022-05-17 22:03:56] [INFO ] Deduced a trap composed of 59 places in 279 ms of which 0 ms to minimize.
[2022-05-17 22:03:57] [INFO ] Deduced a trap composed of 37 places in 296 ms of which 0 ms to minimize.
[2022-05-17 22:03:57] [INFO ] Deduced a trap composed of 33 places in 297 ms of which 0 ms to minimize.
[2022-05-17 22:03:57] [INFO ] Deduced a trap composed of 51 places in 297 ms of which 1 ms to minimize.
[2022-05-17 22:03:58] [INFO ] Deduced a trap composed of 99 places in 275 ms of which 1 ms to minimize.
[2022-05-17 22:03:58] [INFO ] Deduced a trap composed of 91 places in 278 ms of which 0 ms to minimize.
[2022-05-17 22:03:58] [INFO ] Deduced a trap composed of 119 places in 286 ms of which 1 ms to minimize.
[2022-05-17 22:03:59] [INFO ] Deduced a trap composed of 89 places in 288 ms of which 1 ms to minimize.
[2022-05-17 22:03:59] [INFO ] Deduced a trap composed of 91 places in 285 ms of which 1 ms to minimize.
[2022-05-17 22:03:59] [INFO ] Deduced a trap composed of 91 places in 286 ms of which 1 ms to minimize.
[2022-05-17 22:04:00] [INFO ] Deduced a trap composed of 91 places in 282 ms of which 0 ms to minimize.
[2022-05-17 22:04:00] [INFO ] Deduced a trap composed of 91 places in 286 ms of which 1 ms to minimize.
[2022-05-17 22:04:00] [INFO ] Deduced a trap composed of 65 places in 295 ms of which 1 ms to minimize.
[2022-05-17 22:04:01] [INFO ] Deduced a trap composed of 79 places in 302 ms of which 0 ms to minimize.
[2022-05-17 22:04:01] [INFO ] Deduced a trap composed of 95 places in 302 ms of which 0 ms to minimize.
[2022-05-17 22:04:02] [INFO ] Deduced a trap composed of 129 places in 300 ms of which 1 ms to minimize.
[2022-05-17 22:04:02] [INFO ] Deduced a trap composed of 37 places in 312 ms of which 1 ms to minimize.
[2022-05-17 22:04:02] [INFO ] Deduced a trap composed of 19 places in 318 ms of which 1 ms to minimize.
[2022-05-17 22:04:03] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 0 ms to minimize.
[2022-05-17 22:04:03] [INFO ] Deduced a trap composed of 99 places in 282 ms of which 0 ms to minimize.
[2022-05-17 22:04:04] [INFO ] Deduced a trap composed of 31 places in 426 ms of which 1 ms to minimize.
[2022-05-17 22:04:04] [INFO ] Deduced a trap composed of 31 places in 421 ms of which 1 ms to minimize.
[2022-05-17 22:04:05] [INFO ] Deduced a trap composed of 23 places in 417 ms of which 1 ms to minimize.
[2022-05-17 22:04:05] [INFO ] Deduced a trap composed of 43 places in 398 ms of which 0 ms to minimize.
[2022-05-17 22:04:06] [INFO ] Deduced a trap composed of 77 places in 403 ms of which 0 ms to minimize.
[2022-05-17 22:04:06] [INFO ] Deduced a trap composed of 49 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:04:06] [INFO ] Deduced a trap composed of 53 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:04:07] [INFO ] Deduced a trap composed of 31 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:04:07] [INFO ] Deduced a trap composed of 31 places in 406 ms of which 1 ms to minimize.
[2022-05-17 22:04:08] [INFO ] Deduced a trap composed of 53 places in 377 ms of which 0 ms to minimize.
[2022-05-17 22:04:08] [INFO ] Deduced a trap composed of 97 places in 373 ms of which 1 ms to minimize.
[2022-05-17 22:04:09] [INFO ] Deduced a trap composed of 53 places in 383 ms of which 1 ms to minimize.
[2022-05-17 22:04:09] [INFO ] Deduced a trap composed of 97 places in 382 ms of which 1 ms to minimize.
[2022-05-17 22:04:10] [INFO ] Deduced a trap composed of 79 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:04:10] [INFO ] Deduced a trap composed of 53 places in 381 ms of which 1 ms to minimize.
[2022-05-17 22:04:10] [INFO ] Deduced a trap composed of 85 places in 314 ms of which 0 ms to minimize.
[2022-05-17 22:04:11] [INFO ] Deduced a trap composed of 113 places in 315 ms of which 0 ms to minimize.
[2022-05-17 22:04:11] [INFO ] Deduced a trap composed of 85 places in 311 ms of which 0 ms to minimize.
[2022-05-17 22:04:12] [INFO ] Deduced a trap composed of 57 places in 288 ms of which 1 ms to minimize.
[2022-05-17 22:04:12] [INFO ] Deduced a trap composed of 83 places in 285 ms of which 1 ms to minimize.
[2022-05-17 22:04:12] [INFO ] Deduced a trap composed of 71 places in 286 ms of which 0 ms to minimize.
[2022-05-17 22:04:13] [INFO ] Deduced a trap composed of 57 places in 289 ms of which 1 ms to minimize.
[2022-05-17 22:04:13] [INFO ] Deduced a trap composed of 71 places in 287 ms of which 1 ms to minimize.
[2022-05-17 22:04:13] [INFO ] Deduced a trap composed of 71 places in 293 ms of which 0 ms to minimize.
[2022-05-17 22:04:14] [INFO ] Deduced a trap composed of 57 places in 291 ms of which 0 ms to minimize.
[2022-05-17 22:04:14] [INFO ] Deduced a trap composed of 97 places in 196 ms of which 0 ms to minimize.
[2022-05-17 22:04:14] [INFO ] Deduced a trap composed of 97 places in 201 ms of which 1 ms to minimize.
[2022-05-17 22:04:14] [INFO ] Deduced a trap composed of 115 places in 199 ms of which 0 ms to minimize.
[2022-05-17 22:04:15] [INFO ] Deduced a trap composed of 133 places in 199 ms of which 1 ms to minimize.
[2022-05-17 22:04:15] [INFO ] Deduced a trap composed of 133 places in 196 ms of which 1 ms to minimize.
[2022-05-17 22:04:15] [INFO ] Deduced a trap composed of 133 places in 198 ms of which 0 ms to minimize.
[2022-05-17 22:04:15] [INFO ] Trap strengthening (SAT) tested/added 79/78 trap constraints in 29117 ms
[2022-05-17 22:04:15] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 82 ms.
[2022-05-17 22:04:31] [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.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 22:04:31] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 22:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:04:31] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2022-05-17 22:04:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:04:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 22:04:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:04:32] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2022-05-17 22:04:32] [INFO ] [Nat]Added 546 Read/Feed constraints in 77 ms returned sat
[2022-05-17 22:04:32] [INFO ] Deduced a trap composed of 37 places in 401 ms of which 0 ms to minimize.
[2022-05-17 22:04:33] [INFO ] Deduced a trap composed of 83 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:04:33] [INFO ] Deduced a trap composed of 68 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:04:34] [INFO ] Deduced a trap composed of 23 places in 405 ms of which 0 ms to minimize.
[2022-05-17 22:04:34] [INFO ] Deduced a trap composed of 68 places in 413 ms of which 0 ms to minimize.
[2022-05-17 22:04:35] [INFO ] Deduced a trap composed of 76 places in 408 ms of which 1 ms to minimize.
[2022-05-17 22:04:35] [INFO ] Deduced a trap composed of 76 places in 398 ms of which 1 ms to minimize.
[2022-05-17 22:04:36] [INFO ] Deduced a trap composed of 35 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:04:36] [INFO ] Deduced a trap composed of 83 places in 406 ms of which 1 ms to minimize.
[2022-05-17 22:04:37] [INFO ] Deduced a trap composed of 83 places in 403 ms of which 1 ms to minimize.
[2022-05-17 22:04:37] [INFO ] Deduced a trap composed of 19 places in 403 ms of which 1 ms to minimize.
[2022-05-17 22:04:37] [INFO ] Deduced a trap composed of 41 places in 403 ms of which 1 ms to minimize.
[2022-05-17 22:04:38] [INFO ] Deduced a trap composed of 72 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:04:38] [INFO ] Deduced a trap composed of 101 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:04:39] [INFO ] Deduced a trap composed of 83 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:04:39] [INFO ] Deduced a trap composed of 101 places in 395 ms of which 0 ms to minimize.
[2022-05-17 22:04:40] [INFO ] Deduced a trap composed of 65 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:04:40] [INFO ] Deduced a trap composed of 11 places in 389 ms of which 0 ms to minimize.
[2022-05-17 22:04:41] [INFO ] Deduced a trap composed of 83 places in 374 ms of which 1 ms to minimize.
[2022-05-17 22:04:41] [INFO ] Deduced a trap composed of 15 places in 376 ms of which 1 ms to minimize.
[2022-05-17 22:04:42] [INFO ] Deduced a trap composed of 29 places in 377 ms of which 0 ms to minimize.
[2022-05-17 22:04:42] [INFO ] Deduced a trap composed of 29 places in 380 ms of which 0 ms to minimize.
[2022-05-17 22:04:42] [INFO ] Deduced a trap composed of 29 places in 383 ms of which 1 ms to minimize.
[2022-05-17 22:04:43] [INFO ] Deduced a trap composed of 125 places in 375 ms of which 1 ms to minimize.
[2022-05-17 22:04:43] [INFO ] Deduced a trap composed of 47 places in 369 ms of which 1 ms to minimize.
[2022-05-17 22:04:44] [INFO ] Deduced a trap composed of 47 places in 362 ms of which 1 ms to minimize.
[2022-05-17 22:04:44] [INFO ] Deduced a trap composed of 83 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:04:45] [INFO ] Deduced a trap composed of 41 places in 392 ms of which 1 ms to minimize.
[2022-05-17 22:04:45] [INFO ] Deduced a trap composed of 83 places in 400 ms of which 1 ms to minimize.
[2022-05-17 22:04:46] [INFO ] Deduced a trap composed of 11 places in 369 ms of which 1 ms to minimize.
[2022-05-17 22:04:46] [INFO ] Deduced a trap composed of 17 places in 369 ms of which 0 ms to minimize.
[2022-05-17 22:04:46] [INFO ] Deduced a trap composed of 29 places in 365 ms of which 1 ms to minimize.
[2022-05-17 22:04:47] [INFO ] Deduced a trap composed of 65 places in 354 ms of which 0 ms to minimize.
[2022-05-17 22:04:47] [INFO ] Deduced a trap composed of 47 places in 354 ms of which 1 ms to minimize.
[2022-05-17 22:04:48] [INFO ] Deduced a trap composed of 23 places in 360 ms of which 1 ms to minimize.
[2022-05-17 22:04:48] [INFO ] Deduced a trap composed of 43 places in 377 ms of which 1 ms to minimize.
[2022-05-17 22:04:49] [INFO ] Deduced a trap composed of 119 places in 375 ms of which 1 ms to minimize.
[2022-05-17 22:04:49] [INFO ] Deduced a trap composed of 47 places in 376 ms of which 1 ms to minimize.
[2022-05-17 22:04:49] [INFO ] Deduced a trap composed of 11 places in 377 ms of which 1 ms to minimize.
[2022-05-17 22:04:50] [INFO ] Deduced a trap composed of 25 places in 346 ms of which 1 ms to minimize.
[2022-05-17 22:04:50] [INFO ] Deduced a trap composed of 119 places in 307 ms of which 1 ms to minimize.
[2022-05-17 22:04:51] [INFO ] Deduced a trap composed of 119 places in 326 ms of which 0 ms to minimize.
[2022-05-17 22:04:51] [INFO ] Deduced a trap composed of 79 places in 326 ms of which 1 ms to minimize.
[2022-05-17 22:04:51] [INFO ] Deduced a trap composed of 63 places in 313 ms of which 0 ms to minimize.
[2022-05-17 22:04:52] [INFO ] Deduced a trap composed of 119 places in 317 ms of which 0 ms to minimize.
[2022-05-17 22:04:52] [INFO ] Deduced a trap composed of 61 places in 255 ms of which 0 ms to minimize.
[2022-05-17 22:04:52] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 1 ms to minimize.
[2022-05-17 22:04:53] [INFO ] Deduced a trap composed of 47 places in 254 ms of which 0 ms to minimize.
[2022-05-17 22:04:53] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 1 ms to minimize.
[2022-05-17 22:04:53] [INFO ] Deduced a trap composed of 79 places in 253 ms of which 1 ms to minimize.
[2022-05-17 22:04:54] [INFO ] Deduced a trap composed of 61 places in 249 ms of which 1 ms to minimize.
[2022-05-17 22:04:54] [INFO ] Deduced a trap composed of 29 places in 372 ms of which 1 ms to minimize.
[2022-05-17 22:04:55] [INFO ] Deduced a trap composed of 15 places in 371 ms of which 1 ms to minimize.
[2022-05-17 22:04:55] [INFO ] Deduced a trap composed of 65 places in 373 ms of which 0 ms to minimize.
[2022-05-17 22:04:55] [INFO ] Deduced a trap composed of 11 places in 323 ms of which 0 ms to minimize.
[2022-05-17 22:04:56] [INFO ] Deduced a trap composed of 101 places in 281 ms of which 0 ms to minimize.
[2022-05-17 22:04:56] [INFO ] Deduced a trap composed of 101 places in 283 ms of which 1 ms to minimize.
[2022-05-17 22:04:56] [INFO ] Deduced a trap composed of 79 places in 287 ms of which 1 ms to minimize.
[2022-05-17 22:04:57] [INFO ] Deduced a trap composed of 31 places in 357 ms of which 1 ms to minimize.
[2022-05-17 22:04:57] [INFO ] Deduced a trap composed of 79 places in 328 ms of which 0 ms to minimize.
[2022-05-17 22:04:58] [INFO ] Deduced a trap composed of 37 places in 338 ms of which 0 ms to minimize.
[2022-05-17 22:04:58] [INFO ] Deduced a trap composed of 47 places in 341 ms of which 1 ms to minimize.
[2022-05-17 22:04:59] [INFO ] Deduced a trap composed of 119 places in 339 ms of which 1 ms to minimize.
[2022-05-17 22:04:59] [INFO ] Deduced a trap composed of 47 places in 337 ms of which 1 ms to minimize.
[2022-05-17 22:04:59] [INFO ] Deduced a trap composed of 49 places in 291 ms of which 1 ms to minimize.
[2022-05-17 22:05:00] [INFO ] Deduced a trap composed of 79 places in 284 ms of which 0 ms to minimize.
[2022-05-17 22:05:00] [INFO ] Deduced a trap composed of 101 places in 214 ms of which 1 ms to minimize.
[2022-05-17 22:05:00] [INFO ] Deduced a trap composed of 101 places in 213 ms of which 1 ms to minimize.
[2022-05-17 22:05:01] [INFO ] Deduced a trap composed of 119 places in 214 ms of which 1 ms to minimize.
[2022-05-17 22:05:01] [INFO ] Deduced a trap composed of 73 places in 218 ms of which 0 ms to minimize.
[2022-05-17 22:05:01] [INFO ] Deduced a trap composed of 73 places in 218 ms of which 0 ms to minimize.
[2022-05-17 22:05:01] [INFO ] Deduced a trap composed of 101 places in 217 ms of which 1 ms to minimize.
[2022-05-17 22:05:02] [INFO ] Deduced a trap composed of 101 places in 180 ms of which 1 ms to minimize.
[2022-05-17 22:05:02] [INFO ] Deduced a trap composed of 101 places in 188 ms of which 1 ms to minimize.
[2022-05-17 22:05:02] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 1 ms to minimize.
[2022-05-17 22:05:03] [INFO ] Deduced a trap composed of 119 places in 168 ms of which 0 ms to minimize.
[2022-05-17 22:05:03] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 1 ms to minimize.
[2022-05-17 22:05:03] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 1 ms to minimize.
[2022-05-17 22:05:03] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 0 ms to minimize.
[2022-05-17 22:05:04] [INFO ] Deduced a trap composed of 17 places in 424 ms of which 1 ms to minimize.
[2022-05-17 22:05:05] [INFO ] Deduced a trap composed of 75 places in 345 ms of which 1 ms to minimize.
[2022-05-17 22:05:05] [INFO ] Deduced a trap composed of 109 places in 266 ms of which 1 ms to minimize.
[2022-05-17 22:05:05] [INFO ] Deduced a trap composed of 75 places in 263 ms of which 1 ms to minimize.
[2022-05-17 22:05:06] [INFO ] Deduced a trap composed of 71 places in 363 ms of which 1 ms to minimize.
[2022-05-17 22:05:06] [INFO ] Deduced a trap composed of 150 places in 275 ms of which 1 ms to minimize.
[2022-05-17 22:05:06] [INFO ] Deduced a trap composed of 93 places in 284 ms of which 1 ms to minimize.
[2022-05-17 22:05:07] [INFO ] Deduced a trap composed of 91 places in 240 ms of which 1 ms to minimize.
[2022-05-17 22:05:07] [INFO ] Deduced a trap composed of 91 places in 231 ms of which 0 ms to minimize.
[2022-05-17 22:05:07] [INFO ] Deduced a trap composed of 91 places in 221 ms of which 0 ms to minimize.
[2022-05-17 22:05:08] [INFO ] Deduced a trap composed of 133 places in 223 ms of which 1 ms to minimize.
[2022-05-17 22:05:08] [INFO ] Deduced a trap composed of 129 places in 235 ms of which 0 ms to minimize.
[2022-05-17 22:05:08] [INFO ] Deduced a trap composed of 189 places in 235 ms of which 0 ms to minimize.
[2022-05-17 22:05:09] [INFO ] Deduced a trap composed of 133 places in 231 ms of which 1 ms to minimize.
[2022-05-17 22:05:09] [INFO ] Deduced a trap composed of 109 places in 242 ms of which 1 ms to minimize.
[2022-05-17 22:05:09] [INFO ] Deduced a trap composed of 109 places in 236 ms of which 1 ms to minimize.
[2022-05-17 22:05:09] [INFO ] Deduced a trap composed of 91 places in 237 ms of which 1 ms to minimize.
[2022-05-17 22:05:10] [INFO ] Deduced a trap composed of 91 places in 236 ms of which 1 ms to minimize.
[2022-05-17 22:05:10] [INFO ] Deduced a trap composed of 109 places in 234 ms of which 1 ms to minimize.
[2022-05-17 22:05:10] [INFO ] Deduced a trap composed of 109 places in 238 ms of which 1 ms to minimize.
[2022-05-17 22:05:11] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 0 ms to minimize.
[2022-05-17 22:05:11] [INFO ] Deduced a trap composed of 91 places in 214 ms of which 1 ms to minimize.
[2022-05-17 22:05:11] [INFO ] Deduced a trap composed of 97 places in 225 ms of which 0 ms to minimize.
[2022-05-17 22:05:12] [INFO ] Deduced a trap composed of 55 places in 333 ms of which 1 ms to minimize.
[2022-05-17 22:05:12] [INFO ] Deduced a trap composed of 79 places in 256 ms of which 0 ms to minimize.
[2022-05-17 22:05:12] [INFO ] Deduced a trap composed of 133 places in 256 ms of which 0 ms to minimize.
[2022-05-17 22:05:13] [INFO ] Deduced a trap composed of 133 places in 256 ms of which 1 ms to minimize.
[2022-05-17 22:05:13] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2022-05-17 22:05:13] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 0 ms to minimize.
[2022-05-17 22:05:13] [INFO ] Deduced a trap composed of 75 places in 200 ms of which 1 ms to minimize.
[2022-05-17 22:05:14] [INFO ] Deduced a trap composed of 69 places in 295 ms of which 1 ms to minimize.
[2022-05-17 22:05:14] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 0 ms to minimize.
[2022-05-17 22:05:14] [INFO ] Trap strengthening (SAT) tested/added 112/111 trap constraints in 42161 ms
[2022-05-17 22:05:14] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 93 ms.
[2022-05-17 22:05:16] [INFO ] Added : 130 causal constraints over 26 iterations in 2230 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [448, 448, 8, 1, 1] Max seen :[7, 7, 1, 0, 0]
Incomplete Parikh walk after 657800 steps, including 1000 resets, run finished after 6429 ms. (steps per millisecond=102 ) properties (out of 5) seen :13 could not realise parikh vector
Support contains 457 out of 1098 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1098/1098 places, 2210/2210 transitions.
Applied a total of 0 rules in 29 ms. Remains 1098 /1098 variables (removed 0) and now considering 2210/2210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1098/1098 places, 2210/2210 transitions.
Starting structural reductions, iteration 0 : 1098/1098 places, 2210/2210 transitions.
Applied a total of 0 rules in 29 ms. Remains 1098 /1098 variables (removed 0) and now considering 2210/2210 (removed 0) transitions.
[2022-05-17 22:05:23] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:05:23] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 22:05:23] [INFO ] Implicit Places using invariants in 452 ms returned []
[2022-05-17 22:05:23] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:05:23] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 22:05:24] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:05:30] [INFO ] Implicit Places using invariants and state equation in 7095 ms returned []
Implicit Place search using SMT with State Equation took 7547 ms to find 0 implicit places.
[2022-05-17 22:05:30] [INFO ] Redundant transitions in 53 ms returned []
[2022-05-17 22:05:30] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:05:30] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-17 22:05:31] [INFO ] Dead Transitions using invariants and state equation in 849 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1098/1098 places, 2210/2210 transitions.
Starting property specific reduction for Peterson-PT-7-UpperBounds-01
Normalized transition count is 1874 out of 2210 initially.
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:05:31] [INFO ] Computed 23 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :1
[2022-05-17 22:05:31] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:05:31] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 22:05:31] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 22:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:05:32] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2022-05-17 22:05:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:05:32] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 22:05:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:05:33] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2022-05-17 22:05:33] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:05:33] [INFO ] [Nat]Added 546 Read/Feed constraints in 90 ms returned sat
[2022-05-17 22:05:33] [INFO ] Deduced a trap composed of 19 places in 422 ms of which 1 ms to minimize.
[2022-05-17 22:05:34] [INFO ] Deduced a trap composed of 15 places in 427 ms of which 0 ms to minimize.
[2022-05-17 22:05:34] [INFO ] Deduced a trap composed of 47 places in 421 ms of which 1 ms to minimize.
[2022-05-17 22:05:35] [INFO ] Deduced a trap composed of 41 places in 429 ms of which 0 ms to minimize.
[2022-05-17 22:05:35] [INFO ] Deduced a trap composed of 63 places in 435 ms of which 0 ms to minimize.
[2022-05-17 22:05:36] [INFO ] Deduced a trap composed of 19 places in 421 ms of which 1 ms to minimize.
[2022-05-17 22:05:36] [INFO ] Deduced a trap composed of 11 places in 414 ms of which 0 ms to minimize.
[2022-05-17 22:05:37] [INFO ] Deduced a trap composed of 11 places in 422 ms of which 1 ms to minimize.
[2022-05-17 22:05:37] [INFO ] Deduced a trap composed of 19 places in 420 ms of which 0 ms to minimize.
[2022-05-17 22:05:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 1098 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1098/1098 places, 2210/2210 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1098 transition count 2209
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 1097 transition count 2208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1096 transition count 2208
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 4 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 3 with 16 rules applied. Total rules applied 20 place count 1088 transition count 2200
Applied a total of 20 rules in 52 ms. Remains 1088 /1098 variables (removed 10) and now considering 2200/2210 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1098 places, 2200/2210 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:05:37] [INFO ] Computed 23 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5768 ms. (steps per millisecond=173 ) properties (out of 1) seen :6
Interrupted Best-First random walk after 886340 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=177 ) properties seen :{0=3}
[2022-05-17 22:05:48] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:05:48] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 22:05:48] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 22:05:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:05:48] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2022-05-17 22:05:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:05:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 22:05:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:05:49] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2022-05-17 22:05:49] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:05:49] [INFO ] [Nat]Added 546 Read/Feed constraints in 84 ms returned sat
[2022-05-17 22:05:50] [INFO ] Deduced a trap composed of 65 places in 449 ms of which 1 ms to minimize.
[2022-05-17 22:05:50] [INFO ] Deduced a trap composed of 41 places in 444 ms of which 1 ms to minimize.
[2022-05-17 22:05:51] [INFO ] Deduced a trap composed of 49 places in 449 ms of which 0 ms to minimize.
[2022-05-17 22:05:51] [INFO ] Deduced a trap composed of 49 places in 457 ms of which 0 ms to minimize.
[2022-05-17 22:05:52] [INFO ] Deduced a trap composed of 29 places in 441 ms of which 0 ms to minimize.
[2022-05-17 22:05:52] [INFO ] Deduced a trap composed of 66 places in 447 ms of which 1 ms to minimize.
[2022-05-17 22:05:53] [INFO ] Deduced a trap composed of 49 places in 438 ms of which 1 ms to minimize.
[2022-05-17 22:05:53] [INFO ] Deduced a trap composed of 15 places in 458 ms of which 1 ms to minimize.
[2022-05-17 22:05:54] [INFO ] Deduced a trap composed of 35 places in 446 ms of which 1 ms to minimize.
[2022-05-17 22:05:54] [INFO ] Deduced a trap composed of 13 places in 439 ms of which 1 ms to minimize.
[2022-05-17 22:05:55] [INFO ] Deduced a trap composed of 15 places in 433 ms of which 1 ms to minimize.
[2022-05-17 22:05:56] [INFO ] Deduced a trap composed of 17 places in 449 ms of which 1 ms to minimize.
[2022-05-17 22:05:56] [INFO ] Deduced a trap composed of 17 places in 454 ms of which 1 ms to minimize.
[2022-05-17 22:05:57] [INFO ] Deduced a trap composed of 79 places in 442 ms of which 1 ms to minimize.
[2022-05-17 22:05:57] [INFO ] Deduced a trap composed of 47 places in 439 ms of which 0 ms to minimize.
[2022-05-17 22:05:58] [INFO ] Deduced a trap composed of 11 places in 446 ms of which 1 ms to minimize.
[2022-05-17 22:05:58] [INFO ] Deduced a trap composed of 21 places in 445 ms of which 1 ms to minimize.
[2022-05-17 22:05:59] [INFO ] Deduced a trap composed of 47 places in 457 ms of which 1 ms to minimize.
[2022-05-17 22:05:59] [INFO ] Deduced a trap composed of 13 places in 450 ms of which 1 ms to minimize.
[2022-05-17 22:06:00] [INFO ] Deduced a trap composed of 81 places in 449 ms of which 1 ms to minimize.
[2022-05-17 22:06:00] [INFO ] Deduced a trap composed of 55 places in 474 ms of which 1 ms to minimize.
[2022-05-17 22:06:01] [INFO ] Deduced a trap composed of 33 places in 447 ms of which 1 ms to minimize.
[2022-05-17 22:06:01] [INFO ] Deduced a trap composed of 54 places in 446 ms of which 1 ms to minimize.
[2022-05-17 22:06:02] [INFO ] Deduced a trap composed of 29 places in 455 ms of which 1 ms to minimize.
[2022-05-17 22:06:02] [INFO ] Deduced a trap composed of 65 places in 453 ms of which 1 ms to minimize.
[2022-05-17 22:06:03] [INFO ] Deduced a trap composed of 37 places in 443 ms of which 1 ms to minimize.
[2022-05-17 22:06:03] [INFO ] Deduced a trap composed of 106 places in 440 ms of which 0 ms to minimize.
[2022-05-17 22:06:04] [INFO ] Deduced a trap composed of 88 places in 470 ms of which 1 ms to minimize.
[2022-05-17 22:06:04] [INFO ] Deduced a trap composed of 101 places in 458 ms of which 1 ms to minimize.
[2022-05-17 22:06:05] [INFO ] Deduced a trap composed of 11 places in 461 ms of which 1 ms to minimize.
[2022-05-17 22:06:05] [INFO ] Deduced a trap composed of 33 places in 445 ms of which 1 ms to minimize.
[2022-05-17 22:06:06] [INFO ] Deduced a trap composed of 35 places in 441 ms of which 1 ms to minimize.
[2022-05-17 22:06:06] [INFO ] Deduced a trap composed of 39 places in 433 ms of which 1 ms to minimize.
[2022-05-17 22:06:07] [INFO ] Deduced a trap composed of 33 places in 431 ms of which 1 ms to minimize.
[2022-05-17 22:06:07] [INFO ] Deduced a trap composed of 39 places in 433 ms of which 1 ms to minimize.
[2022-05-17 22:06:08] [INFO ] Deduced a trap composed of 45 places in 438 ms of which 1 ms to minimize.
[2022-05-17 22:06:08] [INFO ] Deduced a trap composed of 67 places in 427 ms of which 0 ms to minimize.
[2022-05-17 22:06:09] [INFO ] Deduced a trap composed of 67 places in 434 ms of which 1 ms to minimize.
[2022-05-17 22:06:09] [INFO ] Deduced a trap composed of 49 places in 427 ms of which 1 ms to minimize.
[2022-05-17 22:06:10] [INFO ] Deduced a trap composed of 67 places in 436 ms of which 1 ms to minimize.
[2022-05-17 22:06:10] [INFO ] Deduced a trap composed of 85 places in 439 ms of which 1 ms to minimize.
[2022-05-17 22:06:11] [INFO ] Deduced a trap composed of 65 places in 430 ms of which 1 ms to minimize.
[2022-05-17 22:06:11] [INFO ] Deduced a trap composed of 118 places in 434 ms of which 0 ms to minimize.
[2022-05-17 22:06:12] [INFO ] Deduced a trap composed of 31 places in 426 ms of which 0 ms to minimize.
[2022-05-17 22:06:12] [INFO ] Deduced a trap composed of 85 places in 426 ms of which 1 ms to minimize.
[2022-05-17 22:06:13] [INFO ] Deduced a trap composed of 31 places in 430 ms of which 0 ms to minimize.
[2022-05-17 22:06:13] [INFO ] Deduced a trap composed of 31 places in 433 ms of which 0 ms to minimize.
[2022-05-17 22:06:14] [INFO ] Deduced a trap composed of 49 places in 423 ms of which 1 ms to minimize.
[2022-05-17 22:06:14] [INFO ] Deduced a trap composed of 49 places in 419 ms of which 1 ms to minimize.
[2022-05-17 22:06:15] [INFO ] Deduced a trap composed of 49 places in 443 ms of which 0 ms to minimize.
[2022-05-17 22:06:15] [INFO ] Deduced a trap composed of 85 places in 425 ms of which 1 ms to minimize.
[2022-05-17 22:06:16] [INFO ] Deduced a trap composed of 85 places in 433 ms of which 1 ms to minimize.
[2022-05-17 22:06:16] [INFO ] Deduced a trap composed of 31 places in 428 ms of which 1 ms to minimize.
[2022-05-17 22:06:17] [INFO ] Deduced a trap composed of 116 places in 428 ms of which 0 ms to minimize.
[2022-05-17 22:06:17] [INFO ] Deduced a trap composed of 41 places in 369 ms of which 1 ms to minimize.
[2022-05-17 22:06:18] [INFO ] Deduced a trap composed of 57 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:06:18] [INFO ] Deduced a trap composed of 75 places in 408 ms of which 1 ms to minimize.
[2022-05-17 22:06:19] [INFO ] Deduced a trap composed of 83 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:06:19] [INFO ] Deduced a trap composed of 63 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:06:20] [INFO ] Deduced a trap composed of 37 places in 375 ms of which 1 ms to minimize.
[2022-05-17 22:06:20] [INFO ] Deduced a trap composed of 113 places in 265 ms of which 0 ms to minimize.
[2022-05-17 22:06:20] [INFO ] Deduced a trap composed of 49 places in 279 ms of which 1 ms to minimize.
[2022-05-17 22:06:21] [INFO ] Deduced a trap composed of 51 places in 280 ms of which 0 ms to minimize.
[2022-05-17 22:06:21] [INFO ] Deduced a trap composed of 93 places in 254 ms of which 1 ms to minimize.
[2022-05-17 22:06:21] [INFO ] Deduced a trap composed of 105 places in 262 ms of which 0 ms to minimize.
[2022-05-17 22:06:22] [INFO ] Deduced a trap composed of 87 places in 259 ms of which 1 ms to minimize.
[2022-05-17 22:06:22] [INFO ] Deduced a trap composed of 75 places in 304 ms of which 1 ms to minimize.
[2022-05-17 22:06:22] [INFO ] Deduced a trap composed of 143 places in 306 ms of which 1 ms to minimize.
[2022-05-17 22:06:23] [INFO ] Deduced a trap composed of 71 places in 306 ms of which 1 ms to minimize.
[2022-05-17 22:06:23] [INFO ] Deduced a trap composed of 75 places in 301 ms of which 1 ms to minimize.
[2022-05-17 22:06:24] [INFO ] Deduced a trap composed of 53 places in 304 ms of which 0 ms to minimize.
[2022-05-17 22:06:24] [INFO ] Deduced a trap composed of 97 places in 255 ms of which 1 ms to minimize.
[2022-05-17 22:06:24] [INFO ] Deduced a trap composed of 123 places in 219 ms of which 0 ms to minimize.
[2022-05-17 22:06:24] [INFO ] Deduced a trap composed of 87 places in 213 ms of which 1 ms to minimize.
[2022-05-17 22:06:25] [INFO ] Deduced a trap composed of 69 places in 276 ms of which 0 ms to minimize.
[2022-05-17 22:06:25] [INFO ] Deduced a trap composed of 69 places in 274 ms of which 0 ms to minimize.
[2022-05-17 22:06:25] [INFO ] Deduced a trap composed of 69 places in 284 ms of which 1 ms to minimize.
[2022-05-17 22:06:26] [INFO ] Deduced a trap composed of 69 places in 274 ms of which 1 ms to minimize.
[2022-05-17 22:06:26] [INFO ] Deduced a trap composed of 123 places in 201 ms of which 0 ms to minimize.
[2022-05-17 22:06:26] [INFO ] Deduced a trap composed of 105 places in 205 ms of which 0 ms to minimize.
[2022-05-17 22:06:27] [INFO ] Deduced a trap composed of 123 places in 206 ms of which 1 ms to minimize.
[2022-05-17 22:06:27] [INFO ] Deduced a trap composed of 123 places in 213 ms of which 1 ms to minimize.
[2022-05-17 22:06:27] [INFO ] Deduced a trap composed of 123 places in 215 ms of which 0 ms to minimize.
[2022-05-17 22:06:27] [INFO ] Deduced a trap composed of 105 places in 207 ms of which 1 ms to minimize.
[2022-05-17 22:06:28] [INFO ] Deduced a trap composed of 105 places in 203 ms of which 1 ms to minimize.
[2022-05-17 22:06:28] [INFO ] Deduced a trap composed of 105 places in 204 ms of which 0 ms to minimize.
[2022-05-17 22:06:28] [INFO ] Deduced a trap composed of 123 places in 203 ms of which 1 ms to minimize.
[2022-05-17 22:06:29] [INFO ] Deduced a trap composed of 147 places in 199 ms of which 1 ms to minimize.
[2022-05-17 22:06:29] [INFO ] Deduced a trap composed of 105 places in 197 ms of which 0 ms to minimize.
[2022-05-17 22:06:29] [INFO ] Trap strengthening (SAT) tested/added 90/89 trap constraints in 39448 ms
[2022-05-17 22:06:29] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 82 ms.
[2022-05-17 22:06:34] [INFO ] Deduced a trap composed of 2 places in 506 ms of which 0 ms to minimize.
[2022-05-17 22:06:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 :[6]
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 28 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.
[2022-05-17 22:06:34] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:06:34] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 22:06:34] [INFO ] Implicit Places using invariants in 434 ms returned []
[2022-05-17 22:06:34] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:06:34] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-17 22:06:35] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:06:41] [INFO ] Implicit Places using invariants and state equation in 6975 ms returned []
Implicit Place search using SMT with State Equation took 7410 ms to find 0 implicit places.
[2022-05-17 22:06:42] [INFO ] Redundant transitions in 47 ms returned []
[2022-05-17 22:06:42] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:06:42] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 22:06:42] [INFO ] Dead Transitions using invariants and state equation in 861 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
[2022-05-17 22:06:42] [INFO ] Computed 23 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5786 ms. (steps per millisecond=172 ) properties (out of 1) seen :6
Interrupted Best-First random walk after 878114 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=175 ) properties seen :{0=2}
[2022-05-17 22:06:53] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:06:53] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 22:06:53] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2022-05-17 22:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:06:54] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2022-05-17 22:06:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:06:54] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 22:06:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:06:55] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2022-05-17 22:06:55] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:06:55] [INFO ] [Nat]Added 546 Read/Feed constraints in 83 ms returned sat
[2022-05-17 22:06:55] [INFO ] Deduced a trap composed of 65 places in 448 ms of which 1 ms to minimize.
[2022-05-17 22:06:56] [INFO ] Deduced a trap composed of 41 places in 450 ms of which 1 ms to minimize.
[2022-05-17 22:06:56] [INFO ] Deduced a trap composed of 49 places in 448 ms of which 1 ms to minimize.
[2022-05-17 22:06:57] [INFO ] Deduced a trap composed of 49 places in 451 ms of which 1 ms to minimize.
[2022-05-17 22:06:57] [INFO ] Deduced a trap composed of 29 places in 455 ms of which 1 ms to minimize.
[2022-05-17 22:06:58] [INFO ] Deduced a trap composed of 66 places in 450 ms of which 1 ms to minimize.
[2022-05-17 22:06:58] [INFO ] Deduced a trap composed of 49 places in 435 ms of which 1 ms to minimize.
[2022-05-17 22:06:59] [INFO ] Deduced a trap composed of 15 places in 450 ms of which 1 ms to minimize.
[2022-05-17 22:06:59] [INFO ] Deduced a trap composed of 35 places in 433 ms of which 1 ms to minimize.
[2022-05-17 22:07:00] [INFO ] Deduced a trap composed of 13 places in 435 ms of which 0 ms to minimize.
[2022-05-17 22:07:00] [INFO ] Deduced a trap composed of 15 places in 425 ms of which 1 ms to minimize.
[2022-05-17 22:07:01] [INFO ] Deduced a trap composed of 17 places in 428 ms of which 1 ms to minimize.
[2022-05-17 22:07:01] [INFO ] Deduced a trap composed of 17 places in 432 ms of which 0 ms to minimize.
[2022-05-17 22:07:02] [INFO ] Deduced a trap composed of 79 places in 441 ms of which 1 ms to minimize.
[2022-05-17 22:07:02] [INFO ] Deduced a trap composed of 47 places in 447 ms of which 1 ms to minimize.
[2022-05-17 22:07:03] [INFO ] Deduced a trap composed of 11 places in 445 ms of which 1 ms to minimize.
[2022-05-17 22:07:03] [INFO ] Deduced a trap composed of 21 places in 439 ms of which 1 ms to minimize.
[2022-05-17 22:07:04] [INFO ] Deduced a trap composed of 47 places in 456 ms of which 1 ms to minimize.
[2022-05-17 22:07:04] [INFO ] Deduced a trap composed of 13 places in 441 ms of which 1 ms to minimize.
[2022-05-17 22:07:05] [INFO ] Deduced a trap composed of 81 places in 445 ms of which 0 ms to minimize.
[2022-05-17 22:07:05] [INFO ] Deduced a trap composed of 55 places in 436 ms of which 1 ms to minimize.
[2022-05-17 22:07:06] [INFO ] Deduced a trap composed of 33 places in 440 ms of which 1 ms to minimize.
[2022-05-17 22:07:06] [INFO ] Deduced a trap composed of 54 places in 435 ms of which 1 ms to minimize.
[2022-05-17 22:07:07] [INFO ] Deduced a trap composed of 29 places in 441 ms of which 1 ms to minimize.
[2022-05-17 22:07:07] [INFO ] Deduced a trap composed of 65 places in 452 ms of which 1 ms to minimize.
[2022-05-17 22:07:08] [INFO ] Deduced a trap composed of 37 places in 453 ms of which 1 ms to minimize.
[2022-05-17 22:07:08] [INFO ] Deduced a trap composed of 106 places in 447 ms of which 1 ms to minimize.
[2022-05-17 22:07:09] [INFO ] Deduced a trap composed of 88 places in 440 ms of which 1 ms to minimize.
[2022-05-17 22:07:09] [INFO ] Deduced a trap composed of 101 places in 460 ms of which 1 ms to minimize.
[2022-05-17 22:07:10] [INFO ] Deduced a trap composed of 11 places in 449 ms of which 1 ms to minimize.
[2022-05-17 22:07:11] [INFO ] Deduced a trap composed of 33 places in 435 ms of which 1 ms to minimize.
[2022-05-17 22:07:11] [INFO ] Deduced a trap composed of 35 places in 444 ms of which 1 ms to minimize.
[2022-05-17 22:07:12] [INFO ] Deduced a trap composed of 39 places in 451 ms of which 1 ms to minimize.
[2022-05-17 22:07:12] [INFO ] Deduced a trap composed of 33 places in 433 ms of which 1 ms to minimize.
[2022-05-17 22:07:13] [INFO ] Deduced a trap composed of 39 places in 442 ms of which 1 ms to minimize.
[2022-05-17 22:07:13] [INFO ] Deduced a trap composed of 45 places in 425 ms of which 1 ms to minimize.
[2022-05-17 22:07:14] [INFO ] Deduced a trap composed of 67 places in 450 ms of which 1 ms to minimize.
[2022-05-17 22:07:14] [INFO ] Deduced a trap composed of 67 places in 439 ms of which 1 ms to minimize.
[2022-05-17 22:07:15] [INFO ] Deduced a trap composed of 49 places in 430 ms of which 1 ms to minimize.
[2022-05-17 22:07:15] [INFO ] Deduced a trap composed of 67 places in 420 ms of which 1 ms to minimize.
[2022-05-17 22:07:16] [INFO ] Deduced a trap composed of 85 places in 422 ms of which 1 ms to minimize.
[2022-05-17 22:07:16] [INFO ] Deduced a trap composed of 65 places in 428 ms of which 1 ms to minimize.
[2022-05-17 22:07:16] [INFO ] Deduced a trap composed of 118 places in 426 ms of which 1 ms to minimize.
[2022-05-17 22:07:17] [INFO ] Deduced a trap composed of 31 places in 425 ms of which 1 ms to minimize.
[2022-05-17 22:07:17] [INFO ] Deduced a trap composed of 85 places in 428 ms of which 0 ms to minimize.
[2022-05-17 22:07:18] [INFO ] Deduced a trap composed of 31 places in 424 ms of which 0 ms to minimize.
[2022-05-17 22:07:18] [INFO ] Deduced a trap composed of 31 places in 432 ms of which 1 ms to minimize.
[2022-05-17 22:07:19] [INFO ] Deduced a trap composed of 49 places in 426 ms of which 1 ms to minimize.
[2022-05-17 22:07:19] [INFO ] Deduced a trap composed of 49 places in 428 ms of which 1 ms to minimize.
[2022-05-17 22:07:20] [INFO ] Deduced a trap composed of 49 places in 432 ms of which 1 ms to minimize.
[2022-05-17 22:07:20] [INFO ] Deduced a trap composed of 85 places in 432 ms of which 0 ms to minimize.
[2022-05-17 22:07:21] [INFO ] Deduced a trap composed of 85 places in 428 ms of which 1 ms to minimize.
[2022-05-17 22:07:21] [INFO ] Deduced a trap composed of 31 places in 429 ms of which 0 ms to minimize.
[2022-05-17 22:07:22] [INFO ] Deduced a trap composed of 116 places in 423 ms of which 1 ms to minimize.
[2022-05-17 22:07:23] [INFO ] Deduced a trap composed of 41 places in 361 ms of which 1 ms to minimize.
[2022-05-17 22:07:23] [INFO ] Deduced a trap composed of 57 places in 389 ms of which 1 ms to minimize.
[2022-05-17 22:07:23] [INFO ] Deduced a trap composed of 75 places in 393 ms of which 0 ms to minimize.
[2022-05-17 22:07:24] [INFO ] Deduced a trap composed of 83 places in 389 ms of which 0 ms to minimize.
[2022-05-17 22:07:24] [INFO ] Deduced a trap composed of 63 places in 387 ms of which 1 ms to minimize.
[2022-05-17 22:07:25] [INFO ] Deduced a trap composed of 37 places in 370 ms of which 1 ms to minimize.
[2022-05-17 22:07:25] [INFO ] Deduced a trap composed of 113 places in 269 ms of which 1 ms to minimize.
[2022-05-17 22:07:26] [INFO ] Deduced a trap composed of 49 places in 275 ms of which 0 ms to minimize.
[2022-05-17 22:07:26] [INFO ] Deduced a trap composed of 51 places in 281 ms of which 0 ms to minimize.
[2022-05-17 22:07:26] [INFO ] Deduced a trap composed of 93 places in 251 ms of which 0 ms to minimize.
[2022-05-17 22:07:26] [INFO ] Deduced a trap composed of 105 places in 248 ms of which 0 ms to minimize.
[2022-05-17 22:07:27] [INFO ] Deduced a trap composed of 87 places in 247 ms of which 1 ms to minimize.
[2022-05-17 22:07:27] [INFO ] Deduced a trap composed of 75 places in 293 ms of which 0 ms to minimize.
[2022-05-17 22:07:28] [INFO ] Deduced a trap composed of 143 places in 297 ms of which 1 ms to minimize.
[2022-05-17 22:07:28] [INFO ] Deduced a trap composed of 71 places in 298 ms of which 1 ms to minimize.
[2022-05-17 22:07:28] [INFO ] Deduced a trap composed of 75 places in 290 ms of which 1 ms to minimize.
[2022-05-17 22:07:29] [INFO ] Deduced a trap composed of 53 places in 299 ms of which 0 ms to minimize.
[2022-05-17 22:07:29] [INFO ] Deduced a trap composed of 97 places in 258 ms of which 0 ms to minimize.
[2022-05-17 22:07:29] [INFO ] Deduced a trap composed of 123 places in 221 ms of which 0 ms to minimize.
[2022-05-17 22:07:29] [INFO ] Deduced a trap composed of 87 places in 211 ms of which 1 ms to minimize.
[2022-05-17 22:07:30] [INFO ] Deduced a trap composed of 69 places in 267 ms of which 1 ms to minimize.
[2022-05-17 22:07:30] [INFO ] Deduced a trap composed of 69 places in 265 ms of which 0 ms to minimize.
[2022-05-17 22:07:30] [INFO ] Deduced a trap composed of 69 places in 272 ms of which 1 ms to minimize.
[2022-05-17 22:07:31] [INFO ] Deduced a trap composed of 69 places in 273 ms of which 0 ms to minimize.
[2022-05-17 22:07:31] [INFO ] Deduced a trap composed of 123 places in 191 ms of which 1 ms to minimize.
[2022-05-17 22:07:31] [INFO ] Deduced a trap composed of 105 places in 197 ms of which 1 ms to minimize.
[2022-05-17 22:07:32] [INFO ] Deduced a trap composed of 123 places in 208 ms of which 1 ms to minimize.
[2022-05-17 22:07:32] [INFO ] Deduced a trap composed of 123 places in 203 ms of which 1 ms to minimize.
[2022-05-17 22:07:32] [INFO ] Deduced a trap composed of 123 places in 203 ms of which 0 ms to minimize.
[2022-05-17 22:07:32] [INFO ] Deduced a trap composed of 105 places in 195 ms of which 0 ms to minimize.
[2022-05-17 22:07:33] [INFO ] Deduced a trap composed of 105 places in 205 ms of which 1 ms to minimize.
[2022-05-17 22:07:33] [INFO ] Deduced a trap composed of 105 places in 205 ms of which 0 ms to minimize.
[2022-05-17 22:07:33] [INFO ] Deduced a trap composed of 123 places in 196 ms of which 0 ms to minimize.
[2022-05-17 22:07:33] [INFO ] Deduced a trap composed of 147 places in 201 ms of which 0 ms to minimize.
[2022-05-17 22:07:34] [INFO ] Deduced a trap composed of 105 places in 200 ms of which 0 ms to minimize.
[2022-05-17 22:07:34] [INFO ] Trap strengthening (SAT) tested/added 90/89 trap constraints in 39067 ms
[2022-05-17 22:07:34] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 82 ms.
3timeout
^^^^^^^^
(error "Invalid token: 3timeout")
[2022-05-17 22:07:39] [INFO ] Deduced a trap composed of 2 places in 478 ms of which 1 ms to minimize.
[2022-05-17 22:07: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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 :[6]
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 30 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 27 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 22:07:39] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:07:39] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 22:07:40] [INFO ] Implicit Places using invariants in 439 ms returned []
[2022-05-17 22:07:40] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:07:40] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 22:07:40] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:07:47] [INFO ] Implicit Places using invariants and state equation in 6965 ms returned []
Implicit Place search using SMT with State Equation took 7406 ms to find 0 implicit places.
[2022-05-17 22:07:47] [INFO ] Redundant transitions in 54 ms returned []
[2022-05-17 22:07:47] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:07:47] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-17 22:07:48] [INFO ] Dead Transitions using invariants and state equation in 851 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-01 in 136507 ms.
Starting property specific reduction for Peterson-PT-7-UpperBounds-03
Normalized transition count is 1874 out of 2210 initially.
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:07:48] [INFO ] Computed 23 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :1
[2022-05-17 22:07:48] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:07:48] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 22:07:48] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 22:07:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:07:48] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2022-05-17 22:07:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:07:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 22:07:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:07:49] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2022-05-17 22:07:49] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:07:49] [INFO ] [Nat]Added 546 Read/Feed constraints in 90 ms returned sat
[2022-05-17 22:07:50] [INFO ] Deduced a trap composed of 19 places in 429 ms of which 1 ms to minimize.
[2022-05-17 22:07:50] [INFO ] Deduced a trap composed of 15 places in 423 ms of which 0 ms to minimize.
[2022-05-17 22:07:51] [INFO ] Deduced a trap composed of 47 places in 415 ms of which 1 ms to minimize.
[2022-05-17 22:07:51] [INFO ] Deduced a trap composed of 41 places in 428 ms of which 1 ms to minimize.
[2022-05-17 22:07:52] [INFO ] Deduced a trap composed of 63 places in 427 ms of which 1 ms to minimize.
[2022-05-17 22:07:52] [INFO ] Deduced a trap composed of 19 places in 436 ms of which 1 ms to minimize.
[2022-05-17 22:07:53] [INFO ] Deduced a trap composed of 11 places in 421 ms of which 0 ms to minimize.
[2022-05-17 22:07:53] [INFO ] Deduced a trap composed of 11 places in 422 ms of which 1 ms to minimize.
[2022-05-17 22:07:54] [INFO ] Deduced a trap composed of 19 places in 420 ms of which 1 ms to minimize.
[2022-05-17 22:07: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 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 1098 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1098/1098 places, 2210/2210 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1098 transition count 2209
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 1097 transition count 2208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1096 transition count 2208
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 4 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 3 with 16 rules applied. Total rules applied 20 place count 1088 transition count 2200
Applied a total of 20 rules in 55 ms. Remains 1088 /1098 variables (removed 10) and now considering 2200/2210 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1098 places, 2200/2210 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:07:54] [INFO ] Computed 23 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5743 ms. (steps per millisecond=174 ) properties (out of 1) seen :6
Interrupted Best-First random walk after 877331 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=175 ) properties seen :{0=2}
[2022-05-17 22:08:04] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:08:04] [INFO ] Computed 23 place invariants in 14 ms
[2022-05-17 22:08:05] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 22:08:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:08:05] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2022-05-17 22:08:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:08:05] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 22:08:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:08:06] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2022-05-17 22:08:06] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:08:06] [INFO ] [Nat]Added 546 Read/Feed constraints in 82 ms returned sat
[2022-05-17 22:08:06] [INFO ] Deduced a trap composed of 65 places in 450 ms of which 1 ms to minimize.
[2022-05-17 22:08:07] [INFO ] Deduced a trap composed of 41 places in 462 ms of which 1 ms to minimize.
[2022-05-17 22:08:07] [INFO ] Deduced a trap composed of 49 places in 457 ms of which 0 ms to minimize.
[2022-05-17 22:08:08] [INFO ] Deduced a trap composed of 49 places in 455 ms of which 1 ms to minimize.
[2022-05-17 22:08:08] [INFO ] Deduced a trap composed of 29 places in 450 ms of which 1 ms to minimize.
[2022-05-17 22:08:09] [INFO ] Deduced a trap composed of 66 places in 455 ms of which 1 ms to minimize.
[2022-05-17 22:08:10] [INFO ] Deduced a trap composed of 49 places in 455 ms of which 1 ms to minimize.
[2022-05-17 22:08:10] [INFO ] Deduced a trap composed of 15 places in 452 ms of which 1 ms to minimize.
[2022-05-17 22:08:11] [INFO ] Deduced a trap composed of 35 places in 457 ms of which 1 ms to minimize.
[2022-05-17 22:08:11] [INFO ] Deduced a trap composed of 13 places in 445 ms of which 1 ms to minimize.
[2022-05-17 22:08:12] [INFO ] Deduced a trap composed of 15 places in 444 ms of which 1 ms to minimize.
[2022-05-17 22:08:12] [INFO ] Deduced a trap composed of 17 places in 448 ms of which 1 ms to minimize.
[2022-05-17 22:08:13] [INFO ] Deduced a trap composed of 17 places in 443 ms of which 0 ms to minimize.
[2022-05-17 22:08:13] [INFO ] Deduced a trap composed of 79 places in 447 ms of which 1 ms to minimize.
[2022-05-17 22:08:14] [INFO ] Deduced a trap composed of 47 places in 440 ms of which 1 ms to minimize.
[2022-05-17 22:08:14] [INFO ] Deduced a trap composed of 11 places in 444 ms of which 1 ms to minimize.
[2022-05-17 22:08:15] [INFO ] Deduced a trap composed of 21 places in 458 ms of which 1 ms to minimize.
[2022-05-17 22:08:15] [INFO ] Deduced a trap composed of 47 places in 452 ms of which 1 ms to minimize.
[2022-05-17 22:08:16] [INFO ] Deduced a trap composed of 13 places in 448 ms of which 1 ms to minimize.
[2022-05-17 22:08:16] [INFO ] Deduced a trap composed of 81 places in 450 ms of which 1 ms to minimize.
[2022-05-17 22:08:17] [INFO ] Deduced a trap composed of 55 places in 445 ms of which 1 ms to minimize.
[2022-05-17 22:08:17] [INFO ] Deduced a trap composed of 33 places in 442 ms of which 1 ms to minimize.
[2022-05-17 22:08:18] [INFO ] Deduced a trap composed of 54 places in 452 ms of which 1 ms to minimize.
[2022-05-17 22:08:18] [INFO ] Deduced a trap composed of 29 places in 446 ms of which 1 ms to minimize.
[2022-05-17 22:08:19] [INFO ] Deduced a trap composed of 65 places in 449 ms of which 1 ms to minimize.
[2022-05-17 22:08:19] [INFO ] Deduced a trap composed of 37 places in 457 ms of which 1 ms to minimize.
[2022-05-17 22:08:20] [INFO ] Deduced a trap composed of 106 places in 448 ms of which 1 ms to minimize.
[2022-05-17 22:08:20] [INFO ] Deduced a trap composed of 88 places in 445 ms of which 1 ms to minimize.
[2022-05-17 22:08:21] [INFO ] Deduced a trap composed of 101 places in 434 ms of which 1 ms to minimize.
[2022-05-17 22:08:21] [INFO ] Deduced a trap composed of 11 places in 436 ms of which 0 ms to minimize.
[2022-05-17 22:08:22] [INFO ] Deduced a trap composed of 33 places in 423 ms of which 1 ms to minimize.
[2022-05-17 22:08:22] [INFO ] Deduced a trap composed of 35 places in 424 ms of which 1 ms to minimize.
[2022-05-17 22:08:23] [INFO ] Deduced a trap composed of 39 places in 421 ms of which 1 ms to minimize.
[2022-05-17 22:08:23] [INFO ] Deduced a trap composed of 33 places in 418 ms of which 1 ms to minimize.
[2022-05-17 22:08:24] [INFO ] Deduced a trap composed of 39 places in 425 ms of which 0 ms to minimize.
[2022-05-17 22:08:24] [INFO ] Deduced a trap composed of 45 places in 421 ms of which 0 ms to minimize.
[2022-05-17 22:08:25] [INFO ] Deduced a trap composed of 67 places in 425 ms of which 1 ms to minimize.
[2022-05-17 22:08:25] [INFO ] Deduced a trap composed of 67 places in 421 ms of which 1 ms to minimize.
[2022-05-17 22:08:26] [INFO ] Deduced a trap composed of 49 places in 426 ms of which 0 ms to minimize.
[2022-05-17 22:08:26] [INFO ] Deduced a trap composed of 67 places in 422 ms of which 1 ms to minimize.
[2022-05-17 22:08:27] [INFO ] Deduced a trap composed of 85 places in 423 ms of which 1 ms to minimize.
[2022-05-17 22:08:27] [INFO ] Deduced a trap composed of 65 places in 419 ms of which 1 ms to minimize.
[2022-05-17 22:08:28] [INFO ] Deduced a trap composed of 118 places in 427 ms of which 1 ms to minimize.
[2022-05-17 22:08:28] [INFO ] Deduced a trap composed of 31 places in 428 ms of which 0 ms to minimize.
[2022-05-17 22:08:29] [INFO ] Deduced a trap composed of 85 places in 425 ms of which 1 ms to minimize.
[2022-05-17 22:08:29] [INFO ] Deduced a trap composed of 31 places in 422 ms of which 0 ms to minimize.
[2022-05-17 22:08:30] [INFO ] Deduced a trap composed of 31 places in 433 ms of which 1 ms to minimize.
[2022-05-17 22:08:30] [INFO ] Deduced a trap composed of 49 places in 430 ms of which 1 ms to minimize.
[2022-05-17 22:08:31] [INFO ] Deduced a trap composed of 49 places in 429 ms of which 1 ms to minimize.
[2022-05-17 22:08:31] [INFO ] Deduced a trap composed of 49 places in 425 ms of which 1 ms to minimize.
[2022-05-17 22:08:32] [INFO ] Deduced a trap composed of 85 places in 434 ms of which 1 ms to minimize.
[2022-05-17 22:08:32] [INFO ] Deduced a trap composed of 85 places in 425 ms of which 0 ms to minimize.
[2022-05-17 22:08:33] [INFO ] Deduced a trap composed of 31 places in 434 ms of which 1 ms to minimize.
[2022-05-17 22:08:33] [INFO ] Deduced a trap composed of 116 places in 425 ms of which 1 ms to minimize.
[2022-05-17 22:08:34] [INFO ] Deduced a trap composed of 41 places in 369 ms of which 1 ms to minimize.
[2022-05-17 22:08:34] [INFO ] Deduced a trap composed of 57 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:08:35] [INFO ] Deduced a trap composed of 75 places in 400 ms of which 1 ms to minimize.
[2022-05-17 22:08:35] [INFO ] Deduced a trap composed of 83 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:08:36] [INFO ] Deduced a trap composed of 63 places in 398 ms of which 1 ms to minimize.
[2022-05-17 22:08:36] [INFO ] Deduced a trap composed of 37 places in 370 ms of which 1 ms to minimize.
[2022-05-17 22:08:36] [INFO ] Deduced a trap composed of 113 places in 268 ms of which 1 ms to minimize.
[2022-05-17 22:08:37] [INFO ] Deduced a trap composed of 49 places in 278 ms of which 1 ms to minimize.
[2022-05-17 22:08:37] [INFO ] Deduced a trap composed of 51 places in 289 ms of which 1 ms to minimize.
[2022-05-17 22:08:37] [INFO ] Deduced a trap composed of 93 places in 259 ms of which 1 ms to minimize.
[2022-05-17 22:08:38] [INFO ] Deduced a trap composed of 105 places in 256 ms of which 1 ms to minimize.
[2022-05-17 22:08:38] [INFO ] Deduced a trap composed of 87 places in 254 ms of which 1 ms to minimize.
[2022-05-17 22:08:38] [INFO ] Deduced a trap composed of 75 places in 303 ms of which 1 ms to minimize.
[2022-05-17 22:08:39] [INFO ] Deduced a trap composed of 143 places in 295 ms of which 1 ms to minimize.
[2022-05-17 22:08:39] [INFO ] Deduced a trap composed of 71 places in 302 ms of which 1 ms to minimize.
[2022-05-17 22:08:39] [INFO ] Deduced a trap composed of 75 places in 294 ms of which 0 ms to minimize.
[2022-05-17 22:08:40] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 0 ms to minimize.
[2022-05-17 22:08:40] [INFO ] Deduced a trap composed of 97 places in 262 ms of which 0 ms to minimize.
[2022-05-17 22:08:40] [INFO ] Deduced a trap composed of 123 places in 228 ms of which 0 ms to minimize.
[2022-05-17 22:08:41] [INFO ] Deduced a trap composed of 87 places in 207 ms of which 0 ms to minimize.
[2022-05-17 22:08:41] [INFO ] Deduced a trap composed of 69 places in 273 ms of which 1 ms to minimize.
[2022-05-17 22:08:41] [INFO ] Deduced a trap composed of 69 places in 270 ms of which 0 ms to minimize.
[2022-05-17 22:08:42] [INFO ] Deduced a trap composed of 69 places in 277 ms of which 1 ms to minimize.
[2022-05-17 22:08:42] [INFO ] Deduced a trap composed of 69 places in 269 ms of which 1 ms to minimize.
[2022-05-17 22:08:42] [INFO ] Deduced a trap composed of 123 places in 195 ms of which 1 ms to minimize.
[2022-05-17 22:08:43] [INFO ] Deduced a trap composed of 105 places in 201 ms of which 1 ms to minimize.
[2022-05-17 22:08:43] [INFO ] Deduced a trap composed of 123 places in 202 ms of which 1 ms to minimize.
[2022-05-17 22:08:43] [INFO ] Deduced a trap composed of 123 places in 198 ms of which 1 ms to minimize.
[2022-05-17 22:08:43] [INFO ] Deduced a trap composed of 123 places in 200 ms of which 1 ms to minimize.
[2022-05-17 22:08:44] [INFO ] Deduced a trap composed of 105 places in 201 ms of which 1 ms to minimize.
[2022-05-17 22:08:44] [INFO ] Deduced a trap composed of 105 places in 196 ms of which 0 ms to minimize.
[2022-05-17 22:08:44] [INFO ] Deduced a trap composed of 105 places in 195 ms of which 1 ms to minimize.
[2022-05-17 22:08:44] [INFO ] Deduced a trap composed of 123 places in 196 ms of which 0 ms to minimize.
[2022-05-17 22:08:45] [INFO ] Deduced a trap composed of 147 places in 192 ms of which 0 ms to minimize.
[2022-05-17 22:08:45] [INFO ] Deduced a trap composed of 105 places in 189 ms of which 1 ms to minimize.
[2022-05-17 22:08:45] [INFO ] Trap strengthening (SAT) tested/added 90/89 trap constraints in 39077 ms
[2022-05-17 22:08:45] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 81 ms.
[2022-05-17 22:08:50] [INFO ] Deduced a trap composed of 2 places in 499 ms of which 1 ms to minimize.
[2022-05-17 22:08: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 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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 :[6]
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 32 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 25 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 22:08:51] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:08:51] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 22:08:51] [INFO ] Implicit Places using invariants in 443 ms returned []
[2022-05-17 22:08:51] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:08:51] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 22:08:52] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:08:58] [INFO ] Implicit Places using invariants and state equation in 6823 ms returned []
Implicit Place search using SMT with State Equation took 7268 ms to find 0 implicit places.
[2022-05-17 22:08:58] [INFO ] Redundant transitions in 46 ms returned []
[2022-05-17 22:08:58] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:08:58] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 22:08:59] [INFO ] Dead Transitions using invariants and state equation in 814 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
[2022-05-17 22:08:59] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5625 ms. (steps per millisecond=177 ) properties (out of 1) seen :6
Interrupted Best-First random walk after 915617 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=183 ) properties seen :{0=1}
[2022-05-17 22:09:09] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:09:09] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-17 22:09:10] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 22:09:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:09:10] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2022-05-17 22:09:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:09:10] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 22:09:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:09:11] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2022-05-17 22:09:11] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:09:11] [INFO ] [Nat]Added 546 Read/Feed constraints in 82 ms returned sat
[2022-05-17 22:09:11] [INFO ] Deduced a trap composed of 65 places in 441 ms of which 0 ms to minimize.
[2022-05-17 22:09:12] [INFO ] Deduced a trap composed of 41 places in 429 ms of which 1 ms to minimize.
[2022-05-17 22:09:12] [INFO ] Deduced a trap composed of 49 places in 436 ms of which 0 ms to minimize.
[2022-05-17 22:09:13] [INFO ] Deduced a trap composed of 49 places in 435 ms of which 1 ms to minimize.
[2022-05-17 22:09:13] [INFO ] Deduced a trap composed of 29 places in 439 ms of which 1 ms to minimize.
[2022-05-17 22:09:14] [INFO ] Deduced a trap composed of 66 places in 448 ms of which 1 ms to minimize.
[2022-05-17 22:09:14] [INFO ] Deduced a trap composed of 49 places in 440 ms of which 1 ms to minimize.
[2022-05-17 22:09:15] [INFO ] Deduced a trap composed of 15 places in 460 ms of which 1 ms to minimize.
[2022-05-17 22:09:15] [INFO ] Deduced a trap composed of 35 places in 464 ms of which 1 ms to minimize.
[2022-05-17 22:09:16] [INFO ] Deduced a trap composed of 13 places in 462 ms of which 1 ms to minimize.
[2022-05-17 22:09:16] [INFO ] Deduced a trap composed of 15 places in 465 ms of which 1 ms to minimize.
[2022-05-17 22:09:17] [INFO ] Deduced a trap composed of 17 places in 441 ms of which 1 ms to minimize.
[2022-05-17 22:09:17] [INFO ] Deduced a trap composed of 17 places in 463 ms of which 1 ms to minimize.
[2022-05-17 22:09:18] [INFO ] Deduced a trap composed of 79 places in 449 ms of which 1 ms to minimize.
[2022-05-17 22:09:19] [INFO ] Deduced a trap composed of 47 places in 445 ms of which 1 ms to minimize.
[2022-05-17 22:09:19] [INFO ] Deduced a trap composed of 11 places in 456 ms of which 1 ms to minimize.
[2022-05-17 22:09:20] [INFO ] Deduced a trap composed of 21 places in 461 ms of which 1 ms to minimize.
[2022-05-17 22:09:20] [INFO ] Deduced a trap composed of 47 places in 452 ms of which 1 ms to minimize.
[2022-05-17 22:09:21] [INFO ] Deduced a trap composed of 13 places in 457 ms of which 1 ms to minimize.
[2022-05-17 22:09:21] [INFO ] Deduced a trap composed of 81 places in 446 ms of which 1 ms to minimize.
[2022-05-17 22:09:22] [INFO ] Deduced a trap composed of 55 places in 437 ms of which 1 ms to minimize.
[2022-05-17 22:09:22] [INFO ] Deduced a trap composed of 33 places in 432 ms of which 0 ms to minimize.
[2022-05-17 22:09:23] [INFO ] Deduced a trap composed of 54 places in 435 ms of which 1 ms to minimize.
[2022-05-17 22:09:23] [INFO ] Deduced a trap composed of 29 places in 428 ms of which 0 ms to minimize.
[2022-05-17 22:09:24] [INFO ] Deduced a trap composed of 65 places in 445 ms of which 1 ms to minimize.
[2022-05-17 22:09:24] [INFO ] Deduced a trap composed of 37 places in 439 ms of which 1 ms to minimize.
[2022-05-17 22:09:25] [INFO ] Deduced a trap composed of 106 places in 446 ms of which 1 ms to minimize.
[2022-05-17 22:09:25] [INFO ] Deduced a trap composed of 88 places in 442 ms of which 0 ms to minimize.
[2022-05-17 22:09:26] [INFO ] Deduced a trap composed of 101 places in 435 ms of which 1 ms to minimize.
[2022-05-17 22:09:26] [INFO ] Deduced a trap composed of 11 places in 446 ms of which 1 ms to minimize.
[2022-05-17 22:09:27] [INFO ] Deduced a trap composed of 33 places in 418 ms of which 0 ms to minimize.
[2022-05-17 22:09:27] [INFO ] Deduced a trap composed of 35 places in 418 ms of which 1 ms to minimize.
[2022-05-17 22:09:28] [INFO ] Deduced a trap composed of 39 places in 428 ms of which 1 ms to minimize.
[2022-05-17 22:09:28] [INFO ] Deduced a trap composed of 33 places in 419 ms of which 1 ms to minimize.
[2022-05-17 22:09:29] [INFO ] Deduced a trap composed of 39 places in 425 ms of which 1 ms to minimize.
[2022-05-17 22:09:29] [INFO ] Deduced a trap composed of 45 places in 422 ms of which 0 ms to minimize.
[2022-05-17 22:09:30] [INFO ] Deduced a trap composed of 67 places in 426 ms of which 1 ms to minimize.
[2022-05-17 22:09:30] [INFO ] Deduced a trap composed of 67 places in 414 ms of which 1 ms to minimize.
[2022-05-17 22:09:31] [INFO ] Deduced a trap composed of 49 places in 429 ms of which 1 ms to minimize.
[2022-05-17 22:09:31] [INFO ] Deduced a trap composed of 67 places in 426 ms of which 0 ms to minimize.
[2022-05-17 22:09:32] [INFO ] Deduced a trap composed of 85 places in 431 ms of which 1 ms to minimize.
[2022-05-17 22:09:32] [INFO ] Deduced a trap composed of 65 places in 420 ms of which 0 ms to minimize.
[2022-05-17 22:09:33] [INFO ] Deduced a trap composed of 118 places in 433 ms of which 0 ms to minimize.
[2022-05-17 22:09:33] [INFO ] Deduced a trap composed of 31 places in 424 ms of which 0 ms to minimize.
[2022-05-17 22:09:34] [INFO ] Deduced a trap composed of 85 places in 434 ms of which 1 ms to minimize.
[2022-05-17 22:09:34] [INFO ] Deduced a trap composed of 31 places in 422 ms of which 1 ms to minimize.
[2022-05-17 22:09:35] [INFO ] Deduced a trap composed of 31 places in 422 ms of which 1 ms to minimize.
[2022-05-17 22:09:35] [INFO ] Deduced a trap composed of 49 places in 422 ms of which 0 ms to minimize.
[2022-05-17 22:09:35] [INFO ] Deduced a trap composed of 49 places in 424 ms of which 1 ms to minimize.
[2022-05-17 22:09:36] [INFO ] Deduced a trap composed of 49 places in 418 ms of which 1 ms to minimize.
[2022-05-17 22:09:36] [INFO ] Deduced a trap composed of 85 places in 432 ms of which 1 ms to minimize.
[2022-05-17 22:09:37] [INFO ] Deduced a trap composed of 85 places in 430 ms of which 1 ms to minimize.
[2022-05-17 22:09:37] [INFO ] Deduced a trap composed of 31 places in 421 ms of which 0 ms to minimize.
[2022-05-17 22:09:38] [INFO ] Deduced a trap composed of 116 places in 424 ms of which 1 ms to minimize.
[2022-05-17 22:09:39] [INFO ] Deduced a trap composed of 41 places in 374 ms of which 1 ms to minimize.
[2022-05-17 22:09:39] [INFO ] Deduced a trap composed of 57 places in 418 ms of which 1 ms to minimize.
[2022-05-17 22:09:40] [INFO ] Deduced a trap composed of 75 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:09:40] [INFO ] Deduced a trap composed of 83 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:09:40] [INFO ] Deduced a trap composed of 63 places in 392 ms of which 1 ms to minimize.
[2022-05-17 22:09:41] [INFO ] Deduced a trap composed of 37 places in 370 ms of which 0 ms to minimize.
[2022-05-17 22:09:41] [INFO ] Deduced a trap composed of 113 places in 265 ms of which 0 ms to minimize.
[2022-05-17 22:09:42] [INFO ] Deduced a trap composed of 49 places in 265 ms of which 1 ms to minimize.
[2022-05-17 22:09:42] [INFO ] Deduced a trap composed of 51 places in 274 ms of which 0 ms to minimize.
[2022-05-17 22:09:42] [INFO ] Deduced a trap composed of 93 places in 259 ms of which 0 ms to minimize.
[2022-05-17 22:09:43] [INFO ] Deduced a trap composed of 105 places in 253 ms of which 1 ms to minimize.
[2022-05-17 22:09:43] [INFO ] Deduced a trap composed of 87 places in 253 ms of which 0 ms to minimize.
[2022-05-17 22:09:43] [INFO ] Deduced a trap composed of 75 places in 301 ms of which 1 ms to minimize.
[2022-05-17 22:09:44] [INFO ] Deduced a trap composed of 143 places in 298 ms of which 0 ms to minimize.
[2022-05-17 22:09:44] [INFO ] Deduced a trap composed of 71 places in 296 ms of which 1 ms to minimize.
[2022-05-17 22:09:44] [INFO ] Deduced a trap composed of 75 places in 296 ms of which 1 ms to minimize.
[2022-05-17 22:09:45] [INFO ] Deduced a trap composed of 53 places in 298 ms of which 1 ms to minimize.
[2022-05-17 22:09:45] [INFO ] Deduced a trap composed of 97 places in 247 ms of which 0 ms to minimize.
[2022-05-17 22:09:45] [INFO ] Deduced a trap composed of 123 places in 214 ms of which 0 ms to minimize.
[2022-05-17 22:09:46] [INFO ] Deduced a trap composed of 87 places in 205 ms of which 1 ms to minimize.
[2022-05-17 22:09:46] [INFO ] Deduced a trap composed of 69 places in 270 ms of which 1 ms to minimize.
[2022-05-17 22:09:46] [INFO ] Deduced a trap composed of 69 places in 272 ms of which 0 ms to minimize.
[2022-05-17 22:09:47] [INFO ] Deduced a trap composed of 69 places in 278 ms of which 0 ms to minimize.
[2022-05-17 22:09:47] [INFO ] Deduced a trap composed of 69 places in 271 ms of which 1 ms to minimize.
[2022-05-17 22:09:47] [INFO ] Deduced a trap composed of 123 places in 192 ms of which 1 ms to minimize.
[2022-05-17 22:09:47] [INFO ] Deduced a trap composed of 105 places in 197 ms of which 0 ms to minimize.
[2022-05-17 22:09:48] [INFO ] Deduced a trap composed of 123 places in 204 ms of which 0 ms to minimize.
[2022-05-17 22:09:48] [INFO ] Deduced a trap composed of 123 places in 203 ms of which 1 ms to minimize.
[2022-05-17 22:09:48] [INFO ] Deduced a trap composed of 123 places in 203 ms of which 0 ms to minimize.
[2022-05-17 22:09:48] [INFO ] Deduced a trap composed of 105 places in 207 ms of which 1 ms to minimize.
[2022-05-17 22:09:49] [INFO ] Deduced a trap composed of 105 places in 204 ms of which 0 ms to minimize.
[2022-05-17 22:09:49] [INFO ] Deduced a trap composed of 105 places in 203 ms of which 1 ms to minimize.
[2022-05-17 22:09:49] [INFO ] Deduced a trap composed of 123 places in 204 ms of which 0 ms to minimize.
[2022-05-17 22:09:50] [INFO ] Deduced a trap composed of 147 places in 202 ms of which 0 ms to minimize.
[2022-05-17 22:09:50] [INFO ] Deduced a trap composed of 105 places in 207 ms of which 0 ms to minimize.
[2022-05-17 22:09:50] [INFO ] Trap strengthening (SAT) tested/added 90/89 trap constraints in 39043 ms
[2022-05-17 22:09:50] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 82 ms.
[2022-05-17 22:09:55] [INFO ] Deduced a trap composed of 2 places in 475 ms of which 1 ms to minimize.
[2022-05-17 22:09:55] [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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 :[6]
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 26 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 24 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 22:09:55] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:09:55] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 22:09:56] [INFO ] Implicit Places using invariants in 452 ms returned []
[2022-05-17 22:09:56] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:09:56] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 22:09:56] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:10:04] [INFO ] Implicit Places using invariants and state equation in 7637 ms returned []
Implicit Place search using SMT with State Equation took 8090 ms to find 0 implicit places.
[2022-05-17 22:10:04] [INFO ] Redundant transitions in 53 ms returned []
[2022-05-17 22:10:04] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:10:04] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 22:10:04] [INFO ] Dead Transitions using invariants and state equation in 865 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-03 in 136798 ms.
Starting property specific reduction for Peterson-PT-7-UpperBounds-07
Normalized transition count is 1874 out of 2210 initially.
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:10:04] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2022-05-17 22:10:05] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:10:05] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 22:10:05] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 22:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:10:05] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2022-05-17 22:10:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:10:05] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 22:10:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:10:06] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2022-05-17 22:10:06] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:10:06] [INFO ] [Nat]Added 546 Read/Feed constraints in 84 ms returned sat
[2022-05-17 22:10:06] [INFO ] Deduced a trap composed of 17 places in 373 ms of which 0 ms to minimize.
[2022-05-17 22:10:07] [INFO ] Deduced a trap composed of 13 places in 386 ms of which 1 ms to minimize.
[2022-05-17 22:10:07] [INFO ] Deduced a trap composed of 11 places in 379 ms of which 1 ms to minimize.
[2022-05-17 22:10:08] [INFO ] Deduced a trap composed of 13 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:10:08] [INFO ] Deduced a trap composed of 29 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:10:08] [INFO ] Deduced a trap composed of 29 places in 383 ms of which 1 ms to minimize.
[2022-05-17 22:10:09] [INFO ] Deduced a trap composed of 29 places in 381 ms of which 1 ms to minimize.
[2022-05-17 22:10:09] [INFO ] Deduced a trap composed of 65 places in 375 ms of which 1 ms to minimize.
[2022-05-17 22:10:10] [INFO ] Deduced a trap composed of 65 places in 384 ms of which 1 ms to minimize.
[2022-05-17 22:10:10] [INFO ] Deduced a trap composed of 15 places in 384 ms of which 1 ms to minimize.
[2022-05-17 22:10:10] [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 1098 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1098/1098 places, 2210/2210 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 1098 transition count 2103
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 214 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 214 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 900 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 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 1012 place count 592 transition count 1704
Applied a total of 1012 rules in 79 ms. Remains 592 /1098 variables (removed 506) and now considering 1704/2210 (removed 506) transitions.
Finished structural reductions, in 1 iterations. Remains : 592/1098 places, 1704/2210 transitions.
Normalized transition count is 1368 out of 1704 initially.
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 22:10:10] [INFO ] Computed 23 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1993 ms. (steps per millisecond=501 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 635 ms. (steps per millisecond=1574 ) properties (out of 1) seen :1
[2022-05-17 22:10:13] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 22:10:13] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 22:10:13] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2022-05-17 22:10:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:10:13] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2022-05-17 22:10:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:10:13] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2022-05-17 22:10:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:10:14] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2022-05-17 22:10:14] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:10:14] [INFO ] [Nat]Added 546 Read/Feed constraints in 52 ms returned sat
[2022-05-17 22:10:14] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 1 ms to minimize.
[2022-05-17 22:10:14] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 1 ms to minimize.
[2022-05-17 22:10:14] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 0 ms to minimize.
[2022-05-17 22:10:15] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 1 ms to minimize.
[2022-05-17 22:10:15] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 0 ms to minimize.
[2022-05-17 22:10:15] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 0 ms to minimize.
[2022-05-17 22:10:15] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 1 ms to minimize.
[2022-05-17 22:10:15] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 0 ms to minimize.
[2022-05-17 22:10:16] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 1 ms to minimize.
[2022-05-17 22:10:16] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 1 ms to minimize.
[2022-05-17 22:10:16] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 0 ms to minimize.
[2022-05-17 22:10:16] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 0 ms to minimize.
[2022-05-17 22:10:16] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 1 ms to minimize.
[2022-05-17 22:10:17] [INFO ] Deduced a trap composed of 67 places in 171 ms of which 1 ms to minimize.
[2022-05-17 22:10:17] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 0 ms to minimize.
[2022-05-17 22:10:17] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 0 ms to minimize.
[2022-05-17 22:10:17] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:10:18] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:10:18] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 0 ms to minimize.
[2022-05-17 22:10:18] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 0 ms to minimize.
[2022-05-17 22:10:18] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 0 ms to minimize.
[2022-05-17 22:10:18] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 1 ms to minimize.
[2022-05-17 22:10:19] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 1 ms to minimize.
[2022-05-17 22:10:19] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2022-05-17 22:10:19] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 0 ms to minimize.
[2022-05-17 22:10:19] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 1 ms to minimize.
[2022-05-17 22:10:19] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 1 ms to minimize.
[2022-05-17 22:10:20] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2022-05-17 22:10:20] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2022-05-17 22:10:20] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2022-05-17 22:10:20] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2022-05-17 22:10:20] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 0 ms to minimize.
[2022-05-17 22:10:21] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 0 ms to minimize.
[2022-05-17 22:10:21] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 1 ms to minimize.
[2022-05-17 22:10:21] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 1 ms to minimize.
[2022-05-17 22:10:21] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 0 ms to minimize.
[2022-05-17 22:10:21] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 1 ms to minimize.
[2022-05-17 22:10:22] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 0 ms to minimize.
[2022-05-17 22:10:22] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2022-05-17 22:10:22] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 1 ms to minimize.
[2022-05-17 22:10:22] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 0 ms to minimize.
[2022-05-17 22:10:22] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 0 ms to minimize.
[2022-05-17 22:10:22] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 0 ms to minimize.
[2022-05-17 22:10:23] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 1 ms to minimize.
[2022-05-17 22:10:23] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 1 ms to minimize.
[2022-05-17 22:10:23] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 1 ms to minimize.
[2022-05-17 22:10:23] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 0 ms to minimize.
[2022-05-17 22:10:23] [INFO ] Deduced a trap composed of 57 places in 181 ms of which 0 ms to minimize.
[2022-05-17 22:10:24] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 1 ms to minimize.
[2022-05-17 22:10:24] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 0 ms to minimize.
[2022-05-17 22:10:24] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 0 ms to minimize.
[2022-05-17 22:10:24] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 0 ms to minimize.
[2022-05-17 22:10:24] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 1 ms to minimize.
[2022-05-17 22:10:25] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 0 ms to minimize.
[2022-05-17 22:10:25] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 0 ms to minimize.
[2022-05-17 22:10:25] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 1 ms to minimize.
[2022-05-17 22:10:25] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 0 ms to minimize.
[2022-05-17 22:10:26] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2022-05-17 22:10:26] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 0 ms to minimize.
[2022-05-17 22:10:26] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 0 ms to minimize.
[2022-05-17 22:10:26] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 1 ms to minimize.
[2022-05-17 22:10:26] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 0 ms to minimize.
[2022-05-17 22:10:26] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 0 ms to minimize.
[2022-05-17 22:10:27] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 0 ms to minimize.
[2022-05-17 22:10:27] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 0 ms to minimize.
[2022-05-17 22:10:27] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 0 ms to minimize.
[2022-05-17 22:10:27] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 1 ms to minimize.
[2022-05-17 22:10:27] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 0 ms to minimize.
[2022-05-17 22:10:28] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 0 ms to minimize.
[2022-05-17 22:10:28] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 1 ms to minimize.
[2022-05-17 22:10:28] [INFO ] Deduced a trap composed of 82 places in 191 ms of which 1 ms to minimize.
[2022-05-17 22:10:28] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 0 ms to minimize.
[2022-05-17 22:10:29] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 1 ms to minimize.
[2022-05-17 22:10:29] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2022-05-17 22:10:29] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 0 ms to minimize.
[2022-05-17 22:10:29] [INFO ] Deduced a trap composed of 59 places in 178 ms of which 0 ms to minimize.
[2022-05-17 22:10:29] [INFO ] Deduced a trap composed of 69 places in 180 ms of which 1 ms to minimize.
[2022-05-17 22:10:30] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 1 ms to minimize.
[2022-05-17 22:10:30] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 0 ms to minimize.
[2022-05-17 22:10:30] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 0 ms to minimize.
[2022-05-17 22:10:30] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2022-05-17 22:10:31] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 1 ms to minimize.
[2022-05-17 22:10:31] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 1 ms to minimize.
[2022-05-17 22:10:31] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 1 ms to minimize.
[2022-05-17 22:10:31] [INFO ] Deduced a trap composed of 70 places in 137 ms of which 0 ms to minimize.
[2022-05-17 22:10:31] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 0 ms to minimize.
[2022-05-17 22:10:32] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 1 ms to minimize.
[2022-05-17 22:10:32] [INFO ] Deduced a trap composed of 67 places in 165 ms of which 0 ms to minimize.
[2022-05-17 22:10:32] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 0 ms to minimize.
[2022-05-17 22:10:32] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 0 ms to minimize.
[2022-05-17 22:10:32] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
[2022-05-17 22:10:33] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 1 ms to minimize.
[2022-05-17 22:10:33] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 1 ms to minimize.
[2022-05-17 22:10:33] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 0 ms to minimize.
[2022-05-17 22:10:33] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 1 ms to minimize.
[2022-05-17 22:10:33] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 1 ms to minimize.
[2022-05-17 22:10:34] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 0 ms to minimize.
[2022-05-17 22:10:34] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 1 ms to minimize.
[2022-05-17 22:10:34] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2022-05-17 22:10:34] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 0 ms to minimize.
[2022-05-17 22:10:34] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 0 ms to minimize.
[2022-05-17 22:10:34] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 1 ms to minimize.
[2022-05-17 22:10:34] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 0 ms to minimize.
[2022-05-17 22:10:35] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 0 ms to minimize.
[2022-05-17 22:10:35] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 0 ms to minimize.
[2022-05-17 22:10:35] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 0 ms to minimize.
[2022-05-17 22:10:35] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2022-05-17 22:10:35] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2022-05-17 22:10:35] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 0 ms to minimize.
[2022-05-17 22:10:35] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2022-05-17 22:10:36] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 1 ms to minimize.
[2022-05-17 22:10:36] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 0 ms to minimize.
[2022-05-17 22:10:36] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 0 ms to minimize.
[2022-05-17 22:10:36] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 1 ms to minimize.
[2022-05-17 22:10:36] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 1 ms to minimize.
[2022-05-17 22:10:36] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 1 ms to minimize.
[2022-05-17 22:10:37] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 1 ms to minimize.
[2022-05-17 22:10:37] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 1 ms to minimize.
[2022-05-17 22:10:37] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 0 ms to minimize.
[2022-05-17 22:10:37] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 0 ms to minimize.
[2022-05-17 22:10:37] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 0 ms to minimize.
[2022-05-17 22:10:37] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 0 ms to minimize.
[2022-05-17 22:10:38] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 0 ms to minimize.
[2022-05-17 22:10:38] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 0 ms to minimize.
[2022-05-17 22:10:38] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2022-05-17 22:10:38] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 0 ms to minimize.
[2022-05-17 22:10:38] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 0 ms to minimize.
[2022-05-17 22:10:39] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2022-05-17 22:10:39] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2022-05-17 22:10:39] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2022-05-17 22:10:39] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2022-05-17 22:10:39] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
[2022-05-17 22:10:39] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 0 ms to minimize.
[2022-05-17 22:10:40] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 0 ms to minimize.
[2022-05-17 22:10:40] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 0 ms to minimize.
[2022-05-17 22:10:40] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 0 ms to minimize.
[2022-05-17 22:10:40] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 0 ms to minimize.
[2022-05-17 22:10:40] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 0 ms to minimize.
[2022-05-17 22:10:40] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 0 ms to minimize.
[2022-05-17 22:10:41] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 1 ms to minimize.
[2022-05-17 22:10:41] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 0 ms to minimize.
[2022-05-17 22:10:41] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 0 ms to minimize.
[2022-05-17 22:10:41] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2022-05-17 22:10:41] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 0 ms to minimize.
[2022-05-17 22:10:41] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 0 ms to minimize.
[2022-05-17 22:10:42] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 1 ms to minimize.
[2022-05-17 22:10:42] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2022-05-17 22:10:42] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2022-05-17 22:10:42] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 0 ms to minimize.
[2022-05-17 22:10:42] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 0 ms to minimize.
[2022-05-17 22:10:42] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 0 ms to minimize.
[2022-05-17 22:10:42] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 1 ms to minimize.
[2022-05-17 22:10:43] [INFO ] Deduced a trap composed of 69 places in 143 ms of which 0 ms to minimize.
[2022-05-17 22:10:43] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 1 ms to minimize.
[2022-05-17 22:10:43] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 0 ms to minimize.
[2022-05-17 22:10:44] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 0 ms to minimize.
[2022-05-17 22:10:44] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 0 ms to minimize.
[2022-05-17 22:10:44] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 0 ms to minimize.
[2022-05-17 22:10:44] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 0 ms to minimize.
[2022-05-17 22:10:44] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 0 ms to minimize.
[2022-05-17 22:10:44] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 1 ms to minimize.
[2022-05-17 22:10:44] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 1 ms to minimize.
[2022-05-17 22:10:45] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 0 ms to minimize.
[2022-05-17 22:10:45] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 0 ms to minimize.
[2022-05-17 22:10:45] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 1 ms to minimize.
[2022-05-17 22:10:45] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 1 ms to minimize.
[2022-05-17 22:10:46] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 1 ms to minimize.
[2022-05-17 22:10:46] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
[2022-05-17 22:10:46] [INFO ] Deduced a trap composed of 70 places in 156 ms of which 0 ms to minimize.
[2022-05-17 22:10:46] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 0 ms to minimize.
[2022-05-17 22:10:46] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 0 ms to minimize.
[2022-05-17 22:10:47] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 1 ms to minimize.
[2022-05-17 22:10:47] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 0 ms to minimize.
[2022-05-17 22:10:47] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 1 ms to minimize.
[2022-05-17 22:10:47] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 1 ms to minimize.
[2022-05-17 22:10:47] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 1 ms to minimize.
[2022-05-17 22:10:47] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 0 ms to minimize.
[2022-05-17 22:10:48] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 1 ms to minimize.
[2022-05-17 22:10:48] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 1 ms to minimize.
[2022-05-17 22:10:48] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 0 ms to minimize.
[2022-05-17 22:10:48] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 0 ms to minimize.
[2022-05-17 22:10:48] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 0 ms to minimize.
[2022-05-17 22:10:49] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 1 ms to minimize.
[2022-05-17 22:10:49] [INFO ] Deduced a trap composed of 69 places in 154 ms of which 1 ms to minimize.
[2022-05-17 22:10:49] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 1 ms to minimize.
[2022-05-17 22:10:49] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 0 ms to minimize.
[2022-05-17 22:10:49] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 1 ms to minimize.
[2022-05-17 22:10:50] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 1 ms to minimize.
[2022-05-17 22:10:50] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2022-05-17 22:10:50] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 0 ms to minimize.
[2022-05-17 22:10:50] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 0 ms to minimize.
[2022-05-17 22:10:50] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 0 ms to minimize.
[2022-05-17 22:10:51] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2022-05-17 22:10:51] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 0 ms to minimize.
[2022-05-17 22:10:51] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2022-05-17 22:10:52] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2022-05-17 22:10:52] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 0 ms to minimize.
[2022-05-17 22:10:52] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2022-05-17 22:10:52] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 0 ms to minimize.
[2022-05-17 22:10:53] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 0 ms to minimize.
[2022-05-17 22:10:53] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 0 ms to minimize.
[2022-05-17 22:10:53] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 0 ms to minimize.
[2022-05-17 22:10:53] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 0 ms to minimize.
[2022-05-17 22:10:53] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 0 ms to minimize.
[2022-05-17 22:10:53] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 0 ms to minimize.
[2022-05-17 22:10:54] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 0 ms to minimize.
[2022-05-17 22:10:54] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 0 ms to minimize.
[2022-05-17 22:10:54] [INFO ] Deduced a trap composed of 78 places in 168 ms of which 1 ms to minimize.
[2022-05-17 22:10:55] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:10:55] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 1 ms to minimize.
[2022-05-17 22:10:55] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 0 ms to minimize.
[2022-05-17 22:10:55] [INFO ] Deduced a trap composed of 93 places in 161 ms of which 1 ms to minimize.
[2022-05-17 22:10:55] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 0 ms to minimize.
[2022-05-17 22:10:56] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 1 ms to minimize.
[2022-05-17 22:10:56] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 1 ms to minimize.
[2022-05-17 22:10:56] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 0 ms to minimize.
[2022-05-17 22:10:56] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 1 ms to minimize.
[2022-05-17 22:10:56] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 0 ms to minimize.
[2022-05-17 22:10:57] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 1 ms to minimize.
[2022-05-17 22:10:57] [INFO ] Deduced a trap composed of 69 places in 150 ms of which 1 ms to minimize.
[2022-05-17 22:10:57] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 0 ms to minimize.
[2022-05-17 22:10:57] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 0 ms to minimize.
[2022-05-17 22:10:58] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 0 ms to minimize.
[2022-05-17 22:10:58] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 0 ms to minimize.
[2022-05-17 22:10:59] [INFO ] Deduced a trap composed of 2 places in 216 ms of which 0 ms to minimize.
[2022-05-17 22:10: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 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 21 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 20 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2022-05-17 22:10:59] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 22:10:59] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 22:10:59] [INFO ] Implicit Places using invariants in 326 ms returned []
[2022-05-17 22:10:59] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 22:10:59] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 22:10:59] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:11:03] [INFO ] Implicit Places using invariants and state equation in 4105 ms returned []
Implicit Place search using SMT with State Equation took 4432 ms to find 0 implicit places.
[2022-05-17 22:11:03] [INFO ] Redundant transitions in 36 ms returned []
[2022-05-17 22:11:03] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 22:11:03] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 22:11:04] [INFO ] Dead Transitions using invariants and state equation in 547 ms returned []
Finished structural reductions, in 1 iterations. Remains : 592/592 places, 1704/1704 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-07 in 59107 ms.
Starting property specific reduction for Peterson-PT-7-UpperBounds-08
Normalized transition count is 1874 out of 2210 initially.
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:11:04] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2022-05-17 22:11:04] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:11:04] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 22:11:04] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 22:11:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:11:04] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2022-05-17 22:11:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:11:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 22:11:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:11:05] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2022-05-17 22:11:05] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:11:05] [INFO ] [Nat]Added 546 Read/Feed constraints in 86 ms returned sat
[2022-05-17 22:11:05] [INFO ] Deduced a trap composed of 19 places in 304 ms of which 1 ms to minimize.
[2022-05-17 22:11:06] [INFO ] Deduced a trap composed of 15 places in 297 ms of which 1 ms to minimize.
[2022-05-17 22:11:06] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 1 ms to minimize.
[2022-05-17 22:11:06] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 0 ms to minimize.
[2022-05-17 22:11:07] [INFO ] Deduced a trap composed of 17 places in 305 ms of which 1 ms to minimize.
[2022-05-17 22:11:07] [INFO ] Deduced a trap composed of 17 places in 301 ms of which 0 ms to minimize.
[2022-05-17 22:11:07] [INFO ] Deduced a trap composed of 11 places in 306 ms of which 1 ms to minimize.
[2022-05-17 22:11:08] [INFO ] Deduced a trap composed of 17 places in 306 ms of which 0 ms to minimize.
[2022-05-17 22:11:08] [INFO ] Deduced a trap composed of 33 places in 285 ms of which 1 ms to minimize.
[2022-05-17 22:11:08] [INFO ] Deduced a trap composed of 73 places in 285 ms of which 1 ms to minimize.
[2022-05-17 22:11:09] [INFO ] Deduced a trap composed of 121 places in 298 ms of which 0 ms to minimize.
[2022-05-17 22:11:09] [INFO ] Deduced a trap composed of 121 places in 284 ms of which 0 ms to minimize.
[2022-05-17 22:11:10] [INFO ] Deduced a trap composed of 2 places in 489 ms of which 1 ms to minimize.
[2022-05-17 22:11:10] [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) : [1] Max seen :[0]
Support contains 1 out of 1098 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 1098/1098 places, 2209/2209 transitions.
Reduce places removed 1 places and 2 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 106 rules applied. Total rules applied 106 place count 1097 transition count 2102
Reduce places removed 106 places and 1 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 212 place count 991 transition count 2101
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 213 place count 990 transition count 2099
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 214 place count 989 transition count 2098
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 350 Pre rules applied. Total rules applied 214 place count 989 transition count 1748
Deduced a syphon composed of 350 places in 1 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 4 with 700 rules applied. Total rules applied 914 place count 639 transition count 1748
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1024 place count 584 transition count 1693
Applied a total of 1024 rules in 74 ms. Remains 584 /1098 variables (removed 514) and now considering 1693/2209 (removed 516) transitions.
Finished structural reductions, in 1 iterations. Remains : 584/1098 places, 1693/2209 transitions.
Normalized transition count is 1357 out of 1693 initially.
// Phase 1: matrix 1357 rows 584 cols
[2022-05-17 22:11:10] [INFO ] Computed 23 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1861 ms. (steps per millisecond=537 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties (out of 1) seen :0
[2022-05-17 22:11:12] [INFO ] Flow matrix only has 1357 transitions (discarded 336 similar events)
// Phase 1: matrix 1357 rows 584 cols
[2022-05-17 22:11:12] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 22:11:12] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2022-05-17 22:11:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:11:13] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2022-05-17 22:11:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:11:13] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2022-05-17 22:11:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:11:13] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2022-05-17 22:11:13] [INFO ] State equation strengthened by 544 read => feed constraints.
[2022-05-17 22:11:13] [INFO ] [Nat]Added 544 Read/Feed constraints in 51 ms returned sat
[2022-05-17 22:11:13] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 0 ms to minimize.
[2022-05-17 22:11:13] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 1 ms to minimize.
[2022-05-17 22:11:14] [INFO ] Deduced a trap composed of 54 places in 149 ms of which 0 ms to minimize.
[2022-05-17 22:11:14] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 0 ms to minimize.
[2022-05-17 22:11:14] [INFO ] Deduced a trap composed of 68 places in 140 ms of which 0 ms to minimize.
[2022-05-17 22:11:14] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 1 ms to minimize.
[2022-05-17 22:11:14] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 0 ms to minimize.
[2022-05-17 22:11:14] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 0 ms to minimize.
[2022-05-17 22:11:15] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 1 ms to minimize.
[2022-05-17 22:11:15] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 0 ms to minimize.
[2022-05-17 22:11:15] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 1 ms to minimize.
[2022-05-17 22:11:15] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2022-05-17 22:11:15] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 0 ms to minimize.
[2022-05-17 22:11:16] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 0 ms to minimize.
[2022-05-17 22:11:16] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 1 ms to minimize.
[2022-05-17 22:11:16] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2022-05-17 22:11:16] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 0 ms to minimize.
[2022-05-17 22:11:16] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 1 ms to minimize.
[2022-05-17 22:11:17] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2022-05-17 22:11:17] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 1 ms to minimize.
[2022-05-17 22:11:17] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2022-05-17 22:11:17] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 0 ms to minimize.
[2022-05-17 22:11:17] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 0 ms to minimize.
[2022-05-17 22:11:17] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 0 ms to minimize.
[2022-05-17 22:11:18] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 0 ms to minimize.
[2022-05-17 22:11:18] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4611 ms
[2022-05-17 22:11:18] [INFO ] Computed and/alt/rep : 1237/4763/1237 causal constraints (skipped 112 transitions) in 61 ms.
[2022-05-17 22:11:31] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2022-05-17 22:11:32] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 0 ms to minimize.
[2022-05-17 22:11:32] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2022-05-17 22:11:32] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2022-05-17 22:11:32] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 1 ms to minimize.
[2022-05-17 22:11:33] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 1 ms to minimize.
[2022-05-17 22:11:33] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 1 ms to minimize.
[2022-05-17 22:11:33] [INFO ] Deduced a trap composed of 70 places in 144 ms of which 0 ms to minimize.
[2022-05-17 22:11:33] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 0 ms to minimize.
[2022-05-17 22:11:33] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 1 ms to minimize.
[2022-05-17 22:11:34] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 1 ms to minimize.
[2022-05-17 22:11:34] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 0 ms to minimize.
[2022-05-17 22:11:34] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 1 ms to minimize.
[2022-05-17 22:11:34] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 1 ms to minimize.
[2022-05-17 22:11:35] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 1 ms to minimize.
[2022-05-17 22:11:35] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 1 ms to minimize.
[2022-05-17 22:11:35] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 0 ms to minimize.
[2022-05-17 22:11:35] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 1 ms to minimize.
[2022-05-17 22:11:35] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 0 ms to minimize.
[2022-05-17 22:11:36] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2022-05-17 22:11:36] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 0 ms to minimize.
[2022-05-17 22:11:36] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 0 ms to minimize.
[2022-05-17 22:11:36] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 0 ms to minimize.
[2022-05-17 22:11:37] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2022-05-17 22:11:37] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 0 ms to minimize.
[2022-05-17 22:11:37] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 0 ms to minimize.
[2022-05-17 22:11:37] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:11:38] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 0 ms to minimize.
[2022-05-17 22:11:38] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 1 ms to minimize.
[2022-05-17 22:11:38] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 1 ms to minimize.
[2022-05-17 22:11:38] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 0 ms to minimize.
[2022-05-17 22:11:39] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2022-05-17 22:11:39] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 0 ms to minimize.
[2022-05-17 22:11:39] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2022-05-17 22:11:39] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 0 ms to minimize.
[2022-05-17 22:11:40] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 0 ms to minimize.
[2022-05-17 22:11:40] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 1 ms to minimize.
[2022-05-17 22:11:40] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 1 ms to minimize.
[2022-05-17 22:11:41] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 0 ms to minimize.
[2022-05-17 22:11:41] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 1 ms to minimize.
[2022-05-17 22:11:41] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 1 ms to minimize.
[2022-05-17 22:11:41] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2022-05-17 22:11:41] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 1 ms to minimize.
[2022-05-17 22:11:42] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 1 ms to minimize.
[2022-05-17 22:11:42] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 1 ms to minimize.
[2022-05-17 22:11:42] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2022-05-17 22:11:43] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 0 ms to minimize.
[2022-05-17 22:11:43] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 0 ms to minimize.
[2022-05-17 22:11:43] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 0 ms to minimize.
[2022-05-17 22:11:43] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 1 ms to minimize.
[2022-05-17 22:11:44] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 1 ms to minimize.
[2022-05-17 22:11:44] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 1 ms to minimize.
[2022-05-17 22:11:44] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 0 ms to minimize.
[2022-05-17 22:11:44] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 0 ms to minimize.
[2022-05-17 22:11:44] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 13374 ms
[2022-05-17 22:11:45] [INFO ] Added : 830 causal constraints over 167 iterations in 27071 ms.(timeout) Result :sat
Minimization took 655 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 272200 steps, including 1000 resets, run finished after 435 ms. (steps per millisecond=625 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 584/584 places, 1693/1693 transitions.
Applied a total of 0 rules in 22 ms. Remains 584 /584 variables (removed 0) and now considering 1693/1693 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 1693/1693 transitions.
Starting structural reductions, iteration 0 : 584/584 places, 1693/1693 transitions.
Applied a total of 0 rules in 20 ms. Remains 584 /584 variables (removed 0) and now considering 1693/1693 (removed 0) transitions.
[2022-05-17 22:11:46] [INFO ] Flow matrix only has 1357 transitions (discarded 336 similar events)
// Phase 1: matrix 1357 rows 584 cols
[2022-05-17 22:11:46] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 22:11:46] [INFO ] Implicit Places using invariants in 321 ms returned []
[2022-05-17 22:11:46] [INFO ] Flow matrix only has 1357 transitions (discarded 336 similar events)
// Phase 1: matrix 1357 rows 584 cols
[2022-05-17 22:11:46] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 22:11:46] [INFO ] State equation strengthened by 544 read => feed constraints.
[2022-05-17 22:11:50] [INFO ] Implicit Places using invariants and state equation in 3959 ms returned []
Implicit Place search using SMT with State Equation took 4281 ms to find 0 implicit places.
[2022-05-17 22:11:50] [INFO ] Redundant transitions in 30 ms returned []
[2022-05-17 22:11:50] [INFO ] Flow matrix only has 1357 transitions (discarded 336 similar events)
// Phase 1: matrix 1357 rows 584 cols
[2022-05-17 22:11:50] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 22:11:51] [INFO ] Dead Transitions using invariants and state equation in 531 ms returned []
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 1693/1693 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-08 in 47078 ms.
Starting property specific reduction for Peterson-PT-7-UpperBounds-12
Normalized transition count is 1874 out of 2210 initially.
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:11:51] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2022-05-17 22:11:51] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 22:11:51] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-17 22:11:51] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 22:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:11:51] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2022-05-17 22:11:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:11:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 22:11:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:11:52] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2022-05-17 22:11:52] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:11:52] [INFO ] [Nat]Added 546 Read/Feed constraints in 77 ms returned sat
[2022-05-17 22:11:52] [INFO ] Deduced a trap composed of 37 places in 394 ms of which 1 ms to minimize.
[2022-05-17 22:11:53] [INFO ] Deduced a trap composed of 83 places in 390 ms of which 0 ms to minimize.
[2022-05-17 22:11:53] [INFO ] Deduced a trap composed of 68 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:11:54] [INFO ] Deduced a trap composed of 23 places in 414 ms of which 0 ms to minimize.
[2022-05-17 22:11:54] [INFO ] Deduced a trap composed of 68 places in 393 ms of which 0 ms to minimize.
[2022-05-17 22:11:55] [INFO ] Deduced a trap composed of 76 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:11:55] [INFO ] Deduced a trap composed of 76 places in 400 ms of which 0 ms to minimize.
[2022-05-17 22:11:56] [INFO ] Deduced a trap composed of 35 places in 394 ms of which 1 ms to minimize.
[2022-05-17 22:11:56] [INFO ] Deduced a trap composed of 83 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:11:57] [INFO ] Deduced a trap composed of 83 places in 397 ms of which 0 ms to minimize.
[2022-05-17 22:11:57] [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) : [1] Max seen :[0]
Support contains 1 out of 1098 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 1098/1098 places, 2209/2209 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 1097 transition count 2100
Reduce places removed 108 places and 1 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 216 place count 989 transition count 2099
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 988 transition count 2097
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 218 place count 987 transition count 2096
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 986 transition count 2094
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 220 place count 985 transition count 2093
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 221 place count 984 transition count 2091
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 222 place count 983 transition count 2090
Performed 347 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 347 Pre rules applied. Total rules applied 222 place count 983 transition count 1743
Deduced a syphon composed of 347 places in 1 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 8 with 694 rules applied. Total rules applied 916 place count 636 transition count 1743
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 8 with 110 rules applied. Total rules applied 1026 place count 581 transition count 1688
Applied a total of 1026 rules in 86 ms. Remains 581 /1098 variables (removed 517) and now considering 1688/2209 (removed 521) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/1098 places, 1688/2209 transitions.
Normalized transition count is 1352 out of 1688 initially.
// Phase 1: matrix 1352 rows 581 cols
[2022-05-17 22:11:57] [INFO ] Computed 23 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1897 ms. (steps per millisecond=527 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties (out of 1) seen :0
[2022-05-17 22:11:59] [INFO ] Flow matrix only has 1352 transitions (discarded 336 similar events)
// Phase 1: matrix 1352 rows 581 cols
[2022-05-17 22:11:59] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 22:11:59] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2022-05-17 22:11:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:11:59] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2022-05-17 22:11:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:12:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2022-05-17 22:12:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:12:00] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2022-05-17 22:12:00] [INFO ] State equation strengthened by 542 read => feed constraints.
[2022-05-17 22:12:00] [INFO ] [Nat]Added 542 Read/Feed constraints in 48 ms returned sat
[2022-05-17 22:12:00] [INFO ] Deduced a trap composed of 68 places in 186 ms of which 1 ms to minimize.
[2022-05-17 22:12:00] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 0 ms to minimize.
[2022-05-17 22:12:00] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 0 ms to minimize.
[2022-05-17 22:12:01] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2022-05-17 22:12:01] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 0 ms to minimize.
[2022-05-17 22:12:01] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2022-05-17 22:12:01] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 1 ms to minimize.
[2022-05-17 22:12:01] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 0 ms to minimize.
[2022-05-17 22:12:02] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
[2022-05-17 22:12:02] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 0 ms to minimize.
[2022-05-17 22:12:02] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 0 ms to minimize.
[2022-05-17 22:12:02] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 1 ms to minimize.
[2022-05-17 22:12:02] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 0 ms to minimize.
[2022-05-17 22:12:03] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 1 ms to minimize.
[2022-05-17 22:12:03] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 0 ms to minimize.
[2022-05-17 22:12:03] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 1 ms to minimize.
[2022-05-17 22:12:03] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 0 ms to minimize.
[2022-05-17 22:12:03] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 0 ms to minimize.
[2022-05-17 22:12:04] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 1 ms to minimize.
[2022-05-17 22:12:04] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 0 ms to minimize.
[2022-05-17 22:12:04] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 0 ms to minimize.
[2022-05-17 22:12:04] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2022-05-17 22:12:04] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 0 ms to minimize.
[2022-05-17 22:12:04] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 0 ms to minimize.
[2022-05-17 22:12:05] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 1 ms to minimize.
[2022-05-17 22:12:05] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 0 ms to minimize.
[2022-05-17 22:12:05] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 0 ms to minimize.
[2022-05-17 22:12:05] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:12:05] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 0 ms to minimize.
[2022-05-17 22:12:06] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 0 ms to minimize.
[2022-05-17 22:12:06] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:12:06] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 0 ms to minimize.
[2022-05-17 22:12:06] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 1 ms to minimize.
[2022-05-17 22:12:06] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 1 ms to minimize.
[2022-05-17 22:12:07] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 0 ms to minimize.
[2022-05-17 22:12:07] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 0 ms to minimize.
[2022-05-17 22:12:07] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 0 ms to minimize.
[2022-05-17 22:12:07] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 0 ms to minimize.
[2022-05-17 22:12:08] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 1 ms to minimize.
[2022-05-17 22:12:08] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 0 ms to minimize.
[2022-05-17 22:12:08] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 1 ms to minimize.
[2022-05-17 22:12:08] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 0 ms to minimize.
[2022-05-17 22:12:09] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 0 ms to minimize.
[2022-05-17 22:12:09] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 0 ms to minimize.
[2022-05-17 22:12:09] [INFO ] Deduced a trap composed of 60 places in 187 ms of which 0 ms to minimize.
[2022-05-17 22:12:09] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 1 ms to minimize.
[2022-05-17 22:12:09] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 0 ms to minimize.
[2022-05-17 22:12:10] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 0 ms to minimize.
[2022-05-17 22:12:10] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 1 ms to minimize.
[2022-05-17 22:12:10] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 0 ms to minimize.
[2022-05-17 22:12:10] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2022-05-17 22:12:11] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 1 ms to minimize.
[2022-05-17 22:12:11] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 0 ms to minimize.
[2022-05-17 22:12:11] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 0 ms to minimize.
[2022-05-17 22:12:11] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 0 ms to minimize.
[2022-05-17 22:12:11] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 11386 ms
[2022-05-17 22:12:11] [INFO ] Computed and/alt/rep : 1232/4756/1232 causal constraints (skipped 112 transitions) in 64 ms.
[2022-05-17 22:12:30] [INFO ] Deduced a trap composed of 60 places in 172 ms of which 1 ms to minimize.
[2022-05-17 22:12:31] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2022-05-17 22:12:31] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 0 ms to minimize.
[2022-05-17 22:12:31] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2022-05-17 22:12:32] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 0 ms to minimize.
[2022-05-17 22:12:32] [INFO ] Deduced a trap composed of 72 places in 153 ms of which 0 ms to minimize.
[2022-05-17 22:12:32] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 1 ms to minimize.
[2022-05-17 22:12:32] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 1 ms to minimize.
[2022-05-17 22:12:33] [INFO ] Deduced a trap composed of 67 places in 141 ms of which 0 ms to minimize.
[2022-05-17 22:12:33] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 0 ms to minimize.
[2022-05-17 22:12:33] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 0 ms to minimize.
[2022-05-17 22:12:33] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 1 ms to minimize.
[2022-05-17 22:12:34] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 1 ms to minimize.
[2022-05-17 22:12:34] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 1 ms to minimize.
[2022-05-17 22:12:34] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 1 ms to minimize.
[2022-05-17 22:12:34] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 0 ms to minimize.
[2022-05-17 22:12:35] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 0 ms to minimize.
[2022-05-17 22:12:35] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 1 ms to minimize.
[2022-05-17 22:12:35] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 0 ms to minimize.
[2022-05-17 22:12:35] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 0 ms to minimize.
[2022-05-17 22:12:35] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2022-05-17 22:12:36] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 0 ms to minimize.
[2022-05-17 22:12:36] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 0 ms to minimize.
[2022-05-17 22:12:36] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 0 ms to minimize.
[2022-05-17 22:12:36] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 0 ms to minimize.
[2022-05-17 22:12:37] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2022-05-17 22:12:37] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 1 ms to minimize.
[2022-05-17 22:12:37] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 0 ms to minimize.
[2022-05-17 22:12:37] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 0 ms to minimize.
[2022-05-17 22:12:38] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2022-05-17 22:12:38] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 0 ms to minimize.
[2022-05-17 22:12:38] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 1 ms to minimize.
[2022-05-17 22:12:38] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 0 ms to minimize.
[2022-05-17 22:12:38] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 0 ms to minimize.
[2022-05-17 22:12:39] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 0 ms to minimize.
[2022-05-17 22:12:39] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 0 ms to minimize.
[2022-05-17 22:12:39] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2022-05-17 22:12:39] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 0 ms to minimize.
[2022-05-17 22:12:40] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 0 ms to minimize.
[2022-05-17 22:12:40] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 0 ms to minimize.
[2022-05-17 22:12:40] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 0 ms to minimize.
[2022-05-17 22:12:40] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 0 ms to minimize.
[2022-05-17 22:12:40] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 9999 ms
[2022-05-17 22:12:40] [INFO ] Added : 1026 causal constraints over 206 iterations in 29306 ms.(timeout) Result :sat
Minimization took 962 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 202000 steps, including 1000 resets, run finished after 325 ms. (steps per millisecond=621 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 581/581 places, 1688/1688 transitions.
Applied a total of 0 rules in 20 ms. Remains 581 /581 variables (removed 0) and now considering 1688/1688 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1688/1688 transitions.
Starting structural reductions, iteration 0 : 581/581 places, 1688/1688 transitions.
Applied a total of 0 rules in 20 ms. Remains 581 /581 variables (removed 0) and now considering 1688/1688 (removed 0) transitions.
[2022-05-17 22:12:42] [INFO ] Flow matrix only has 1352 transitions (discarded 336 similar events)
// Phase 1: matrix 1352 rows 581 cols
[2022-05-17 22:12:42] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 22:12:42] [INFO ] Implicit Places using invariants in 323 ms returned []
[2022-05-17 22:12:42] [INFO ] Flow matrix only has 1352 transitions (discarded 336 similar events)
// Phase 1: matrix 1352 rows 581 cols
[2022-05-17 22:12:42] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 22:12:43] [INFO ] State equation strengthened by 542 read => feed constraints.
[2022-05-17 22:12:46] [INFO ] Implicit Places using invariants and state equation in 3764 ms returned []
Implicit Place search using SMT with State Equation took 4087 ms to find 0 implicit places.
[2022-05-17 22:12:46] [INFO ] Redundant transitions in 25 ms returned []
[2022-05-17 22:12:46] [INFO ] Flow matrix only has 1352 transitions (discarded 336 similar events)
// Phase 1: matrix 1352 rows 581 cols
[2022-05-17 22:12:46] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 22:12:47] [INFO ] Dead Transitions using invariants and state equation in 534 ms returned []
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1688/1688 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-12 in 55840 ms.
[2022-05-17 22:12:47] [INFO ] Flatten gal took : 150 ms
[2022-05-17 22:12:47] [INFO ] Applying decomposition
[2022-05-17 22:12:47] [INFO ] Flatten gal took : 92 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/graph13353384693630001258.txt, -o, /tmp/graph13353384693630001258.bin, -w, /tmp/graph13353384693630001258.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/graph13353384693630001258.bin, -l, -1, -v, -w, /tmp/graph13353384693630001258.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-17 22:12:47] [INFO ] Decomposing Gal with order
[2022-05-17 22:12:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:12:48] [INFO ] Removed a total of 3174 redundant transitions.
[2022-05-17 22:12:48] [INFO ] Flatten gal took : 199 ms
[2022-05-17 22:12:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 49 ms.
[2022-05-17 22:12:48] [INFO ] Time to serialize gal into /tmp/UpperBounds6609722679280222501.gal : 27 ms
[2022-05-17 22:12:48] [INFO ] Time to serialize properties into /tmp/UpperBounds15861312396742174859.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/UpperBounds6609722679280222501.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15861312396742174859.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/UpperBounds6609722679280222501.gal -t CGAL -reachable-file /tmp/UpperBounds15861312396742174859.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds15861312396742174859.prop.
Detected timeout of ITS tools.
[2022-05-17 22:40:20] [INFO ] Applying decomposition
[2022-05-17 22:40:20] [INFO ] Flatten gal took : 439 ms
[2022-05-17 22:40:22] [INFO ] Decomposing Gal with order
[2022-05-17 22:40:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:40:23] [INFO ] Removed a total of 2152 redundant transitions.
[2022-05-17 22:40:24] [INFO ] Flatten gal took : 1111 ms
[2022-05-17 22:40:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 981 labels/synchronizations in 91 ms.
[2022-05-17 22:40:24] [INFO ] Time to serialize gal into /tmp/UpperBounds16707227088245183659.gal : 13 ms
[2022-05-17 22:40:24] [INFO ] Time to serialize properties into /tmp/UpperBounds17219586054017098046.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/UpperBounds16707227088245183659.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17219586054017098046.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/UpperBounds16707227088245183659.gal -t CGAL -reachable-file /tmp/UpperBounds17219586054017098046.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds17219586054017098046.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-PT-7"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is Peterson-PT-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 r179-tall-165277026700034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;