About the Execution of 2023-gold for HypertorusGrid-PT-d5k3p2b10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16214.035 | 3600000.00 | 3578240.00 | 64315.00 | 1 ? ? ? ? 1 ? ? ? 1 1 1 1 1 1 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r219-smll-171649598100201.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is HypertorusGrid-PT-d5k3p2b10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649598100201
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 14 03:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 14 03:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 13 22:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 128K Apr 13 22:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 14M May 18 16:42 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 HypertorusGrid-PT-d5k3p2b10-UpperBounds-00
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-UpperBounds-01
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-UpperBounds-02
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-UpperBounds-03
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-UpperBounds-04
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-UpperBounds-05
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-UpperBounds-06
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-UpperBounds-07
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-UpperBounds-08
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-UpperBounds-09
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-UpperBounds-10
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-UpperBounds-11
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-UpperBounds-12
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-UpperBounds-13
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-UpperBounds-14
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716708059829
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HypertorusGrid-PT-d5k3p2b10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-26 07:21:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 07:21:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 07:21:04] [INFO ] Load time of PNML (sax parser for PT used): 823 ms
[2024-05-26 07:21:04] [INFO ] Transformed 7533 places.
[2024-05-26 07:21:04] [INFO ] Transformed 24300 transitions.
[2024-05-26 07:21:04] [INFO ] Parsed PT model containing 7533 places and 24300 transitions and 97200 arcs in 1049 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 24300 rows 7533 cols
[2024-05-26 07:21:06] [INFO ] Computed 2674 invariants in 1309 ms
FORMULA HypertorusGrid-PT-d5k3p2b10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d5k3p2b10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d5k3p2b10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d5k3p2b10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8517 ms. (steps per millisecond=1 ) properties (out of 12) seen :46
FORMULA HypertorusGrid-PT-d5k3p2b10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypertorusGrid-PT-d5k3p2b10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypertorusGrid-PT-d5k3p2b10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypertorusGrid-PT-d5k3p2b10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 997 ms. (steps per millisecond=10 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1043 ms. (steps per millisecond=9 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1120 ms. (steps per millisecond=8 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1253 ms. (steps per millisecond=7 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1098 ms. (steps per millisecond=9 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1152 ms. (steps per millisecond=8 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1255 ms. (steps per millisecond=7 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1079 ms. (steps per millisecond=9 ) properties (out of 8) seen :24
[2024-05-26 07:21:23] [INFO ] Invariant cache hit.
[2024-05-26 07:21:27] [INFO ] [Real]Absence check using 2673 positive place invariants in 1879 ms returned sat
[2024-05-26 07:21:28] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 1204 ms returned sat
[2024-05-26 07:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:21:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 07:21:31] [INFO ] [Real]Absence check using 2673 positive place invariants in 1504 ms returned sat
[2024-05-26 07:21:32] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 818 ms returned sat
[2024-05-26 07:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:21:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 07:21:36] [INFO ] [Real]Absence check using 2673 positive place invariants in 1386 ms returned sat
[2024-05-26 07:21:37] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 948 ms returned sat
[2024-05-26 07:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:21:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 07:21:41] [INFO ] [Real]Absence check using 2673 positive place invariants in 1354 ms returned sat
[2024-05-26 07:21:42] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 1011 ms returned sat
[2024-05-26 07:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:21:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 07:21:46] [INFO ] [Real]Absence check using 2673 positive place invariants in 1330 ms returned sat
[2024-05-26 07:21:47] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 821 ms returned sat
[2024-05-26 07:21:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:21:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 07:21:51] [INFO ] [Real]Absence check using 2673 positive place invariants in 1339 ms returned sat
[2024-05-26 07:21:52] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 820 ms returned sat
[2024-05-26 07:21:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:21:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 07:21:56] [INFO ] [Real]Absence check using 2673 positive place invariants in 1327 ms returned sat
[2024-05-26 07:21:57] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 841 ms returned sat
[2024-05-26 07:21:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:21:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 07:22:01] [INFO ] [Real]Absence check using 2673 positive place invariants in 1419 ms returned sat
[2024-05-26 07:22:02] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 811 ms returned sat
[2024-05-26 07:22:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:22:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [30, 30, 30, 30, 30, 30, 30, 30] Max seen :[3, 5, 2, 3, 16, 3, 5, 5]
Support contains 7 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 2619 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2631 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 07:22:06] [INFO ] Invariant cache hit.
Finished random walk after 36217 steps, including 0 resets, run visited all 8 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 52141 steps, including 0 resets, run visited all 8 properties in 5043 ms. (steps per millisecond=10 )
Finished Best-First random walk after 57825 steps, including 0 resets, run visited all 8 properties in 5019 ms. (steps per millisecond=11 )
Finished Best-First random walk after 56331 steps, including 0 resets, run visited all 8 properties in 5009 ms. (steps per millisecond=11 )
Finished Best-First random walk after 58938 steps, including 0 resets, run visited all 8 properties in 5032 ms. (steps per millisecond=11 )
Finished Best-First random walk after 59922 steps, including 0 resets, run visited all 8 properties in 5071 ms. (steps per millisecond=11 )
Finished Best-First random walk after 56267 steps, including 0 resets, run visited all 8 properties in 5083 ms. (steps per millisecond=11 )
Finished Best-First random walk after 59938 steps, including 0 resets, run visited all 8 properties in 5033 ms. (steps per millisecond=11 )
Finished Best-First random walk after 59682 steps, including 0 resets, run visited all 8 properties in 5012 ms. (steps per millisecond=11 )
[2024-05-26 07:23:17] [INFO ] Invariant cache hit.
[2024-05-26 07:23:19] [INFO ] [Real]Absence check using 2673 positive place invariants in 1315 ms returned sat
[2024-05-26 07:23:20] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 1032 ms returned sat
[2024-05-26 07:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:23:40] [INFO ] [Real]Absence check using state equation in 19964 ms returned sat
[2024-05-26 07:23:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:23:44] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1364 ms returned sat
[2024-05-26 07:23:45] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 1041 ms returned sat
[2024-05-26 07:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:24:06] [INFO ] [Nat]Absence check using state equation in 20639 ms returned sat
[2024-05-26 07:24:09] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1924 ms.
[2024-05-26 07:24:11] [INFO ] [Real]Absence check using 2673 positive place invariants in 1248 ms returned sat
[2024-05-26 07:24:12] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 842 ms returned sat
[2024-05-26 07:24:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:24:32] [INFO ] [Real]Absence check using state equation in 19293 ms returned sat
[2024-05-26 07:24:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:24:35] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1349 ms returned sat
[2024-05-26 07:24:36] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 945 ms returned sat
[2024-05-26 07:24:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:24:57] [INFO ] [Nat]Absence check using state equation in 20598 ms returned sat
[2024-05-26 07:24:59] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1540 ms.
[2024-05-26 07:25:01] [INFO ] [Real]Absence check using 2673 positive place invariants in 1410 ms returned sat
[2024-05-26 07:25:02] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 826 ms returned sat
[2024-05-26 07:25:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:25:22] [INFO ] [Real]Absence check using state equation in 19876 ms returned sat
[2024-05-26 07:25:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:25:26] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1456 ms returned sat
[2024-05-26 07:25:27] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 1012 ms returned sat
[2024-05-26 07:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:25:47] [INFO ] [Nat]Absence check using state equation in 20339 ms returned sat
[2024-05-26 07:25:50] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1652 ms.
[2024-05-26 07:25:52] [INFO ] [Real]Absence check using 2673 positive place invariants in 1256 ms returned sat
[2024-05-26 07:25:53] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 857 ms returned sat
[2024-05-26 07:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:26:12] [INFO ] [Real]Absence check using state equation in 18896 ms returned sat
[2024-05-26 07:26:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:26:15] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1258 ms returned sat
[2024-05-26 07:26:16] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 816 ms returned sat
[2024-05-26 07:26:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:26:38] [INFO ] [Nat]Absence check using state equation in 21956 ms returned sat
[2024-05-26 07:26:41] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1617 ms.
[2024-05-26 07:26:43] [INFO ] [Real]Absence check using 2673 positive place invariants in 1216 ms returned sat
[2024-05-26 07:26:44] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 825 ms returned sat
[2024-05-26 07:26:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:27:03] [INFO ] [Real]Absence check using state equation in 19329 ms returned sat
[2024-05-26 07:27:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:27:06] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1249 ms returned sat
[2024-05-26 07:27:07] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 831 ms returned sat
[2024-05-26 07:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:27:34] [INFO ] [Nat]Absence check using state equation in 26788 ms returned sat
[2024-05-26 07:27:37] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1728 ms.
[2024-05-26 07:27:39] [INFO ] [Real]Absence check using 2673 positive place invariants in 1319 ms returned sat
[2024-05-26 07:27:40] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 844 ms returned sat
[2024-05-26 07:27:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:28:04] [INFO ] [Real]Absence check using state equation in 23388 ms returned sat
[2024-05-26 07:28:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:28:07] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1315 ms returned sat
[2024-05-26 07:28:08] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 828 ms returned sat
[2024-05-26 07:28:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:28:30] [INFO ] [Nat]Absence check using state equation in 22307 ms returned sat
[2024-05-26 07:28:33] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1520 ms.
[2024-05-26 07:28:35] [INFO ] [Real]Absence check using 2673 positive place invariants in 1314 ms returned sat
[2024-05-26 07:28:36] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 829 ms returned sat
[2024-05-26 07:28:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:28:57] [INFO ] [Real]Absence check using state equation in 21466 ms returned sat
[2024-05-26 07:28:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:29:01] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1353 ms returned sat
[2024-05-26 07:29:02] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 1034 ms returned sat
[2024-05-26 07:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:29:23] [INFO ] [Nat]Absence check using state equation in 21570 ms returned sat
[2024-05-26 07:29:26] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1518 ms.
[2024-05-26 07:29:28] [INFO ] [Real]Absence check using 2673 positive place invariants in 1339 ms returned sat
[2024-05-26 07:29:29] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 1027 ms returned sat
[2024-05-26 07:29:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:29:51] [INFO ] [Real]Absence check using state equation in 21839 ms returned sat
[2024-05-26 07:29:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:29:55] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1351 ms returned sat
[2024-05-26 07:29:55] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 826 ms returned sat
[2024-05-26 07:29:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:30:17] [INFO ] [Nat]Absence check using state equation in 21380 ms returned sat
[2024-05-26 07:30:19] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1428 ms.
Current structural bounds on expressions (after SMT) : [30, 30, 30, 30, 30, 30, 30, 30] Max seen :[3, 5, 6, 5, 20, 4, 6, 5]
Support contains 7 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 2343 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2344 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 2492 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 07:30:24] [INFO ] Invariant cache hit.
[2024-05-26 07:30:25] [INFO ] Implicit Places using invariants in 1224 ms returned []
Implicit Place search using SMT only with invariants took 1226 ms to find 0 implicit places.
[2024-05-26 07:30:25] [INFO ] Invariant cache hit.
[2024-05-26 07:30:27] [INFO ] Dead Transitions using invariants and state equation in 1241 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4966 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 07:30:27] [INFO ] Invariant cache hit.
Finished random walk after 37674 steps, including 0 resets, run visited all 8 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 60456 steps, including 0 resets, run visited all 8 properties in 5046 ms. (steps per millisecond=11 )
Finished Best-First random walk after 58938 steps, including 0 resets, run visited all 8 properties in 5124 ms. (steps per millisecond=11 )
Finished Best-First random walk after 59938 steps, including 0 resets, run visited all 8 properties in 5011 ms. (steps per millisecond=11 )
Finished Best-First random walk after 57331 steps, including 0 resets, run visited all 8 properties in 5062 ms. (steps per millisecond=11 )
Finished Best-First random walk after 57331 steps, including 0 resets, run visited all 8 properties in 5054 ms. (steps per millisecond=11 )
Finished Best-First random walk after 55995 steps, including 0 resets, run visited all 8 properties in 5026 ms. (steps per millisecond=11 )
Finished Best-First random walk after 59938 steps, including 0 resets, run visited all 8 properties in 5078 ms. (steps per millisecond=11 )
Finished Best-First random walk after 57235 steps, including 0 resets, run visited all 8 properties in 5068 ms. (steps per millisecond=11 )
[2024-05-26 07:31:37] [INFO ] Invariant cache hit.
[2024-05-26 07:31:40] [INFO ] [Real]Absence check using 2673 positive place invariants in 1322 ms returned sat
[2024-05-26 07:31:41] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 891 ms returned sat
[2024-05-26 07:31:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:32:03] [INFO ] [Real]Absence check using state equation in 22805 ms returned sat
[2024-05-26 07:32:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:32:07] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1336 ms returned sat
[2024-05-26 07:32:07] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 817 ms returned sat
[2024-05-26 07:32:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:32:30] [INFO ] [Nat]Absence check using state equation in 22976 ms returned sat
[2024-05-26 07:32:33] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1659 ms.
[2024-05-26 07:32:36] [INFO ] [Real]Absence check using 2673 positive place invariants in 1495 ms returned sat
[2024-05-26 07:32:37] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 833 ms returned sat
[2024-05-26 07:32:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:32:59] [INFO ] [Real]Absence check using state equation in 21830 ms returned sat
[2024-05-26 07:32:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:33:02] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1354 ms returned sat
[2024-05-26 07:33:03] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 835 ms returned sat
[2024-05-26 07:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:33:25] [INFO ] [Nat]Absence check using state equation in 22459 ms returned sat
[2024-05-26 07:33:28] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1466 ms.
[2024-05-26 07:33:30] [INFO ] [Real]Absence check using 2673 positive place invariants in 1248 ms returned sat
[2024-05-26 07:33:31] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 849 ms returned sat
[2024-05-26 07:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:33:51] [INFO ] [Real]Absence check using state equation in 19672 ms returned sat
[2024-05-26 07:33:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:33:54] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1276 ms returned sat
[2024-05-26 07:33:55] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 831 ms returned sat
[2024-05-26 07:33:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:34:15] [INFO ] [Nat]Absence check using state equation in 20314 ms returned sat
[2024-05-26 07:34:18] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1439 ms.
[2024-05-26 07:34:20] [INFO ] [Real]Absence check using 2673 positive place invariants in 1248 ms returned sat
[2024-05-26 07:34:21] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 814 ms returned sat
[2024-05-26 07:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:34:40] [INFO ] [Real]Absence check using state equation in 19570 ms returned sat
[2024-05-26 07:34:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:34:43] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1272 ms returned sat
[2024-05-26 07:34:44] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 836 ms returned sat
[2024-05-26 07:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:35:04] [INFO ] [Nat]Absence check using state equation in 20395 ms returned sat
[2024-05-26 07:35:07] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1448 ms.
[2024-05-26 07:35:10] [INFO ] [Real]Absence check using 2673 positive place invariants in 1439 ms returned sat
[2024-05-26 07:35:10] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 832 ms returned sat
[2024-05-26 07:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:35:30] [INFO ] [Real]Absence check using state equation in 19603 ms returned sat
[2024-05-26 07:35:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:35:33] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1264 ms returned sat
[2024-05-26 07:35:34] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 827 ms returned sat
[2024-05-26 07:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:35:55] [INFO ] [Nat]Absence check using state equation in 20668 ms returned sat
[2024-05-26 07:35:57] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1441 ms.
[2024-05-26 07:35:59] [INFO ] [Real]Absence check using 2673 positive place invariants in 1253 ms returned sat
[2024-05-26 07:36:00] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 821 ms returned sat
[2024-05-26 07:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:36:20] [INFO ] [Real]Absence check using state equation in 19514 ms returned sat
[2024-05-26 07:36:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:36:23] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1262 ms returned sat
[2024-05-26 07:36:24] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 826 ms returned sat
[2024-05-26 07:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:36:44] [INFO ] [Nat]Absence check using state equation in 20448 ms returned sat
[2024-05-26 07:36:46] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1420 ms.
[2024-05-26 07:36:49] [INFO ] [Real]Absence check using 2673 positive place invariants in 1254 ms returned sat
[2024-05-26 07:36:50] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 822 ms returned sat
[2024-05-26 07:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:37:09] [INFO ] [Real]Absence check using state equation in 19264 ms returned sat
[2024-05-26 07:37:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:37:12] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1272 ms returned sat
[2024-05-26 07:37:13] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 821 ms returned sat
[2024-05-26 07:37:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:37:34] [INFO ] [Nat]Absence check using state equation in 20249 ms returned sat
[2024-05-26 07:37:36] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1622 ms.
[2024-05-26 07:37:39] [INFO ] [Real]Absence check using 2673 positive place invariants in 1251 ms returned sat
[2024-05-26 07:37:39] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 821 ms returned sat
[2024-05-26 07:37:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:38:03] [INFO ] [Real]Absence check using state equation in 23992 ms returned sat
[2024-05-26 07:38:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:38:07] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1463 ms returned sat
[2024-05-26 07:38:08] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 818 ms returned sat
[2024-05-26 07:38:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:38:29] [INFO ] [Nat]Absence check using state equation in 20967 ms returned sat
[2024-05-26 07:38:31] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1420 ms.
Current structural bounds on expressions (after SMT) : [30, 30, 30, 30, 30, 30, 30, 30] Max seen :[3, 5, 6, 5, 20, 4, 6, 5]
Support contains 7 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1775 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1777 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1680 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 07:38:35] [INFO ] Invariant cache hit.
[2024-05-26 07:38:36] [INFO ] Implicit Places using invariants in 1020 ms returned []
Implicit Place search using SMT only with invariants took 1021 ms to find 0 implicit places.
[2024-05-26 07:38:36] [INFO ] Invariant cache hit.
[2024-05-26 07:38:37] [INFO ] Dead Transitions using invariants and state equation in 1283 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3990 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-01
[2024-05-26 07:38:37] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8140 ms. (steps per millisecond=1 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 847 ms. (steps per millisecond=11 ) properties (out of 1) seen :2
[2024-05-26 07:38:46] [INFO ] Invariant cache hit.
[2024-05-26 07:38:48] [INFO ] [Real]Absence check using 2673 positive place invariants in 1266 ms returned sat
[2024-05-26 07:38:49] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 869 ms returned sat
[2024-05-26 07:38:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:38:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [30] Max seen :[2]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 2001 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2004 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 07:38:53] [INFO ] Invariant cache hit.
Finished random walk after 37705 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 59938 steps, including 0 resets, run visited all 1 properties in 5047 ms. (steps per millisecond=11 )
[2024-05-26 07:39:28] [INFO ] Invariant cache hit.
[2024-05-26 07:39:31] [INFO ] [Real]Absence check using 2673 positive place invariants in 1253 ms returned sat
[2024-05-26 07:39:32] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 821 ms returned sat
[2024-05-26 07:39:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:39:55] [INFO ] [Real]Absence check using state equation in 23151 ms returned sat
[2024-05-26 07:39:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:39:58] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1270 ms returned sat
[2024-05-26 07:39:59] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 827 ms returned sat
[2024-05-26 07:39:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:40:20] [INFO ] [Nat]Absence check using state equation in 20831 ms returned sat
[2024-05-26 07:40:22] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1628 ms.
Current structural bounds on expressions (after SMT) : [30] Max seen :[5]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1617 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1617 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1611 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 07:40:26] [INFO ] Invariant cache hit.
[2024-05-26 07:40:27] [INFO ] Implicit Places using invariants in 972 ms returned []
Implicit Place search using SMT only with invariants took 973 ms to find 0 implicit places.
[2024-05-26 07:40:27] [INFO ] Invariant cache hit.
[2024-05-26 07:40:28] [INFO ] Dead Transitions using invariants and state equation in 991 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3578 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 07:40:28] [INFO ] Invariant cache hit.
Finished random walk after 37651 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 60472 steps, including 0 resets, run visited all 1 properties in 5038 ms. (steps per millisecond=12 )
[2024-05-26 07:41:03] [INFO ] Invariant cache hit.
[2024-05-26 07:41:05] [INFO ] [Real]Absence check using 2673 positive place invariants in 1264 ms returned sat
[2024-05-26 07:41:06] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 955 ms returned sat
[2024-05-26 07:41:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:41:26] [INFO ] [Real]Absence check using state equation in 20375 ms returned sat
[2024-05-26 07:41:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:41:30] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1267 ms returned sat
[2024-05-26 07:41:30] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 816 ms returned sat
[2024-05-26 07:41:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:41:51] [INFO ] [Nat]Absence check using state equation in 20382 ms returned sat
[2024-05-26 07:41:53] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1653 ms.
Current structural bounds on expressions (after SMT) : [30] Max seen :[5]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1592 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1592 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1583 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 07:41:57] [INFO ] Invariant cache hit.
[2024-05-26 07:41:58] [INFO ] Implicit Places using invariants in 997 ms returned []
Implicit Place search using SMT only with invariants took 998 ms to find 0 implicit places.
[2024-05-26 07:41:58] [INFO ] Invariant cache hit.
[2024-05-26 07:41:59] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3577 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Ending property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-01 in 201504 ms.
Starting property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-02
[2024-05-26 07:41:59] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7674 ms. (steps per millisecond=1 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 839 ms. (steps per millisecond=11 ) properties (out of 1) seen :2
[2024-05-26 07:42:07] [INFO ] Invariant cache hit.
[2024-05-26 07:42:09] [INFO ] [Real]Absence check using 2673 positive place invariants in 1260 ms returned sat
[2024-05-26 07:42:10] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 1007 ms returned sat
[2024-05-26 07:42:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:42:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [30] Max seen :[3]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1760 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1762 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 07:42:14] [INFO ] Invariant cache hit.
Finished random walk after 37576 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 57331 steps, including 0 resets, run visited all 1 properties in 5013 ms. (steps per millisecond=11 )
[2024-05-26 07:42:49] [INFO ] Invariant cache hit.
[2024-05-26 07:42:51] [INFO ] [Real]Absence check using 2673 positive place invariants in 1199 ms returned sat
[2024-05-26 07:42:52] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 817 ms returned sat
[2024-05-26 07:42:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:43:11] [INFO ] [Real]Absence check using state equation in 19019 ms returned sat
[2024-05-26 07:43:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:43:14] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1250 ms returned sat
[2024-05-26 07:43:15] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 860 ms returned sat
[2024-05-26 07:43:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:43:35] [INFO ] [Nat]Absence check using state equation in 20077 ms returned sat
[2024-05-26 07:43:38] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1471 ms.
Current structural bounds on expressions (after SMT) : [30] Max seen :[3]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1562 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1562 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1557 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 07:43:41] [INFO ] Invariant cache hit.
[2024-05-26 07:43:42] [INFO ] Implicit Places using invariants in 985 ms returned []
Implicit Place search using SMT only with invariants took 986 ms to find 0 implicit places.
[2024-05-26 07:43:42] [INFO ] Invariant cache hit.
[2024-05-26 07:43:43] [INFO ] Dead Transitions using invariants and state equation in 996 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3542 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Ending property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-02 in 104109 ms.
Starting property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-03
[2024-05-26 07:43:43] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8598 ms. (steps per millisecond=1 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 842 ms. (steps per millisecond=11 ) properties (out of 1) seen :2
[2024-05-26 07:43:52] [INFO ] Invariant cache hit.
[2024-05-26 07:43:54] [INFO ] [Real]Absence check using 2673 positive place invariants in 1260 ms returned sat
[2024-05-26 07:43:55] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 1025 ms returned sat
[2024-05-26 07:43:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:43:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [30] Max seen :[5]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1843 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1844 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 07:43:59] [INFO ] Invariant cache hit.
Finished random walk after 36834 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 56331 steps, including 0 resets, run visited all 1 properties in 5094 ms. (steps per millisecond=11 )
[2024-05-26 07:44:34] [INFO ] Invariant cache hit.
[2024-05-26 07:44:37] [INFO ] [Real]Absence check using 2673 positive place invariants in 1395 ms returned sat
[2024-05-26 07:44:38] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 895 ms returned sat
[2024-05-26 07:44:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:45:00] [INFO ] [Real]Absence check using state equation in 22710 ms returned sat
[2024-05-26 07:45:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:45:04] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1393 ms returned sat
[2024-05-26 07:45:04] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 901 ms returned sat
[2024-05-26 07:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:45:29] [INFO ] [Nat]Absence check using state equation in 24131 ms returned sat
[2024-05-26 07:45:31] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1550 ms.
Current structural bounds on expressions (after SMT) : [30] Max seen :[5]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1715 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1715 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1696 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 07:45:35] [INFO ] Invariant cache hit.
[2024-05-26 07:45:36] [INFO ] Implicit Places using invariants in 1046 ms returned []
Implicit Place search using SMT only with invariants took 1047 ms to find 0 implicit places.
[2024-05-26 07:45:36] [INFO ] Invariant cache hit.
[2024-05-26 07:45:37] [INFO ] Dead Transitions using invariants and state equation in 1067 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3814 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Ending property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-03 in 114040 ms.
Starting property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-04
[2024-05-26 07:45:37] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8038 ms. (steps per millisecond=1 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 910 ms. (steps per millisecond=10 ) properties (out of 1) seen :2
[2024-05-26 07:45:46] [INFO ] Invariant cache hit.
[2024-05-26 07:45:48] [INFO ] [Real]Absence check using 2673 positive place invariants in 1411 ms returned sat
[2024-05-26 07:45:49] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 878 ms returned sat
[2024-05-26 07:45:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:45:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [30] Max seen :[3]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1749 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1754 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 07:45:52] [INFO ] Invariant cache hit.
Finished random walk after 35732 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 57315 steps, including 0 resets, run visited all 1 properties in 5058 ms. (steps per millisecond=11 )
[2024-05-26 07:46:28] [INFO ] Invariant cache hit.
[2024-05-26 07:46:30] [INFO ] [Real]Absence check using 2673 positive place invariants in 1412 ms returned sat
[2024-05-26 07:46:31] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 902 ms returned sat
[2024-05-26 07:46:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:46:54] [INFO ] [Real]Absence check using state equation in 23195 ms returned sat
[2024-05-26 07:46:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:46:57] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1399 ms returned sat
[2024-05-26 07:46:58] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 885 ms returned sat
[2024-05-26 07:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:47:22] [INFO ] [Nat]Absence check using state equation in 24086 ms returned sat
[2024-05-26 07:47:25] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1491 ms.
Current structural bounds on expressions (after SMT) : [30] Max seen :[3]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1699 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1702 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1684 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 07:47:28] [INFO ] Invariant cache hit.
[2024-05-26 07:47:29] [INFO ] Implicit Places using invariants in 1023 ms returned []
Implicit Place search using SMT only with invariants took 1024 ms to find 0 implicit places.
[2024-05-26 07:47:29] [INFO ] Invariant cache hit.
[2024-05-26 07:47:30] [INFO ] Dead Transitions using invariants and state equation in 1037 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3751 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Ending property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-04 in 113634 ms.
Starting property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-06
[2024-05-26 07:47:30] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8181 ms. (steps per millisecond=1 ) properties (out of 1) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 873 ms. (steps per millisecond=11 ) properties (out of 1) seen :12
[2024-05-26 07:47:39] [INFO ] Invariant cache hit.
[2024-05-26 07:47:42] [INFO ] [Real]Absence check using 2673 positive place invariants in 1416 ms returned sat
[2024-05-26 07:47:43] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 855 ms returned sat
[2024-05-26 07:47:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:47:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [30] Max seen :[17]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1684 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1685 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 07:47:46] [INFO ] Invariant cache hit.
Finished random walk after 36413 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 57267 steps, including 0 resets, run visited all 1 properties in 5085 ms. (steps per millisecond=11 )
[2024-05-26 07:48:21] [INFO ] Invariant cache hit.
[2024-05-26 07:48:24] [INFO ] [Real]Absence check using 2673 positive place invariants in 1410 ms returned sat
[2024-05-26 07:48:25] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 863 ms returned sat
[2024-05-26 07:48:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:48:47] [INFO ] [Real]Absence check using state equation in 22504 ms returned sat
[2024-05-26 07:48:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:48:51] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1460 ms returned sat
[2024-05-26 07:48:51] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 856 ms returned sat
[2024-05-26 07:48:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:49:15] [INFO ] [Nat]Absence check using state equation in 23255 ms returned sat
[2024-05-26 07:49:17] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1546 ms.
Current structural bounds on expressions (after SMT) : [30] Max seen :[21]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1703 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1703 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1717 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 07:49:21] [INFO ] Invariant cache hit.
[2024-05-26 07:49:22] [INFO ] Implicit Places using invariants in 1025 ms returned []
Implicit Place search using SMT only with invariants took 1026 ms to find 0 implicit places.
[2024-05-26 07:49:22] [INFO ] Invariant cache hit.
[2024-05-26 07:49:23] [INFO ] Dead Transitions using invariants and state equation in 1053 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3801 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 07:49:23] [INFO ] Invariant cache hit.
Finished random walk after 36091 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 57107 steps, including 0 resets, run visited all 1 properties in 5072 ms. (steps per millisecond=11 )
[2024-05-26 07:49:58] [INFO ] Invariant cache hit.
[2024-05-26 07:50:00] [INFO ] [Real]Absence check using 2673 positive place invariants in 1412 ms returned sat
[2024-05-26 07:50:01] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 885 ms returned sat
[2024-05-26 07:50:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:50:24] [INFO ] [Real]Absence check using state equation in 22816 ms returned sat
[2024-05-26 07:50:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:50:27] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1444 ms returned sat
[2024-05-26 07:50:28] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 883 ms returned sat
[2024-05-26 07:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:50:52] [INFO ] [Nat]Absence check using state equation in 24209 ms returned sat
[2024-05-26 07:50:55] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1512 ms.
Current structural bounds on expressions (after SMT) : [30] Max seen :[22]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1708 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1708 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1701 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 07:50:58] [INFO ] Invariant cache hit.
[2024-05-26 07:50:59] [INFO ] Implicit Places using invariants in 1023 ms returned []
Implicit Place search using SMT only with invariants took 1027 ms to find 0 implicit places.
[2024-05-26 07:50:59] [INFO ] Invariant cache hit.
[2024-05-26 07:51:00] [INFO ] Dead Transitions using invariants and state equation in 1023 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3764 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 07:51:00] [INFO ] Invariant cache hit.
Finished random walk after 36032 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 57331 steps, including 0 resets, run visited all 1 properties in 5065 ms. (steps per millisecond=11 )
[2024-05-26 07:51:36] [INFO ] Invariant cache hit.
[2024-05-26 07:51:38] [INFO ] [Real]Absence check using 2673 positive place invariants in 1431 ms returned sat
[2024-05-26 07:51:39] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 896 ms returned sat
[2024-05-26 07:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:52:01] [INFO ] [Real]Absence check using state equation in 22129 ms returned sat
[2024-05-26 07:52:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:52:04] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1459 ms returned sat
[2024-05-26 07:52:05] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 864 ms returned sat
[2024-05-26 07:52:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:52:30] [INFO ] [Nat]Absence check using state equation in 24299 ms returned sat
[2024-05-26 07:52:32] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1471 ms.
Current structural bounds on expressions (after SMT) : [30] Max seen :[22]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1754 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1755 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1755 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 07:52:36] [INFO ] Invariant cache hit.
[2024-05-26 07:52:37] [INFO ] Implicit Places using invariants in 1066 ms returned []
Implicit Place search using SMT only with invariants took 1067 ms to find 0 implicit places.
[2024-05-26 07:52:37] [INFO ] Invariant cache hit.
[2024-05-26 07:52:38] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3883 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Ending property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-06 in 307389 ms.
Starting property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-07
[2024-05-26 07:52:38] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8277 ms. (steps per millisecond=1 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 913 ms. (steps per millisecond=10 ) properties (out of 1) seen :2
[2024-05-26 07:52:47] [INFO ] Invariant cache hit.
[2024-05-26 07:52:50] [INFO ] [Real]Absence check using 2673 positive place invariants in 1470 ms returned sat
[2024-05-26 07:52:50] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 878 ms returned sat
[2024-05-26 07:52:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:52:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [30] Max seen :[3]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1737 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1738 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 07:52:54] [INFO ] Invariant cache hit.
Finished random walk after 37890 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 57107 steps, including 0 resets, run visited all 1 properties in 5063 ms. (steps per millisecond=11 )
[2024-05-26 07:53:29] [INFO ] Invariant cache hit.
[2024-05-26 07:53:31] [INFO ] [Real]Absence check using 2673 positive place invariants in 1242 ms returned sat
[2024-05-26 07:53:32] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 1022 ms returned sat
[2024-05-26 07:53:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:53:52] [INFO ] [Real]Absence check using state equation in 19430 ms returned sat
[2024-05-26 07:53:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:53:55] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1292 ms returned sat
[2024-05-26 07:53:56] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 823 ms returned sat
[2024-05-26 07:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:54:18] [INFO ] [Nat]Absence check using state equation in 22857 ms returned sat
[2024-05-26 07:54:21] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1532 ms.
Current structural bounds on expressions (after SMT) : [30] Max seen :[6]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1588 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1588 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1589 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 07:54:24] [INFO ] Invariant cache hit.
[2024-05-26 07:54:25] [INFO ] Implicit Places using invariants in 978 ms returned []
Implicit Place search using SMT only with invariants took 981 ms to find 0 implicit places.
[2024-05-26 07:54:25] [INFO ] Invariant cache hit.
[2024-05-26 07:54:26] [INFO ] Dead Transitions using invariants and state equation in 1056 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3629 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 07:54:26] [INFO ] Invariant cache hit.
Finished random walk after 36529 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 57697 steps, including 0 resets, run visited all 1 properties in 5051 ms. (steps per millisecond=11 )
[2024-05-26 07:55:01] [INFO ] Invariant cache hit.
[2024-05-26 07:55:04] [INFO ] [Real]Absence check using 2673 positive place invariants in 1247 ms returned sat
[2024-05-26 07:55:05] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 875 ms returned sat
[2024-05-26 07:55:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:55:25] [INFO ] [Real]Absence check using state equation in 20464 ms returned sat
[2024-05-26 07:55:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:55:29] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1293 ms returned sat
[2024-05-26 07:55:29] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 850 ms returned sat
[2024-05-26 07:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:55:50] [INFO ] [Nat]Absence check using state equation in 20684 ms returned sat
[2024-05-26 07:55:53] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1676 ms.
Current structural bounds on expressions (after SMT) : [30] Max seen :[10]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1783 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1784 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1573 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 07:55:56] [INFO ] Invariant cache hit.
[2024-05-26 07:55:57] [INFO ] Implicit Places using invariants in 1003 ms returned []
Implicit Place search using SMT only with invariants took 1004 ms to find 0 implicit places.
[2024-05-26 07:55:57] [INFO ] Invariant cache hit.
[2024-05-26 07:55:58] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3592 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 07:55:58] [INFO ] Invariant cache hit.
Finished random walk after 38138 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 60312 steps, including 0 resets, run visited all 1 properties in 5050 ms. (steps per millisecond=11 )
[2024-05-26 07:56:33] [INFO ] Invariant cache hit.
[2024-05-26 07:56:36] [INFO ] [Real]Absence check using 2673 positive place invariants in 1264 ms returned sat
[2024-05-26 07:56:37] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 882 ms returned sat
[2024-05-26 07:56:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:56:59] [INFO ] [Real]Absence check using state equation in 22536 ms returned sat
[2024-05-26 07:57:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:57:02] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1286 ms returned sat
[2024-05-26 07:57:03] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 846 ms returned sat
[2024-05-26 07:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:57:24] [INFO ] [Nat]Absence check using state equation in 21348 ms returned sat
[2024-05-26 07:57:27] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1640 ms.
Current structural bounds on expressions (after SMT) : [30] Max seen :[10]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1596 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1596 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1967 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 07:57:31] [INFO ] Invariant cache hit.
[2024-05-26 07:57:32] [INFO ] Implicit Places using invariants in 1005 ms returned []
Implicit Place search using SMT only with invariants took 1006 ms to find 0 implicit places.
[2024-05-26 07:57:32] [INFO ] Invariant cache hit.
[2024-05-26 07:57:33] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3974 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Ending property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-07 in 295083 ms.
Starting property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-08
[2024-05-26 07:57:33] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7980 ms. (steps per millisecond=1 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 855 ms. (steps per millisecond=11 ) properties (out of 1) seen :2
[2024-05-26 07:57:42] [INFO ] Invariant cache hit.
[2024-05-26 07:57:44] [INFO ] [Real]Absence check using 2673 positive place invariants in 1437 ms returned sat
[2024-05-26 07:57:45] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 878 ms returned sat
[2024-05-26 07:57:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:57:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [30] Max seen :[4]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1801 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1804 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 07:57:49] [INFO ] Invariant cache hit.
Finished random walk after 38293 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 58906 steps, including 0 resets, run visited all 1 properties in 5102 ms. (steps per millisecond=11 )
[2024-05-26 07:58:24] [INFO ] Invariant cache hit.
[2024-05-26 07:58:26] [INFO ] [Real]Absence check using 2673 positive place invariants in 1269 ms returned sat
[2024-05-26 07:58:27] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 829 ms returned sat
[2024-05-26 07:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:58:47] [INFO ] [Real]Absence check using state equation in 20217 ms returned sat
[2024-05-26 07:58:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 07:58:50] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1305 ms returned sat
[2024-05-26 07:58:51] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 825 ms returned sat
[2024-05-26 07:58:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 07:59:11] [INFO ] [Nat]Absence check using state equation in 20127 ms returned sat
[2024-05-26 07:59:14] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1531 ms.
Current structural bounds on expressions (after SMT) : [30] Max seen :[4]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1611 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1611 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 2019 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 07:59:18] [INFO ] Invariant cache hit.
[2024-05-26 07:59:19] [INFO ] Implicit Places using invariants in 1289 ms returned []
Implicit Place search using SMT only with invariants took 1290 ms to find 0 implicit places.
[2024-05-26 07:59:19] [INFO ] Invariant cache hit.
[2024-05-26 07:59:20] [INFO ] Dead Transitions using invariants and state equation in 991 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4305 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Ending property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-08 in 107269 ms.
Starting property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-15
[2024-05-26 07:59:20] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7719 ms. (steps per millisecond=1 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 849 ms. (steps per millisecond=11 ) properties (out of 1) seen :2
[2024-05-26 07:59:29] [INFO ] Invariant cache hit.
[2024-05-26 07:59:31] [INFO ] [Real]Absence check using 2673 positive place invariants in 1284 ms returned sat
[2024-05-26 07:59:32] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 831 ms returned sat
[2024-05-26 07:59:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 07:59:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [30] Max seen :[3]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1592 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1596 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 07:59:35] [INFO ] Invariant cache hit.
Finished random walk after 37744 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 59778 steps, including 0 resets, run visited all 1 properties in 5075 ms. (steps per millisecond=11 )
[2024-05-26 08:00:10] [INFO ] Invariant cache hit.
[2024-05-26 08:00:13] [INFO ] [Real]Absence check using 2673 positive place invariants in 1270 ms returned sat
[2024-05-26 08:00:14] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 835 ms returned sat
[2024-05-26 08:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 08:00:34] [INFO ] [Real]Absence check using state equation in 20243 ms returned sat
[2024-05-26 08:00:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 08:00:37] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1290 ms returned sat
[2024-05-26 08:00:38] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 824 ms returned sat
[2024-05-26 08:00:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 08:00:58] [INFO ] [Nat]Absence check using state equation in 20449 ms returned sat
[2024-05-26 08:01:01] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1496 ms.
Current structural bounds on expressions (after SMT) : [30] Max seen :[4]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1924 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1925 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1695 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 08:01:05] [INFO ] Invariant cache hit.
[2024-05-26 08:01:06] [INFO ] Implicit Places using invariants in 1151 ms returned []
Implicit Place search using SMT only with invariants took 1152 ms to find 0 implicit places.
[2024-05-26 08:01:06] [INFO ] Invariant cache hit.
[2024-05-26 08:01:07] [INFO ] Dead Transitions using invariants and state equation in 968 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3819 ms. Remains : 7533/7533 places, 24300/24300 transitions.
[2024-05-26 08:01:07] [INFO ] Invariant cache hit.
Finished random walk after 36633 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 57123 steps, including 0 resets, run visited all 1 properties in 5008 ms. (steps per millisecond=11 )
[2024-05-26 08:01:42] [INFO ] Invariant cache hit.
[2024-05-26 08:01:44] [INFO ] [Real]Absence check using 2673 positive place invariants in 1237 ms returned sat
[2024-05-26 08:01:45] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 858 ms returned sat
[2024-05-26 08:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 08:02:06] [INFO ] [Real]Absence check using state equation in 20416 ms returned sat
[2024-05-26 08:02:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 08:02:09] [INFO ] [Nat]Absence check using 2673 positive place invariants in 1295 ms returned sat
[2024-05-26 08:02:10] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 856 ms returned sat
[2024-05-26 08:02:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 08:02:31] [INFO ] [Nat]Absence check using state equation in 21587 ms returned sat
[2024-05-26 08:02:34] [INFO ] Computed and/alt/rep : 21870/21870/21870 causal constraints (skipped 0 transitions) in 1514 ms.
Current structural bounds on expressions (after SMT) : [30] Max seen :[4]
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1583 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1584 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1583 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2024-05-26 08:02:37] [INFO ] Invariant cache hit.
[2024-05-26 08:02:38] [INFO ] Implicit Places using invariants in 972 ms returned []
Implicit Place search using SMT only with invariants took 973 ms to find 0 implicit places.
[2024-05-26 08:02:38] [INFO ] Invariant cache hit.
[2024-05-26 08:02:39] [INFO ] Dead Transitions using invariants and state equation in 974 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3534 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Ending property specific reduction for HypertorusGrid-PT-d5k3p2b10-UpperBounds-15 in 199089 ms.
[2024-05-26 08:02:41] [INFO ] Flatten gal took : 1535 ms
[2024-05-26 08:02:42] [INFO ] Applying decomposition
[2024-05-26 08:02:43] [INFO ] Flatten gal took : 1053 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9830584446288204146.txt' '-o' '/tmp/graph9830584446288204146.bin' '-w' '/tmp/graph9830584446288204146.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9830584446288204146.bin' '-l' '-1' '-v' '-w' '/tmp/graph9830584446288204146.weights' '-q' '0' '-e' '0.001'
[2024-05-26 08:02:46] [INFO ] Decomposing Gal with order
[2024-05-26 08:02:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 08:02:57] [INFO ] Removed a total of 38880 redundant transitions.
[2024-05-26 08:02:58] [INFO ] Flatten gal took : 2040 ms
[2024-05-26 08:02:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 195 ms.
[2024-05-26 08:02:59] [INFO ] Time to serialize gal into /tmp/UpperBounds9604705673584588772.gal : 249 ms
[2024-05-26 08:02:59] [INFO ] Time to serialize properties into /tmp/UpperBounds2358599639760185728.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9604705673584588772.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2358599639760185728.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds2358599639760185728.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 150984 kB
After kill :
MemTotal: 16393232 kB
MemFree: 12263988 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="HypertorusGrid-PT-d5k3p2b10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is HypertorusGrid-PT-d5k3p2b10, 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 r219-smll-171649598100201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HypertorusGrid-PT-d5k3p2b10.tgz
mv HypertorusGrid-PT-d5k3p2b10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;