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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 12 07:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 12 07:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 18M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716654260107

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=MultiCrashLeafsetExtension-PT-S32C03
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 16:24:21] [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-25 16:24:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:24:22] [INFO ] Load time of PNML (sax parser for PT used): 648 ms
[2024-05-25 16:24:22] [INFO ] Transformed 15862 places.
[2024-05-25 16:24:22] [INFO ] Transformed 25109 transitions.
[2024-05-25 16:24:22] [INFO ] Parsed PT model containing 15862 places and 25109 transitions and 104566 arcs in 850 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Normalized transition count is 24053 out of 25109 initially.
// Phase 1: matrix 24053 rows 15862 cols
[2024-05-25 16:24:24] [INFO ] Computed 1403 invariants in 2149 ms
Incomplete random walk after 10000 steps, including 320 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :0
[2024-05-25 16:24:26] [INFO ] Flow matrix only has 24053 transitions (discarded 1056 similar events)
// Phase 1: matrix 24053 rows 15862 cols
[2024-05-25 16:24:28] [INFO ] Computed 1403 invariants in 1837 ms
[2024-05-25 16:24:30] [INFO ] [Real]Absence check using 76 positive place invariants in 392 ms returned sat
[2024-05-25 16:24:31] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 817 ms returned sat
[2024-05-25 16:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:24:33] [INFO ] [Real]Absence check using state equation in 2148 ms returned unknown
[2024-05-25 16:24:35] [INFO ] [Real]Absence check using 76 positive place invariants in 431 ms returned sat
[2024-05-25 16:24:36] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 818 ms returned sat
[2024-05-25 16:24:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:24:38] [INFO ] [Real]Absence check using state equation in 2167 ms returned unknown
[2024-05-25 16:24:40] [INFO ] [Real]Absence check using 76 positive place invariants in 460 ms returned sat
[2024-05-25 16:24:41] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 932 ms returned sat
[2024-05-25 16:24:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:24:43] [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 2
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-25 16:24:45] [INFO ] [Real]Absence check using 76 positive place invariants in 376 ms returned sat
[2024-05-25 16:24:46] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 824 ms returned sat
[2024-05-25 16:24:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:24:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-25 16:24:50] [INFO ] [Real]Absence check using 76 positive place invariants in 431 ms returned sat
[2024-05-25 16:24:51] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 813 ms returned sat
[2024-05-25 16:24:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:24:53] [INFO ] [Real]Absence check using state equation in 2175 ms returned unknown
[2024-05-25 16:24:55] [INFO ] [Real]Absence check using 76 positive place invariants in 366 ms returned sat
[2024-05-25 16:24:56] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 868 ms returned sat
[2024-05-25 16:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:24:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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-25 16:25:00] [INFO ] [Real]Absence check using 76 positive place invariants in 399 ms returned sat
[2024-05-25 16:25:01] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 892 ms returned sat
[2024-05-25 16:25:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:25:03] [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 6
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-25 16:25:05] [INFO ] [Real]Absence check using 76 positive place invariants in 398 ms returned sat
[2024-05-25 16:25:06] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 924 ms returned sat
[2024-05-25 16:25:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:25:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-25 16:25:10] [INFO ] [Real]Absence check using 76 positive place invariants in 394 ms returned sat
[2024-05-25 16:25:11] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 626 ms returned unsat
[2024-05-25 16:25:13] [INFO ] [Real]Absence check using 76 positive place invariants in 392 ms returned sat
[2024-05-25 16:25:13] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 635 ms returned unsat
[2024-05-25 16:25:15] [INFO ] [Real]Absence check using 76 positive place invariants in 369 ms returned sat
[2024-05-25 16:25:16] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 663 ms returned unsat
[2024-05-25 16:25:18] [INFO ] [Real]Absence check using 76 positive place invariants in 403 ms returned sat
[2024-05-25 16:25:18] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 635 ms returned unsat
[2024-05-25 16:25:20] [INFO ] [Real]Absence check using 76 positive place invariants in 387 ms returned sat
[2024-05-25 16:25:21] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 918 ms returned sat
[2024-05-25 16:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:25:23] [INFO ] [Real]Absence check using state equation in 2157 ms returned unknown
[2024-05-25 16:25:25] [INFO ] [Real]Absence check using 76 positive place invariants in 390 ms returned sat
[2024-05-25 16:25:26] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 635 ms returned unsat
[2024-05-25 16:25:28] [INFO ] [Real]Absence check using 76 positive place invariants in 370 ms returned sat
[2024-05-25 16:25:28] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 632 ms returned unsat
[2024-05-25 16:25:30] [INFO ] [Real]Absence check using 76 positive place invariants in 391 ms returned sat
[2024-05-25 16:25:31] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 917 ms returned sat
[2024-05-25 16:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:25:34] [INFO ] [Real]Absence check using state equation in 2175 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 33, 1, 1, 1, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 33] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 15862 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15862/15862 places, 25109/25109 transitions.
Graph (complete) has 59447 edges and 15862 vertex of which 15820 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.50 ms
Discarding 42 places :
Also discarding 0 output transitions
Drop transitions removed 3165 transitions
Trivial Post-agglo rules discarded 3165 transitions
Performed 3165 trivial Post agglomeration. Transition count delta: 3165
Iterating post reduction 0 with 3165 rules applied. Total rules applied 3166 place count 15820 transition count 21944
Reduce places removed 3165 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3166 rules applied. Total rules applied 6332 place count 12655 transition count 21943
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6333 place count 12654 transition count 21943
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 6333 place count 12654 transition count 21745
Deduced a syphon composed of 198 places in 18 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 6729 place count 12456 transition count 21745
Discarding 2967 places :
Symmetric choice reduction at 3 with 2967 rule applications. Total rules 9696 place count 9489 transition count 18778
Iterating global reduction 3 with 2967 rules applied. Total rules applied 12663 place count 9489 transition count 18778
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12663 place count 9489 transition count 18775
Deduced a syphon composed of 3 places in 18 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12669 place count 9486 transition count 18775
Discarding 987 places :
Symmetric choice reduction at 3 with 987 rule applications. Total rules 13656 place count 8499 transition count 15814
Iterating global reduction 3 with 987 rules applied. Total rules applied 14643 place count 8499 transition count 15814
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 16 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 14709 place count 8466 transition count 15781
Free-agglomeration rule (complex) applied 577 times.
Iterating global reduction 3 with 577 rules applied. Total rules applied 15286 place count 8466 transition count 17178
Reduce places removed 577 places and 0 transitions.
Iterating post reduction 3 with 577 rules applied. Total rules applied 15863 place count 7889 transition count 17178
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 4 with 99 rules applied. Total rules applied 15962 place count 7889 transition count 17178
Applied a total of 15962 rules in 15649 ms. Remains 7889 /15862 variables (removed 7973) and now considering 17178/25109 (removed 7931) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15653 ms. Remains : 7889/15862 places, 17178/25109 transitions.
Normalized transition count is 15614 out of 17178 initially.
// Phase 1: matrix 15614 rows 7889 cols
[2024-05-25 16:25:50] [INFO ] Computed 1361 invariants in 742 ms
Interrupted random walk after 834630 steps, including 43701 resets, run timeout after 30001 ms. (steps per millisecond=27 ) properties seen 3
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4382 ms. (steps per millisecond=228 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4402 ms. (steps per millisecond=227 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4403 ms. (steps per millisecond=227 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4378 ms. (steps per millisecond=228 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000000 steps, including 4805 resets, run finished after 4340 ms. (steps per millisecond=230 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4348 ms. (steps per millisecond=229 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4308 ms. (steps per millisecond=232 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4326 ms. (steps per millisecond=231 ) properties (out of 8) seen :1
[2024-05-25 16:26:55] [INFO ] Flow matrix only has 15614 transitions (discarded 1564 similar events)
// Phase 1: matrix 15614 rows 7889 cols
[2024-05-25 16:26:56] [INFO ] Computed 1361 invariants in 770 ms
[2024-05-25 16:26:57] [INFO ] [Real]Absence check using 65 positive place invariants in 180 ms returned sat
[2024-05-25 16:26:57] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 501 ms returned sat
[2024-05-25 16:26:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:27:06] [INFO ] [Real]Absence check using state equation in 8605 ms returned sat
[2024-05-25 16:27:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:27:07] [INFO ] [Nat]Absence check using 65 positive place invariants in 190 ms returned sat
[2024-05-25 16:27:08] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 455 ms returned sat
[2024-05-25 16:27:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:27:16] [INFO ] [Nat]Absence check using state equation in 8838 ms returned sat
[2024-05-25 16:27:16] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2024-05-25 16:27:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:27:23] [INFO ] [Nat]Added 8098 Read/Feed constraints in 6483 ms returned unknown
[2024-05-25 16:27:24] [INFO ] [Real]Absence check using 65 positive place invariants in 161 ms returned sat
[2024-05-25 16:27:24] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 423 ms returned sat
[2024-05-25 16:27:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:27:32] [INFO ] [Real]Absence check using state equation in 8028 ms returned sat
[2024-05-25 16:27:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:27:34] [INFO ] [Nat]Absence check using 65 positive place invariants in 161 ms returned sat
[2024-05-25 16:27:34] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 424 ms returned sat
[2024-05-25 16:27:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:27:43] [INFO ] [Nat]Absence check using state equation in 8649 ms returned sat
[2024-05-25 16:27:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:27:49] [INFO ] [Nat]Added 8098 Read/Feed constraints in 6405 ms returned unknown
[2024-05-25 16:27:50] [INFO ] [Real]Absence check using 65 positive place invariants in 159 ms returned sat
[2024-05-25 16:27:50] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 421 ms returned sat
[2024-05-25 16:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:27:58] [INFO ] [Real]Absence check using state equation in 8143 ms returned sat
[2024-05-25 16:27:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:28:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 172 ms returned sat
[2024-05-25 16:28:00] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 448 ms returned sat
[2024-05-25 16:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:28:10] [INFO ] [Nat]Absence check using state equation in 9526 ms returned sat
[2024-05-25 16:28:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:28:15] [INFO ] [Nat]Added 8098 Read/Feed constraints in 5132 ms returned unsat
[2024-05-25 16:28:16] [INFO ] [Real]Absence check using 65 positive place invariants in 172 ms returned sat
[2024-05-25 16:28:16] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 474 ms returned sat
[2024-05-25 16:28:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:28:27] [INFO ] [Real]Absence check using state equation in 10756 ms returned sat
[2024-05-25 16:28:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:28:28] [INFO ] [Nat]Absence check using 65 positive place invariants in 177 ms returned sat
[2024-05-25 16:28:29] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 465 ms returned sat
[2024-05-25 16:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:28:38] [INFO ] [Nat]Absence check using state equation in 9086 ms returned sat
[2024-05-25 16:28:41] [INFO ] [Nat]Added 8098 Read/Feed constraints in 2500 ms returned unsat
[2024-05-25 16:28:42] [INFO ] [Real]Absence check using 65 positive place invariants in 176 ms returned sat
[2024-05-25 16:28:42] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 422 ms returned unsat
[2024-05-25 16:28:43] [INFO ] [Real]Absence check using 65 positive place invariants in 172 ms returned sat
[2024-05-25 16:28:43] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 418 ms returned sat
[2024-05-25 16:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:28:52] [INFO ] [Real]Absence check using state equation in 8371 ms returned sat
[2024-05-25 16:28:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:28:53] [INFO ] [Nat]Absence check using 65 positive place invariants in 206 ms returned sat
[2024-05-25 16:28:54] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 488 ms returned sat
[2024-05-25 16:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:29:05] [INFO ] [Nat]Absence check using state equation in 11171 ms returned sat
[2024-05-25 16:29:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:29:11] [INFO ] [Nat]Added 8098 Read/Feed constraints in 6486 ms returned unknown
[2024-05-25 16:29:12] [INFO ] [Real]Absence check using 65 positive place invariants in 166 ms returned sat
[2024-05-25 16:29:13] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 446 ms returned sat
[2024-05-25 16:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:29:21] [INFO ] [Real]Absence check using state equation in 8690 ms returned sat
[2024-05-25 16:29:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:29:23] [INFO ] [Nat]Absence check using 65 positive place invariants in 199 ms returned sat
[2024-05-25 16:29:23] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 481 ms returned sat
[2024-05-25 16:29:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:29:34] [INFO ] [Nat]Absence check using state equation in 10890 ms returned sat
[2024-05-25 16:29:37] [INFO ] [Nat]Added 8098 Read/Feed constraints in 2617 ms returned unsat
[2024-05-25 16:29:38] [INFO ] [Real]Absence check using 65 positive place invariants in 168 ms returned sat
[2024-05-25 16:29:38] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 430 ms returned sat
[2024-05-25 16:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:29:48] [INFO ] [Real]Absence check using state equation in 10143 ms returned sat
[2024-05-25 16:29:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:29:49] [INFO ] [Nat]Absence check using 65 positive place invariants in 173 ms returned sat
[2024-05-25 16:29:50] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 439 ms returned sat
[2024-05-25 16:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:29:59] [INFO ] [Nat]Absence check using state equation in 9027 ms returned sat
[2024-05-25 16:30:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:30:05] [INFO ] [Nat]Added 8098 Read/Feed constraints in 5746 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 0, 0, 1, 1, 0, 0] Max seen :[0, 0, 0, 0, 1, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 7889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7889/7889 places, 17178/17178 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 7889 transition count 17176
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7887 transition count 17176
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 7887 transition count 17173
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 7884 transition count 17173
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 13 place count 7881 transition count 17170
Iterating global reduction 3 with 3 rules applied. Total rules applied 16 place count 7881 transition count 17170
Applied a total of 16 rules in 5865 ms. Remains 7881 /7889 variables (removed 8) and now considering 17170/17178 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5865 ms. Remains : 7881/7889 places, 17170/17178 transitions.
Normalized transition count is 15606 out of 17170 initially.
// Phase 1: matrix 15606 rows 7881 cols
[2024-05-25 16:30:11] [INFO ] Computed 1361 invariants in 715 ms
Interrupted random walk after 862364 steps, including 45161 resets, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4412 ms. (steps per millisecond=226 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4352 ms. (steps per millisecond=229 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4383 ms. (steps per millisecond=228 ) properties (out of 3) seen :0
[2024-05-25 16:30:54] [INFO ] Flow matrix only has 15606 transitions (discarded 1564 similar events)
// Phase 1: matrix 15606 rows 7881 cols
[2024-05-25 16:30:55] [INFO ] Computed 1361 invariants in 728 ms
[2024-05-25 16:30:56] [INFO ] [Real]Absence check using 65 positive place invariants in 184 ms returned sat
[2024-05-25 16:30:57] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 453 ms returned sat
[2024-05-25 16:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:31:05] [INFO ] [Real]Absence check using state equation in 8566 ms returned sat
[2024-05-25 16:31:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:31:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 179 ms returned sat
[2024-05-25 16:31:07] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 401 ms returned sat
[2024-05-25 16:31:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:31:16] [INFO ] [Nat]Absence check using state equation in 8841 ms returned sat
[2024-05-25 16:31:16] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2024-05-25 16:31:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:31:22] [INFO ] [Nat]Added 8098 Read/Feed constraints in 6400 ms returned unknown
[2024-05-25 16:31:23] [INFO ] [Real]Absence check using 65 positive place invariants in 177 ms returned sat
[2024-05-25 16:31:23] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 423 ms returned sat
[2024-05-25 16:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:31:31] [INFO ] [Real]Absence check using state equation in 7991 ms returned sat
[2024-05-25 16:31:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:31:33] [INFO ] [Nat]Absence check using 65 positive place invariants in 176 ms returned sat
[2024-05-25 16:31:33] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 370 ms returned sat
[2024-05-25 16:31:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:31:42] [INFO ] [Nat]Absence check using state equation in 9212 ms returned sat
[2024-05-25 16:31:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:31:49] [INFO ] [Nat]Added 8098 Read/Feed constraints in 6418 ms returned unknown
[2024-05-25 16:31:50] [INFO ] [Real]Absence check using 65 positive place invariants in 190 ms returned sat
[2024-05-25 16:31:50] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 442 ms returned sat
[2024-05-25 16:31:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:31:58] [INFO ] [Real]Absence check using state equation in 8468 ms returned sat
[2024-05-25 16:31:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 185 ms returned sat
[2024-05-25 16:32:00] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 426 ms returned sat
[2024-05-25 16:32:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:32:09] [INFO ] [Nat]Absence check using state equation in 9080 ms returned sat
[2024-05-25 16:32:11] [INFO ] [Nat]Added 8098 Read/Feed constraints in 1879 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 0] Max seen :[0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 7881 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7881/7881 places, 17170/17170 transitions.
Applied a total of 0 rules in 2129 ms. Remains 7881 /7881 variables (removed 0) and now considering 17170/17170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2130 ms. Remains : 7881/7881 places, 17170/17170 transitions.
Normalized transition count is 15606 out of 17170 initially.
// Phase 1: matrix 15606 rows 7881 cols
[2024-05-25 16:32:14] [INFO ] Computed 1361 invariants in 709 ms
Interrupted random walk after 891058 steps, including 46666 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4309 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4291 ms. (steps per millisecond=233 ) properties (out of 2) seen :0
[2024-05-25 16:32:53] [INFO ] Flow matrix only has 15606 transitions (discarded 1564 similar events)
// Phase 1: matrix 15606 rows 7881 cols
[2024-05-25 16:32:53] [INFO ] Computed 1361 invariants in 682 ms
[2024-05-25 16:32:54] [INFO ] [Real]Absence check using 65 positive place invariants in 174 ms returned sat
[2024-05-25 16:32:54] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 417 ms returned sat
[2024-05-25 16:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:33:03] [INFO ] [Real]Absence check using state equation in 8569 ms returned sat
[2024-05-25 16:33:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:04] [INFO ] [Nat]Absence check using 65 positive place invariants in 184 ms returned sat
[2024-05-25 16:33:05] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 412 ms returned sat
[2024-05-25 16:33:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:33:14] [INFO ] [Nat]Absence check using state equation in 9494 ms returned sat
[2024-05-25 16:33:14] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2024-05-25 16:33:18] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:33:21] [INFO ] [Nat]Added 8098 Read/Feed constraints in 6390 ms returned unknown
[2024-05-25 16:33:21] [INFO ] [Real]Absence check using 65 positive place invariants in 184 ms returned sat
[2024-05-25 16:33:22] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 423 ms returned sat
[2024-05-25 16:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:33:30] [INFO ] [Real]Absence check using state equation in 8567 ms returned sat
[2024-05-25 16:33:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 186 ms returned sat
[2024-05-25 16:33:32] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 431 ms returned sat
[2024-05-25 16:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:33:42] [INFO ] [Nat]Absence check using state equation in 9895 ms returned sat
[2024-05-25 16:33:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:33:48] [INFO ] [Nat]Added 8098 Read/Feed constraints in 6396 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 7881 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7881/7881 places, 17170/17170 transitions.
Applied a total of 0 rules in 2087 ms. Remains 7881 /7881 variables (removed 0) and now considering 17170/17170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2095 ms. Remains : 7881/7881 places, 17170/17170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7881/7881 places, 17170/17170 transitions.
Applied a total of 0 rules in 2077 ms. Remains 7881 /7881 variables (removed 0) and now considering 17170/17170 (removed 0) transitions.
[2024-05-25 16:33:53] [INFO ] Flow matrix only has 15606 transitions (discarded 1564 similar events)
[2024-05-25 16:33:53] [INFO ] Invariant cache hit.
[2024-05-25 16:33:53] [INFO ] Implicit Places using invariants in 700 ms returned []
Implicit Place search using SMT only with invariants took 701 ms to find 0 implicit places.
[2024-05-25 16:33:53] [INFO ] Flow matrix only has 15606 transitions (discarded 1564 similar events)
[2024-05-25 16:33:53] [INFO ] Invariant cache hit.
[2024-05-25 16:33:54] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3507 ms. Remains : 7881/7881 places, 17170/17170 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-00
Normalized transition count is 15606 out of 17170 initially.
// Phase 1: matrix 15606 rows 7881 cols
[2024-05-25 16:33:55] [INFO ] Computed 1361 invariants in 694 ms
Incomplete random walk after 10000 steps, including 523 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
[2024-05-25 16:33:55] [INFO ] Flow matrix only has 15606 transitions (discarded 1564 similar events)
// Phase 1: matrix 15606 rows 7881 cols
[2024-05-25 16:33:56] [INFO ] Computed 1361 invariants in 703 ms
[2024-05-25 16:33:57] [INFO ] [Real]Absence check using 65 positive place invariants in 178 ms returned sat
[2024-05-25 16:33:57] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 420 ms returned sat
[2024-05-25 16:33:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:34:01] [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) : [1] Max seen :[0]
Support contains 1 out of 7881 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7881/7881 places, 17170/17170 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 7881 transition count 17169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 7880 transition count 17169
Applied a total of 2 rules in 4153 ms. Remains 7880 /7881 variables (removed 1) and now considering 17169/17170 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4154 ms. Remains : 7880/7881 places, 17169/17170 transitions.
Normalized transition count is 15604 out of 17169 initially.
// Phase 1: matrix 15604 rows 7880 cols
[2024-05-25 16:34:06] [INFO ] Computed 1361 invariants in 701 ms
Interrupted random walk after 932647 steps, including 48833 resets, run timeout after 30001 ms. (steps per millisecond=31 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4080 ms. (steps per millisecond=245 ) properties (out of 1) seen :0
[2024-05-25 16:34:40] [INFO ] Flow matrix only has 15604 transitions (discarded 1565 similar events)
// Phase 1: matrix 15604 rows 7880 cols
[2024-05-25 16:34:41] [INFO ] Computed 1361 invariants in 698 ms
[2024-05-25 16:34:41] [INFO ] [Real]Absence check using 65 positive place invariants in 191 ms returned sat
[2024-05-25 16:34:42] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 423 ms returned sat
[2024-05-25 16:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:34:50] [INFO ] [Real]Absence check using state equation in 8420 ms returned sat
[2024-05-25 16:34:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:34:52] [INFO ] [Nat]Absence check using 65 positive place invariants in 191 ms returned sat
[2024-05-25 16:34:52] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 414 ms returned sat
[2024-05-25 16:34:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:35:01] [INFO ] [Nat]Absence check using state equation in 8790 ms returned sat
[2024-05-25 16:35:01] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2024-05-25 16:35:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:35:07] [INFO ] [Nat]Added 8098 Read/Feed constraints in 6397 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 7880 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7880/7880 places, 17169/17169 transitions.
Applied a total of 0 rules in 2027 ms. Remains 7880 /7880 variables (removed 0) and now considering 17169/17169 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2027 ms. Remains : 7880/7880 places, 17169/17169 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7880/7880 places, 17169/17169 transitions.
Applied a total of 0 rules in 2050 ms. Remains 7880 /7880 variables (removed 0) and now considering 17169/17169 (removed 0) transitions.
[2024-05-25 16:35:11] [INFO ] Flow matrix only has 15604 transitions (discarded 1565 similar events)
[2024-05-25 16:35:11] [INFO ] Invariant cache hit.
[2024-05-25 16:35:19] [INFO ] Implicit Places using invariants in 7713 ms returned []
Implicit Place search using SMT only with invariants took 7715 ms to find 0 implicit places.
[2024-05-25 16:35:19] [INFO ] Flow matrix only has 15604 transitions (discarded 1565 similar events)
[2024-05-25 16:35:19] [INFO ] Invariant cache hit.
[2024-05-25 16:35:31] [INFO ] Dead Transitions using invariants and state equation in 12283 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22051 ms. Remains : 7880/7880 places, 17169/17169 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-00 in 97240 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-02
Normalized transition count is 15606 out of 17170 initially.
// Phase 1: matrix 15606 rows 7881 cols
[2024-05-25 16:35:32] [INFO ] Computed 1361 invariants in 703 ms
Incomplete random walk after 10000 steps, including 523 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
[2024-05-25 16:35:32] [INFO ] Flow matrix only has 15606 transitions (discarded 1564 similar events)
// Phase 1: matrix 15606 rows 7881 cols
[2024-05-25 16:35:33] [INFO ] Computed 1361 invariants in 711 ms
[2024-05-25 16:35:34] [INFO ] [Real]Absence check using 65 positive place invariants in 179 ms returned sat
[2024-05-25 16:35:34] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 418 ms returned sat
[2024-05-25 16:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:35:38] [INFO ] [Real]Absence check using state equation in 3772 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 7881 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7881/7881 places, 17170/17170 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 7881 transition count 17169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 7880 transition count 17169
Applied a total of 2 rules in 4103 ms. Remains 7880 /7881 variables (removed 1) and now considering 17169/17170 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4104 ms. Remains : 7880/7881 places, 17169/17170 transitions.
Normalized transition count is 15604 out of 17169 initially.
// Phase 1: matrix 15604 rows 7880 cols
[2024-05-25 16:35:43] [INFO ] Computed 1361 invariants in 688 ms
Interrupted random walk after 908518 steps, including 47582 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4275 ms. (steps per millisecond=233 ) properties (out of 1) seen :0
[2024-05-25 16:36:17] [INFO ] Flow matrix only has 15604 transitions (discarded 1565 similar events)
// Phase 1: matrix 15604 rows 7880 cols
[2024-05-25 16:36:18] [INFO ] Computed 1361 invariants in 695 ms
[2024-05-25 16:36:19] [INFO ] [Real]Absence check using 65 positive place invariants in 175 ms returned sat
[2024-05-25 16:36:19] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 440 ms returned sat
[2024-05-25 16:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:36:28] [INFO ] [Real]Absence check using state equation in 8590 ms returned sat
[2024-05-25 16:36:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:36:29] [INFO ] [Nat]Absence check using 65 positive place invariants in 169 ms returned sat
[2024-05-25 16:36:29] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 423 ms returned sat
[2024-05-25 16:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:36:41] [INFO ] [Nat]Absence check using state equation in 11693 ms returned sat
[2024-05-25 16:36:41] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2024-05-25 16:36:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:36:48] [INFO ] [Nat]Added 8098 Read/Feed constraints in 6393 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 7880 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7880/7880 places, 17169/17169 transitions.
Applied a total of 0 rules in 2102 ms. Remains 7880 /7880 variables (removed 0) and now considering 17169/17169 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2102 ms. Remains : 7880/7880 places, 17169/17169 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7880/7880 places, 17169/17169 transitions.
Applied a total of 0 rules in 2137 ms. Remains 7880 /7880 variables (removed 0) and now considering 17169/17169 (removed 0) transitions.
[2024-05-25 16:36:52] [INFO ] Flow matrix only has 15604 transitions (discarded 1565 similar events)
[2024-05-25 16:36:52] [INFO ] Invariant cache hit.
[2024-05-25 16:37:00] [INFO ] Implicit Places using invariants in 7893 ms returned []
Implicit Place search using SMT only with invariants took 7894 ms to find 0 implicit places.
[2024-05-25 16:37:00] [INFO ] Flow matrix only has 15604 transitions (discarded 1565 similar events)
[2024-05-25 16:37:00] [INFO ] Invariant cache hit.
[2024-05-25 16:37:11] [INFO ] Dead Transitions using invariants and state equation in 11512 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21548 ms. Remains : 7880/7880 places, 17169/17169 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-02 in 99998 ms.
[2024-05-25 16:37:12] [INFO ] Flatten gal took : 810 ms
[2024-05-25 16:37:13] [INFO ] Applying decomposition
[2024-05-25 16:37:14] [INFO ] Flatten gal took : 589 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/graph13603198904064817693.txt' '-o' '/tmp/graph13603198904064817693.bin' '-w' '/tmp/graph13603198904064817693.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13603198904064817693.bin' '-l' '-1' '-v' '-w' '/tmp/graph13603198904064817693.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:37:15] [INFO ] Decomposing Gal with order
[2024-05-25 16:37:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:37:20] [INFO ] Removed a total of 18804 redundant transitions.
[2024-05-25 16:37:21] [INFO ] Flatten gal took : 4845 ms
[2024-05-25 16:37:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 14600 labels/synchronizations in 2031 ms.
[2024-05-25 16:37:25] [INFO ] Time to serialize gal into /tmp/UpperBounds13417688614769299455.gal : 297 ms
[2024-05-25 16:37:25] [INFO ] Time to serialize properties into /tmp/UpperBounds260911767114924495.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/UpperBounds13417688614769299455.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds260911767114924495.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/UpperBounds260911767114924495.prop.
Detected timeout of ITS tools.
[2024-05-25 17:02:02] [INFO ] Flatten gal took : 12334 ms
[2024-05-25 17:02:03] [INFO ] Time to serialize gal into /tmp/UpperBounds5937018734192660347.gal : 238 ms
[2024-05-25 17:02:03] [INFO ] Time to serialize properties into /tmp/UpperBounds6774195407381382796.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/UpperBounds5937018734192660347.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6774195407381382796.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...304
Loading property file /tmp/UpperBounds6774195407381382796.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 137012 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14156600 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="MultiCrashLeafsetExtension-PT-S32C03"
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 MultiCrashLeafsetExtension-PT-S32C03, 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 r263-tall-171654372000096"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C03.tgz
mv MultiCrashLeafsetExtension-PT-S32C03 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;