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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 7.3K Apr 30 06:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 30 06:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 30 06:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 06:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 25M May 10 09:33 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 Dekker-PT-200-UpperBounds-00
FORMULA_NAME Dekker-PT-200-UpperBounds-01
FORMULA_NAME Dekker-PT-200-UpperBounds-02
FORMULA_NAME Dekker-PT-200-UpperBounds-03
FORMULA_NAME Dekker-PT-200-UpperBounds-04
FORMULA_NAME Dekker-PT-200-UpperBounds-05
FORMULA_NAME Dekker-PT-200-UpperBounds-06
FORMULA_NAME Dekker-PT-200-UpperBounds-07
FORMULA_NAME Dekker-PT-200-UpperBounds-08
FORMULA_NAME Dekker-PT-200-UpperBounds-09
FORMULA_NAME Dekker-PT-200-UpperBounds-10
FORMULA_NAME Dekker-PT-200-UpperBounds-11
FORMULA_NAME Dekker-PT-200-UpperBounds-12
FORMULA_NAME Dekker-PT-200-UpperBounds-13
FORMULA_NAME Dekker-PT-200-UpperBounds-14
FORMULA_NAME Dekker-PT-200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652591680045

Running Version 0
[2022-05-15 05:14:41] [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-15 05:14:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 05:14:43] [INFO ] Load time of PNML (sax parser for PT used): 1194 ms
[2022-05-15 05:14:43] [INFO ] Transformed 1000 places.
[2022-05-15 05:14:43] [INFO ] Transformed 40400 transitions.
[2022-05-15 05:14:43] [INFO ] Found NUPN structural information;
[2022-05-15 05:14:43] [INFO ] Parsed PT model containing 1000 places and 40400 transitions in 1452 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
FORMULA Dekker-PT-200-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 800 out of 40400 initially.
// Phase 1: matrix 800 rows 1000 cols
[2022-05-15 05:14:43] [INFO ] Computed 600 place invariants in 126 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 664 ms. (steps per millisecond=15 ) properties (out of 9) seen :5
FORMULA Dekker-PT-200-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :1
FORMULA Dekker-PT-200-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
[2022-05-15 05:14:44] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2022-05-15 05:14:44] [INFO ] Computed 600 place invariants in 23 ms
[2022-05-15 05:14:45] [INFO ] [Real]Absence check using 400 positive place invariants in 90 ms returned sat
[2022-05-15 05:14:45] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 32 ms returned sat
[2022-05-15 05:14:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:14:45] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2022-05-15 05:14:45] [INFO ] State equation strengthened by 200 read => feed constraints.
[2022-05-15 05:14:46] [INFO ] [Real]Added 200 Read/Feed constraints in 186 ms returned sat
[2022-05-15 05:14:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:14:46] [INFO ] [Nat]Absence check using 400 positive place invariants in 66 ms returned sat
[2022-05-15 05:14:46] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 31 ms returned sat
[2022-05-15 05:14:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:14:46] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2022-05-15 05:14:46] [INFO ] [Nat]Added 200 Read/Feed constraints in 121 ms returned sat
[2022-05-15 05:14:48] [INFO ] Deduced a trap composed of 4 places in 1255 ms of which 20 ms to minimize.
[2022-05-15 05:14:49] [INFO ] Deduced a trap composed of 4 places in 1174 ms of which 3 ms to minimize.
[2022-05-15 05:14:50] [INFO ] Deduced a trap composed of 4 places in 1090 ms of which 1 ms to minimize.
[2022-05-15 05:14:51] [INFO ] Deduced a trap composed of 4 places in 1046 ms of which 1 ms to minimize.
[2022-05-15 05:14: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 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-15 05:14:51] [INFO ] [Real]Absence check using 400 positive place invariants in 74 ms returned sat
[2022-05-15 05:14:51] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 32 ms returned sat
[2022-05-15 05:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:14:51] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2022-05-15 05:14:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:14:52] [INFO ] [Nat]Absence check using 400 positive place invariants in 69 ms returned sat
[2022-05-15 05:14:52] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 32 ms returned sat
[2022-05-15 05:14:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:14:52] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-15 05:14:52] [INFO ] [Nat]Added 200 Read/Feed constraints in 108 ms returned sat
[2022-05-15 05:14:53] [INFO ] Deduced a trap composed of 4 places in 1088 ms of which 1 ms to minimize.
[2022-05-15 05:14:54] [INFO ] Deduced a trap composed of 4 places in 1055 ms of which 0 ms to minimize.
[2022-05-15 05:14:55] [INFO ] Deduced a trap composed of 4 places in 1056 ms of which 2 ms to minimize.
[2022-05-15 05:14:57] [INFO ] Deduced a trap composed of 4 places in 1043 ms of which 1 ms to minimize.
[2022-05-15 05:14:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-15 05:14:57] [INFO ] [Real]Absence check using 400 positive place invariants in 82 ms returned sat
[2022-05-15 05:14:57] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 30 ms returned sat
[2022-05-15 05:14:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:14:57] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2022-05-15 05:14:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:14:57] [INFO ] [Nat]Absence check using 400 positive place invariants in 70 ms returned sat
[2022-05-15 05:14:57] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 31 ms returned sat
[2022-05-15 05:14:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:14:58] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2022-05-15 05:14:58] [INFO ] [Nat]Added 200 Read/Feed constraints in 109 ms returned sat
[2022-05-15 05:14:59] [INFO ] Deduced a trap composed of 4 places in 1083 ms of which 0 ms to minimize.
[2022-05-15 05:15:00] [INFO ] Deduced a trap composed of 4 places in 1047 ms of which 0 ms to minimize.
[2022-05-15 05:15:01] [INFO ] Deduced a trap composed of 4 places in 975 ms of which 4 ms to minimize.
[2022-05-15 05:15:02] [INFO ] Deduced a trap composed of 4 places in 991 ms of which 0 ms to minimize.
[2022-05-15 05:15:03] [INFO ] Deduced a trap composed of 4 places in 933 ms of which 7 ms to minimize.
[2022-05-15 05:15:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1636 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 40400/40400 transitions.
Normalized transition count is 800 out of 40400 initially.
// Phase 1: matrix 800 rows 1000 cols
[2022-05-15 05:15:05] [INFO ] Computed 600 place invariants in 47 ms
Interrupted random walk after 485061 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen :{}
Interrupted Best-First random walk after 862493 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=172 ) properties seen :{}
Interrupted Best-First random walk after 834152 steps, including 2 resets, run timeout after 5002 ms. (steps per millisecond=166 ) properties seen :{}
Interrupted Best-First random walk after 792545 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=158 ) properties seen :{}
[2022-05-15 05:15:50] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2022-05-15 05:15:50] [INFO ] Computed 600 place invariants in 13 ms
[2022-05-15 05:15:50] [INFO ] [Real]Absence check using 400 positive place invariants in 64 ms returned sat
[2022-05-15 05:15:50] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 29 ms returned sat
[2022-05-15 05:15:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:15:50] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2022-05-15 05:15:51] [INFO ] State equation strengthened by 200 read => feed constraints.
[2022-05-15 05:15:51] [INFO ] [Real]Added 200 Read/Feed constraints in 115 ms returned sat
[2022-05-15 05:15:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:15:51] [INFO ] [Nat]Absence check using 400 positive place invariants in 62 ms returned sat
[2022-05-15 05:15:51] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 27 ms returned sat
[2022-05-15 05:15:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:15:51] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2022-05-15 05:15:51] [INFO ] [Nat]Added 200 Read/Feed constraints in 112 ms returned sat
[2022-05-15 05:15:52] [INFO ] Deduced a trap composed of 4 places in 1027 ms of which 1 ms to minimize.
[2022-05-15 05:15:54] [INFO ] Deduced a trap composed of 4 places in 1077 ms of which 1 ms to minimize.
[2022-05-15 05:15:55] [INFO ] Deduced a trap composed of 4 places in 1062 ms of which 1 ms to minimize.
[2022-05-15 05:15:56] [INFO ] Deduced a trap composed of 4 places in 1054 ms of which 1 ms to minimize.
[2022-05-15 05:15:57] [INFO ] Deduced a trap composed of 6 places in 1092 ms of which 1 ms to minimize.
[2022-05-15 05:15:58] [INFO ] Deduced a trap composed of 4 places in 1008 ms of which 0 ms to minimize.
[2022-05-15 05:15:59] [INFO ] Deduced a trap composed of 4 places in 958 ms of which 0 ms to minimize.
[2022-05-15 05:16:00] [INFO ] Deduced a trap composed of 4 places in 953 ms of which 0 ms to minimize.
[2022-05-15 05:16:01] [INFO ] Deduced a trap composed of 4 places in 928 ms of which 1 ms to minimize.
[2022-05-15 05:16:02] [INFO ] Deduced a trap composed of 4 places in 968 ms of which 1 ms to minimize.
[2022-05-15 05:16:03] [INFO ] Deduced a trap composed of 4 places in 888 ms of which 0 ms to minimize.
[2022-05-15 05:16:04] [INFO ] Deduced a trap composed of 4 places in 931 ms of which 1 ms to minimize.
[2022-05-15 05:16:05] [INFO ] Deduced a trap composed of 4 places in 930 ms of which 1 ms to minimize.
[2022-05-15 05:16:06] [INFO ] Deduced a trap composed of 4 places in 912 ms of which 0 ms to minimize.
[2022-05-15 05:16:07] [INFO ] Deduced a trap composed of 4 places in 860 ms of which 0 ms to minimize.
[2022-05-15 05:16:07] [INFO ] Deduced a trap composed of 4 places in 861 ms of which 1 ms to minimize.
[2022-05-15 05:16:08] [INFO ] Deduced a trap composed of 4 places in 836 ms of which 0 ms to minimize.
[2022-05-15 05:16:09] [INFO ] Deduced a trap composed of 4 places in 852 ms of which 1 ms to minimize.
[2022-05-15 05:16:10] [INFO ] Deduced a trap composed of 4 places in 854 ms of which 1 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 6 places in 848 ms of which 1 ms to minimize.
[2022-05-15 05:16:12] [INFO ] Deduced a trap composed of 4 places in 899 ms of which 10 ms to minimize.
[2022-05-15 05:16:13] [INFO ] Deduced a trap composed of 4 places in 896 ms of which 2 ms to minimize.
[2022-05-15 05:16:14] [INFO ] Deduced a trap composed of 4 places in 884 ms of which 1 ms to minimize.
[2022-05-15 05:16:15] [INFO ] Deduced a trap composed of 4 places in 886 ms of which 0 ms to minimize.
[2022-05-15 05:16:16] [INFO ] Deduced a trap composed of 4 places in 880 ms of which 0 ms to minimize.
[2022-05-15 05:16:17] [INFO ] Deduced a trap composed of 4 places in 877 ms of which 0 ms to minimize.
[2022-05-15 05:16:17] [INFO ] Deduced a trap composed of 4 places in 845 ms of which 1 ms to minimize.
[2022-05-15 05:16:18] [INFO ] Deduced a trap composed of 4 places in 869 ms of which 1 ms to minimize.
[2022-05-15 05:16:19] [INFO ] Deduced a trap composed of 4 places in 837 ms of which 0 ms to minimize.
[2022-05-15 05:16:20] [INFO ] Deduced a trap composed of 6 places in 826 ms of which 1 ms to minimize.
[2022-05-15 05:16:21] [INFO ] Deduced a trap composed of 4 places in 827 ms of which 0 ms to minimize.
[2022-05-15 05:16:22] [INFO ] Deduced a trap composed of 4 places in 840 ms of which 0 ms to minimize.
[2022-05-15 05:16:23] [INFO ] Deduced a trap composed of 4 places in 748 ms of which 1 ms to minimize.
[2022-05-15 05:16:23] [INFO ] Deduced a trap composed of 4 places in 740 ms of which 1 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 818 ms of which 1 ms to minimize.
[2022-05-15 05:16:25] [INFO ] Deduced a trap composed of 4 places in 791 ms of which 0 ms to minimize.
[2022-05-15 05:16:26] [INFO ] Deduced a trap composed of 6 places in 769 ms of which 1 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 773 ms of which 2 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 755 ms of which 0 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 743 ms of which 1 ms to minimize.
[2022-05-15 05:16:29] [INFO ] Deduced a trap composed of 4 places in 746 ms of which 1 ms to minimize.
[2022-05-15 05:16:30] [INFO ] Deduced a trap composed of 6 places in 719 ms of which 0 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 673 ms of which 9 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 720 ms of which 1 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 713 ms of which 1 ms to minimize.
[2022-05-15 05:16:33] [INFO ] Deduced a trap composed of 4 places in 707 ms of which 1 ms to minimize.
[2022-05-15 05:16:33] [INFO ] Deduced a trap composed of 4 places in 633 ms of which 0 ms to minimize.
[2022-05-15 05:16:34] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 0 ms to minimize.
[2022-05-15 05:16:35] [INFO ] Deduced a trap composed of 4 places in 673 ms of which 1 ms to minimize.
[2022-05-15 05:16:36] [INFO ] Deduced a trap composed of 4 places in 633 ms of which 4 ms to minimize.
[2022-05-15 05:16:36] [INFO ] Deduced a trap composed of 4 places in 677 ms of which 11 ms to minimize.
[2022-05-15 05:16:36] [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-15 05:16:36] [INFO ] [Real]Absence check using 400 positive place invariants in 66 ms returned sat
[2022-05-15 05:16:37] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 30 ms returned sat
[2022-05-15 05:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:16:37] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2022-05-15 05:16:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:16:37] [INFO ] [Nat]Absence check using 400 positive place invariants in 69 ms returned sat
[2022-05-15 05:16:37] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 31 ms returned sat
[2022-05-15 05:16:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:16:37] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2022-05-15 05:16:37] [INFO ] [Nat]Added 200 Read/Feed constraints in 108 ms returned sat
[2022-05-15 05:16:39] [INFO ] Deduced a trap composed of 4 places in 1050 ms of which 0 ms to minimize.
[2022-05-15 05:16:40] [INFO ] Deduced a trap composed of 4 places in 948 ms of which 1 ms to minimize.
[2022-05-15 05:16:41] [INFO ] Deduced a trap composed of 4 places in 1041 ms of which 3 ms to minimize.
[2022-05-15 05:16:42] [INFO ] Deduced a trap composed of 4 places in 963 ms of which 0 ms to minimize.
[2022-05-15 05:16:43] [INFO ] Deduced a trap composed of 4 places in 919 ms of which 1 ms to minimize.
[2022-05-15 05:16:44] [INFO ] Deduced a trap composed of 6 places in 895 ms of which 1 ms to minimize.
[2022-05-15 05:16:44] [INFO ] Deduced a trap composed of 4 places in 884 ms of which 0 ms to minimize.
[2022-05-15 05:16:45] [INFO ] Deduced a trap composed of 4 places in 987 ms of which 1 ms to minimize.
[2022-05-15 05:16:46] [INFO ] Deduced a trap composed of 4 places in 881 ms of which 1 ms to minimize.
[2022-05-15 05:16:47] [INFO ] Deduced a trap composed of 6 places in 980 ms of which 1 ms to minimize.
[2022-05-15 05:16:48] [INFO ] Deduced a trap composed of 4 places in 937 ms of which 1 ms to minimize.
[2022-05-15 05:16:49] [INFO ] Deduced a trap composed of 4 places in 945 ms of which 1 ms to minimize.
[2022-05-15 05:16:50] [INFO ] Deduced a trap composed of 4 places in 939 ms of which 0 ms to minimize.
[2022-05-15 05:16:51] [INFO ] Deduced a trap composed of 4 places in 912 ms of which 1 ms to minimize.
[2022-05-15 05:16:52] [INFO ] Deduced a trap composed of 4 places in 900 ms of which 0 ms to minimize.
[2022-05-15 05:16:53] [INFO ] Deduced a trap composed of 4 places in 900 ms of which 0 ms to minimize.
[2022-05-15 05:16:54] [INFO ] Deduced a trap composed of 6 places in 789 ms of which 0 ms to minimize.
[2022-05-15 05:16:55] [INFO ] Deduced a trap composed of 4 places in 784 ms of which 0 ms to minimize.
[2022-05-15 05:16:56] [INFO ] Deduced a trap composed of 4 places in 780 ms of which 1 ms to minimize.
[2022-05-15 05:16:57] [INFO ] Deduced a trap composed of 4 places in 864 ms of which 0 ms to minimize.
[2022-05-15 05:16:57] [INFO ] Deduced a trap composed of 4 places in 856 ms of which 0 ms to minimize.
[2022-05-15 05:16:58] [INFO ] Deduced a trap composed of 4 places in 854 ms of which 0 ms to minimize.
[2022-05-15 05:16:59] [INFO ] Deduced a trap composed of 4 places in 831 ms of which 1 ms to minimize.
[2022-05-15 05:17:00] [INFO ] Deduced a trap composed of 4 places in 741 ms of which 0 ms to minimize.
[2022-05-15 05:17:01] [INFO ] Deduced a trap composed of 4 places in 742 ms of which 1 ms to minimize.
[2022-05-15 05:17:02] [INFO ] Deduced a trap composed of 4 places in 736 ms of which 0 ms to minimize.
[2022-05-15 05:17:02] [INFO ] Deduced a trap composed of 4 places in 730 ms of which 0 ms to minimize.
[2022-05-15 05:17:03] [INFO ] Deduced a trap composed of 4 places in 796 ms of which 1 ms to minimize.
[2022-05-15 05:17:04] [INFO ] Deduced a trap composed of 4 places in 714 ms of which 0 ms to minimize.
[2022-05-15 05:17:05] [INFO ] Deduced a trap composed of 4 places in 711 ms of which 1 ms to minimize.
[2022-05-15 05:17:05] [INFO ] Deduced a trap composed of 4 places in 695 ms of which 0 ms to minimize.
[2022-05-15 05:17:06] [INFO ] Deduced a trap composed of 4 places in 747 ms of which 0 ms to minimize.
[2022-05-15 05:17:07] [INFO ] Deduced a trap composed of 4 places in 675 ms of which 0 ms to minimize.
[2022-05-15 05:17:08] [INFO ] Deduced a trap composed of 4 places in 679 ms of which 1 ms to minimize.
[2022-05-15 05:17:08] [INFO ] Deduced a trap composed of 4 places in 694 ms of which 1 ms to minimize.
[2022-05-15 05:17:09] [INFO ] Deduced a trap composed of 4 places in 766 ms of which 1 ms to minimize.
[2022-05-15 05:17:10] [INFO ] Deduced a trap composed of 4 places in 704 ms of which 0 ms to minimize.
[2022-05-15 05:17:11] [INFO ] Deduced a trap composed of 4 places in 786 ms of which 0 ms to minimize.
[2022-05-15 05:17:11] [INFO ] Deduced a trap composed of 4 places in 745 ms of which 0 ms to minimize.
[2022-05-15 05:17:12] [INFO ] Deduced a trap composed of 4 places in 746 ms of which 1 ms to minimize.
[2022-05-15 05:17:13] [INFO ] Deduced a trap composed of 4 places in 713 ms of which 0 ms to minimize.
[2022-05-15 05:17:14] [INFO ] Deduced a trap composed of 4 places in 731 ms of which 0 ms to minimize.
[2022-05-15 05:17:14] [INFO ] Deduced a trap composed of 4 places in 695 ms of which 0 ms to minimize.
[2022-05-15 05:17:15] [INFO ] Deduced a trap composed of 4 places in 706 ms of which 0 ms to minimize.
[2022-05-15 05:17:16] [INFO ] Deduced a trap composed of 4 places in 694 ms of which 0 ms to minimize.
[2022-05-15 05:17:17] [INFO ] Deduced a trap composed of 4 places in 714 ms of which 1 ms to minimize.
[2022-05-15 05:17:17] [INFO ] Deduced a trap composed of 4 places in 641 ms of which 0 ms to minimize.
[2022-05-15 05:17:18] [INFO ] Deduced a trap composed of 4 places in 692 ms of which 0 ms to minimize.
[2022-05-15 05:17:19] [INFO ] Deduced a trap composed of 4 places in 669 ms of which 0 ms to minimize.
[2022-05-15 05:17:20] [INFO ] Deduced a trap composed of 4 places in 659 ms of which 0 ms to minimize.
[2022-05-15 05:17:20] [INFO ] Deduced a trap composed of 4 places in 645 ms of which 1 ms to minimize.
[2022-05-15 05:17:21] [INFO ] Deduced a trap composed of 4 places in 687 ms of which 0 ms to minimize.
[2022-05-15 05:17:22] [INFO ] Deduced a trap composed of 4 places in 625 ms of which 0 ms to minimize.
[2022-05-15 05:17:22] [INFO ] Deduced a trap composed of 4 places in 633 ms of which 0 ms to minimize.
[2022-05-15 05:17:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-15 05:17:22] [INFO ] [Real]Absence check using 400 positive place invariants in 69 ms returned sat
[2022-05-15 05:17:22] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 32 ms returned sat
[2022-05-15 05:17:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:17:23] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2022-05-15 05:17:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:17:23] [INFO ] [Nat]Absence check using 400 positive place invariants in 70 ms returned sat
[2022-05-15 05:17:23] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 30 ms returned sat
[2022-05-15 05:17:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:17:23] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2022-05-15 05:17:23] [INFO ] [Nat]Added 200 Read/Feed constraints in 108 ms returned sat
[2022-05-15 05:17:25] [INFO ] Deduced a trap composed of 4 places in 1044 ms of which 0 ms to minimize.
[2022-05-15 05:17:26] [INFO ] Deduced a trap composed of 4 places in 1020 ms of which 0 ms to minimize.
[2022-05-15 05:17:27] [INFO ] Deduced a trap composed of 4 places in 929 ms of which 0 ms to minimize.
[2022-05-15 05:17:28] [INFO ] Deduced a trap composed of 4 places in 933 ms of which 1 ms to minimize.
[2022-05-15 05:17:29] [INFO ] Deduced a trap composed of 4 places in 995 ms of which 1 ms to minimize.
[2022-05-15 05:17:29] [INFO ] Deduced a trap composed of 6 places in 881 ms of which 1 ms to minimize.
[2022-05-15 05:17:30] [INFO ] Deduced a trap composed of 4 places in 896 ms of which 1 ms to minimize.
[2022-05-15 05:17:31] [INFO ] Deduced a trap composed of 4 places in 883 ms of which 0 ms to minimize.
[2022-05-15 05:17:32] [INFO ] Deduced a trap composed of 4 places in 970 ms of which 1 ms to minimize.
[2022-05-15 05:17:33] [INFO ] Deduced a trap composed of 6 places in 860 ms of which 0 ms to minimize.
[2022-05-15 05:17:34] [INFO ] Deduced a trap composed of 4 places in 861 ms of which 0 ms to minimize.
[2022-05-15 05:17:35] [INFO ] Deduced a trap composed of 4 places in 851 ms of which 1 ms to minimize.
[2022-05-15 05:17:36] [INFO ] Deduced a trap composed of 4 places in 910 ms of which 0 ms to minimize.
[2022-05-15 05:17:37] [INFO ] Deduced a trap composed of 4 places in 835 ms of which 0 ms to minimize.
[2022-05-15 05:17:38] [INFO ] Deduced a trap composed of 4 places in 896 ms of which 0 ms to minimize.
[2022-05-15 05:17:39] [INFO ] Deduced a trap composed of 4 places in 818 ms of which 0 ms to minimize.
[2022-05-15 05:17:39] [INFO ] Deduced a trap composed of 6 places in 790 ms of which 0 ms to minimize.
[2022-05-15 05:17:40] [INFO ] Deduced a trap composed of 4 places in 866 ms of which 1 ms to minimize.
[2022-05-15 05:17:41] [INFO ] Deduced a trap composed of 4 places in 777 ms of which 1 ms to minimize.
[2022-05-15 05:17:42] [INFO ] Deduced a trap composed of 4 places in 769 ms of which 0 ms to minimize.
[2022-05-15 05:17:43] [INFO ] Deduced a trap composed of 4 places in 777 ms of which 0 ms to minimize.
[2022-05-15 05:17:44] [INFO ] Deduced a trap composed of 4 places in 836 ms of which 0 ms to minimize.
[2022-05-15 05:17:45] [INFO ] Deduced a trap composed of 4 places in 780 ms of which 1 ms to minimize.
[2022-05-15 05:17:45] [INFO ] Deduced a trap composed of 4 places in 818 ms of which 0 ms to minimize.
[2022-05-15 05:17:46] [INFO ] Deduced a trap composed of 4 places in 757 ms of which 0 ms to minimize.
[2022-05-15 05:17:47] [INFO ] Deduced a trap composed of 4 places in 811 ms of which 1 ms to minimize.
[2022-05-15 05:17:48] [INFO ] Deduced a trap composed of 4 places in 803 ms of which 1 ms to minimize.
[2022-05-15 05:17:49] [INFO ] Deduced a trap composed of 4 places in 800 ms of which 0 ms to minimize.
[2022-05-15 05:17:50] [INFO ] Deduced a trap composed of 4 places in 796 ms of which 1 ms to minimize.
[2022-05-15 05:17:50] [INFO ] Deduced a trap composed of 4 places in 766 ms of which 1 ms to minimize.
[2022-05-15 05:17:51] [INFO ] Deduced a trap composed of 4 places in 757 ms of which 1 ms to minimize.
[2022-05-15 05:17:52] [INFO ] Deduced a trap composed of 4 places in 738 ms of which 0 ms to minimize.
[2022-05-15 05:17:53] [INFO ] Deduced a trap composed of 4 places in 742 ms of which 0 ms to minimize.
[2022-05-15 05:17:53] [INFO ] Deduced a trap composed of 4 places in 751 ms of which 0 ms to minimize.
[2022-05-15 05:17:54] [INFO ] Deduced a trap composed of 4 places in 737 ms of which 0 ms to minimize.
[2022-05-15 05:17:55] [INFO ] Deduced a trap composed of 4 places in 742 ms of which 0 ms to minimize.
[2022-05-15 05:17:56] [INFO ] Deduced a trap composed of 4 places in 751 ms of which 0 ms to minimize.
[2022-05-15 05:17:57] [INFO ] Deduced a trap composed of 4 places in 738 ms of which 0 ms to minimize.
[2022-05-15 05:17:57] [INFO ] Deduced a trap composed of 4 places in 730 ms of which 1 ms to minimize.
[2022-05-15 05:17:58] [INFO ] Deduced a trap composed of 4 places in 713 ms of which 0 ms to minimize.
[2022-05-15 05:17:59] [INFO ] Deduced a trap composed of 4 places in 747 ms of which 0 ms to minimize.
[2022-05-15 05:18:00] [INFO ] Deduced a trap composed of 4 places in 747 ms of which 0 ms to minimize.
[2022-05-15 05:18:00] [INFO ] Deduced a trap composed of 4 places in 711 ms of which 0 ms to minimize.
[2022-05-15 05:18:01] [INFO ] Deduced a trap composed of 4 places in 738 ms of which 1 ms to minimize.
[2022-05-15 05:18:02] [INFO ] Deduced a trap composed of 4 places in 740 ms of which 0 ms to minimize.
[2022-05-15 05:18:03] [INFO ] Deduced a trap composed of 4 places in 763 ms of which 1 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 719 ms of which 1 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 724 ms of which 1 ms to minimize.
[2022-05-15 05:18:05] [INFO ] Deduced a trap composed of 4 places in 720 ms of which 0 ms to minimize.
[2022-05-15 05:18:06] [INFO ] Deduced a trap composed of 4 places in 729 ms of which 1 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 767 ms of which 0 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 696 ms of which 1 ms to minimize.
[2022-05-15 05:18:08] [INFO ] Deduced a trap composed of 4 places in 720 ms of which 0 ms to minimize.
[2022-05-15 05:18: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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1488 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 40400/40400 transitions.
Starting structural reductions, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1159 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-05-15 05:18:11] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2022-05-15 05:18:11] [INFO ] Computed 600 place invariants in 8 ms
[2022-05-15 05:18:41] [INFO ] Performed 950/1000 implicitness test of which 184 returned IMPLICIT in 30 seconds.
[2022-05-15 05:18:41] [INFO ] Implicit Places using invariants in 30446 ms returned [400, 403, 406, 409, 412, 415, 418, 421, 424, 427, 430, 433, 436, 439, 442, 445, 448, 451, 454, 457, 460, 463, 466, 469, 472, 475, 478, 481, 484, 487, 490, 493, 496, 499, 502, 505, 508, 511, 514, 517, 520, 523, 526, 529, 532, 535, 538, 541, 544, 547, 550, 553, 556, 559, 562, 565, 568, 571, 574, 577, 580, 583, 586, 589, 592, 595, 598, 601, 604, 607, 610, 613, 616, 619, 622, 625, 628, 631, 634, 637, 640, 643, 646, 649, 652, 655, 658, 661, 664, 667, 670, 673, 676, 679, 682, 685, 688, 691, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 733, 736, 739, 742, 745, 748, 751, 754, 757, 760, 763, 766, 769, 772, 775, 778, 781, 784, 787, 790, 793, 796, 799, 802, 805, 808, 811, 814, 817, 820, 823, 826, 829, 832, 835, 838, 841, 844, 847, 850, 853, 856, 859, 862, 865, 868, 871, 874, 877, 880, 883, 886, 889, 892, 895, 898, 901, 904, 907, 910, 913, 916, 919, 922, 925, 928, 931, 934, 937, 940, 943, 946, 949, 952, 955, 958, 961, 964, 967, 970, 973, 976, 979, 982, 985, 988, 991, 994, 997]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 30484 ms to find 200 implicit places.
[2022-05-15 05:18:41] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2022-05-15 05:18:41] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-15 05:18:55] [INFO ] Dead Transitions using invariants and state equation in 13583 ms returned []
Starting structural reductions, iteration 1 : 800/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 973 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-05-15 05:18:56] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2022-05-15 05:18:56] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-15 05:19:10] [INFO ] Dead Transitions using invariants and state equation in 13745 ms returned []
Finished structural reductions, in 2 iterations. Remains : 800/1000 places, 40400/40400 transitions.
Normalized transition count is 800 out of 40400 initially.
// Phase 1: matrix 800 rows 800 cols
[2022-05-15 05:19:10] [INFO ] Computed 400 place invariants in 12 ms
Interrupted random walk after 538311 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4929 ms. (steps per millisecond=202 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4989 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4887 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
[2022-05-15 05:19:54] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2022-05-15 05:19:54] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-15 05:19:55] [INFO ] [Real]Absence check using 400 positive place invariants in 57 ms returned sat
[2022-05-15 05:19:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:19:55] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2022-05-15 05:19:55] [INFO ] State equation strengthened by 200 read => feed constraints.
[2022-05-15 05:19:55] [INFO ] [Real]Added 200 Read/Feed constraints in 139 ms returned sat
[2022-05-15 05:19:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:19:55] [INFO ] [Nat]Absence check using 400 positive place invariants in 62 ms returned sat
[2022-05-15 05:19:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:19:56] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2022-05-15 05:19:56] [INFO ] [Nat]Added 200 Read/Feed constraints in 109 ms returned sat
[2022-05-15 05:19:56] [INFO ] Deduced a trap composed of 4 places in 668 ms of which 0 ms to minimize.
[2022-05-15 05:19:57] [INFO ] Deduced a trap composed of 4 places in 642 ms of which 1 ms to minimize.
[2022-05-15 05:19:58] [INFO ] Deduced a trap composed of 4 places in 689 ms of which 0 ms to minimize.
[2022-05-15 05:19:59] [INFO ] Deduced a trap composed of 4 places in 691 ms of which 1 ms to minimize.
[2022-05-15 05:19:59] [INFO ] Deduced a trap composed of 4 places in 665 ms of which 1 ms to minimize.
[2022-05-15 05:20:00] [INFO ] Deduced a trap composed of 4 places in 671 ms of which 1 ms to minimize.
[2022-05-15 05:20:01] [INFO ] Deduced a trap composed of 4 places in 647 ms of which 0 ms to minimize.
[2022-05-15 05:20:01] [INFO ] Deduced a trap composed of 4 places in 634 ms of which 0 ms to minimize.
[2022-05-15 05:20:02] [INFO ] Deduced a trap composed of 4 places in 614 ms of which 1 ms to minimize.
[2022-05-15 05:20:03] [INFO ] Deduced a trap composed of 4 places in 654 ms of which 19 ms to minimize.
[2022-05-15 05:20:03] [INFO ] Deduced a trap composed of 4 places in 584 ms of which 0 ms to minimize.
[2022-05-15 05:20:04] [INFO ] Deduced a trap composed of 4 places in 567 ms of which 0 ms to minimize.
[2022-05-15 05:20:04] [INFO ] Deduced a trap composed of 4 places in 566 ms of which 1 ms to minimize.
[2022-05-15 05:20:05] [INFO ] Deduced a trap composed of 4 places in 559 ms of which 0 ms to minimize.
[2022-05-15 05:20:06] [INFO ] Deduced a trap composed of 4 places in 539 ms of which 0 ms to minimize.
[2022-05-15 05:20:06] [INFO ] Deduced a trap composed of 4 places in 538 ms of which 0 ms to minimize.
[2022-05-15 05:20:07] [INFO ] Deduced a trap composed of 4 places in 528 ms of which 1 ms to minimize.
[2022-05-15 05:20:07] [INFO ] Deduced a trap composed of 4 places in 519 ms of which 0 ms to minimize.
[2022-05-15 05:20:08] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 0 ms to minimize.
[2022-05-15 05:20:08] [INFO ] Deduced a trap composed of 4 places in 523 ms of which 1 ms to minimize.
[2022-05-15 05:20:09] [INFO ] Deduced a trap composed of 4 places in 483 ms of which 0 ms to minimize.
[2022-05-15 05:20:09] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 0 ms to minimize.
[2022-05-15 05:20:10] [INFO ] Deduced a trap composed of 4 places in 474 ms of which 0 ms to minimize.
[2022-05-15 05:20:10] [INFO ] Deduced a trap composed of 4 places in 462 ms of which 0 ms to minimize.
[2022-05-15 05:20:11] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 0 ms to minimize.
[2022-05-15 05:20:11] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 1 ms to minimize.
[2022-05-15 05:20:12] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 0 ms to minimize.
[2022-05-15 05:20:12] [INFO ] Deduced a trap composed of 4 places in 431 ms of which 0 ms to minimize.
[2022-05-15 05:20:13] [INFO ] Deduced a trap composed of 4 places in 419 ms of which 1 ms to minimize.
[2022-05-15 05:20:13] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 0 ms to minimize.
[2022-05-15 05:20:14] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 0 ms to minimize.
[2022-05-15 05:20:14] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 0 ms to minimize.
[2022-05-15 05:20:15] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 0 ms to minimize.
[2022-05-15 05:20:15] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 1 ms to minimize.
[2022-05-15 05:20:15] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 0 ms to minimize.
[2022-05-15 05:20:16] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 0 ms to minimize.
[2022-05-15 05:20:16] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 1 ms to minimize.
[2022-05-15 05:20:17] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 0 ms to minimize.
[2022-05-15 05:20:17] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 0 ms to minimize.
[2022-05-15 05:20:18] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 0 ms to minimize.
[2022-05-15 05:20:18] [INFO ] Deduced a trap composed of 4 places in 425 ms of which 0 ms to minimize.
[2022-05-15 05:20:18] [INFO ] Deduced a trap composed of 4 places in 427 ms of which 0 ms to minimize.
[2022-05-15 05:20:19] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 0 ms to minimize.
[2022-05-15 05:20:19] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 0 ms to minimize.
[2022-05-15 05:20:20] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 1 ms to minimize.
[2022-05-15 05:20:20] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 0 ms to minimize.
[2022-05-15 05:20:21] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 0 ms to minimize.
[2022-05-15 05:20:21] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 0 ms to minimize.
[2022-05-15 05:20:22] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 0 ms to minimize.
[2022-05-15 05:20:22] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 0 ms to minimize.
[2022-05-15 05:20:23] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 0 ms to minimize.
[2022-05-15 05:20:23] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 0 ms to minimize.
[2022-05-15 05:20:23] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 1 ms to minimize.
[2022-05-15 05:20:24] [INFO ] Deduced a trap composed of 4 places in 397 ms of which 1 ms to minimize.
[2022-05-15 05:20:24] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 0 ms to minimize.
[2022-05-15 05:20:25] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 1 ms to minimize.
[2022-05-15 05:20:25] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 0 ms to minimize.
[2022-05-15 05:20:26] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 0 ms to minimize.
[2022-05-15 05:20:26] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 1 ms to minimize.
[2022-05-15 05:20:26] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 0 ms to minimize.
[2022-05-15 05:20:27] [INFO ] Deduced a trap composed of 4 places in 425 ms of which 2 ms to minimize.
[2022-05-15 05:20:27] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 0 ms to minimize.
[2022-05-15 05:20:28] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 0 ms to minimize.
[2022-05-15 05:20:28] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 0 ms to minimize.
[2022-05-15 05:20:29] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 0 ms to minimize.
[2022-05-15 05:20:29] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 0 ms to minimize.
[2022-05-15 05:20:29] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 0 ms to minimize.
[2022-05-15 05:20:30] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 0 ms to minimize.
[2022-05-15 05:20:30] [INFO ] Deduced a trap composed of 4 places in 420 ms of which 0 ms to minimize.
[2022-05-15 05:20:31] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 1 ms to minimize.
[2022-05-15 05:20:31] [INFO ] Deduced a trap composed of 4 places in 401 ms of which 0 ms to minimize.
[2022-05-15 05:20:32] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 0 ms to minimize.
[2022-05-15 05:20:32] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 1 ms to minimize.
[2022-05-15 05:20:33] [INFO ] Deduced a trap composed of 4 places in 420 ms of which 0 ms to minimize.
[2022-05-15 05:20:33] [INFO ] Deduced a trap composed of 4 places in 425 ms of which 1 ms to minimize.
[2022-05-15 05:20:34] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 0 ms to minimize.
[2022-05-15 05:20:34] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 17 ms to minimize.
[2022-05-15 05:20:34] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 15 ms to minimize.
[2022-05-15 05:20:35] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 4 ms to minimize.
[2022-05-15 05:20:35] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 12 ms to minimize.
[2022-05-15 05:20:36] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 1 ms to minimize.
[2022-05-15 05:20:36] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 1 ms to minimize.
[2022-05-15 05:20:37] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 0 ms to minimize.
[2022-05-15 05:20:37] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 1 ms to minimize.
[2022-05-15 05:20:37] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 3 ms to minimize.
[2022-05-15 05:20:38] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 1 ms to minimize.
[2022-05-15 05:20:38] [INFO ] Deduced a trap composed of 4 places in 397 ms of which 0 ms to minimize.
[2022-05-15 05:20:39] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 0 ms to minimize.
[2022-05-15 05:20:39] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 1 ms to minimize.
[2022-05-15 05:20:40] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 0 ms to minimize.
[2022-05-15 05:20:40] [INFO ] Deduced a trap composed of 4 places in 398 ms of which 0 ms to minimize.
[2022-05-15 05:20:40] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 1 ms to minimize.
[2022-05-15 05:20:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-15 05:20:41] [INFO ] [Real]Absence check using 400 positive place invariants in 59 ms returned sat
[2022-05-15 05:20:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:20:41] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2022-05-15 05:20:41] [INFO ] [Real]Added 200 Read/Feed constraints in 111 ms returned sat
[2022-05-15 05:20:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:20:41] [INFO ] [Nat]Absence check using 400 positive place invariants in 59 ms returned sat
[2022-05-15 05:20:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:20:41] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2022-05-15 05:20:42] [INFO ] [Nat]Added 200 Read/Feed constraints in 107 ms returned sat
[2022-05-15 05:20:42] [INFO ] Deduced a trap composed of 4 places in 717 ms of which 0 ms to minimize.
[2022-05-15 05:20:43] [INFO ] Deduced a trap composed of 4 places in 686 ms of which 1 ms to minimize.
[2022-05-15 05:20:44] [INFO ] Deduced a trap composed of 4 places in 683 ms of which 0 ms to minimize.
[2022-05-15 05:20:44] [INFO ] Deduced a trap composed of 4 places in 711 ms of which 0 ms to minimize.
[2022-05-15 05:20:45] [INFO ] Deduced a trap composed of 4 places in 675 ms of which 0 ms to minimize.
[2022-05-15 05:20:46] [INFO ] Deduced a trap composed of 4 places in 649 ms of which 0 ms to minimize.
[2022-05-15 05:20:47] [INFO ] Deduced a trap composed of 4 places in 660 ms of which 1 ms to minimize.
[2022-05-15 05:20:47] [INFO ] Deduced a trap composed of 4 places in 642 ms of which 0 ms to minimize.
[2022-05-15 05:20:48] [INFO ] Deduced a trap composed of 4 places in 634 ms of which 0 ms to minimize.
[2022-05-15 05:20:49] [INFO ] Deduced a trap composed of 4 places in 630 ms of which 1 ms to minimize.
[2022-05-15 05:20:49] [INFO ] Deduced a trap composed of 4 places in 608 ms of which 0 ms to minimize.
[2022-05-15 05:20:50] [INFO ] Deduced a trap composed of 4 places in 589 ms of which 1 ms to minimize.
[2022-05-15 05:20:50] [INFO ] Deduced a trap composed of 4 places in 574 ms of which 0 ms to minimize.
[2022-05-15 05:20:51] [INFO ] Deduced a trap composed of 4 places in 566 ms of which 0 ms to minimize.
[2022-05-15 05:20:52] [INFO ] Deduced a trap composed of 4 places in 562 ms of which 1 ms to minimize.
[2022-05-15 05:20:52] [INFO ] Deduced a trap composed of 4 places in 594 ms of which 0 ms to minimize.
[2022-05-15 05:20:53] [INFO ] Deduced a trap composed of 4 places in 572 ms of which 1 ms to minimize.
[2022-05-15 05:20:53] [INFO ] Deduced a trap composed of 4 places in 533 ms of which 0 ms to minimize.
[2022-05-15 05:20:54] [INFO ] Deduced a trap composed of 4 places in 519 ms of which 0 ms to minimize.
[2022-05-15 05:20:55] [INFO ] Deduced a trap composed of 4 places in 571 ms of which 1 ms to minimize.
[2022-05-15 05:20:55] [INFO ] Deduced a trap composed of 4 places in 525 ms of which 0 ms to minimize.
[2022-05-15 05:20:56] [INFO ] Deduced a trap composed of 4 places in 517 ms of which 1 ms to minimize.
[2022-05-15 05:20:56] [INFO ] Deduced a trap composed of 4 places in 518 ms of which 1 ms to minimize.
[2022-05-15 05:20:57] [INFO ] Deduced a trap composed of 4 places in 522 ms of which 1 ms to minimize.
[2022-05-15 05:20:57] [INFO ] Deduced a trap composed of 4 places in 485 ms of which 0 ms to minimize.
[2022-05-15 05:20:58] [INFO ] Deduced a trap composed of 4 places in 511 ms of which 1 ms to minimize.
[2022-05-15 05:20:58] [INFO ] Deduced a trap composed of 4 places in 469 ms of which 0 ms to minimize.
[2022-05-15 05:20:59] [INFO ] Deduced a trap composed of 4 places in 477 ms of which 1 ms to minimize.
[2022-05-15 05:20:59] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 0 ms to minimize.
[2022-05-15 05:21:00] [INFO ] Deduced a trap composed of 4 places in 467 ms of which 1 ms to minimize.
[2022-05-15 05:21:00] [INFO ] Deduced a trap composed of 4 places in 433 ms of which 1 ms to minimize.
[2022-05-15 05:21:01] [INFO ] Deduced a trap composed of 4 places in 487 ms of which 0 ms to minimize.
[2022-05-15 05:21:01] [INFO ] Deduced a trap composed of 4 places in 449 ms of which 0 ms to minimize.
[2022-05-15 05:21:02] [INFO ] Deduced a trap composed of 4 places in 445 ms of which 0 ms to minimize.
[2022-05-15 05:21:02] [INFO ] Deduced a trap composed of 4 places in 419 ms of which 0 ms to minimize.
[2022-05-15 05:21:03] [INFO ] Deduced a trap composed of 4 places in 422 ms of which 0 ms to minimize.
[2022-05-15 05:21:03] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 0 ms to minimize.
[2022-05-15 05:21:04] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 0 ms to minimize.
[2022-05-15 05:21:04] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 0 ms to minimize.
[2022-05-15 05:21:04] [INFO ] Deduced a trap composed of 4 places in 437 ms of which 0 ms to minimize.
[2022-05-15 05:21:05] [INFO ] Deduced a trap composed of 4 places in 428 ms of which 0 ms to minimize.
[2022-05-15 05:21:05] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 1 ms to minimize.
[2022-05-15 05:21:06] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 0 ms to minimize.
[2022-05-15 05:21:06] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 0 ms to minimize.
[2022-05-15 05:21:07] [INFO ] Deduced a trap composed of 4 places in 456 ms of which 0 ms to minimize.
[2022-05-15 05:21:07] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 1 ms to minimize.
[2022-05-15 05:21:08] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 0 ms to minimize.
[2022-05-15 05:21:08] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 0 ms to minimize.
[2022-05-15 05:21:09] [INFO ] Deduced a trap composed of 4 places in 425 ms of which 1 ms to minimize.
[2022-05-15 05:21:09] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 1 ms to minimize.
[2022-05-15 05:21:10] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 0 ms to minimize.
[2022-05-15 05:21:10] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 0 ms to minimize.
[2022-05-15 05:21:11] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 0 ms to minimize.
[2022-05-15 05:21:11] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 0 ms to minimize.
[2022-05-15 05:21:11] [INFO ] Deduced a trap composed of 4 places in 431 ms of which 0 ms to minimize.
[2022-05-15 05:21:12] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 0 ms to minimize.
[2022-05-15 05:21:12] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 0 ms to minimize.
[2022-05-15 05:21:13] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 1 ms to minimize.
[2022-05-15 05:21:13] [INFO ] Deduced a trap composed of 4 places in 467 ms of which 0 ms to minimize.
[2022-05-15 05:21:14] [INFO ] Deduced a trap composed of 4 places in 466 ms of which 1 ms to minimize.
[2022-05-15 05:21:14] [INFO ] Deduced a trap composed of 4 places in 449 ms of which 1 ms to minimize.
[2022-05-15 05:21:15] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 0 ms to minimize.
[2022-05-15 05:21:15] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 0 ms to minimize.
[2022-05-15 05:21:16] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 1 ms to minimize.
[2022-05-15 05:21:16] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 0 ms to minimize.
[2022-05-15 05:21:17] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 1 ms to minimize.
[2022-05-15 05:21:17] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 0 ms to minimize.
[2022-05-15 05:21:18] [INFO ] Deduced a trap composed of 4 places in 404 ms of which 0 ms to minimize.
[2022-05-15 05:21:18] [INFO ] Deduced a trap composed of 4 places in 433 ms of which 1 ms to minimize.
[2022-05-15 05:21:19] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 0 ms to minimize.
[2022-05-15 05:21:19] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 0 ms to minimize.
[2022-05-15 05:21:19] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 0 ms to minimize.
[2022-05-15 05:21:20] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 1 ms to minimize.
[2022-05-15 05:21:20] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 1 ms to minimize.
[2022-05-15 05:21:21] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 1 ms to minimize.
[2022-05-15 05:21:21] [INFO ] Deduced a trap composed of 4 places in 445 ms of which 0 ms to minimize.
[2022-05-15 05:21:22] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 0 ms to minimize.
[2022-05-15 05:21:22] [INFO ] Deduced a trap composed of 4 places in 427 ms of which 0 ms to minimize.
[2022-05-15 05:21:23] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 1 ms to minimize.
[2022-05-15 05:21:23] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 0 ms to minimize.
[2022-05-15 05:21:24] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 1 ms to minimize.
[2022-05-15 05:21:24] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 0 ms to minimize.
[2022-05-15 05:21:25] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 0 ms to minimize.
[2022-05-15 05:21:25] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 0 ms to minimize.
[2022-05-15 05:21:25] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 0 ms to minimize.
[2022-05-15 05:21:26] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 0 ms to minimize.
[2022-05-15 05:21:26] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 1 ms to minimize.
[2022-05-15 05:21:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-15 05:21:26] [INFO ] [Real]Absence check using 400 positive place invariants in 61 ms returned sat
[2022-05-15 05:21:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:27] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2022-05-15 05:21:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:21:27] [INFO ] [Nat]Absence check using 400 positive place invariants in 80 ms returned sat
[2022-05-15 05:21:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:27] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2022-05-15 05:21:27] [INFO ] [Nat]Added 200 Read/Feed constraints in 106 ms returned sat
[2022-05-15 05:21:28] [INFO ] Deduced a trap composed of 4 places in 717 ms of which 1 ms to minimize.
[2022-05-15 05:21:29] [INFO ] Deduced a trap composed of 4 places in 776 ms of which 0 ms to minimize.
[2022-05-15 05:21:29] [INFO ] Deduced a trap composed of 4 places in 727 ms of which 1 ms to minimize.
[2022-05-15 05:21:30] [INFO ] Deduced a trap composed of 4 places in 688 ms of which 1 ms to minimize.
[2022-05-15 05:21:31] [INFO ] Deduced a trap composed of 4 places in 692 ms of which 0 ms to minimize.
[2022-05-15 05:21:32] [INFO ] Deduced a trap composed of 4 places in 683 ms of which 0 ms to minimize.
[2022-05-15 05:21:32] [INFO ] Deduced a trap composed of 4 places in 731 ms of which 1 ms to minimize.
[2022-05-15 05:21:33] [INFO ] Deduced a trap composed of 4 places in 673 ms of which 1 ms to minimize.
[2022-05-15 05:21:34] [INFO ] Deduced a trap composed of 4 places in 703 ms of which 0 ms to minimize.
[2022-05-15 05:21:35] [INFO ] Deduced a trap composed of 4 places in 638 ms of which 0 ms to minimize.
[2022-05-15 05:21:35] [INFO ] Deduced a trap composed of 4 places in 641 ms of which 0 ms to minimize.
[2022-05-15 05:21:36] [INFO ] Deduced a trap composed of 4 places in 712 ms of which 0 ms to minimize.
[2022-05-15 05:21:37] [INFO ] Deduced a trap composed of 4 places in 674 ms of which 1 ms to minimize.
[2022-05-15 05:21:37] [INFO ] Deduced a trap composed of 4 places in 658 ms of which 0 ms to minimize.
[2022-05-15 05:21:38] [INFO ] Deduced a trap composed of 4 places in 643 ms of which 0 ms to minimize.
[2022-05-15 05:21:39] [INFO ] Deduced a trap composed of 4 places in 643 ms of which 0 ms to minimize.
[2022-05-15 05:21:39] [INFO ] Deduced a trap composed of 4 places in 626 ms of which 0 ms to minimize.
[2022-05-15 05:21:40] [INFO ] Deduced a trap composed of 4 places in 559 ms of which 0 ms to minimize.
[2022-05-15 05:21:41] [INFO ] Deduced a trap composed of 4 places in 595 ms of which 1 ms to minimize.
[2022-05-15 05:21:41] [INFO ] Deduced a trap composed of 4 places in 582 ms of which 0 ms to minimize.
[2022-05-15 05:21:42] [INFO ] Deduced a trap composed of 4 places in 582 ms of which 0 ms to minimize.
[2022-05-15 05:21:42] [INFO ] Deduced a trap composed of 4 places in 567 ms of which 0 ms to minimize.
[2022-05-15 05:21:43] [INFO ] Deduced a trap composed of 4 places in 548 ms of which 0 ms to minimize.
[2022-05-15 05:21:44] [INFO ] Deduced a trap composed of 4 places in 557 ms of which 0 ms to minimize.
[2022-05-15 05:21:44] [INFO ] Deduced a trap composed of 4 places in 559 ms of which 0 ms to minimize.
[2022-05-15 05:21:45] [INFO ] Deduced a trap composed of 4 places in 551 ms of which 1 ms to minimize.
[2022-05-15 05:21:45] [INFO ] Deduced a trap composed of 4 places in 498 ms of which 1 ms to minimize.
[2022-05-15 05:21:46] [INFO ] Deduced a trap composed of 4 places in 501 ms of which 2 ms to minimize.
[2022-05-15 05:21:46] [INFO ] Deduced a trap composed of 4 places in 490 ms of which 0 ms to minimize.
[2022-05-15 05:21:47] [INFO ] Deduced a trap composed of 4 places in 478 ms of which 1 ms to minimize.
[2022-05-15 05:21:47] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 0 ms to minimize.
[2022-05-15 05:21:48] [INFO ] Deduced a trap composed of 4 places in 478 ms of which 1 ms to minimize.
[2022-05-15 05:21:48] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 0 ms to minimize.
[2022-05-15 05:21:49] [INFO ] Deduced a trap composed of 4 places in 433 ms of which 0 ms to minimize.
[2022-05-15 05:21:49] [INFO ] Deduced a trap composed of 4 places in 421 ms of which 0 ms to minimize.
[2022-05-15 05:21:50] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 1 ms to minimize.
[2022-05-15 05:21:50] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 0 ms to minimize.
[2022-05-15 05:21:51] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 0 ms to minimize.
[2022-05-15 05:21:51] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 1 ms to minimize.
[2022-05-15 05:21:52] [INFO ] Deduced a trap composed of 4 places in 412 ms of which 0 ms to minimize.
[2022-05-15 05:21:52] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 0 ms to minimize.
[2022-05-15 05:21:53] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 1 ms to minimize.
[2022-05-15 05:21:53] [INFO ] Deduced a trap composed of 4 places in 428 ms of which 0 ms to minimize.
[2022-05-15 05:21:54] [INFO ] Deduced a trap composed of 4 places in 469 ms of which 0 ms to minimize.
[2022-05-15 05:21:54] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 1 ms to minimize.
[2022-05-15 05:21:54] [INFO ] Deduced a trap composed of 4 places in 459 ms of which 0 ms to minimize.
[2022-05-15 05:21:55] [INFO ] Deduced a trap composed of 4 places in 510 ms of which 0 ms to minimize.
[2022-05-15 05:21:56] [INFO ] Deduced a trap composed of 4 places in 493 ms of which 1 ms to minimize.
[2022-05-15 05:21:56] [INFO ] Deduced a trap composed of 4 places in 482 ms of which 1 ms to minimize.
[2022-05-15 05:21:57] [INFO ] Deduced a trap composed of 4 places in 472 ms of which 0 ms to minimize.
[2022-05-15 05:21:57] [INFO ] Deduced a trap composed of 4 places in 451 ms of which 1 ms to minimize.
[2022-05-15 05:21:58] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 0 ms to minimize.
[2022-05-15 05:21:58] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 1 ms to minimize.
[2022-05-15 05:21:59] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 1 ms to minimize.
[2022-05-15 05:21:59] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 0 ms to minimize.
[2022-05-15 05:21:59] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 0 ms to minimize.
[2022-05-15 05:22:00] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 0 ms to minimize.
[2022-05-15 05:22:00] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 0 ms to minimize.
[2022-05-15 05:22:01] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 0 ms to minimize.
[2022-05-15 05:22:01] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 0 ms to minimize.
[2022-05-15 05:22:02] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 0 ms to minimize.
[2022-05-15 05:22:02] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 0 ms to minimize.
[2022-05-15 05:22:02] [INFO ] Deduced a trap composed of 4 places in 420 ms of which 0 ms to minimize.
[2022-05-15 05:22:03] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 1 ms to minimize.
[2022-05-15 05:22:03] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 0 ms to minimize.
[2022-05-15 05:22:04] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 0 ms to minimize.
[2022-05-15 05:22:04] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 0 ms to minimize.
[2022-05-15 05:22:05] [INFO ] Deduced a trap composed of 4 places in 408 ms of which 0 ms to minimize.
[2022-05-15 05:22:05] [INFO ] Deduced a trap composed of 4 places in 437 ms of which 1 ms to minimize.
[2022-05-15 05:22:06] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 1 ms to minimize.
[2022-05-15 05:22:06] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 1 ms to minimize.
[2022-05-15 05:22:06] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 0 ms to minimize.
[2022-05-15 05:22:07] [INFO ] Deduced a trap composed of 4 places in 408 ms of which 0 ms to minimize.
[2022-05-15 05:22:07] [INFO ] Deduced a trap composed of 4 places in 445 ms of which 0 ms to minimize.
[2022-05-15 05:22:08] [INFO ] Deduced a trap composed of 4 places in 437 ms of which 1 ms to minimize.
[2022-05-15 05:22:08] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 0 ms to minimize.
[2022-05-15 05:22:09] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 0 ms to minimize.
[2022-05-15 05:22:09] [INFO ] Deduced a trap composed of 4 places in 404 ms of which 1 ms to minimize.
[2022-05-15 05:22:10] [INFO ] Deduced a trap composed of 4 places in 428 ms of which 0 ms to minimize.
[2022-05-15 05:22:10] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 1 ms to minimize.
[2022-05-15 05:22:10] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 0 ms to minimize.
[2022-05-15 05:22:11] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 0 ms to minimize.
[2022-05-15 05:22:11] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 1 ms to minimize.
[2022-05-15 05:22:12] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 1 ms to minimize.
[2022-05-15 05:22:12] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 1 ms to minimize.
[2022-05-15 05:22:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 800 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 1028 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40400/40400 transitions.
Starting structural reductions, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 1098 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-05-15 05:22:14] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2022-05-15 05:22:14] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-15 05:22:20] [INFO ] Implicit Places using invariants in 6101 ms returned []
Implicit Place search using SMT only with invariants took 6106 ms to find 0 implicit places.
[2022-05-15 05:22:20] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2022-05-15 05:22:20] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-15 05:22:33] [INFO ] Dead Transitions using invariants and state equation in 12917 ms returned []
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40400/40400 transitions.
Starting property specific reduction for Dekker-PT-200-UpperBounds-05
Normalized transition count is 800 out of 40400 initially.
// Phase 1: matrix 800 rows 800 cols
[2022-05-15 05:22:33] [INFO ] Computed 400 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
[2022-05-15 05:22:34] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2022-05-15 05:22:34] [INFO ] Computed 400 place invariants in 7 ms
[2022-05-15 05:22:34] [INFO ] [Real]Absence check using 400 positive place invariants in 62 ms returned sat
[2022-05-15 05:22:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:22:34] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2022-05-15 05:22:34] [INFO ] State equation strengthened by 200 read => feed constraints.
[2022-05-15 05:22:35] [INFO ] [Real]Added 200 Read/Feed constraints in 130 ms returned sat
[2022-05-15 05:22:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:22:35] [INFO ] [Nat]Absence check using 400 positive place invariants in 63 ms returned sat
[2022-05-15 05:22:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:22:35] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2022-05-15 05:22:35] [INFO ] [Nat]Added 200 Read/Feed constraints in 122 ms returned sat
[2022-05-15 05:22:36] [INFO ] Deduced a trap composed of 4 places in 705 ms of which 1 ms to minimize.
[2022-05-15 05:22:37] [INFO ] Deduced a trap composed of 4 places in 696 ms of which 1 ms to minimize.
[2022-05-15 05:22:37] [INFO ] Deduced a trap composed of 4 places in 611 ms of which 0 ms to minimize.
[2022-05-15 05:22:38] [INFO ] Deduced a trap composed of 4 places in 606 ms of which 0 ms to minimize.
[2022-05-15 05:22:39] [INFO ] Deduced a trap composed of 4 places in 589 ms of which 0 ms to minimize.
[2022-05-15 05:22:39] [INFO ] Deduced a trap composed of 4 places in 575 ms of which 0 ms to minimize.
[2022-05-15 05:22:40] [INFO ] Deduced a trap composed of 4 places in 615 ms of which 1 ms to minimize.
[2022-05-15 05:22:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 800 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 800/800 places, 40399/40399 transitions.
Applied a total of 0 rules in 926 ms. Remains 800 /800 variables (removed 0) and now considering 40399/40399 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40399/40399 transitions.
Normalized transition count is 799 out of 40399 initially.
// Phase 1: matrix 799 rows 800 cols
[2022-05-15 05:22:41] [INFO ] Computed 400 place invariants in 20 ms
Interrupted random walk after 522593 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen :{}
Interrupted Best-First random walk after 974852 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=194 ) properties seen :{}
[2022-05-15 05:23:16] [INFO ] Flow matrix only has 799 transitions (discarded 39600 similar events)
// Phase 1: matrix 799 rows 800 cols
[2022-05-15 05:23:16] [INFO ] Computed 400 place invariants in 26 ms
[2022-05-15 05:23:16] [INFO ] [Real]Absence check using 400 positive place invariants in 57 ms returned sat
[2022-05-15 05:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:23:16] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2022-05-15 05:23:16] [INFO ] State equation strengthened by 200 read => feed constraints.
[2022-05-15 05:23:17] [INFO ] [Real]Added 200 Read/Feed constraints in 123 ms returned sat
[2022-05-15 05:23:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:23:17] [INFO ] [Nat]Absence check using 400 positive place invariants in 57 ms returned sat
[2022-05-15 05:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:23:17] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2022-05-15 05:23:17] [INFO ] [Nat]Added 200 Read/Feed constraints in 114 ms returned sat
[2022-05-15 05:23:18] [INFO ] Deduced a trap composed of 4 places in 676 ms of which 0 ms to minimize.
[2022-05-15 05:23:18] [INFO ] Deduced a trap composed of 4 places in 657 ms of which 0 ms to minimize.
[2022-05-15 05:23:19] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 0 ms to minimize.
[2022-05-15 05:23:20] [INFO ] Deduced a trap composed of 4 places in 698 ms of which 1 ms to minimize.
[2022-05-15 05:23:21] [INFO ] Deduced a trap composed of 4 places in 672 ms of which 1 ms to minimize.
[2022-05-15 05:23:21] [INFO ] Deduced a trap composed of 4 places in 662 ms of which 1 ms to minimize.
[2022-05-15 05:23:22] [INFO ] Deduced a trap composed of 4 places in 581 ms of which 1 ms to minimize.
[2022-05-15 05:23:23] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 1 ms to minimize.
[2022-05-15 05:23:23] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 0 ms to minimize.
[2022-05-15 05:23:24] [INFO ] Deduced a trap composed of 4 places in 663 ms of which 0 ms to minimize.
[2022-05-15 05:23:25] [INFO ] Deduced a trap composed of 4 places in 593 ms of which 0 ms to minimize.
[2022-05-15 05:23:25] [INFO ] Deduced a trap composed of 4 places in 609 ms of which 0 ms to minimize.
[2022-05-15 05:23:26] [INFO ] Deduced a trap composed of 4 places in 579 ms of which 0 ms to minimize.
[2022-05-15 05:23:26] [INFO ] Deduced a trap composed of 4 places in 563 ms of which 0 ms to minimize.
[2022-05-15 05:23:27] [INFO ] Deduced a trap composed of 4 places in 557 ms of which 1 ms to minimize.
[2022-05-15 05:23:28] [INFO ] Deduced a trap composed of 4 places in 538 ms of which 0 ms to minimize.
[2022-05-15 05:23:28] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 0 ms to minimize.
[2022-05-15 05:23:29] [INFO ] Deduced a trap composed of 4 places in 523 ms of which 0 ms to minimize.
[2022-05-15 05:23:29] [INFO ] Deduced a trap composed of 4 places in 487 ms of which 0 ms to minimize.
[2022-05-15 05:23:30] [INFO ] Deduced a trap composed of 4 places in 499 ms of which 0 ms to minimize.
[2022-05-15 05:23:30] [INFO ] Deduced a trap composed of 4 places in 518 ms of which 0 ms to minimize.
[2022-05-15 05:23:31] [INFO ] Deduced a trap composed of 4 places in 506 ms of which 1 ms to minimize.
[2022-05-15 05:23:31] [INFO ] Deduced a trap composed of 4 places in 497 ms of which 1 ms to minimize.
[2022-05-15 05:23:32] [INFO ] Deduced a trap composed of 4 places in 509 ms of which 0 ms to minimize.
[2022-05-15 05:23:32] [INFO ] Deduced a trap composed of 4 places in 478 ms of which 1 ms to minimize.
[2022-05-15 05:23:33] [INFO ] Deduced a trap composed of 4 places in 463 ms of which 1 ms to minimize.
[2022-05-15 05:23:33] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 1 ms to minimize.
[2022-05-15 05:23:34] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 0 ms to minimize.
[2022-05-15 05:23:34] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 0 ms to minimize.
[2022-05-15 05:23:35] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 0 ms to minimize.
[2022-05-15 05:23:35] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 0 ms to minimize.
[2022-05-15 05:23:36] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 0 ms to minimize.
[2022-05-15 05:23:36] [INFO ] Deduced a trap composed of 4 places in 419 ms of which 0 ms to minimize.
[2022-05-15 05:23:37] [INFO ] Deduced a trap composed of 4 places in 408 ms of which 0 ms to minimize.
[2022-05-15 05:23:37] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 0 ms to minimize.
[2022-05-15 05:23:38] [INFO ] Deduced a trap composed of 4 places in 419 ms of which 0 ms to minimize.
[2022-05-15 05:23:38] [INFO ] Deduced a trap composed of 4 places in 403 ms of which 0 ms to minimize.
[2022-05-15 05:23:38] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 0 ms to minimize.
[2022-05-15 05:23:39] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 0 ms to minimize.
[2022-05-15 05:23:39] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 0 ms to minimize.
[2022-05-15 05:23:40] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 1 ms to minimize.
[2022-05-15 05:23:40] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 1 ms to minimize.
[2022-05-15 05:23:41] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 1 ms to minimize.
[2022-05-15 05:23:41] [INFO ] Deduced a trap composed of 4 places in 404 ms of which 0 ms to minimize.
[2022-05-15 05:23:42] [INFO ] Deduced a trap composed of 4 places in 430 ms of which 0 ms to minimize.
[2022-05-15 05:23:42] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 1 ms to minimize.
[2022-05-15 05:23:43] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 0 ms to minimize.
[2022-05-15 05:23:43] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 0 ms to minimize.
[2022-05-15 05:23:44] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 0 ms to minimize.
[2022-05-15 05:23:44] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 0 ms to minimize.
[2022-05-15 05:23:44] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 0 ms to minimize.
[2022-05-15 05:23:45] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 0 ms to minimize.
[2022-05-15 05:23:45] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 1 ms to minimize.
[2022-05-15 05:23:46] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 1 ms to minimize.
[2022-05-15 05:23:46] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 1 ms to minimize.
[2022-05-15 05:23:46] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 1 ms to minimize.
[2022-05-15 05:23:47] [INFO ] Deduced a trap composed of 4 places in 401 ms of which 1 ms to minimize.
[2022-05-15 05:23:47] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 0 ms to minimize.
[2022-05-15 05:23:48] [INFO ] Deduced a trap composed of 4 places in 361 ms of which 1 ms to minimize.
[2022-05-15 05:23:48] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 0 ms to minimize.
[2022-05-15 05:23:49] [INFO ] Deduced a trap composed of 4 places in 451 ms of which 1 ms to minimize.
[2022-05-15 05:23:49] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 1 ms to minimize.
[2022-05-15 05:23:49] [INFO ] Deduced a trap composed of 4 places in 408 ms of which 1 ms to minimize.
[2022-05-15 05:23:50] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 0 ms to minimize.
[2022-05-15 05:23:50] [INFO ] Deduced a trap composed of 4 places in 408 ms of which 0 ms to minimize.
[2022-05-15 05:23:51] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 1 ms to minimize.
[2022-05-15 05:23:51] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 1 ms to minimize.
[2022-05-15 05:23:52] [INFO ] Deduced a trap composed of 4 places in 427 ms of which 0 ms to minimize.
[2022-05-15 05:23:52] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 1 ms to minimize.
[2022-05-15 05:23:52] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 1 ms to minimize.
[2022-05-15 05:23:53] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 1 ms to minimize.
[2022-05-15 05:23:53] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 0 ms to minimize.
[2022-05-15 05:23:54] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 0 ms to minimize.
[2022-05-15 05:23:54] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 0 ms to minimize.
[2022-05-15 05:23:55] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 0 ms to minimize.
[2022-05-15 05:23:55] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 1 ms to minimize.
[2022-05-15 05:23:55] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 0 ms to minimize.
[2022-05-15 05:23:56] [INFO ] Deduced a trap composed of 4 places in 364 ms of which 0 ms to minimize.
[2022-05-15 05:23:56] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 0 ms to minimize.
[2022-05-15 05:23:57] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 0 ms to minimize.
[2022-05-15 05:23:57] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 0 ms to minimize.
[2022-05-15 05:23:58] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 0 ms to minimize.
[2022-05-15 05:23:58] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 0 ms to minimize.
[2022-05-15 05:23:58] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 0 ms to minimize.
[2022-05-15 05:23:59] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2022-05-15 05:23:59] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 0 ms to minimize.
[2022-05-15 05:23:59] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 0 ms to minimize.
[2022-05-15 05:24:00] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 1 ms to minimize.
[2022-05-15 05:24:00] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 1 ms to minimize.
[2022-05-15 05:24:01] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 0 ms to minimize.
[2022-05-15 05:24:01] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 0 ms to minimize.
[2022-05-15 05:24:01] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 0 ms to minimize.
[2022-05-15 05:24:02] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 1 ms to minimize.
[2022-05-15 05:24:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 800 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 800/800 places, 40399/40399 transitions.
Applied a total of 0 rules in 973 ms. Remains 800 /800 variables (removed 0) and now considering 40399/40399 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40399/40399 transitions.
Starting structural reductions, iteration 0 : 800/800 places, 40399/40399 transitions.
Applied a total of 0 rules in 829 ms. Remains 800 /800 variables (removed 0) and now considering 40399/40399 (removed 0) transitions.
[2022-05-15 05:24:04] [INFO ] Flow matrix only has 799 transitions (discarded 39600 similar events)
// Phase 1: matrix 799 rows 800 cols
[2022-05-15 05:24:04] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-15 05:24:10] [INFO ] Implicit Places using invariants in 6092 ms returned []
Implicit Place search using SMT only with invariants took 6093 ms to find 0 implicit places.
[2022-05-15 05:24:10] [INFO ] Flow matrix only has 799 transitions (discarded 39600 similar events)
// Phase 1: matrix 799 rows 800 cols
[2022-05-15 05:24:10] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-15 05:24:23] [INFO ] Dead Transitions using invariants and state equation in 13041 ms returned []
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40399/40399 transitions.
Ending property specific reduction for Dekker-PT-200-UpperBounds-05 in 109697 ms.
Starting property specific reduction for Dekker-PT-200-UpperBounds-10
Normalized transition count is 800 out of 40400 initially.
// Phase 1: matrix 800 rows 800 cols
[2022-05-15 05:24:23] [INFO ] Computed 400 place invariants in 15 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
[2022-05-15 05:24:24] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2022-05-15 05:24:24] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-15 05:24:24] [INFO ] [Real]Absence check using 400 positive place invariants in 63 ms returned sat
[2022-05-15 05:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:24:24] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2022-05-15 05:24:24] [INFO ] State equation strengthened by 200 read => feed constraints.
[2022-05-15 05:24:24] [INFO ] [Real]Added 200 Read/Feed constraints in 130 ms returned sat
[2022-05-15 05:24:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:24:25] [INFO ] [Nat]Absence check using 400 positive place invariants in 66 ms returned sat
[2022-05-15 05:24:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:24:25] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2022-05-15 05:24:25] [INFO ] [Nat]Added 200 Read/Feed constraints in 118 ms returned sat
[2022-05-15 05:24:26] [INFO ] Deduced a trap composed of 4 places in 742 ms of which 0 ms to minimize.
[2022-05-15 05:24:26] [INFO ] Deduced a trap composed of 4 places in 722 ms of which 0 ms to minimize.
[2022-05-15 05:24:27] [INFO ] Deduced a trap composed of 4 places in 753 ms of which 0 ms to minimize.
[2022-05-15 05:24:28] [INFO ] Deduced a trap composed of 4 places in 712 ms of which 1 ms to minimize.
[2022-05-15 05:24:29] [INFO ] Deduced a trap composed of 4 places in 705 ms of which 0 ms to minimize.
[2022-05-15 05:24:29] [INFO ] Deduced a trap composed of 4 places in 686 ms of which 1 ms to minimize.
[2022-05-15 05:24:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 800 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 800/800 places, 40399/40399 transitions.
Applied a total of 0 rules in 816 ms. Remains 800 /800 variables (removed 0) and now considering 40399/40399 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40399/40399 transitions.
Normalized transition count is 799 out of 40399 initially.
// Phase 1: matrix 799 rows 800 cols
[2022-05-15 05:24:30] [INFO ] Computed 400 place invariants in 18 ms
Interrupted random walk after 499558 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4916 ms. (steps per millisecond=203 ) properties (out of 1) seen :0
[2022-05-15 05:25:05] [INFO ] Flow matrix only has 799 transitions (discarded 39600 similar events)
// Phase 1: matrix 799 rows 800 cols
[2022-05-15 05:25:05] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-15 05:25:05] [INFO ] [Real]Absence check using 400 positive place invariants in 61 ms returned sat
[2022-05-15 05:25:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:25:06] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2022-05-15 05:25:06] [INFO ] State equation strengthened by 200 read => feed constraints.
[2022-05-15 05:25:06] [INFO ] [Real]Added 200 Read/Feed constraints in 124 ms returned sat
[2022-05-15 05:25:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:25:06] [INFO ] [Nat]Absence check using 400 positive place invariants in 64 ms returned sat
[2022-05-15 05:25:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:25:06] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2022-05-15 05:25:07] [INFO ] [Nat]Added 200 Read/Feed constraints in 114 ms returned sat
[2022-05-15 05:25:07] [INFO ] Deduced a trap composed of 4 places in 681 ms of which 1 ms to minimize.
[2022-05-15 05:25:08] [INFO ] Deduced a trap composed of 4 places in 677 ms of which 0 ms to minimize.
[2022-05-15 05:25:09] [INFO ] Deduced a trap composed of 4 places in 751 ms of which 1 ms to minimize.
[2022-05-15 05:25:10] [INFO ] Deduced a trap composed of 4 places in 720 ms of which 0 ms to minimize.
[2022-05-15 05:25:10] [INFO ] Deduced a trap composed of 4 places in 707 ms of which 1 ms to minimize.
[2022-05-15 05:25:11] [INFO ] Deduced a trap composed of 4 places in 698 ms of which 0 ms to minimize.
[2022-05-15 05:25:12] [INFO ] Deduced a trap composed of 4 places in 681 ms of which 1 ms to minimize.
[2022-05-15 05:25:12] [INFO ] Deduced a trap composed of 4 places in 672 ms of which 3 ms to minimize.
[2022-05-15 05:25:13] [INFO ] Deduced a trap composed of 4 places in 660 ms of which 0 ms to minimize.
[2022-05-15 05:25:14] [INFO ] Deduced a trap composed of 4 places in 636 ms of which 0 ms to minimize.
[2022-05-15 05:25:15] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 1 ms to minimize.
[2022-05-15 05:25:15] [INFO ] Deduced a trap composed of 4 places in 621 ms of which 1 ms to minimize.
[2022-05-15 05:25:16] [INFO ] Deduced a trap composed of 4 places in 603 ms of which 1 ms to minimize.
[2022-05-15 05:25:16] [INFO ] Deduced a trap composed of 4 places in 599 ms of which 0 ms to minimize.
[2022-05-15 05:25:17] [INFO ] Deduced a trap composed of 4 places in 580 ms of which 0 ms to minimize.
[2022-05-15 05:25:18] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 1 ms to minimize.
[2022-05-15 05:25:18] [INFO ] Deduced a trap composed of 4 places in 571 ms of which 0 ms to minimize.
[2022-05-15 05:25:19] [INFO ] Deduced a trap composed of 4 places in 560 ms of which 1 ms to minimize.
[2022-05-15 05:25:19] [INFO ] Deduced a trap composed of 4 places in 548 ms of which 0 ms to minimize.
[2022-05-15 05:25:20] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 1 ms to minimize.
[2022-05-15 05:25:21] [INFO ] Deduced a trap composed of 4 places in 497 ms of which 0 ms to minimize.
[2022-05-15 05:25:21] [INFO ] Deduced a trap composed of 4 places in 524 ms of which 1 ms to minimize.
[2022-05-15 05:25:22] [INFO ] Deduced a trap composed of 4 places in 485 ms of which 0 ms to minimize.
[2022-05-15 05:25:22] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 1 ms to minimize.
[2022-05-15 05:25:23] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 1 ms to minimize.
[2022-05-15 05:25:23] [INFO ] Deduced a trap composed of 4 places in 462 ms of which 0 ms to minimize.
[2022-05-15 05:25:24] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 0 ms to minimize.
[2022-05-15 05:25:24] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 1 ms to minimize.
[2022-05-15 05:25:25] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 0 ms to minimize.
[2022-05-15 05:25:25] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 0 ms to minimize.
[2022-05-15 05:25:26] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 0 ms to minimize.
[2022-05-15 05:25:26] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 0 ms to minimize.
[2022-05-15 05:25:26] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 1 ms to minimize.
[2022-05-15 05:25:27] [INFO ] Deduced a trap composed of 4 places in 448 ms of which 0 ms to minimize.
[2022-05-15 05:25:27] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 0 ms to minimize.
[2022-05-15 05:25:28] [INFO ] Deduced a trap composed of 4 places in 440 ms of which 0 ms to minimize.
[2022-05-15 05:25:28] [INFO ] Deduced a trap composed of 4 places in 419 ms of which 0 ms to minimize.
[2022-05-15 05:25:29] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 0 ms to minimize.
[2022-05-15 05:25:29] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 0 ms to minimize.
[2022-05-15 05:25:30] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 0 ms to minimize.
[2022-05-15 05:25:30] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 1 ms to minimize.
[2022-05-15 05:25:31] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 0 ms to minimize.
[2022-05-15 05:25:31] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 1 ms to minimize.
[2022-05-15 05:25:32] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 0 ms to minimize.
[2022-05-15 05:25:32] [INFO ] Deduced a trap composed of 4 places in 428 ms of which 0 ms to minimize.
[2022-05-15 05:25:32] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 0 ms to minimize.
[2022-05-15 05:25:33] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 1 ms to minimize.
[2022-05-15 05:25:33] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 0 ms to minimize.
[2022-05-15 05:25:34] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 0 ms to minimize.
[2022-05-15 05:25:34] [INFO ] Deduced a trap composed of 4 places in 398 ms of which 0 ms to minimize.
[2022-05-15 05:25:35] [INFO ] Deduced a trap composed of 4 places in 397 ms of which 0 ms to minimize.
[2022-05-15 05:25:35] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 0 ms to minimize.
[2022-05-15 05:25:36] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 0 ms to minimize.
[2022-05-15 05:25:36] [INFO ] Deduced a trap composed of 4 places in 405 ms of which 1 ms to minimize.
[2022-05-15 05:25:36] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 0 ms to minimize.
[2022-05-15 05:25:37] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 0 ms to minimize.
[2022-05-15 05:25:37] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 0 ms to minimize.
[2022-05-15 05:25:38] [INFO ] Deduced a trap composed of 4 places in 467 ms of which 0 ms to minimize.
[2022-05-15 05:25:38] [INFO ] Deduced a trap composed of 4 places in 451 ms of which 1 ms to minimize.
[2022-05-15 05:25:39] [INFO ] Deduced a trap composed of 4 places in 440 ms of which 0 ms to minimize.
[2022-05-15 05:25:39] [INFO ] Deduced a trap composed of 4 places in 449 ms of which 1 ms to minimize.
[2022-05-15 05:25:40] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 0 ms to minimize.
[2022-05-15 05:25:40] [INFO ] Deduced a trap composed of 4 places in 433 ms of which 0 ms to minimize.
[2022-05-15 05:25:41] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 0 ms to minimize.
[2022-05-15 05:25:41] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 1 ms to minimize.
[2022-05-15 05:25:42] [INFO ] Deduced a trap composed of 4 places in 421 ms of which 0 ms to minimize.
[2022-05-15 05:25:42] [INFO ] Deduced a trap composed of 4 places in 419 ms of which 0 ms to minimize.
[2022-05-15 05:25:42] [INFO ] Deduced a trap composed of 4 places in 471 ms of which 0 ms to minimize.
[2022-05-15 05:25:43] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 0 ms to minimize.
[2022-05-15 05:25:43] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 0 ms to minimize.
[2022-05-15 05:25:44] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 0 ms to minimize.
[2022-05-15 05:25:44] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 0 ms to minimize.
[2022-05-15 05:25:45] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 0 ms to minimize.
[2022-05-15 05:25:45] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 1 ms to minimize.
[2022-05-15 05:25:46] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 0 ms to minimize.
[2022-05-15 05:25:46] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 0 ms to minimize.
[2022-05-15 05:25:46] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 0 ms to minimize.
[2022-05-15 05:25:47] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 0 ms to minimize.
[2022-05-15 05:25:47] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 0 ms to minimize.
[2022-05-15 05:25:48] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 0 ms to minimize.
[2022-05-15 05:25:48] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 1 ms to minimize.
[2022-05-15 05:25:49] [INFO ] Deduced a trap composed of 4 places in 360 ms of which 0 ms to minimize.
[2022-05-15 05:25:49] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 0 ms to minimize.
[2022-05-15 05:25:49] [INFO ] Deduced a trap composed of 4 places in 377 ms of which 0 ms to minimize.
[2022-05-15 05:25:50] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 0 ms to minimize.
[2022-05-15 05:25:50] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 1 ms to minimize.
[2022-05-15 05:25:51] [INFO ] Deduced a trap composed of 4 places in 377 ms of which 1 ms to minimize.
[2022-05-15 05:25:51] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 1 ms to minimize.
[2022-05-15 05:25:51] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 0 ms to minimize.
[2022-05-15 05:25: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 800 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 800/800 places, 40399/40399 transitions.
Applied a total of 0 rules in 828 ms. Remains 800 /800 variables (removed 0) and now considering 40399/40399 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40399/40399 transitions.
Starting structural reductions, iteration 0 : 800/800 places, 40399/40399 transitions.
Applied a total of 0 rules in 889 ms. Remains 800 /800 variables (removed 0) and now considering 40399/40399 (removed 0) transitions.
[2022-05-15 05:25:53] [INFO ] Flow matrix only has 799 transitions (discarded 39600 similar events)
// Phase 1: matrix 799 rows 800 cols
[2022-05-15 05:25:53] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-15 05:25:59] [INFO ] Implicit Places using invariants in 5782 ms returned []
Implicit Place search using SMT only with invariants took 5787 ms to find 0 implicit places.
[2022-05-15 05:25:59] [INFO ] Flow matrix only has 799 transitions (discarded 39600 similar events)
// Phase 1: matrix 799 rows 800 cols
[2022-05-15 05:25:59] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-15 05:26:12] [INFO ] Dead Transitions using invariants and state equation in 13476 ms returned []
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40399/40399 transitions.
Ending property specific reduction for Dekker-PT-200-UpperBounds-10 in 109626 ms.
Starting property specific reduction for Dekker-PT-200-UpperBounds-14
Normalized transition count is 800 out of 40400 initially.
// Phase 1: matrix 800 rows 800 cols
[2022-05-15 05:26:12] [INFO ] Computed 400 place invariants in 15 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
[2022-05-15 05:26:13] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2022-05-15 05:26:13] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-15 05:26:13] [INFO ] [Real]Absence check using 400 positive place invariants in 62 ms returned sat
[2022-05-15 05:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:26:14] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2022-05-15 05:26:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:26:14] [INFO ] [Nat]Absence check using 400 positive place invariants in 63 ms returned sat
[2022-05-15 05:26:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:26:14] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2022-05-15 05:26:14] [INFO ] State equation strengthened by 200 read => feed constraints.
[2022-05-15 05:26:14] [INFO ] [Nat]Added 200 Read/Feed constraints in 116 ms returned sat
[2022-05-15 05:26:15] [INFO ] Deduced a trap composed of 4 places in 707 ms of which 1 ms to minimize.
[2022-05-15 05:26:16] [INFO ] Deduced a trap composed of 4 places in 768 ms of which 0 ms to minimize.
[2022-05-15 05:26:17] [INFO ] Deduced a trap composed of 4 places in 746 ms of which 0 ms to minimize.
[2022-05-15 05:26:17] [INFO ] Deduced a trap composed of 4 places in 720 ms of which 2 ms to minimize.
[2022-05-15 05:26:18] [INFO ] Deduced a trap composed of 4 places in 739 ms of which 1 ms to minimize.
[2022-05-15 05:26:19] [INFO ] Deduced a trap composed of 4 places in 717 ms of which 0 ms to minimize.
[2022-05-15 05:26:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 800 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 800/800 places, 40399/40399 transitions.
Applied a total of 0 rules in 1061 ms. Remains 800 /800 variables (removed 0) and now considering 40399/40399 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40399/40399 transitions.
Normalized transition count is 799 out of 40399 initially.
// Phase 1: matrix 799 rows 800 cols
[2022-05-15 05:26:20] [INFO ] Computed 400 place invariants in 19 ms
Interrupted random walk after 524908 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4858 ms. (steps per millisecond=205 ) properties (out of 1) seen :0
[2022-05-15 05:26:55] [INFO ] Flow matrix only has 799 transitions (discarded 39600 similar events)
// Phase 1: matrix 799 rows 800 cols
[2022-05-15 05:26:55] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-15 05:26:55] [INFO ] [Real]Absence check using 400 positive place invariants in 65 ms returned sat
[2022-05-15 05:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:26:55] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2022-05-15 05:26:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:26:56] [INFO ] [Nat]Absence check using 400 positive place invariants in 59 ms returned sat
[2022-05-15 05:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:26:56] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2022-05-15 05:26:56] [INFO ] State equation strengthened by 200 read => feed constraints.
[2022-05-15 05:26:56] [INFO ] [Nat]Added 200 Read/Feed constraints in 122 ms returned sat
[2022-05-15 05:26:57] [INFO ] Deduced a trap composed of 4 places in 713 ms of which 0 ms to minimize.
[2022-05-15 05:26:58] [INFO ] Deduced a trap composed of 4 places in 730 ms of which 1 ms to minimize.
[2022-05-15 05:26:58] [INFO ] Deduced a trap composed of 4 places in 692 ms of which 0 ms to minimize.
[2022-05-15 05:26:59] [INFO ] Deduced a trap composed of 4 places in 667 ms of which 1 ms to minimize.
[2022-05-15 05:27:00] [INFO ] Deduced a trap composed of 4 places in 738 ms of which 0 ms to minimize.
[2022-05-15 05:27:01] [INFO ] Deduced a trap composed of 4 places in 736 ms of which 0 ms to minimize.
[2022-05-15 05:27:01] [INFO ] Deduced a trap composed of 4 places in 676 ms of which 0 ms to minimize.
[2022-05-15 05:27:02] [INFO ] Deduced a trap composed of 4 places in 647 ms of which 1 ms to minimize.
[2022-05-15 05:27:03] [INFO ] Deduced a trap composed of 4 places in 657 ms of which 0 ms to minimize.
[2022-05-15 05:27:03] [INFO ] Deduced a trap composed of 4 places in 611 ms of which 0 ms to minimize.
[2022-05-15 05:27:04] [INFO ] Deduced a trap composed of 4 places in 603 ms of which 0 ms to minimize.
[2022-05-15 05:27:05] [INFO ] Deduced a trap composed of 4 places in 601 ms of which 0 ms to minimize.
[2022-05-15 05:27:05] [INFO ] Deduced a trap composed of 4 places in 604 ms of which 1 ms to minimize.
[2022-05-15 05:27:06] [INFO ] Deduced a trap composed of 4 places in 583 ms of which 0 ms to minimize.
[2022-05-15 05:27:06] [INFO ] Deduced a trap composed of 4 places in 574 ms of which 0 ms to minimize.
[2022-05-15 05:27:07] [INFO ] Deduced a trap composed of 4 places in 614 ms of which 1 ms to minimize.
[2022-05-15 05:27:08] [INFO ] Deduced a trap composed of 4 places in 599 ms of which 0 ms to minimize.
[2022-05-15 05:27:08] [INFO ] Deduced a trap composed of 4 places in 578 ms of which 0 ms to minimize.
[2022-05-15 05:27:09] [INFO ] Deduced a trap composed of 4 places in 583 ms of which 0 ms to minimize.
[2022-05-15 05:27:10] [INFO ] Deduced a trap composed of 4 places in 578 ms of which 0 ms to minimize.
[2022-05-15 05:27:10] [INFO ] Deduced a trap composed of 4 places in 549 ms of which 0 ms to minimize.
[2022-05-15 05:27:11] [INFO ] Deduced a trap composed of 4 places in 553 ms of which 0 ms to minimize.
[2022-05-15 05:27:11] [INFO ] Deduced a trap composed of 4 places in 529 ms of which 8 ms to minimize.
[2022-05-15 05:27:12] [INFO ] Deduced a trap composed of 4 places in 525 ms of which 0 ms to minimize.
[2022-05-15 05:27:12] [INFO ] Deduced a trap composed of 4 places in 526 ms of which 0 ms to minimize.
[2022-05-15 05:27:13] [INFO ] Deduced a trap composed of 4 places in 515 ms of which 0 ms to minimize.
[2022-05-15 05:27:13] [INFO ] Deduced a trap composed of 4 places in 504 ms of which 0 ms to minimize.
[2022-05-15 05:27:14] [INFO ] Deduced a trap composed of 4 places in 509 ms of which 0 ms to minimize.
[2022-05-15 05:27:14] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 1 ms to minimize.
[2022-05-15 05:27:15] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 0 ms to minimize.
[2022-05-15 05:27:15] [INFO ] Deduced a trap composed of 4 places in 473 ms of which 1 ms to minimize.
[2022-05-15 05:27:16] [INFO ] Deduced a trap composed of 4 places in 451 ms of which 1 ms to minimize.
[2022-05-15 05:27:16] [INFO ] Deduced a trap composed of 4 places in 473 ms of which 0 ms to minimize.
[2022-05-15 05:27:17] [INFO ] Deduced a trap composed of 4 places in 493 ms of which 1 ms to minimize.
[2022-05-15 05:27:17] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 0 ms to minimize.
[2022-05-15 05:27:18] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 0 ms to minimize.
[2022-05-15 05:27:18] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 0 ms to minimize.
[2022-05-15 05:27:19] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 1 ms to minimize.
[2022-05-15 05:27:19] [INFO ] Deduced a trap composed of 4 places in 448 ms of which 0 ms to minimize.
[2022-05-15 05:27:20] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 1 ms to minimize.
[2022-05-15 05:27:20] [INFO ] Deduced a trap composed of 4 places in 427 ms of which 1 ms to minimize.
[2022-05-15 05:27:21] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 0 ms to minimize.
[2022-05-15 05:27:21] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 0 ms to minimize.
[2022-05-15 05:27:22] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 0 ms to minimize.
[2022-05-15 05:27:22] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 1 ms to minimize.
[2022-05-15 05:27:23] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 0 ms to minimize.
[2022-05-15 05:27:23] [INFO ] Deduced a trap composed of 4 places in 486 ms of which 0 ms to minimize.
[2022-05-15 05:27:24] [INFO ] Deduced a trap composed of 4 places in 499 ms of which 0 ms to minimize.
[2022-05-15 05:27:24] [INFO ] Deduced a trap composed of 4 places in 487 ms of which 0 ms to minimize.
[2022-05-15 05:27:25] [INFO ] Deduced a trap composed of 4 places in 487 ms of which 0 ms to minimize.
[2022-05-15 05:27:25] [INFO ] Deduced a trap composed of 4 places in 475 ms of which 0 ms to minimize.
[2022-05-15 05:27:26] [INFO ] Deduced a trap composed of 4 places in 465 ms of which 0 ms to minimize.
[2022-05-15 05:27:26] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 0 ms to minimize.
[2022-05-15 05:27:27] [INFO ] Deduced a trap composed of 4 places in 457 ms of which 1 ms to minimize.
[2022-05-15 05:27:27] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 1 ms to minimize.
[2022-05-15 05:27:28] [INFO ] Deduced a trap composed of 4 places in 430 ms of which 0 ms to minimize.
[2022-05-15 05:27:28] [INFO ] Deduced a trap composed of 4 places in 425 ms of which 0 ms to minimize.
[2022-05-15 05:27:29] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 0 ms to minimize.
[2022-05-15 05:27:29] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 1 ms to minimize.
[2022-05-15 05:27:30] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 0 ms to minimize.
[2022-05-15 05:27:30] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 0 ms to minimize.
[2022-05-15 05:27:30] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 0 ms to minimize.
[2022-05-15 05:27:31] [INFO ] Deduced a trap composed of 4 places in 425 ms of which 0 ms to minimize.
[2022-05-15 05:27:31] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 0 ms to minimize.
[2022-05-15 05:27:32] [INFO ] Deduced a trap composed of 4 places in 404 ms of which 0 ms to minimize.
[2022-05-15 05:27:32] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 0 ms to minimize.
[2022-05-15 05:27:33] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 0 ms to minimize.
[2022-05-15 05:27:33] [INFO ] Deduced a trap composed of 4 places in 422 ms of which 0 ms to minimize.
[2022-05-15 05:27:34] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 0 ms to minimize.
[2022-05-15 05:27:34] [INFO ] Deduced a trap composed of 4 places in 420 ms of which 0 ms to minimize.
[2022-05-15 05:27:35] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 0 ms to minimize.
[2022-05-15 05:27:35] [INFO ] Deduced a trap composed of 4 places in 431 ms of which 0 ms to minimize.
[2022-05-15 05:27:36] [INFO ] Deduced a trap composed of 4 places in 421 ms of which 0 ms to minimize.
[2022-05-15 05:27:36] [INFO ] Deduced a trap composed of 4 places in 451 ms of which 1 ms to minimize.
[2022-05-15 05:27:36] [INFO ] Deduced a trap composed of 4 places in 465 ms of which 1 ms to minimize.
[2022-05-15 05:27:37] [INFO ] Deduced a trap composed of 4 places in 433 ms of which 1 ms to minimize.
[2022-05-15 05:27:37] [INFO ] Deduced a trap composed of 4 places in 421 ms of which 0 ms to minimize.
[2022-05-15 05:27:38] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 1 ms to minimize.
[2022-05-15 05:27:38] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 0 ms to minimize.
[2022-05-15 05:27:39] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 0 ms to minimize.
[2022-05-15 05:27:39] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 0 ms to minimize.
[2022-05-15 05:27:40] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 0 ms to minimize.
[2022-05-15 05:27:40] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 0 ms to minimize.
[2022-05-15 05:27:40] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 0 ms to minimize.
[2022-05-15 05:27:41] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 1 ms to minimize.
[2022-05-15 05:27:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 800 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 800/800 places, 40399/40399 transitions.
Applied a total of 0 rules in 1333 ms. Remains 800 /800 variables (removed 0) and now considering 40399/40399 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40399/40399 transitions.
Starting structural reductions, iteration 0 : 800/800 places, 40399/40399 transitions.
Applied a total of 0 rules in 1169 ms. Remains 800 /800 variables (removed 0) and now considering 40399/40399 (removed 0) transitions.
[2022-05-15 05:27:43] [INFO ] Flow matrix only has 799 transitions (discarded 39600 similar events)
// Phase 1: matrix 799 rows 800 cols
[2022-05-15 05:27:43] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-15 05:27:50] [INFO ] Implicit Places using invariants in 6355 ms returned []
Implicit Place search using SMT only with invariants took 6358 ms to find 0 implicit places.
[2022-05-15 05:27:50] [INFO ] Flow matrix only has 799 transitions (discarded 39600 similar events)
// Phase 1: matrix 799 rows 800 cols
[2022-05-15 05:27:50] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-15 05:28:03] [INFO ] Dead Transitions using invariants and state equation in 12942 ms returned []
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40399/40399 transitions.
Ending property specific reduction for Dekker-PT-200-UpperBounds-14 in 110097 ms.
[2022-05-15 05:28:05] [INFO ] Flatten gal took : 2052 ms
[2022-05-15 05:28:06] [INFO ] Applying decomposition
[2022-05-15 05:28:08] [INFO ] Flatten gal took : 1781 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/graph16836452509957359996.txt, -o, /tmp/graph16836452509957359996.bin, -w, /tmp/graph16836452509957359996.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/graph16836452509957359996.bin, -l, -1, -v, -w, /tmp/graph16836452509957359996.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-15 05:28:11] [INFO ] Decomposing Gal with order
[2022-05-15 05:28:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 05:28:14] [INFO ] Removed a total of 118800 redundant transitions.
[2022-05-15 05:28:15] [INFO ] Flatten gal took : 2745 ms
[2022-05-15 05:28:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1301 ms.
[2022-05-15 05:28:16] [INFO ] Time to serialize gal into /tmp/UpperBounds7708768960981815019.gal : 150 ms
[2022-05-15 05:28:16] [INFO ] Time to serialize properties into /tmp/UpperBounds13011737110358133640.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds7708768960981815019.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13011737110358133640.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds7708768960981815019.gal -t CGAL -reachable-file /tmp/UpperBounds13011737110358133640.prop --nowitness
Loading property file /tmp/UpperBounds13011737110358133640.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\_flat,1.62301e+62,38.4093,232336,403,10,6370,20325,41215,5390,26,20147,0
Total reachable state count : 1.623007424701580178297381713264574228547e+62

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Dekker-PT-200-UpperBounds-05 :0 <= u88.p3_88 <= 1
FORMULA Dekker-PT-200-UpperBounds-05 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
Dekker-PT-200-UpperBounds-05,0,38.5802,232336,1,0,6370,20325,42415,5390,37,20147,21365
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Dekker-PT-200-UpperBounds-10 :0 <= u142.p3_142 <= 1
FORMULA Dekker-PT-200-UpperBounds-10 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
Dekker-PT-200-UpperBounds-10,0,38.7189,232336,1,0,6370,20325,42814,5390,37,20147,21753
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Dekker-PT-200-UpperBounds-14 :0 <= u162.p3_162 <= 1
FORMULA Dekker-PT-200-UpperBounds-14 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
Dekker-PT-200-UpperBounds-14,0,38.8547,232336,1,0,6370,20325,43198,5390,37,20147,21930

BK_STOP 1652592537526

--------------------
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="Dekker-PT-200"
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 Dekker-PT-200, 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 r071-tall-165254780500238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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