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-165277026700025.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-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026700025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 47K Apr 30 09:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 209K Apr 30 09:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 83K Apr 30 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 388K Apr 30 09:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 26K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K 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 298K 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-4-UpperBounds-00
FORMULA_NAME Peterson-PT-4-UpperBounds-01
FORMULA_NAME Peterson-PT-4-UpperBounds-02
FORMULA_NAME Peterson-PT-4-UpperBounds-03
FORMULA_NAME Peterson-PT-4-UpperBounds-04
FORMULA_NAME Peterson-PT-4-UpperBounds-05
FORMULA_NAME Peterson-PT-4-UpperBounds-06
FORMULA_NAME Peterson-PT-4-UpperBounds-07
FORMULA_NAME Peterson-PT-4-UpperBounds-08
FORMULA_NAME Peterson-PT-4-UpperBounds-09
FORMULA_NAME Peterson-PT-4-UpperBounds-10
FORMULA_NAME Peterson-PT-4-UpperBounds-11
FORMULA_NAME Peterson-PT-4-UpperBounds-12
FORMULA_NAME Peterson-PT-4-UpperBounds-13
FORMULA_NAME Peterson-PT-4-UpperBounds-14
FORMULA_NAME Peterson-PT-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652823907858

Running Version 0
[2022-05-17 21:45:09] [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:45:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:45:09] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2022-05-17 21:45:09] [INFO ] Transformed 480 places.
[2022-05-17 21:45:09] [INFO ] Transformed 690 transitions.
[2022-05-17 21:45:09] [INFO ] Found NUPN structural information;
[2022-05-17 21:45:09] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2022-05-17 21:45:09] [INFO ] Parsed PT model containing 480 places and 690 transitions in 115 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
FORMULA Peterson-PT-4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 630 out of 690 initially.
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 21:45:09] [INFO ] Computed 19 place invariants in 23 ms
FORMULA Peterson-PT-4-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :16
FORMULA Peterson-PT-4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :11
[2022-05-17 21:45:09] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 21:45:09] [INFO ] Computed 19 place invariants in 6 ms
[2022-05-17 21:45:10] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned unsat
[2022-05-17 21:45:10] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-17 21:45:10] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 21:45:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:10] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2022-05-17 21:45:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-17 21:45:10] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 21:45:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:10] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-05-17 21:45:10] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:45:10] [INFO ] [Nat]Added 132 Read/Feed constraints in 28 ms returned sat
[2022-05-17 21:45:10] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 6 ms to minimize.
[2022-05-17 21:45:10] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 1 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 2 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 1 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 0 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 0 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 0 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 0 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 1 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 0 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 0 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
[2022-05-17 21:45:13] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:45:13] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:45:13] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 0 ms to minimize.
[2022-05-17 21:45:13] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2022-05-17 21:45:13] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2022-05-17 21:45:13] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2022-05-17 21:45:13] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 10 ms to minimize.
[2022-05-17 21:45:13] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 0 ms to minimize.
[2022-05-17 21:45:14] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2022-05-17 21:45:14] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 0 ms to minimize.
[2022-05-17 21:45:14] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 0 ms to minimize.
[2022-05-17 21:45:14] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 0 ms to minimize.
[2022-05-17 21:45:14] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 1 ms to minimize.
[2022-05-17 21:45:14] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 0 ms to minimize.
[2022-05-17 21:45:14] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2022-05-17 21:45:15] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:45:15] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
[2022-05-17 21:45:15] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 5 ms to minimize.
[2022-05-17 21:45:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:45:15] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-17 21:45:15] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 21:45:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:15] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-05-17 21:45:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-17 21:45:15] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 21:45:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:15] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-05-17 21:45:15] [INFO ] [Nat]Added 132 Read/Feed constraints in 21 ms returned sat
[2022-05-17 21:45:15] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2022-05-17 21:45:16] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2022-05-17 21:45:16] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2022-05-17 21:45:16] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2022-05-17 21:45:16] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2022-05-17 21:45:16] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2022-05-17 21:45:16] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:45:16] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 0 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 0 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 0 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 0 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 0 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 0 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 0 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 0 ms to minimize.
[2022-05-17 21:45:18] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
[2022-05-17 21:45:18] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 0 ms to minimize.
[2022-05-17 21:45:18] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:45:18] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2022-05-17 21:45:18] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2022-05-17 21:45:18] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2022-05-17 21:45:18] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 0 ms to minimize.
[2022-05-17 21:45:18] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 1 ms to minimize.
[2022-05-17 21:45:19] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 0 ms to minimize.
[2022-05-17 21:45:19] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2022-05-17 21:45:19] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2022-05-17 21:45:19] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 1 ms to minimize.
[2022-05-17 21:45:19] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 0 ms to minimize.
[2022-05-17 21:45:19] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 0 ms to minimize.
[2022-05-17 21:45:19] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2022-05-17 21:45:20] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
[2022-05-17 21:45:20] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2022-05-17 21:45:20] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 1 ms to minimize.
[2022-05-17 21:45:20] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2022-05-17 21:45:20] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 0 ms to minimize.
[2022-05-17 21:45:20] [INFO ] Deduced a trap composed of 2 places in 142 ms of which 0 ms to minimize.
[2022-05-17 21:45:20] [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:45:20] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-17 21:45:20] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2022-05-17 21:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:21] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2022-05-17 21:45:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-17 21:45:21] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 21:45:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:21] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-05-17 21:45:21] [INFO ] [Nat]Added 132 Read/Feed constraints in 26 ms returned sat
[2022-05-17 21:45:21] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2022-05-17 21:45:21] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2022-05-17 21:45:21] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2022-05-17 21:45:21] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2022-05-17 21:45:21] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2022-05-17 21:45:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 620 ms
[2022-05-17 21:45:22] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-17 21:45:22] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2022-05-17 21:45:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:22] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2022-05-17 21:45:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-17 21:45:22] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 21:45:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:22] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2022-05-17 21:45:22] [INFO ] [Nat]Added 132 Read/Feed constraints in 22 ms returned sat
[2022-05-17 21:45:22] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2022-05-17 21:45:22] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2022-05-17 21:45:22] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:45:22] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 0 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 0 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 0 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 0 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 0 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 0 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 0 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 0 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 0 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 0 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 1 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 0 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 0 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 6 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 0 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 0 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
[2022-05-17 21:45:26] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 1 ms to minimize.
[2022-05-17 21:45:26] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 0 ms to minimize.
[2022-05-17 21:45:26] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2022-05-17 21:45:26] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 0 ms to minimize.
[2022-05-17 21:45:26] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 0 ms to minimize.
[2022-05-17 21:45:26] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 1 ms to minimize.
[2022-05-17 21:45:26] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 0 ms to minimize.
[2022-05-17 21:45:27] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 0 ms to minimize.
[2022-05-17 21:45:27] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2022-05-17 21:45:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:45:27] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-17 21:45:27] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2022-05-17 21:45:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:27] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2022-05-17 21:45:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-17 21:45:27] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 21:45:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:27] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2022-05-17 21:45:27] [INFO ] [Nat]Added 132 Read/Feed constraints in 21 ms returned sat
[2022-05-17 21:45:27] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 0 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 0 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 0 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 0 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 0 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 0 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 0 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2230 ms
[2022-05-17 21:45:30] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 40 ms.
[2022-05-17 21:45:32] [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 5
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)
Current structural bounds on expressions (after SMT) : [5, 5, 5, 4, 5, 1] Max seen :[5, 1, 1, 4, 1, 0]
FORMULA Peterson-PT-4-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 400 place count 280 transition count 395
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 590 place count 185 transition count 395
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 628 place count 166 transition count 376
Applied a total of 628 rules in 61 ms. Remains 166 /480 variables (removed 314) and now considering 376/690 (removed 314) transitions.
Finished structural reductions, in 1 iterations. Remains : 166/480 places, 376/690 transitions.
Normalized transition count is 316 out of 376 initially.
// Phase 1: matrix 316 rows 166 cols
[2022-05-17 21:45:32] [INFO ] Computed 19 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1481 ms. (steps per millisecond=675 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=2169 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 454 ms. (steps per millisecond=2202 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=2320 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 482 ms. (steps per millisecond=2074 ) properties (out of 4) seen :3
[2022-05-17 21:45:35] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 166 cols
[2022-05-17 21:45:35] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-17 21:45:35] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 21:45:35] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 21:45:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:36] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-05-17 21:45:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 21:45:36] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 21:45:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:36] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-05-17 21:45:36] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:45:36] [INFO ] [Nat]Added 132 Read/Feed constraints in 10 ms returned sat
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 7 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:45:40] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 0 ms to minimize.
[2022-05-17 21:46:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:46:21] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:46:21] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2022-05-17 21:46:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:21] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-17 21:46:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 21:46:21] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 21:46:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:21] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-05-17 21:46:21] [INFO ] [Nat]Added 132 Read/Feed constraints in 10 ms returned sat
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:46:24] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2022-05-17 21:46:24] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2022-05-17 21:46:24] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:46:24] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:46:25] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 3 ms to minimize.
[2022-05-17 21:47:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:47:06] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:47:06] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 21:47:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:06] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2022-05-17 21:47:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:47:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:47:06] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 21:47:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:06] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-17 21:47:06] [INFO ] [Nat]Added 132 Read/Feed constraints in 10 ms returned sat
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 38 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2022-05-17 21:47:10] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2022-05-17 21:47:51] [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:47:51] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 21:47:51] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 21:47:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:51] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-05-17 21:47:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:47:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 21:47:51] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 21:47:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:51] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-17 21:47:51] [INFO ] [Nat]Added 132 Read/Feed constraints in 11 ms returned sat
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 816 ms
[2022-05-17 21:47:52] [INFO ] Computed and/alt/rep : 275/792/275 causal constraints (skipped 36 transitions) in 19 ms.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 506 ms
[2022-05-17 21:47:54] [INFO ] Added : 266 causal constraints over 54 iterations in 1657 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 1] Max seen :[1, 1, 1, 0]
Incomplete Parikh walk after 51000 steps, including 995 resets, run finished after 100 ms. (steps per millisecond=510 ) properties (out of 4) seen :3 could not realise parikh vector
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 166/166 places, 376/376 transitions.
Applied a total of 0 rules in 13 ms. Remains 166 /166 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 166/166 places, 376/376 transitions.
Starting structural reductions, iteration 0 : 166/166 places, 376/376 transitions.
Applied a total of 0 rules in 13 ms. Remains 166 /166 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2022-05-17 21:47:54] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 166 cols
[2022-05-17 21:47:54] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 21:47:54] [INFO ] Implicit Places using invariants in 104 ms returned [153, 154, 155, 156, 157]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 105 ms to find 5 implicit places.
[2022-05-17 21:47:54] [INFO ] Redundant transitions in 22 ms returned []
[2022-05-17 21:47:54] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 21:47:54] [INFO ] Computed 14 place invariants in 20 ms
[2022-05-17 21:47:54] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Starting structural reductions, iteration 1 : 161/166 places, 376/376 transitions.
Applied a total of 0 rules in 11 ms. Remains 161 /161 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2022-05-17 21:47:54] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-17 21:47:54] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 21:47:54] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 21:47:54] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Finished structural reductions, in 2 iterations. Remains : 161/166 places, 376/376 transitions.
Normalized transition count is 316 out of 376 initially.
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 21:47:54] [INFO ] Computed 14 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1361 ms. (steps per millisecond=734 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=2331 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=2336 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=2375 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 4) seen :3
[2022-05-17 21:47:57] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 21:47:57] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-17 21:47:57] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:47:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:57] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-17 21:47:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:47:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:47:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:57] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-17 21:47:58] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:47:58] [INFO ] [Nat]Added 132 Read/Feed constraints in 10 ms returned sat
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2022-05-17 21:48:01] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:48:01] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:48:42] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 0 ms to minimize.
[2022-05-17 21:48:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:48:43] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 21:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:48:43] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-17 21:48:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:48:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:48:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:48:43] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-17 21:48:43] [INFO ] [Nat]Added 132 Read/Feed constraints in 11 ms returned sat
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:48:46] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2022-05-17 21:48:46] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2022-05-17 21:48:46] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 0 ms to minimize.
[2022-05-17 21:49:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:49:28] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:49:28] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-17 21:49:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:49:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:49:28] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-05-17 21:49:28] [INFO ] [Nat]Added 132 Read/Feed constraints in 11 ms returned sat
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 37 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 7 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:49:31] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:49:31] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:49:31] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:49:31] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 0 ms to minimize.
[2022-05-17 21:49:31] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
[2022-05-17 21:50: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 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:13] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 21:50:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:13] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-17 21:50:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:50:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 21:50:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:13] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-05-17 21:50:13] [INFO ] [Nat]Added 132 Read/Feed constraints in 10 ms returned sat
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 1304 ms
[2022-05-17 21:50:14] [INFO ] Computed and/alt/rep : 275/792/275 causal constraints (skipped 36 transitions) in 18 ms.
[2022-05-17 21:50:15] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:50:15] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:50:15] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:50:15] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:50:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 248 ms
[2022-05-17 21:50:15] [INFO ] Added : 149 causal constraints over 30 iterations in 832 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 1] Max seen :[1, 1, 1, 0]
Incomplete Parikh walk after 61100 steps, including 999 resets, run finished after 84 ms. (steps per millisecond=727 ) properties (out of 4) seen :3 could not realise parikh vector
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 376/376 transitions.
Applied a total of 0 rules in 9 ms. Remains 161 /161 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 376/376 transitions.
Starting structural reductions, iteration 0 : 161/161 places, 376/376 transitions.
Applied a total of 0 rules in 9 ms. Remains 161 /161 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2022-05-17 21:50:15] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 21:50:15] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 21:50:15] [INFO ] Implicit Places using invariants in 85 ms returned []
[2022-05-17 21:50:15] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 21:50:15] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 21:50:15] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:50:16] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2022-05-17 21:50:16] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 21:50:16] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 21:50:16] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-17 21:50:16] [INFO ] Dead Transitions using invariants and state equation in 134 ms returned []
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 376/376 transitions.
Starting property specific reduction for Peterson-PT-4-UpperBounds-03
Normalized transition count is 316 out of 376 initially.
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 21:50:16] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2022-05-17 21:50:16] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 21:50:16] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 21:50:16] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:50:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:16] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-17 21:50:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:50:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:50:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:16] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-05-17 21:50:16] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:50:16] [INFO ] [Nat]Added 132 Read/Feed constraints in 19 ms returned sat
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:50:19] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2022-05-17 21:50:19] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2022-05-17 21:50:19] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:50:19] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:50:19] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2022-05-17 21:50:19] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:50:19] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2022-05-17 21:50:19] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:50:19] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:50:20] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2022-05-17 21:50:21] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 0 ms to minimize.
[2022-05-17 21:50:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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) : [5] Max seen :[1]
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 376/376 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 160 transition count 375
Applied a total of 2 rules in 11 ms. Remains 160 /161 variables (removed 1) and now considering 375/376 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/161 places, 375/376 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 21:50:21] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1173 ms. (steps per millisecond=852 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 1) seen :1
[2022-05-17 21:50:23] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 21:50:23] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-17 21:50:23] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:23] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-17 21:50:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:50:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:23] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-05-17 21:50:23] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:50:23] [INFO ] [Nat]Added 132 Read/Feed constraints in 10 ms returned sat
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 34 places in 21 ms of which 1 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 35 places in 21 ms of which 0 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 48 places in 28 ms of which 1 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:50:26] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:50:26] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
[2022-05-17 21:51:08] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2022-05-17 21:51:08] [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) : [5] Max seen :[1]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2022-05-17 21:51:08] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 21:51:08] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 21:51:08] [INFO ] Implicit Places using invariants in 85 ms returned []
[2022-05-17 21:51:08] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 21:51:08] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 21:51:08] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:51:08] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2022-05-17 21:51:08] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-17 21:51:08] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 21:51:08] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 21:51:08] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Ending property specific reduction for Peterson-PT-4-UpperBounds-03 in 52504 ms.
Starting property specific reduction for Peterson-PT-4-UpperBounds-04
Normalized transition count is 316 out of 376 initially.
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 21:51:08] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2022-05-17 21:51:08] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 21:51:08] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 21:51:08] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:51:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:51:08] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-17 21:51:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:51:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:51:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:51:09] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-05-17 21:51:09] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:51:09] [INFO ] [Nat]Added 132 Read/Feed constraints in 10 ms returned sat
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2022-05-17 21:51:11] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:51:12] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:51:12] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:51:14] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:51:14] [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) : [5] Max seen :[1]
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 376/376 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 160 transition count 375
Applied a total of 2 rules in 9 ms. Remains 160 /161 variables (removed 1) and now considering 375/376 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/161 places, 375/376 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 21:51:14] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1217 ms. (steps per millisecond=821 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 381 ms. (steps per millisecond=2624 ) properties (out of 1) seen :1
[2022-05-17 21:51:15] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 21:51:15] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 21:51:15] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:51:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:51:15] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-17 21:51:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:51:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:51:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:51:15] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-17 21:51:15] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:51:15] [INFO ] [Nat]Added 132 Read/Feed constraints in 10 ms returned sat
[2022-05-17 21:51:15] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:51:15] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:51:15] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:51:15] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 43 places in 27 ms of which 1 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2022-05-17 21:51:16] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 48 places in 27 ms of which 1 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:51:17] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:51:18] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2022-05-17 21:51:18] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:51:18] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:51:18] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2022-05-17 21:51:18] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:51:18] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:51:18] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2022-05-17 21:51:18] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:51:18] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2022-05-17 21:51:18] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:51:18] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:52:00] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:52:00] [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) : [5] Max seen :[1]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2022-05-17 21:52:00] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 21:52:00] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-17 21:52:00] [INFO ] Implicit Places using invariants in 103 ms returned []
[2022-05-17 21:52:00] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 21:52:00] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-17 21:52:00] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:52:01] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2022-05-17 21:52:01] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-17 21:52:01] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 21:52:01] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 21:52:01] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Ending property specific reduction for Peterson-PT-4-UpperBounds-04 in 52469 ms.
Starting property specific reduction for Peterson-PT-4-UpperBounds-07
Normalized transition count is 316 out of 376 initially.
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 21:52:01] [INFO ] Computed 14 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2022-05-17 21:52:01] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 21:52:01] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 21:52:01] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:01] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-17 21:52:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:52:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 21:52:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:01] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-17 21:52:01] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:52:01] [INFO ] [Nat]Added 132 Read/Feed constraints in 10 ms returned sat
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
[2022-05-17 21:52:04] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:52:04] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:52:04] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:52:04] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2022-05-17 21:52:04] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2022-05-17 21:52:04] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:52:04] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:52:06] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:52:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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) : [5] Max seen :[1]
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 376/376 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 160 transition count 375
Applied a total of 2 rules in 7 ms. Remains 160 /161 variables (removed 1) and now considering 375/376 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/161 places, 375/376 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 21:52:06] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1159 ms. (steps per millisecond=862 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 379 ms. (steps per millisecond=2638 ) properties (out of 1) seen :1
[2022-05-17 21:52:08] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 21:52:08] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-17 21:52:08] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:52:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:08] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-17 21:52:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:52:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:52:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:08] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-17 21:52:08] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:52:08] [INFO ] [Nat]Added 132 Read/Feed constraints in 11 ms returned sat
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 3 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 34 places in 23 ms of which 1 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 43 places in 24 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 35 places in 24 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 48 places in 24 ms of which 0 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2022-05-17 21:52:11] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2022-05-17 21:52:53] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:52:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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) : [5] Max seen :[1]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2022-05-17 21:52:53] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 21:52:53] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 21:52:53] [INFO ] Implicit Places using invariants in 79 ms returned []
[2022-05-17 21:52:53] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 21:52:53] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 21:52:53] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:52:53] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2022-05-17 21:52:53] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-17 21:52:53] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 21:52:53] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-17 21:52:53] [INFO ] Dead Transitions using invariants and state equation in 121 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Ending property specific reduction for Peterson-PT-4-UpperBounds-07 in 52403 ms.
Starting property specific reduction for Peterson-PT-4-UpperBounds-15
Normalized transition count is 316 out of 376 initially.
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 21:52:53] [INFO ] Computed 14 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2022-05-17 21:52:53] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 21:52:53] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 21:52:53] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 21:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:53] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-17 21:52:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:52:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 21:52:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:53] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-17 21:52:53] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:52:53] [INFO ] [Nat]Added 132 Read/Feed constraints in 12 ms returned sat
[2022-05-17 21:52:53] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2022-05-17 21:52:55] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2022-05-17 21:52:55] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:52:55] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:52:55] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2022-05-17 21:52:55] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 1277 ms
[2022-05-17 21:52:55] [INFO ] Computed and/alt/rep : 275/792/275 causal constraints (skipped 36 transitions) in 17 ms.
[2022-05-17 21:52:55] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2022-05-17 21:52:55] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:52:55] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:52:55] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2022-05-17 21:52:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 261 ms
[2022-05-17 21:52:56] [INFO ] Added : 149 causal constraints over 30 iterations in 829 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 61100 steps, including 1000 resets, run finished after 72 ms. (steps per millisecond=848 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 161 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 161/161 places, 375/375 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 161 transition count 370
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 156 transition count 370
Applied a total of 10 rules in 10 ms. Remains 156 /161 variables (removed 5) and now considering 370/375 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 156/161 places, 370/375 transitions.
Normalized transition count is 310 out of 370 initially.
// Phase 1: matrix 310 rows 156 cols
[2022-05-17 21:52:56] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1108 ms. (steps per millisecond=902 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=2631 ) properties (out of 1) seen :0
[2022-05-17 21:52:57] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 156 cols
[2022-05-17 21:52:57] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-17 21:52:57] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:57] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-17 21:52:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:52:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 21:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:57] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-17 21:52:57] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:52:57] [INFO ] [Nat]Added 132 Read/Feed constraints in 10 ms returned sat
[2022-05-17 21:52:57] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2022-05-17 21:52:57] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2022-05-17 21:52:57] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:52:58] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:52:58] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-05-17 21:52:58] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2022-05-17 21:52:58] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:52:58] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2022-05-17 21:52:58] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2022-05-17 21:52:58] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:52:58] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2022-05-17 21:52:58] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 522 ms
[2022-05-17 21:52:58] [INFO ] Computed and/alt/rep : 269/785/269 causal constraints (skipped 36 transitions) in 18 ms.
[2022-05-17 21:52:58] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2022-05-17 21:52:58] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2022-05-17 21:52:59] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:52:59] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2022-05-17 21:52:59] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2022-05-17 21:52:59] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2022-05-17 21:52:59] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2022-05-17 21:52:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 405 ms
[2022-05-17 21:52:59] [INFO ] Added : 138 causal constraints over 28 iterations in 929 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 29400 steps, including 894 resets, run finished after 40 ms. (steps per millisecond=735 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 370/370 transitions.
Applied a total of 0 rules in 26 ms. Remains 156 /156 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 370/370 transitions.
Starting structural reductions, iteration 0 : 156/156 places, 370/370 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 370/370 (removed 0) transitions.
[2022-05-17 21:52:59] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 156 cols
[2022-05-17 21:52:59] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-17 21:52:59] [INFO ] Implicit Places using invariants in 89 ms returned []
[2022-05-17 21:52:59] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 156 cols
[2022-05-17 21:52:59] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 21:52:59] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-05-17 21:52:59] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2022-05-17 21:52:59] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-17 21:52:59] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 156 cols
[2022-05-17 21:52:59] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 21:52:59] [INFO ] Dead Transitions using invariants and state equation in 120 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 370/370 transitions.
Ending property specific reduction for Peterson-PT-4-UpperBounds-15 in 6237 ms.
[2022-05-17 21:53:00] [INFO ] Flatten gal took : 87 ms
[2022-05-17 21:53:00] [INFO ] Applying decomposition
[2022-05-17 21:53:00] [INFO ] Flatten gal took : 22 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/graph16344151500734326258.txt, -o, /tmp/graph16344151500734326258.bin, -w, /tmp/graph16344151500734326258.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/graph16344151500734326258.bin, -l, -1, -v, -w, /tmp/graph16344151500734326258.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-17 21:53:00] [INFO ] Decomposing Gal with order
[2022-05-17 21:53:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 21:53:00] [INFO ] Removed a total of 411 redundant transitions.
[2022-05-17 21:53:00] [INFO ] Flatten gal took : 100 ms
[2022-05-17 21:53:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 303 labels/synchronizations in 17 ms.
[2022-05-17 21:53:00] [INFO ] Time to serialize gal into /tmp/UpperBounds9750095671516756298.gal : 9 ms
[2022-05-17 21:53:00] [INFO ] Time to serialize properties into /tmp/UpperBounds12266562676643012629.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds9750095671516756298.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12266562676643012629.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/UpperBounds9750095671516756298.gal -t CGAL -reachable-file /tmp/UpperBounds12266562676643012629.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds12266562676643012629.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,4.22921e+06,21.511,511968,2,39462,5,2.0297e+06,6,0,1145,1.94248e+06,0
Total reachable state count : 4229212

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-4-UpperBounds-03 :0 <= gi6.gi1.gu23.CS_0+gi6.gi0.gu24.CS_1+gi5.gi1.gu5.CS_3+gi6.gi1.gu22.CS_2+gi6.gi1.gu21.CS_4 <= 1
FORMULA Peterson-PT-4-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-UpperBounds-03,0,21.5181,511968,1,0,7,2.0297e+06,9,1,1439,1.94248e+06,4
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-4-UpperBounds-04 :0 <= gi6.gi1.gu23.CS_0+gi6.gi0.gu24.CS_1+gi5.gi1.gu5.CS_3+gi6.gi1.gu22.CS_2+gi6.gi1.gu21.CS_4 <= 1
FORMULA Peterson-PT-4-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-UpperBounds-04,0,21.5196,511968,1,0,7,2.0297e+06,9,1,1439,1.94248e+06,4
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-4-UpperBounds-07 :0 <= gi6.gi1.gu23.CS_0+gi6.gi0.gu24.CS_1+gi5.gi1.gu5.CS_3+gi6.gi1.gu22.CS_2+gi6.gi1.gu21.CS_4 <= 1
FORMULA Peterson-PT-4-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-UpperBounds-07,0,21.5198,511968,1,0,7,2.0297e+06,9,1,1439,1.94248e+06,4
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-4-UpperBounds-15 :0 <= gi5.gi1.gu5.IsEndLoop_3_3_4 <= 1
FORMULA Peterson-PT-4-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-UpperBounds-15,0,21.5208,511968,1,0,8,2.0297e+06,10,1,1506,1.94248e+06,5

BK_STOP 1652824403366

--------------------
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-4"
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-4, 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-165277026700025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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