About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S32C06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2735.815 | 490280.00 | 537318.00 | 2820.90 | 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r229-tall-167856413900925.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S32C06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413900925
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 16K Feb 26 02:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 02:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 02:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 02:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 24M Mar 5 18:22 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-S32C06-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679623390694
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-24 02:03:12] [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]
[2023-03-24 02:03:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 02:03:12] [INFO ] Load time of PNML (sax parser for PT used): 661 ms
[2023-03-24 02:03:12] [INFO ] Transformed 22816 places.
[2023-03-24 02:03:13] [INFO ] Transformed 35015 transitions.
[2023-03-24 02:03:13] [INFO ] Parsed PT model containing 22816 places and 35015 transitions and 137470 arcs in 870 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 33959 out of 35015 initially.
// Phase 1: matrix 33959 rows 22816 cols
[2023-03-24 02:03:17] [INFO ] Computed 1613 place invariants in 3903 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 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 23 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 23 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 23 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 16) seen :0
[2023-03-24 02:03:19] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
// Phase 1: matrix 33959 rows 22816 cols
[2023-03-24 02:03:23] [INFO ] Computed 1613 place invariants in 3547 ms
[2023-03-24 02:03:26] [INFO ] [Real]Absence check using 82 positive place invariants in 953 ms returned sat
[2023-03-24 02:03:27] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 506 ms returned unsat
[2023-03-24 02:03:30] [INFO ] [Real]Absence check using 82 positive place invariants in 878 ms returned sat
[2023-03-24 02:03:32] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 1456 ms returned sat
[2023-03-24 02:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:03:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 1
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:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 02:03:35] [INFO ] [Real]Absence check using 82 positive place invariants in 910 ms returned sat
[2023-03-24 02:03:37] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 1376 ms returned sat
[2023-03-24 02:03:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:03:37] [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 2
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:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 02:03:40] [INFO ] [Real]Absence check using 82 positive place invariants in 931 ms returned sat
[2023-03-24 02:03:42] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 1479 ms returned sat
[2023-03-24 02:03:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:03:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 02:03:45] [INFO ] [Real]Absence check using 82 positive place invariants in 854 ms returned sat
[2023-03-24 02:03:47] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 1467 ms returned sat
[2023-03-24 02:03:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:03:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 02:03:50] [INFO ] [Real]Absence check using 82 positive place invariants in 885 ms returned sat
[2023-03-24 02:03:51] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 358 ms returned unsat
[2023-03-24 02:03:54] [INFO ] [Real]Absence check using 82 positive place invariants in 890 ms returned sat
[2023-03-24 02:03:55] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 1345 ms returned sat
[2023-03-24 02:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:03:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 02:03:59] [INFO ] [Real]Absence check using 82 positive place invariants in 908 ms returned sat
[2023-03-24 02:03:59] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 323 ms returned unsat
[2023-03-24 02:04:03] [INFO ] [Real]Absence check using 82 positive place invariants in 863 ms returned sat
[2023-03-24 02:04:04] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 1440 ms returned sat
[2023-03-24 02:04:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:04:04] [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 8
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:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 02:04:08] [INFO ] [Real]Absence check using 82 positive place invariants in 920 ms returned sat
[2023-03-24 02:04:09] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 1449 ms returned sat
[2023-03-24 02:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:04:09] [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 9
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:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 02:04:13] [INFO ] [Real]Absence check using 82 positive place invariants in 905 ms returned sat
[2023-03-24 02:04:14] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 1458 ms returned sat
[2023-03-24 02:04:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:04:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 10
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:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 02:04:18] [INFO ] [Real]Absence check using 82 positive place invariants in 882 ms returned sat
[2023-03-24 02:04:19] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 1402 ms returned sat
[2023-03-24 02:04:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:04:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 11
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:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 02:04:23] [INFO ] [Real]Absence check using 82 positive place invariants in 889 ms returned sat
[2023-03-24 02:04:23] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 327 ms returned unsat
[2023-03-24 02:04:26] [INFO ] [Real]Absence check using 82 positive place invariants in 873 ms returned sat
[2023-03-24 02:04:27] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 320 ms returned unsat
[2023-03-24 02:04:30] [INFO ] [Real]Absence check using 82 positive place invariants in 855 ms returned sat
[2023-03-24 02:04:31] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 1473 ms returned sat
[2023-03-24 02:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:04:32] [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 14
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:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 02:04:35] [INFO ] [Real]Absence check using 82 positive place invariants in 892 ms returned sat
[2023-03-24 02:04:36] [INFO ] [Real]Absence check using 82 positive and 1531 generalized place invariants in 577 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 99, 1, 99, 33, 1, 33, 1, 99, 33, 33, 33, 1, 1, 99, 1] Max seen :[1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 22816 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22816/22816 places, 35015/35015 transitions.
Graph (complete) has 79301 edges and 22816 vertex of which 22768 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.58 ms
Discarding 48 places :
Also discarding 0 output transitions
Drop transitions removed 6313 transitions
Trivial Post-agglo rules discarded 6313 transitions
Performed 6313 trivial Post agglomeration. Transition count delta: 6313
Iterating post reduction 0 with 6313 rules applied. Total rules applied 6314 place count 22768 transition count 28702
Reduce places removed 6313 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 6333 rules applied. Total rules applied 12647 place count 16455 transition count 28682
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 12667 place count 16435 transition count 28682
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 394 Pre rules applied. Total rules applied 12667 place count 16435 transition count 28288
Deduced a syphon composed of 394 places in 40 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 3 with 788 rules applied. Total rules applied 13455 place count 16041 transition count 28288
Discarding 5933 places :
Symmetric choice reduction at 3 with 5933 rule applications. Total rules 19388 place count 10108 transition count 22355
Iterating global reduction 3 with 5933 rules applied. Total rules applied 25321 place count 10108 transition count 22355
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 25321 place count 10108 transition count 22350
Deduced a syphon composed of 5 places in 31 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 25331 place count 10103 transition count 22350
Discarding 983 places :
Symmetric choice reduction at 3 with 983 rule applications. Total rules 26314 place count 9120 transition count 16452
Iterating global reduction 3 with 983 rules applied. Total rules applied 27297 place count 9120 transition count 16452
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 24 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 27363 place count 9087 transition count 16419
Free-agglomeration rule (complex) applied 583 times.
Iterating global reduction 3 with 583 rules applied. Total rules applied 27946 place count 9087 transition count 20751
Reduce places removed 583 places and 0 transitions.
Iterating post reduction 3 with 583 rules applied. Total rules applied 28529 place count 8504 transition count 20751
Partial Free-agglomeration rule applied 230 times.
Drop transitions removed 230 transitions
Iterating global reduction 4 with 230 rules applied. Total rules applied 28759 place count 8504 transition count 20751
Applied a total of 28759 rules in 11982 ms. Remains 8504 /22816 variables (removed 14312) and now considering 20751/35015 (removed 14264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11989 ms. Remains : 8504/22816 places, 20751/35015 transitions.
Normalized transition count is 19185 out of 20751 initially.
// Phase 1: matrix 19185 rows 8504 cols
[2023-03-24 02:04:49] [INFO ] Computed 1565 place invariants in 898 ms
Interrupted random walk after 442597 steps, including 11891 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 5
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 689124 steps, including 1734 resets, run timeout after 5001 ms. (steps per millisecond=137 ) properties seen 1
Interrupted Best-First random walk after 701002 steps, including 1764 resets, run timeout after 5001 ms. (steps per millisecond=140 ) properties seen 1
Interrupted Best-First random walk after 701096 steps, including 1764 resets, run timeout after 5001 ms. (steps per millisecond=140 ) properties seen 1
Interrupted Best-First random walk after 693314 steps, including 1745 resets, run timeout after 5001 ms. (steps per millisecond=138 ) properties seen 1
Interrupted Best-First random walk after 703086 steps, including 1769 resets, run timeout after 5001 ms. (steps per millisecond=140 ) properties seen 3
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-24 02:05:44] [INFO ] Flow matrix only has 19185 transitions (discarded 1566 similar events)
// Phase 1: matrix 19185 rows 8504 cols
[2023-03-24 02:05:44] [INFO ] Computed 1565 place invariants in 922 ms
[2023-03-24 02:05:45] [INFO ] [Real]Absence check using 65 positive place invariants in 216 ms returned sat
[2023-03-24 02:05:46] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 403 ms returned unsat
[2023-03-24 02:05:47] [INFO ] [Real]Absence check using 65 positive place invariants in 213 ms returned sat
[2023-03-24 02:05:47] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 553 ms returned sat
[2023-03-24 02:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:06:01] [INFO ] [Real]Absence check using state equation in 13520 ms returned sat
[2023-03-24 02:06:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:06:02] [INFO ] [Nat]Absence check using 65 positive place invariants in 187 ms returned sat
[2023-03-24 02:06:03] [INFO ] [Nat]Absence check using 65 positive and 1500 generalized place invariants in 505 ms returned sat
[2023-03-24 02:06:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:06:17] [INFO ] [Nat]Absence check using state equation in 14123 ms returned sat
[2023-03-24 02:06:17] [INFO ] State equation strengthened by 11266 read => feed constraints.
[2023-03-24 02:06:21] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 02:06:22] [INFO ] [Nat]Added 11266 Read/Feed constraints in 4968 ms returned unsat
[2023-03-24 02:06:23] [INFO ] [Real]Absence check using 65 positive place invariants in 201 ms returned sat
[2023-03-24 02:06:24] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 502 ms returned sat
[2023-03-24 02:06:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:06:36] [INFO ] [Real]Absence check using state equation in 12859 ms returned sat
[2023-03-24 02:06:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:06:38] [INFO ] [Nat]Absence check using 65 positive place invariants in 206 ms returned sat
[2023-03-24 02:06:38] [INFO ] [Nat]Absence check using 65 positive and 1500 generalized place invariants in 454 ms returned sat
[2023-03-24 02:06:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:06:52] [INFO ] [Nat]Absence check using state equation in 13552 ms returned sat
[2023-03-24 02:06:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 02:06:57] [INFO ] [Nat]Added 11266 Read/Feed constraints in 4849 ms returned sat
[2023-03-24 02:06:59] [INFO ] Computed and/alt/rep : 10934/15901/10934 causal constraints (skipped 8218 transitions) in 1512 ms.
[2023-03-24 02:07:03] [INFO ] Added : 6 causal constraints over 2 iterations in 5336 ms. Result :sat
[2023-03-24 02:07:04] [INFO ] [Real]Absence check using 65 positive place invariants in 217 ms returned sat
[2023-03-24 02:07:05] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 492 ms returned unsat
[2023-03-24 02:07:06] [INFO ] [Real]Absence check using 65 positive place invariants in 200 ms returned sat
[2023-03-24 02:07:06] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 513 ms returned sat
[2023-03-24 02:07:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:07:18] [INFO ] [Real]Absence check using state equation in 11525 ms returned sat
[2023-03-24 02:07:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:07:19] [INFO ] [Nat]Absence check using 65 positive place invariants in 208 ms returned sat
[2023-03-24 02:07:20] [INFO ] [Nat]Absence check using 65 positive and 1500 generalized place invariants in 506 ms returned sat
[2023-03-24 02:07:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:07:33] [INFO ] [Nat]Absence check using state equation in 13306 ms returned sat
[2023-03-24 02:07:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 02:07:37] [INFO ] [Nat]Added 11266 Read/Feed constraints in 4109 ms returned sat
[2023-03-24 02:07:39] [INFO ] Computed and/alt/rep : 10934/15901/10934 causal constraints (skipped 8218 transitions) in 1480 ms.
[2023-03-24 02:07:42] [INFO ] Added : 5 causal constraints over 1 iterations in 3856 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 0, 2, 1, 2] Max seen :[1, 0, 0, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 8504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8504/8504 places, 20751/20751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8504 transition count 20748
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 8501 transition count 20748
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 8501 transition count 20745
Deduced a syphon composed of 3 places in 18 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 8498 transition count 20745
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 8498 transition count 20741
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 8494 transition count 20741
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 24 place count 8490 transition count 20737
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 8490 transition count 20737
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 8490 transition count 20737
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 8489 transition count 20736
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 8489 transition count 20736
Applied a total of 31 rules in 5170 ms. Remains 8489 /8504 variables (removed 15) and now considering 20736/20751 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5170 ms. Remains : 8489/8504 places, 20736/20751 transitions.
Normalized transition count is 19170 out of 20736 initially.
// Phase 1: matrix 19170 rows 8489 cols
[2023-03-24 02:07:49] [INFO ] Computed 1565 place invariants in 860 ms
Interrupted random walk after 489981 steps, including 13168 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 1
Interrupted Best-First random walk after 719435 steps, including 1811 resets, run timeout after 5001 ms. (steps per millisecond=143 ) properties seen 1
Interrupted Best-First random walk after 715692 steps, including 1801 resets, run timeout after 5001 ms. (steps per millisecond=143 ) properties seen 0
[2023-03-24 02:08:29] [INFO ] Flow matrix only has 19170 transitions (discarded 1566 similar events)
// Phase 1: matrix 19170 rows 8489 cols
[2023-03-24 02:08:30] [INFO ] Computed 1565 place invariants in 926 ms
[2023-03-24 02:08:31] [INFO ] [Real]Absence check using 65 positive place invariants in 193 ms returned sat
[2023-03-24 02:08:31] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 555 ms returned sat
[2023-03-24 02:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:08:45] [INFO ] [Real]Absence check using state equation in 14236 ms returned sat
[2023-03-24 02:08:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:08:47] [INFO ] [Nat]Absence check using 65 positive place invariants in 195 ms returned sat
[2023-03-24 02:08:47] [INFO ] [Nat]Absence check using 65 positive and 1500 generalized place invariants in 523 ms returned sat
[2023-03-24 02:08:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:09:01] [INFO ] [Nat]Absence check using state equation in 13504 ms returned sat
[2023-03-24 02:09:01] [INFO ] State equation strengthened by 11266 read => feed constraints.
[2023-03-24 02:09:04] [INFO ] [Nat]Added 11266 Read/Feed constraints in 3455 ms returned sat
[2023-03-24 02:09:06] [INFO ] Computed and/alt/rep : 10924/15886/10924 causal constraints (skipped 8213 transitions) in 1385 ms.
[2023-03-24 02:09:10] [INFO ] Added : 6 causal constraints over 2 iterations in 4817 ms. Result :sat
[2023-03-24 02:09:11] [INFO ] [Real]Absence check using 65 positive place invariants in 195 ms returned sat
[2023-03-24 02:09:12] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 342 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 1] Max seen :[0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 8489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8489/8489 places, 20736/20736 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 8489 transition count 20735
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 8488 transition count 20735
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 8487 transition count 20734
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 8487 transition count 20734
Applied a total of 4 rules in 3003 ms. Remains 8487 /8489 variables (removed 2) and now considering 20734/20736 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3003 ms. Remains : 8487/8489 places, 20734/20736 transitions.
Normalized transition count is 19168 out of 20734 initially.
// Phase 1: matrix 19168 rows 8487 cols
[2023-03-24 02:09:16] [INFO ] Computed 1565 place invariants in 890 ms
Interrupted random walk after 485689 steps, including 13054 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Interrupted Best-First random walk after 707232 steps, including 1780 resets, run timeout after 5001 ms. (steps per millisecond=141 ) properties seen 0
[2023-03-24 02:09:51] [INFO ] Flow matrix only has 19168 transitions (discarded 1566 similar events)
// Phase 1: matrix 19168 rows 8487 cols
[2023-03-24 02:09:52] [INFO ] Computed 1565 place invariants in 952 ms
[2023-03-24 02:09:53] [INFO ] [Real]Absence check using 65 positive place invariants in 194 ms returned sat
[2023-03-24 02:09:53] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 511 ms returned sat
[2023-03-24 02:09:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:10:05] [INFO ] [Real]Absence check using state equation in 11806 ms returned sat
[2023-03-24 02:10:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:10:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 195 ms returned sat
[2023-03-24 02:10:07] [INFO ] [Nat]Absence check using 65 positive and 1500 generalized place invariants in 506 ms returned sat
[2023-03-24 02:10:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:10:18] [INFO ] [Nat]Absence check using state equation in 11735 ms returned sat
[2023-03-24 02:10:19] [INFO ] State equation strengthened by 11266 read => feed constraints.
[2023-03-24 02:10:22] [INFO ] [Nat]Added 11266 Read/Feed constraints in 3091 ms returned sat
[2023-03-24 02:10:24] [INFO ] Computed and/alt/rep : 10923/15884/10923 causal constraints (skipped 8212 transitions) in 1425 ms.
[2023-03-24 02:10:27] [INFO ] Added : 6 causal constraints over 2 iterations in 4784 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 8487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8487/8487 places, 20734/20734 transitions.
Applied a total of 0 rules in 992 ms. Remains 8487 /8487 variables (removed 0) and now considering 20734/20734 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 992 ms. Remains : 8487/8487 places, 20734/20734 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8487/8487 places, 20734/20734 transitions.
Applied a total of 0 rules in 993 ms. Remains 8487 /8487 variables (removed 0) and now considering 20734/20734 (removed 0) transitions.
[2023-03-24 02:10:30] [INFO ] Flow matrix only has 19168 transitions (discarded 1566 similar events)
[2023-03-24 02:10:30] [INFO ] Invariant cache hit.
[2023-03-24 02:10:31] [INFO ] Implicit Places using invariants in 753 ms returned []
Implicit Place search using SMT only with invariants took 754 ms to find 0 implicit places.
[2023-03-24 02:10:31] [INFO ] Flow matrix only has 19168 transitions (discarded 1566 similar events)
[2023-03-24 02:10:31] [INFO ] Invariant cache hit.
[2023-03-24 02:10:31] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2460 ms. Remains : 8487/8487 places, 20734/20734 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-03
Normalized transition count is 19168 out of 20734 initially.
// Phase 1: matrix 19168 rows 8487 cols
[2023-03-24 02:10:32] [INFO ] Computed 1565 place invariants in 877 ms
Incomplete random walk after 10000 steps, including 268 resets, run finished after 623 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
[2023-03-24 02:10:33] [INFO ] Flow matrix only has 19168 transitions (discarded 1566 similar events)
// Phase 1: matrix 19168 rows 8487 cols
[2023-03-24 02:10:34] [INFO ] Computed 1565 place invariants in 901 ms
[2023-03-24 02:10:35] [INFO ] [Real]Absence check using 65 positive place invariants in 190 ms returned sat
[2023-03-24 02:10:35] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 515 ms returned sat
[2023-03-24 02:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:10:39] [INFO ] [Real]Absence check using state equation in 3575 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 8487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8487/8487 places, 20734/20734 transitions.
Applied a total of 0 rules in 1018 ms. Remains 8487 /8487 variables (removed 0) and now considering 20734/20734 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1019 ms. Remains : 8487/8487 places, 20734/20734 transitions.
Normalized transition count is 19168 out of 20734 initially.
// Phase 1: matrix 19168 rows 8487 cols
[2023-03-24 02:10:41] [INFO ] Computed 1565 place invariants in 883 ms
Finished random walk after 487244 steps, including 13094 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=16 )
Interrupted Best-First random walk after 730467 steps, including 1838 resets, run timeout after 5001 ms. (steps per millisecond=146 ) properties seen 0
[2023-03-24 02:11:16] [INFO ] Flow matrix only has 19168 transitions (discarded 1566 similar events)
// Phase 1: matrix 19168 rows 8487 cols
[2023-03-24 02:11:17] [INFO ] Computed 1565 place invariants in 909 ms
[2023-03-24 02:11:18] [INFO ] [Real]Absence check using 65 positive place invariants in 191 ms returned sat
[2023-03-24 02:11:18] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 458 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C06-UpperBounds-03 in 46803 ms.
[2023-03-24 02:11:20] [INFO ] Flatten gal took : 1121 ms
Total runtime 487922 ms.
BK_STOP 1679623880974
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-S32C06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S32C06, 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 r229-tall-167856413900925"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C06.tgz
mv MultiCrashLeafsetExtension-PT-S32C06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;