Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 8.1K Apr 30 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 09:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 46K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652823856978

Running Version 0
[2022-05-17 21:44:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 21:44:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:44:18] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-17 21:44:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 21:44:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 583 ms
[2022-05-17 21:44:19] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2022-05-17 21:44:19] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 2 ms.
[2022-05-17 21:44:19] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_14930336027061310972.dot
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 21:44:19] [INFO ] Computed 1 place invariants in 7 ms
FORMULA Peterson-COL-6-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-09 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-17 21:44:19] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions in 56 ms.
[2022-05-17 21:44:19] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 21:44:19] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 21:44:19] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 21:44:19] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 21:44:19] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 21:44:19] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 21:44:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-17 21:44:19] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 21:44:19] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 21:44:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 21:44:19] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 21:44:19] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 21:44:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 21:44:19] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 21:44:19] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 21:44:19] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 21:44:19] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 21:44:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 21:44:19] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 21:44:19] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 21:44:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-17 21:44:19] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 21:44:19] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 8 ms.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 21:44:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-17 21:44:19] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 21:44:19] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 21:44:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:19] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 21:44:19] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 21:44:19] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
[2022-05-17 21:44:19] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions in 26 ms.
[2022-05-17 21:44:19] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_9062968233635835296.dot
Deduced a syphon composed of 42 places in 17 ms
Reduce places removed 42 places and 84 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 10) seen :54
FORMULA Peterson-COL-6-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :23
FORMULA Peterson-COL-6-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :16
FORMULA Peterson-COL-6-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-17 21:44:20] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 21:44:20] [INFO ] Computed 27 place invariants in 29 ms
[2022-05-17 21:44:20] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2022-05-17 21:44:20] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 12 ms returned sat
[2022-05-17 21:44:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:21] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2022-05-17 21:44:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 22 ms returned sat
[2022-05-17 21:44:21] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 12 ms returned sat
[2022-05-17 21:44:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:21] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2022-05-17 21:44:21] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:44:21] [INFO ] [Nat]Added 366 Read/Feed constraints in 104 ms returned sat
[2022-05-17 21:44:22] [INFO ] Deduced a trap composed of 22 places in 599 ms of which 5 ms to minimize.
[2022-05-17 21:44:23] [INFO ] Deduced a trap composed of 46 places in 504 ms of which 12 ms to minimize.
[2022-05-17 21:44:23] [INFO ] Deduced a trap composed of 119 places in 472 ms of which 1 ms to minimize.
[2022-05-17 21:44:24] [INFO ] Deduced a trap composed of 149 places in 507 ms of which 3 ms to minimize.
[2022-05-17 21:44:24] [INFO ] Deduced a trap composed of 177 places in 511 ms of which 1 ms to minimize.
[2022-05-17 21:44:25] [INFO ] Deduced a trap composed of 161 places in 538 ms of which 1 ms to minimize.
[2022-05-17 21:44:26] [INFO ] Deduced a trap composed of 61 places in 519 ms of which 1 ms to minimize.
[2022-05-17 21:44:26] [INFO ] Deduced a trap composed of 204 places in 498 ms of which 1 ms to minimize.
[2022-05-17 21:44: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:44:26] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2022-05-17 21:44:26] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-17 21:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:27] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2022-05-17 21:44:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2022-05-17 21:44:27] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-17 21:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:28] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2022-05-17 21:44:28] [INFO ] [Nat]Added 366 Read/Feed constraints in 108 ms returned sat
[2022-05-17 21:44:28] [INFO ] Deduced a trap composed of 22 places in 551 ms of which 1 ms to minimize.
[2022-05-17 21:44:29] [INFO ] Deduced a trap composed of 46 places in 494 ms of which 1 ms to minimize.
[2022-05-17 21:44:29] [INFO ] Deduced a trap composed of 119 places in 507 ms of which 1 ms to minimize.
[2022-05-17 21:44:30] [INFO ] Deduced a trap composed of 149 places in 479 ms of which 1 ms to minimize.
[2022-05-17 21:44:31] [INFO ] Deduced a trap composed of 177 places in 526 ms of which 2 ms to minimize.
[2022-05-17 21:44:31] [INFO ] Deduced a trap composed of 161 places in 516 ms of which 2 ms to minimize.
[2022-05-17 21:44:32] [INFO ] Deduced a trap composed of 61 places in 486 ms of which 1 ms to minimize.
[2022-05-17 21:44:32] [INFO ] Deduced a trap composed of 204 places in 536 ms of which 15 ms to minimize.
[2022-05-17 21:44:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [7, 7] Max seen :[3, 3]
Support contains 294 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 1778
Reduce places removed 252 places and 0 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Iterating post reduction 1 with 504 rules applied. Total rules applied 756 place count 1078 transition count 1526
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 2 with 252 rules applied. Total rules applied 1008 place count 826 transition count 1526
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 1008 place count 826 transition count 1442
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 1176 place count 742 transition count 1442
Applied a total of 1176 rules in 360 ms. Remains 742 /1330 variables (removed 588) and now considering 1442/2030 (removed 588) transitions.
Finished structural reductions, in 1 iterations. Remains : 742/1330 places, 1442/2030 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 742 cols
[2022-05-17 21:44:33] [INFO ] Computed 27 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 11017 ms. (steps per millisecond=90 ) properties (out of 2) seen :12
Interrupted Best-First random walk after 905178 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=180 ) properties seen :{0=2, 1=2}
Interrupted Best-First random walk after 907162 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=181 ) properties seen :{0=1, 1=1}
[2022-05-17 21:44:54] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2022-05-17 21:44:54] [INFO ] Computed 27 place invariants in 8 ms
[2022-05-17 21:44:54] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-05-17 21:44:54] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-17 21:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:54] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2022-05-17 21:44:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-05-17 21:44:54] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-17 21:44:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:55] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2022-05-17 21:44:55] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:44:55] [INFO ] [Nat]Added 366 Read/Feed constraints in 62 ms returned sat
[2022-05-17 21:44:55] [INFO ] Deduced a trap composed of 136 places in 242 ms of which 0 ms to minimize.
[2022-05-17 21:44:55] [INFO ] Deduced a trap composed of 173 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:44:55] [INFO ] Deduced a trap composed of 59 places in 238 ms of which 0 ms to minimize.
[2022-05-17 21:44:56] [INFO ] Deduced a trap composed of 59 places in 238 ms of which 1 ms to minimize.
[2022-05-17 21:44:56] [INFO ] Deduced a trap composed of 76 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:44:56] [INFO ] Deduced a trap composed of 80 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:44:57] [INFO ] Deduced a trap composed of 68 places in 235 ms of which 0 ms to minimize.
[2022-05-17 21:44:57] [INFO ] Deduced a trap composed of 97 places in 267 ms of which 1 ms to minimize.
[2022-05-17 21:44:57] [INFO ] Deduced a trap composed of 74 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:44:57] [INFO ] Deduced a trap composed of 90 places in 238 ms of which 0 ms to minimize.
[2022-05-17 21:44:58] [INFO ] Deduced a trap composed of 80 places in 264 ms of which 1 ms to minimize.
[2022-05-17 21:44:58] [INFO ] Deduced a trap composed of 156 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:44:58] [INFO ] Deduced a trap composed of 87 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:44:59] [INFO ] Deduced a trap composed of 118 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:44:59] [INFO ] Deduced a trap composed of 133 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:44:59] [INFO ] Deduced a trap composed of 72 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:44:59] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:45:00] [INFO ] Deduced a trap composed of 75 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:45:00] [INFO ] Deduced a trap composed of 59 places in 237 ms of which 2 ms to minimize.
[2022-05-17 21:45:00] [INFO ] Deduced a trap composed of 109 places in 253 ms of which 2 ms to minimize.
[2022-05-17 21:45:01] [INFO ] Deduced a trap composed of 20 places in 247 ms of which 0 ms to minimize.
[2022-05-17 21:45:01] [INFO ] Deduced a trap composed of 83 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:45:01] [INFO ] Deduced a trap composed of 125 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:45:01] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:45:02] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:45:02] [INFO ] Deduced a trap composed of 87 places in 205 ms of which 0 ms to minimize.
[2022-05-17 21:45:02] [INFO ] Deduced a trap composed of 102 places in 232 ms of which 0 ms to minimize.
[2022-05-17 21:45:02] [INFO ] Deduced a trap composed of 201 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:45:03] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 0 ms to minimize.
[2022-05-17 21:45:03] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 0 ms to minimize.
[2022-05-17 21:45:03] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 0 ms to minimize.
[2022-05-17 21:45:03] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 0 ms to minimize.
[2022-05-17 21:45:03] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 0 ms to minimize.
[2022-05-17 21:45:04] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 0 ms to minimize.
[2022-05-17 21:45:04] [INFO ] Deduced a trap composed of 79 places in 193 ms of which 1 ms to minimize.
[2022-05-17 21:45:04] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 1 ms to minimize.
[2022-05-17 21:45:04] [INFO ] Deduced a trap composed of 54 places in 199 ms of which 1 ms to minimize.
[2022-05-17 21:45:05] [INFO ] Deduced a trap composed of 125 places in 192 ms of which 0 ms to minimize.
[2022-05-17 21:45:05] [INFO ] Deduced a trap composed of 72 places in 191 ms of which 1 ms to minimize.
[2022-05-17 21:45:05] [INFO ] Deduced a trap composed of 59 places in 203 ms of which 1 ms to minimize.
[2022-05-17 21:45:05] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 7 ms to minimize.
[2022-05-17 21:45:06] [INFO ] Deduced a trap composed of 68 places in 195 ms of which 1 ms to minimize.
[2022-05-17 21:45:06] [INFO ] Deduced a trap composed of 62 places in 199 ms of which 1 ms to minimize.
[2022-05-17 21:45:06] [INFO ] Deduced a trap composed of 154 places in 177 ms of which 0 ms to minimize.
[2022-05-17 21:45:06] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 0 ms to minimize.
[2022-05-17 21:45:07] [INFO ] Deduced a trap composed of 99 places in 135 ms of which 0 ms to minimize.
[2022-05-17 21:45:07] [INFO ] Deduced a trap composed of 72 places in 150 ms of which 0 ms to minimize.
[2022-05-17 21:45:07] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 0 ms to minimize.
[2022-05-17 21:45:07] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 1 ms to minimize.
[2022-05-17 21:45:07] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 2 ms to minimize.
[2022-05-17 21:45:07] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 1 ms to minimize.
[2022-05-17 21:45:08] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 4 ms to minimize.
[2022-05-17 21:45:08] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 1 ms to minimize.
[2022-05-17 21:45:08] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 1 ms to minimize.
[2022-05-17 21:45:08] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 1 ms to minimize.
[2022-05-17 21:45:08] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 1 ms to minimize.
[2022-05-17 21:45:08] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 0 ms to minimize.
[2022-05-17 21:45:09] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:45:09] [INFO ] Deduced a trap composed of 52 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:45:09] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:45:10] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 0 ms to minimize.
[2022-05-17 21:45:10] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 0 ms to minimize.
[2022-05-17 21:45:10] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 0 ms to minimize.
[2022-05-17 21:45:10] [INFO ] Deduced a trap composed of 165 places in 138 ms of which 0 ms to minimize.
[2022-05-17 21:45:10] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 0 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 163 places in 142 ms of which 0 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 0 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 0 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 0 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 0 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 0 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Trap strengthening (SAT) tested/added 72/71 trap constraints in 16930 ms
[2022-05-17 21:45:12] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 93 ms.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 69 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 78 places in 243 ms of which 0 ms to minimize.
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 40 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 154 places in 242 ms of which 1 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 106 places in 242 ms of which 1 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 81 places in 243 ms of which 1 ms to minimize.
[2022-05-17 21:45:30] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:45:30] [INFO ] Deduced a trap composed of 55 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:45:30] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:45:31] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:45:31] [INFO ] Deduced a trap composed of 62 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:45:31] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 0 ms to minimize.
[2022-05-17 21:45:32] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:45:32] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:45:32] [INFO ] Deduced a trap composed of 69 places in 232 ms of which 0 ms to minimize.
[2022-05-17 21:45:33] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:45:33] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:45:33] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 128 places in 220 ms of which 0 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 66 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 76 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 63 places in 228 ms of which 2 ms to minimize.
[2022-05-17 21:45:35] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:45:35] [INFO ] Deduced a trap composed of 52 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:45:35] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 82 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 76 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 73 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 40 places in 233 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 1 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 147 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 0 ms to minimize.
[2022-05-17 21:45:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:45:39] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2022-05-17 21:45:39] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-17 21:45:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:40] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2022-05-17 21:45:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-05-17 21:45:40] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-17 21:45:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:40] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2022-05-17 21:45:40] [INFO ] [Nat]Added 366 Read/Feed constraints in 57 ms returned sat
[2022-05-17 21:45:40] [INFO ] Deduced a trap composed of 136 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:45:41] [INFO ] Deduced a trap composed of 173 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:45:41] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:45:41] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:45:41] [INFO ] Deduced a trap composed of 76 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:45:42] [INFO ] Deduced a trap composed of 80 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:45:42] [INFO ] Deduced a trap composed of 68 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:45:42] [INFO ] Deduced a trap composed of 97 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:45:42] [INFO ] Deduced a trap composed of 74 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:45:43] [INFO ] Deduced a trap composed of 90 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:45:43] [INFO ] Deduced a trap composed of 80 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:45:43] [INFO ] Deduced a trap composed of 156 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:45:44] [INFO ] Deduced a trap composed of 87 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:45:44] [INFO ] Deduced a trap composed of 118 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:45:44] [INFO ] Deduced a trap composed of 133 places in 233 ms of which 0 ms to minimize.
[2022-05-17 21:45:44] [INFO ] Deduced a trap composed of 72 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:45:45] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 1 ms to minimize.
[2022-05-17 21:45:45] [INFO ] Deduced a trap composed of 75 places in 236 ms of which 0 ms to minimize.
[2022-05-17 21:45:45] [INFO ] Deduced a trap composed of 59 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:45:45] [INFO ] Deduced a trap composed of 109 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:45:46] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:45:46] [INFO ] Deduced a trap composed of 83 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:45:46] [INFO ] Deduced a trap composed of 125 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:45:47] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:45:47] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:45:47] [INFO ] Deduced a trap composed of 87 places in 209 ms of which 0 ms to minimize.
[2022-05-17 21:45:47] [INFO ] Deduced a trap composed of 102 places in 210 ms of which 0 ms to minimize.
[2022-05-17 21:45:48] [INFO ] Deduced a trap composed of 201 places in 211 ms of which 0 ms to minimize.
[2022-05-17 21:45:48] [INFO ] Deduced a trap composed of 52 places in 159 ms of which 0 ms to minimize.
[2022-05-17 21:45:48] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 0 ms to minimize.
[2022-05-17 21:45:48] [INFO ] Deduced a trap composed of 78 places in 162 ms of which 1 ms to minimize.
[2022-05-17 21:45:48] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 0 ms to minimize.
[2022-05-17 21:45:49] [INFO ] Deduced a trap composed of 54 places in 149 ms of which 0 ms to minimize.
[2022-05-17 21:45:49] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 0 ms to minimize.
[2022-05-17 21:45:49] [INFO ] Deduced a trap composed of 79 places in 191 ms of which 1 ms to minimize.
[2022-05-17 21:45:49] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 1 ms to minimize.
[2022-05-17 21:45:50] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 0 ms to minimize.
[2022-05-17 21:45:50] [INFO ] Deduced a trap composed of 125 places in 194 ms of which 1 ms to minimize.
[2022-05-17 21:45:50] [INFO ] Deduced a trap composed of 72 places in 195 ms of which 1 ms to minimize.
[2022-05-17 21:45:50] [INFO ] Deduced a trap composed of 59 places in 192 ms of which 1 ms to minimize.
[2022-05-17 21:45:51] [INFO ] Deduced a trap composed of 53 places in 201 ms of which 1 ms to minimize.
[2022-05-17 21:45:51] [INFO ] Deduced a trap composed of 68 places in 198 ms of which 1 ms to minimize.
[2022-05-17 21:45:51] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 1 ms to minimize.
[2022-05-17 21:45:51] [INFO ] Deduced a trap composed of 154 places in 178 ms of which 1 ms to minimize.
[2022-05-17 21:45:51] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 1 ms to minimize.
[2022-05-17 21:45:52] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 1 ms to minimize.
[2022-05-17 21:45:52] [INFO ] Deduced a trap composed of 72 places in 143 ms of which 1 ms to minimize.
[2022-05-17 21:45:52] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 1 ms to minimize.
[2022-05-17 21:45:52] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 0 ms to minimize.
[2022-05-17 21:45:52] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 0 ms to minimize.
[2022-05-17 21:45:53] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 0 ms to minimize.
[2022-05-17 21:45:53] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 1 ms to minimize.
[2022-05-17 21:45:53] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 1 ms to minimize.
[2022-05-17 21:45:53] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 1 ms to minimize.
[2022-05-17 21:45:53] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 0 ms to minimize.
[2022-05-17 21:45:53] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 1 ms to minimize.
[2022-05-17 21:45:54] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 1 ms to minimize.
[2022-05-17 21:45:54] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:45:54] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:45:54] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:45:55] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:45:55] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:45:55] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 0 ms to minimize.
[2022-05-17 21:45:55] [INFO ] Deduced a trap composed of 165 places in 141 ms of which 1 ms to minimize.
[2022-05-17 21:45:56] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 0 ms to minimize.
[2022-05-17 21:45:56] [INFO ] Deduced a trap composed of 163 places in 142 ms of which 0 ms to minimize.
[2022-05-17 21:45:56] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 0 ms to minimize.
[2022-05-17 21:45:56] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 1 ms to minimize.
[2022-05-17 21:45:56] [INFO ] Deduced a trap composed of 80 places in 149 ms of which 1 ms to minimize.
[2022-05-17 21:45:56] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 0 ms to minimize.
[2022-05-17 21:45:57] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 0 ms to minimize.
[2022-05-17 21:45:57] [INFO ] Trap strengthening (SAT) tested/added 72/71 trap constraints in 16659 ms
[2022-05-17 21:45:57] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 85 ms.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 69 places in 241 ms of which 5 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 78 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 40 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 154 places in 235 ms of which 0 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 106 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 81 places in 237 ms of which 0 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 55 places in 238 ms of which 1 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 62 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 28 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 69 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 48 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 128 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 66 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 76 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 63 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:46:20] [INFO ] Deduced a trap composed of 52 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:46:20] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:46:20] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 0 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 82 places in 235 ms of which 0 ms to minimize.
[2022-05-17 21:46:21] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 76 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 73 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:46:22] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 20 places in 217 ms of which 0 ms to minimize.
[2022-05-17 21:46:23] [INFO ] Deduced a trap composed of 18 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:46:24] [INFO ] Deduced a trap composed of 147 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:46:24] [INFO ] Deduced a trap composed of 29 places in 234 ms of which 0 ms to minimize.
[2022-05-17 21:46:24] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:46:24] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:46:25] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:46:25] [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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [7, 7] Max seen :[6, 6]
Support contains 294 out of 742 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 742/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 52 ms. Remains 742 /742 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 742/742 places, 1442/1442 transitions.
Starting structural reductions, iteration 0 : 742/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 30 ms. Remains 742 /742 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 21:46:25] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2022-05-17 21:46:25] [INFO ] Computed 27 place invariants in 5 ms
[2022-05-17 21:46:25] [INFO ] Implicit Places using invariants in 351 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 355 ms to find 7 implicit places.
[2022-05-17 21:46:25] [INFO ] Redundant transitions in 94 ms returned []
[2022-05-17 21:46:25] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:46:25] [INFO ] Computed 20 place invariants in 12 ms
[2022-05-17 21:46:26] [INFO ] Dead Transitions using invariants and state equation in 490 ms returned []
Starting structural reductions, iteration 1 : 735/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 30 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 21:46:26] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-17 21:46:26] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:46:26] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 21:46:26] [INFO ] Dead Transitions using invariants and state equation in 508 ms returned []
Finished structural reductions, in 2 iterations. Remains : 735/742 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:46:26] [INFO ] Computed 20 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10659 ms. (steps per millisecond=93 ) properties (out of 2) seen :12
Interrupted Best-First random walk after 917394 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=183 ) properties seen :{0=1, 1=1}
Interrupted Best-First random walk after 918298 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=183 ) properties seen :{0=1, 1=1}
[2022-05-17 21:46:47] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:46:47] [INFO ] Computed 20 place invariants in 12 ms
[2022-05-17 21:46:47] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 21:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:47] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2022-05-17 21:46:47] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:46:47] [INFO ] [Real]Added 366 Read/Feed constraints in 46 ms returned sat
[2022-05-17 21:46:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2022-05-17 21:46:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:48] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2022-05-17 21:46:48] [INFO ] [Nat]Added 366 Read/Feed constraints in 51 ms returned sat
[2022-05-17 21:46:48] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:46:48] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:46:49] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:46:49] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:46:49] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 0 ms to minimize.
[2022-05-17 21:46:50] [INFO ] Deduced a trap composed of 46 places in 250 ms of which 0 ms to minimize.
[2022-05-17 21:46:50] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:46:50] [INFO ] Deduced a trap composed of 61 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:46:50] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:46:51] [INFO ] Deduced a trap composed of 59 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:46:51] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:46:51] [INFO ] Deduced a trap composed of 68 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:46:51] [INFO ] Deduced a trap composed of 52 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:46:52] [INFO ] Deduced a trap composed of 46 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:46:52] [INFO ] Deduced a trap composed of 60 places in 232 ms of which 2 ms to minimize.
[2022-05-17 21:46:52] [INFO ] Deduced a trap composed of 48 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:46:53] [INFO ] Deduced a trap composed of 59 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:46:53] [INFO ] Deduced a trap composed of 59 places in 233 ms of which 0 ms to minimize.
[2022-05-17 21:46:53] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:46:53] [INFO ] Deduced a trap composed of 54 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:46:54] [INFO ] Deduced a trap composed of 46 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:46:54] [INFO ] Deduced a trap composed of 92 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:46:54] [INFO ] Deduced a trap composed of 49 places in 236 ms of which 3 ms to minimize.
[2022-05-17 21:46:55] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:46:55] [INFO ] Deduced a trap composed of 59 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:46:55] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 0 ms to minimize.
[2022-05-17 21:46:55] [INFO ] Deduced a trap composed of 26 places in 245 ms of which 0 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 40 places in 247 ms of which 0 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 50 places in 243 ms of which 1 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 94 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 78 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 80 places in 248 ms of which 1 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 69 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 96 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 68 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 88 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 28 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 38 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 1 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 55 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 74 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 1 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 46 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 36 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 109 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 2 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 85 places in 221 ms of which 1 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 104 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 48 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Trap strengthening (SAT) tested/added 76/75 trap constraints in 20711 ms
[2022-05-17 21:47:09] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 59 ms.
[2022-05-17 21:47:24] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:47:24] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:47:25] [INFO ] Deduced a trap composed of 67 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:47:25] [INFO ] Deduced a trap composed of 76 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:47:25] [INFO ] Deduced a trap composed of 51 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:47:25] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 0 ms to minimize.
[2022-05-17 21:47:26] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:47:26] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 1 ms to minimize.
[2022-05-17 21:47:26] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:47:27] [INFO ] Deduced a trap composed of 96 places in 247 ms of which 0 ms to minimize.
[2022-05-17 21:47:27] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 1 ms to minimize.
[2022-05-17 21:47:27] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 1 ms to minimize.
[2022-05-17 21:47:28] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:47:28] [INFO ] Deduced a trap composed of 60 places in 244 ms of which 1 ms to minimize.
[2022-05-17 21:47:28] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 1 ms to minimize.
[2022-05-17 21:47:29] [INFO ] Deduced a trap composed of 70 places in 248 ms of which 1 ms to minimize.
[2022-05-17 21:47:29] [INFO ] Deduced a trap composed of 103 places in 246 ms of which 0 ms to minimize.
[2022-05-17 21:47:29] [INFO ] Deduced a trap composed of 53 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:47:30] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 0 ms to minimize.
[2022-05-17 21:47:30] [INFO ] Deduced a trap composed of 14 places in 239 ms of which 1 ms to minimize.
[2022-05-17 21:47:30] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 1 ms to minimize.
[2022-05-17 21:47:31] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 0 ms to minimize.
[2022-05-17 21:47:31] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 1 ms to minimize.
[2022-05-17 21:47:31] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 1 ms to minimize.
[2022-05-17 21:47:32] [INFO ] Deduced a trap composed of 34 places in 245 ms of which 1 ms to minimize.
[2022-05-17 21:47:32] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 1 ms to minimize.
[2022-05-17 21:47:32] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 0 ms to minimize.
[2022-05-17 21:47:33] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 1 ms to minimize.
[2022-05-17 21:47:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:47:33] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 21:47:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:33] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2022-05-17 21:47:33] [INFO ] [Real]Added 366 Read/Feed constraints in 48 ms returned sat
[2022-05-17 21:47:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:47:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 21:47:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:34] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2022-05-17 21:47:34] [INFO ] [Nat]Added 366 Read/Feed constraints in 52 ms returned sat
[2022-05-17 21:47:34] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 0 ms to minimize.
[2022-05-17 21:47:34] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 1 ms to minimize.
[2022-05-17 21:47:35] [INFO ] Deduced a trap composed of 38 places in 248 ms of which 0 ms to minimize.
[2022-05-17 21:47:35] [INFO ] Deduced a trap composed of 38 places in 244 ms of which 1 ms to minimize.
[2022-05-17 21:47:35] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 0 ms to minimize.
[2022-05-17 21:47:35] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 0 ms to minimize.
[2022-05-17 21:47:36] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 1 ms to minimize.
[2022-05-17 21:47:36] [INFO ] Deduced a trap composed of 61 places in 239 ms of which 0 ms to minimize.
[2022-05-17 21:47:36] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 0 ms to minimize.
[2022-05-17 21:47:37] [INFO ] Deduced a trap composed of 59 places in 245 ms of which 1 ms to minimize.
[2022-05-17 21:47:37] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 0 ms to minimize.
[2022-05-17 21:47:37] [INFO ] Deduced a trap composed of 68 places in 244 ms of which 0 ms to minimize.
[2022-05-17 21:47:37] [INFO ] Deduced a trap composed of 52 places in 238 ms of which 0 ms to minimize.
[2022-05-17 21:47:38] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 1 ms to minimize.
[2022-05-17 21:47:38] [INFO ] Deduced a trap composed of 60 places in 244 ms of which 1 ms to minimize.
[2022-05-17 21:47:38] [INFO ] Deduced a trap composed of 48 places in 251 ms of which 0 ms to minimize.
[2022-05-17 21:47:39] [INFO ] Deduced a trap composed of 59 places in 245 ms of which 1 ms to minimize.
[2022-05-17 21:47:39] [INFO ] Deduced a trap composed of 59 places in 241 ms of which 0 ms to minimize.
[2022-05-17 21:47:39] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 0 ms to minimize.
[2022-05-17 21:47:39] [INFO ] Deduced a trap composed of 54 places in 238 ms of which 1 ms to minimize.
[2022-05-17 21:47:40] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 1 ms to minimize.
[2022-05-17 21:47:40] [INFO ] Deduced a trap composed of 92 places in 243 ms of which 1 ms to minimize.
[2022-05-17 21:47:40] [INFO ] Deduced a trap composed of 49 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:47:41] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:47:41] [INFO ] Deduced a trap composed of 59 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:47:41] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 1 ms to minimize.
[2022-05-17 21:47:41] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 0 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 1 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 0 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 50 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 44 places in 239 ms of which 0 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 94 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 78 places in 240 ms of which 0 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 80 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 69 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 96 places in 245 ms of which 1 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 68 places in 243 ms of which 0 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 42 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 0 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 88 places in 241 ms of which 0 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 1 ms to minimize.
[2022-05-17 21:47:47] [INFO ] Deduced a trap composed of 38 places in 246 ms of which 1 ms to minimize.
[2022-05-17 21:47:47] [INFO ] Deduced a trap composed of 38 places in 246 ms of which 1 ms to minimize.
[2022-05-17 21:47:47] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 0 ms to minimize.
[2022-05-17 21:47:48] [INFO ] Deduced a trap composed of 55 places in 246 ms of which 0 ms to minimize.
[2022-05-17 21:47:48] [INFO ] Deduced a trap composed of 74 places in 243 ms of which 1 ms to minimize.
[2022-05-17 21:47:48] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 0 ms to minimize.
[2022-05-17 21:47:48] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 1 ms to minimize.
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 1 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 40 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 50 places in 241 ms of which 0 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 1 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 1 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 0 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 109 places in 244 ms of which 1 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 26 places in 248 ms of which 1 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 38 places in 248 ms of which 0 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 85 places in 244 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 104 places in 243 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 0 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 48 places in 244 ms of which 1 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 36 places in 244 ms of which 1 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 1 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 26 places in 251 ms of which 1 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Trap strengthening (SAT) tested/added 76/75 trap constraints in 21750 ms
[2022-05-17 21:47:55] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 62 ms.
[2022-05-17 21:48:11] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:48:11] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:48:11] [INFO ] Deduced a trap composed of 67 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:48:11] [INFO ] Deduced a trap composed of 76 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:48:12] [INFO ] Deduced a trap composed of 51 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:48:12] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:48:12] [INFO ] Deduced a trap composed of 66 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:48:13] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 0 ms to minimize.
[2022-05-17 21:48:13] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 0 ms to minimize.
[2022-05-17 21:48:13] [INFO ] Deduced a trap composed of 96 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:48:14] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:48:14] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:48:14] [INFO ] Deduced a trap composed of 66 places in 232 ms of which 0 ms to minimize.
[2022-05-17 21:48:15] [INFO ] Deduced a trap composed of 60 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:48:15] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:48:15] [INFO ] Deduced a trap composed of 70 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:48:16] [INFO ] Deduced a trap composed of 103 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:48:16] [INFO ] Deduced a trap composed of 53 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:48:16] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:48:17] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:48:17] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:48:17] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:48:18] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:48:18] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:48:18] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:48:18] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:48:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [7, 7] Max seen :[6, 6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 39 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 28 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 21:48:19] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:48:19] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 21:48:19] [INFO ] Implicit Places using invariants in 225 ms returned []
[2022-05-17 21:48:19] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:48:19] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 21:48:19] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:48:21] [INFO ] Implicit Places using invariants and state equation in 2657 ms returned []
Implicit Place search using SMT with State Equation took 2883 ms to find 0 implicit places.
[2022-05-17 21:48:22] [INFO ] Redundant transitions in 90 ms returned []
[2022-05-17 21:48:22] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:48:22] [INFO ] Computed 20 place invariants in 10 ms
[2022-05-17 21:48:22] [INFO ] Dead Transitions using invariants and state equation in 497 ms returned []
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting property specific reduction for Peterson-COL-6-UpperBounds-03
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:48:22] [INFO ] Computed 20 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :2
[2022-05-17 21:48:22] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:48:22] [INFO ] Computed 20 place invariants in 15 ms
[2022-05-17 21:48:22] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 21:48:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:48:22] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2022-05-17 21:48:23] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:48:23] [INFO ] [Real]Added 366 Read/Feed constraints in 49 ms returned sat
[2022-05-17 21:48:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:48:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 21:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:48:23] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2022-05-17 21:48:23] [INFO ] [Nat]Added 366 Read/Feed constraints in 53 ms returned sat
[2022-05-17 21:48:23] [INFO ] Deduced a trap composed of 69 places in 239 ms of which 1 ms to minimize.
[2022-05-17 21:48:24] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 0 ms to minimize.
[2022-05-17 21:48:24] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 0 ms to minimize.
[2022-05-17 21:48:24] [INFO ] Deduced a trap composed of 22 places in 441 ms of which 2 ms to minimize.
[2022-05-17 21:48:25] [INFO ] Deduced a trap composed of 118 places in 440 ms of which 2 ms to minimize.
[2022-05-17 21:48:25] [INFO ] Deduced a trap composed of 43 places in 449 ms of which 2 ms to minimize.
[2022-05-17 21:48:26] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:48:26] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 1 ms to minimize.
[2022-05-17 21:48:26] [INFO ] Deduced a trap composed of 117 places in 439 ms of which 2 ms to minimize.
[2022-05-17 21:48:27] [INFO ] Deduced a trap composed of 22 places in 300 ms of which 0 ms to minimize.
[2022-05-17 21:48:27] [INFO ] Deduced a trap composed of 34 places in 437 ms of which 2 ms to minimize.
[2022-05-17 21:48:28] [INFO ] Deduced a trap composed of 44 places in 399 ms of which 1 ms to minimize.
[2022-05-17 21:48:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [294] Max seen :[4]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 53 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:48:28] [INFO ] Computed 20 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6347 ms. (steps per millisecond=157 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4807 ms. (steps per millisecond=208 ) properties (out of 1) seen :2
[2022-05-17 21:48:39] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:48:39] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-17 21:48:39] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2022-05-17 21:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:48:39] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2022-05-17 21:48:39] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:48:39] [INFO ] [Real]Added 366 Read/Feed constraints in 47 ms returned sat
[2022-05-17 21:48:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:48:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 21:48:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:48:40] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2022-05-17 21:48:40] [INFO ] [Nat]Added 366 Read/Feed constraints in 50 ms returned sat
[2022-05-17 21:48:40] [INFO ] Deduced a trap composed of 29 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:48:40] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:48:41] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:48:41] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 0 ms to minimize.
[2022-05-17 21:48:41] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:48:41] [INFO ] Deduced a trap composed of 46 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:48:42] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:48:42] [INFO ] Deduced a trap composed of 61 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:48:42] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 59 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 68 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 52 places in 219 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 60 places in 219 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 48 places in 218 ms of which 0 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 59 places in 234 ms of which 0 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 59 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:48:46] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:48:46] [INFO ] Deduced a trap composed of 92 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:48:46] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 1 ms to minimize.
[2022-05-17 21:48:46] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:48:47] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:48:47] [INFO ] Deduced a trap composed of 44 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:48:47] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 0 ms to minimize.
[2022-05-17 21:48:47] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:48:48] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 0 ms to minimize.
[2022-05-17 21:48:48] [INFO ] Deduced a trap composed of 50 places in 221 ms of which 1 ms to minimize.
[2022-05-17 21:48:48] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:48:48] [INFO ] Deduced a trap composed of 94 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:48:49] [INFO ] Deduced a trap composed of 78 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:48:49] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:48:49] [INFO ] Deduced a trap composed of 39 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:48:50] [INFO ] Deduced a trap composed of 80 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:48:50] [INFO ] Deduced a trap composed of 69 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:48:50] [INFO ] Deduced a trap composed of 96 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:48:50] [INFO ] Deduced a trap composed of 68 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:48:51] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:48:51] [INFO ] Deduced a trap composed of 33 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:48:51] [INFO ] Deduced a trap composed of 88 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:48:51] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 1 ms to minimize.
[2022-05-17 21:48:52] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:48:52] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:48:52] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 0 ms to minimize.
[2022-05-17 21:48:52] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:48:53] [INFO ] Deduced a trap composed of 55 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:48:53] [INFO ] Deduced a trap composed of 74 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:48:53] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:48:54] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:48:54] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:48:54] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:48:54] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:48:55] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:48:55] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:48:55] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:48:56] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:48:56] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:48:56] [INFO ] Deduced a trap composed of 36 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:48:56] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:48:57] [INFO ] Deduced a trap composed of 109 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:48:57] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 5 ms to minimize.
[2022-05-17 21:48:57] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:48:57] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:48:58] [INFO ] Deduced a trap composed of 85 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:48:58] [INFO ] Deduced a trap composed of 104 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:48:58] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 0 ms to minimize.
[2022-05-17 21:48:58] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:48:59] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:48:59] [INFO ] Deduced a trap composed of 36 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:48:59] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:49:00] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 1 ms to minimize.
[2022-05-17 21:49:00] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:49:00] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:49:00] [INFO ] Trap strengthening (SAT) tested/added 76/75 trap constraints in 20353 ms
[2022-05-17 21:49:00] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 54 ms.
[2022-05-17 21:49:15] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:49:16] [INFO ] Deduced a trap composed of 50 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:49:16] [INFO ] Deduced a trap composed of 67 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:49:16] [INFO ] Deduced a trap composed of 76 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:49:16] [INFO ] Deduced a trap composed of 51 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:49:17] [INFO ] Deduced a trap composed of 66 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:49:17] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:49:17] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:49:18] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 0 ms to minimize.
[2022-05-17 21:49:18] [INFO ] Deduced a trap composed of 96 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:49:18] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 1 ms to minimize.
[2022-05-17 21:49:19] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:49:19] [INFO ] Deduced a trap composed of 66 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:49:19] [INFO ] Deduced a trap composed of 60 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:49:20] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:49:20] [INFO ] Deduced a trap composed of 70 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:49:20] [INFO ] Deduced a trap composed of 103 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:49:21] [INFO ] Deduced a trap composed of 53 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:49:21] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:49:21] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:49:21] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:49:22] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:49:22] [INFO ] Deduced a trap composed of 48 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:49:22] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:49:23] [INFO ] Deduced a trap composed of 34 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:49:23] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:49:23] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:49:24] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 0 ms to minimize.
[2022-05-17 21:49:24] [INFO ] Deduced a trap composed of 68 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:49:24] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:49:25] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:49:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 17 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 16 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 21:49:25] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:49:25] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 21:49:25] [INFO ] Implicit Places using invariants in 268 ms returned []
[2022-05-17 21:49:25] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:49:25] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 21:49:25] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:49:28] [INFO ] Implicit Places using invariants and state equation in 2646 ms returned []
Implicit Place search using SMT with State Equation took 2915 ms to find 0 implicit places.
[2022-05-17 21:49:28] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-17 21:49:28] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:49:28] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 21:49:28] [INFO ] Dead Transitions using invariants and state equation in 442 ms returned []
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:49:28] [INFO ] Computed 20 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6447 ms. (steps per millisecond=155 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4885 ms. (steps per millisecond=204 ) properties (out of 1) seen :1
[2022-05-17 21:49:39] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:49:39] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 21:49:40] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2022-05-17 21:49:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:49:40] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2022-05-17 21:49:40] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:49:40] [INFO ] [Real]Added 366 Read/Feed constraints in 50 ms returned sat
[2022-05-17 21:49:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:49:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 21:49:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:49:40] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2022-05-17 21:49:40] [INFO ] [Nat]Added 366 Read/Feed constraints in 53 ms returned sat
[2022-05-17 21:49:41] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:49:41] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:49:41] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:49:41] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:49:42] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:49:42] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 0 ms to minimize.
[2022-05-17 21:49:42] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:49:42] [INFO ] Deduced a trap composed of 61 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:49:43] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:49:43] [INFO ] Deduced a trap composed of 59 places in 232 ms of which 0 ms to minimize.
[2022-05-17 21:49:43] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:49:44] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:49:44] [INFO ] Deduced a trap composed of 52 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:49:44] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:49:44] [INFO ] Deduced a trap composed of 60 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:49:45] [INFO ] Deduced a trap composed of 48 places in 260 ms of which 0 ms to minimize.
[2022-05-17 21:49:45] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:49:45] [INFO ] Deduced a trap composed of 59 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:49:45] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:49:46] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:49:46] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:49:46] [INFO ] Deduced a trap composed of 92 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:49:47] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:49:47] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 0 ms to minimize.
[2022-05-17 21:49:47] [INFO ] Deduced a trap composed of 59 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:49:47] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:49:48] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:49:48] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 0 ms to minimize.
[2022-05-17 21:49:48] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:49:48] [INFO ] Deduced a trap composed of 50 places in 234 ms of which 0 ms to minimize.
[2022-05-17 21:49:49] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:49:49] [INFO ] Deduced a trap composed of 94 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:49:49] [INFO ] Deduced a trap composed of 78 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:49:49] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 0 ms to minimize.
[2022-05-17 21:49:50] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:49:50] [INFO ] Deduced a trap composed of 80 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:49:50] [INFO ] Deduced a trap composed of 69 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:49:51] [INFO ] Deduced a trap composed of 96 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:49:51] [INFO ] Deduced a trap composed of 68 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:49:51] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 0 ms to minimize.
[2022-05-17 21:49:51] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:49:52] [INFO ] Deduced a trap composed of 88 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:49:52] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:49:52] [INFO ] Deduced a trap composed of 28 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:49:52] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:49:53] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:49:53] [INFO ] Deduced a trap composed of 33 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:49:53] [INFO ] Deduced a trap composed of 55 places in 219 ms of which 0 ms to minimize.
[2022-05-17 21:49:54] [INFO ] Deduced a trap composed of 74 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:49:54] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:49:54] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:49:54] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 0 ms to minimize.
[2022-05-17 21:49:55] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:49:55] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:49:55] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 1 ms to minimize.
[2022-05-17 21:49:55] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:49:56] [INFO ] Deduced a trap composed of 50 places in 219 ms of which 0 ms to minimize.
[2022-05-17 21:49:56] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:49:56] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:49:56] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:49:57] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:49:57] [INFO ] Deduced a trap composed of 109 places in 218 ms of which 1 ms to minimize.
[2022-05-17 21:49:57] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:49:58] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:49:58] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:49:58] [INFO ] Deduced a trap composed of 85 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:49:58] [INFO ] Deduced a trap composed of 104 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:49:59] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:49:59] [INFO ] Deduced a trap composed of 48 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:49:59] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:49:59] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:50:00] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:50:00] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:50:00] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:50:01] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:50:01] [INFO ] Trap strengthening (SAT) tested/added 76/75 trap constraints in 20296 ms
[2022-05-17 21:50:01] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 59 ms.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 76 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 51 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 1 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:50:19] [INFO ] Deduced a trap composed of 96 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:50:19] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:50:19] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:50:19] [INFO ] Deduced a trap composed of 66 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:50:20] [INFO ] Deduced a trap composed of 60 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:50:20] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:50:20] [INFO ] Deduced a trap composed of 70 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:50:21] [INFO ] Deduced a trap composed of 103 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:50:21] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:50:21] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:50:22] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:50:22] [INFO ] Deduced a trap composed of 42 places in 232 ms of which 0 ms to minimize.
[2022-05-17 21:50:22] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 48 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 34 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 68 places in 233 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 2 places in 300 ms of which 0 ms to minimize.
[2022-05-17 21:50:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 16 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 16 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 21:50:25] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:50:25] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-17 21:50:26] [INFO ] Implicit Places using invariants in 245 ms returned []
[2022-05-17 21:50:26] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:50:26] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 21:50:26] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:50:28] [INFO ] Implicit Places using invariants and state equation in 2779 ms returned []
Implicit Place search using SMT with State Equation took 3027 ms to find 0 implicit places.
[2022-05-17 21:50:28] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-17 21:50:28] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:50:28] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-17 21:50:29] [INFO ] Dead Transitions using invariants and state equation in 463 ms returned []
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Ending property specific reduction for Peterson-COL-6-UpperBounds-03 in 126763 ms.
Starting property specific reduction for Peterson-COL-6-UpperBounds-13
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:50:29] [INFO ] Computed 20 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :1
[2022-05-17 21:50:29] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:50:29] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-17 21:50:29] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 21:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:29] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2022-05-17 21:50:29] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:50:29] [INFO ] [Real]Added 366 Read/Feed constraints in 44 ms returned sat
[2022-05-17 21:50:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:50:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2022-05-17 21:50:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:30] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2022-05-17 21:50:30] [INFO ] [Nat]Added 366 Read/Feed constraints in 52 ms returned sat
[2022-05-17 21:50:30] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:50:30] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:50:31] [INFO ] Deduced a trap composed of 28 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:50:31] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:50:31] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 0 ms to minimize.
[2022-05-17 21:50:31] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:50:32] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:50:32] [INFO ] Deduced a trap composed of 50 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:50:32] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 0 ms to minimize.
[2022-05-17 21:50:32] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 0 ms to minimize.
[2022-05-17 21:50:33] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:50:33] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 1 ms to minimize.
[2022-05-17 21:50:33] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:50:33] [INFO ] Deduced a trap composed of 68 places in 218 ms of which 0 ms to minimize.
[2022-05-17 21:50:34] [INFO ] Deduced a trap composed of 50 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:50:34] [INFO ] Deduced a trap composed of 101 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:50:34] [INFO ] Deduced a trap composed of 101 places in 219 ms of which 0 ms to minimize.
[2022-05-17 21:50:35] [INFO ] Deduced a trap composed of 106 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:50:35] [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) : [294] Max seen :[5]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 16 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:50:35] [INFO ] Computed 20 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6407 ms. (steps per millisecond=156 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4912 ms. (steps per millisecond=203 ) properties (out of 1) seen :2
[2022-05-17 21:50:46] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:50:46] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-17 21:50:46] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 21:50:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:46] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2022-05-17 21:50:46] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:50:46] [INFO ] [Real]Added 366 Read/Feed constraints in 48 ms returned sat
[2022-05-17 21:50:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:50:46] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 21:50:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:47] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2022-05-17 21:50:47] [INFO ] [Nat]Added 366 Read/Feed constraints in 51 ms returned sat
[2022-05-17 21:50:47] [INFO ] Deduced a trap composed of 29 places in 233 ms of which 0 ms to minimize.
[2022-05-17 21:50:47] [INFO ] Deduced a trap composed of 33 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:50:48] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:50:48] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:50:48] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:50:48] [INFO ] Deduced a trap composed of 46 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:50:49] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:50:49] [INFO ] Deduced a trap composed of 61 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:50:49] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:50:49] [INFO ] Deduced a trap composed of 59 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:50:50] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:50:50] [INFO ] Deduced a trap composed of 68 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:50:50] [INFO ] Deduced a trap composed of 52 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:50:51] [INFO ] Deduced a trap composed of 46 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:50:51] [INFO ] Deduced a trap composed of 60 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:50:51] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:50:51] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 0 ms to minimize.
[2022-05-17 21:50:52] [INFO ] Deduced a trap composed of 59 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:50:52] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:50:52] [INFO ] Deduced a trap composed of 54 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:50:52] [INFO ] Deduced a trap composed of 46 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:50:53] [INFO ] Deduced a trap composed of 92 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:50:53] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:50:53] [INFO ] Deduced a trap composed of 44 places in 221 ms of which 1 ms to minimize.
[2022-05-17 21:50:54] [INFO ] Deduced a trap composed of 59 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:50:54] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 0 ms to minimize.
[2022-05-17 21:50:54] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:50:54] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:50:55] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:50:55] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:50:55] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:50:55] [INFO ] Deduced a trap composed of 94 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:50:56] [INFO ] Deduced a trap composed of 78 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:50:56] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:50:56] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:50:57] [INFO ] Deduced a trap composed of 80 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:50:57] [INFO ] Deduced a trap composed of 69 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:50:57] [INFO ] Deduced a trap composed of 96 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:50:57] [INFO ] Deduced a trap composed of 68 places in 245 ms of which 1 ms to minimize.
[2022-05-17 21:50:58] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:50:58] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:50:58] [INFO ] Deduced a trap composed of 88 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:50:58] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:50:59] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:50:59] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:50:59] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:51:00] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:51:00] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:51:00] [INFO ] Deduced a trap composed of 74 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:51:00] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:51:01] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:51:01] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:51:01] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:51:01] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:51:02] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 0 ms to minimize.
[2022-05-17 21:51:02] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:51:02] [INFO ] Deduced a trap composed of 50 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:51:03] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:51:03] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:51:03] [INFO ] Deduced a trap composed of 36 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:51:03] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:51:04] [INFO ] Deduced a trap composed of 109 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:51:04] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:51:04] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:51:04] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:51:05] [INFO ] Deduced a trap composed of 85 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:51:05] [INFO ] Deduced a trap composed of 104 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:51:05] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:51:06] [INFO ] Deduced a trap composed of 48 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:51:06] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:51:06] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 0 ms to minimize.
[2022-05-17 21:51:06] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:51:07] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:51:07] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:51:07] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:51:07] [INFO ] Trap strengthening (SAT) tested/added 76/75 trap constraints in 20454 ms
[2022-05-17 21:51:07] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 59 ms.
[2022-05-17 21:51:22] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:51:23] [INFO ] Deduced a trap composed of 50 places in 233 ms of which 0 ms to minimize.
[2022-05-17 21:51:23] [INFO ] Deduced a trap composed of 67 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:51:23] [INFO ] Deduced a trap composed of 76 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:51:24] [INFO ] Deduced a trap composed of 51 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:51:24] [INFO ] Deduced a trap composed of 66 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:51:24] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:51:25] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:51:25] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:51:25] [INFO ] Deduced a trap composed of 96 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:51:26] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:51:26] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:51:26] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:51:27] [INFO ] Deduced a trap composed of 60 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:51:27] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:51:27] [INFO ] Deduced a trap composed of 70 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:51:28] [INFO ] Deduced a trap composed of 103 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:51:28] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:51:28] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:51:29] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:51:29] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:51:29] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 0 ms to minimize.
[2022-05-17 21:51:29] [INFO ] Deduced a trap composed of 48 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:51:30] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:51:30] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:51:30] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:51:31] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:51:31] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:51:31] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:51:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 15 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 15 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 21:51:31] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:51:31] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 21:51:32] [INFO ] Implicit Places using invariants in 220 ms returned []
[2022-05-17 21:51:32] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:51:32] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 21:51:32] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:51:34] [INFO ] Implicit Places using invariants and state equation in 2693 ms returned []
Implicit Place search using SMT with State Equation took 2914 ms to find 0 implicit places.
[2022-05-17 21:51:34] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-17 21:51:34] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:51:34] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-17 21:51:35] [INFO ] Dead Transitions using invariants and state equation in 461 ms returned []
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:51:35] [INFO ] Computed 20 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6162 ms. (steps per millisecond=162 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4823 ms. (steps per millisecond=207 ) properties (out of 1) seen :1
[2022-05-17 21:51:46] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:51:46] [INFO ] Computed 20 place invariants in 11 ms
[2022-05-17 21:51:46] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 21:51:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:51:46] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2022-05-17 21:51:46] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:51:46] [INFO ] [Real]Added 366 Read/Feed constraints in 46 ms returned sat
[2022-05-17 21:51:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:51:46] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 21:51:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:51:47] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2022-05-17 21:51:47] [INFO ] [Nat]Added 366 Read/Feed constraints in 50 ms returned sat
[2022-05-17 21:51:47] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:51:47] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:51:47] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:51:48] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:51:48] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:51:48] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:51:49] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:51:49] [INFO ] Deduced a trap composed of 61 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:51:49] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:51:49] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:51:50] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 1 ms to minimize.
[2022-05-17 21:51:50] [INFO ] Deduced a trap composed of 68 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:51:50] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:51:50] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 0 ms to minimize.
[2022-05-17 21:51:51] [INFO ] Deduced a trap composed of 60 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:51:51] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:51:51] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 0 ms to minimize.
[2022-05-17 21:51:52] [INFO ] Deduced a trap composed of 59 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:51:52] [INFO ] Deduced a trap composed of 38 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:51:52] [INFO ] Deduced a trap composed of 54 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:51:52] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:51:53] [INFO ] Deduced a trap composed of 92 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:51:53] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 1 ms to minimize.
[2022-05-17 21:51:53] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:51:53] [INFO ] Deduced a trap composed of 59 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:51:54] [INFO ] Deduced a trap composed of 44 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:51:54] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 0 ms to minimize.
[2022-05-17 21:51:54] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:51:54] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:51:55] [INFO ] Deduced a trap composed of 50 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:51:55] [INFO ] Deduced a trap composed of 44 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:51:55] [INFO ] Deduced a trap composed of 94 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:51:56] [INFO ] Deduced a trap composed of 78 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:51:56] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:51:56] [INFO ] Deduced a trap composed of 39 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:51:56] [INFO ] Deduced a trap composed of 80 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:51:57] [INFO ] Deduced a trap composed of 69 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:51:57] [INFO ] Deduced a trap composed of 96 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:51:57] [INFO ] Deduced a trap composed of 68 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:51:57] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:51:58] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:51:58] [INFO ] Deduced a trap composed of 88 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:51:58] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:51:58] [INFO ] Deduced a trap composed of 28 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:51:59] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 0 ms to minimize.
[2022-05-17 21:51:59] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:51:59] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:52:00] [INFO ] Deduced a trap composed of 55 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:52:00] [INFO ] Deduced a trap composed of 74 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:52:00] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:52:00] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 1 ms to minimize.
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 1 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 40 places in 247 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 109 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:52:04] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:52:04] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:52:04] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:52:05] [INFO ] Deduced a trap composed of 85 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:52:05] [INFO ] Deduced a trap composed of 104 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:52:05] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:52:05] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:52:06] [INFO ] Deduced a trap composed of 48 places in 231 ms of which 5 ms to minimize.
[2022-05-17 21:52:06] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:52:06] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:52:06] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:52:07] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:52:07] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:52:07] [INFO ] Trap strengthening (SAT) tested/added 76/75 trap constraints in 20346 ms
[2022-05-17 21:52:07] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 57 ms.
[2022-05-17 21:52:22] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:52:23] [INFO ] Deduced a trap composed of 50 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:52:23] [INFO ] Deduced a trap composed of 67 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:52:23] [INFO ] Deduced a trap composed of 76 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:52:24] [INFO ] Deduced a trap composed of 51 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:52:24] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:52:24] [INFO ] Deduced a trap composed of 66 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:52:25] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:52:25] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:52:25] [INFO ] Deduced a trap composed of 96 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:52:26] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:52:26] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 0 ms to minimize.
[2022-05-17 21:52:26] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:52:27] [INFO ] Deduced a trap composed of 60 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:52:27] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:52:27] [INFO ] Deduced a trap composed of 70 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:52:27] [INFO ] Deduced a trap composed of 103 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:52:28] [INFO ] Deduced a trap composed of 53 places in 250 ms of which 1 ms to minimize.
[2022-05-17 21:52:28] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:52:28] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:52:29] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:52:29] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:52:29] [INFO ] Deduced a trap composed of 48 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:52:30] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:52:30] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:52:30] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:52:31] [INFO ] Deduced a trap composed of 36 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:52:31] [INFO ] Deduced a trap composed of 28 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:52:31] [INFO ] Deduced a trap composed of 68 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:52:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 15 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 15 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 21:52:31] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:52:31] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 21:52:32] [INFO ] Implicit Places using invariants in 248 ms returned []
[2022-05-17 21:52:32] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:52:32] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 21:52:32] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:52:34] [INFO ] Implicit Places using invariants and state equation in 2706 ms returned []
Implicit Place search using SMT with State Equation took 2955 ms to find 0 implicit places.
[2022-05-17 21:52:34] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-17 21:52:34] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:52:34] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-17 21:52:35] [INFO ] Dead Transitions using invariants and state equation in 446 ms returned []
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Ending property specific reduction for Peterson-COL-6-UpperBounds-13 in 126013 ms.
[2022-05-17 21:52:35] [INFO ] Flatten gal took : 155 ms
[2022-05-17 21:52:35] [INFO ] Applying decomposition
[2022-05-17 21:52:35] [INFO ] Flatten gal took : 85 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/graph435745823326856871.txt, -o, /tmp/graph435745823326856871.bin, -w, /tmp/graph435745823326856871.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/graph435745823326856871.bin, -l, -1, -v, -w, /tmp/graph435745823326856871.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-17 21:52:35] [INFO ] Decomposing Gal with order
[2022-05-17 21:52:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 21:52:36] [INFO ] Removed a total of 2000 redundant transitions.
[2022-05-17 21:52:36] [INFO ] Flatten gal took : 154 ms
[2022-05-17 21:52:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 49 ms.
[2022-05-17 21:52:36] [INFO ] Time to serialize gal into /tmp/UpperBounds12438628589752502417.gal : 19 ms
[2022-05-17 21:52:36] [INFO ] Time to serialize properties into /tmp/UpperBounds8571345584729685094.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/UpperBounds12438628589752502417.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds8571345584729685094.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds12438628589752502417.gal -t CGAL -reachable-file /tmp/UpperBounds8571345584729685094.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds8571345584729685094.prop.
Detected timeout of ITS tools.
[2022-05-17 22:15:35] [INFO ] Applying decomposition
[2022-05-17 22:15:35] [INFO ] Flatten gal took : 381 ms
[2022-05-17 22:15:35] [INFO ] Decomposing Gal with order
[2022-05-17 22:15:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:15:37] [INFO ] Removed a total of 2121 redundant transitions.
[2022-05-17 22:15:38] [INFO ] Flatten gal took : 482 ms
[2022-05-17 22:15:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 70 ms.
[2022-05-17 22:15:38] [INFO ] Time to serialize gal into /tmp/UpperBounds3039020370110199112.gal : 45 ms
[2022-05-17 22:15:38] [INFO ] Time to serialize properties into /tmp/UpperBounds4168865413952371645.prop : 6 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/UpperBounds3039020370110199112.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds4168865413952371645.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds3039020370110199112.gal -t CGAL -reachable-file /tmp/UpperBounds4168865413952371645.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds4168865413952371645.prop.
Detected timeout of ITS tools.
[2022-05-17 22:38:28] [INFO ] Flatten gal took : 389 ms
[2022-05-17 22:38:29] [INFO ] Input system was already deterministic with 1442 transitions.
[2022-05-17 22:38:29] [INFO ] Transformed 735 places.
[2022-05-17 22:38:29] [INFO ] Transformed 1442 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 22:38:29] [INFO ] Time to serialize gal into /tmp/UpperBounds13438348859750584364.gal : 41 ms
[2022-05-17 22:38:29] [INFO ] Time to serialize properties into /tmp/UpperBounds15431798801561717443.prop : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds13438348859750584364.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15431798801561717443.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds13438348859750584364.gal -t CGAL -reachable-file /tmp/UpperBounds15431798801561717443.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds15431798801561717443.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-6"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is Peterson-COL-6, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-165277026700013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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