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.r107-tall-167814483700069.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 smartxred
Input is CloudReconfiguration-PT-309, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814483700069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.8K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 11:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 11:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 11:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 11:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 660K 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 CloudReconfiguration-PT-309-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678321836645

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-309
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 00:30:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 00:30:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 00:30:38] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-09 00:30:38] [INFO ] Transformed 2585 places.
[2023-03-09 00:30:38] [INFO ] Transformed 3095 transitions.
[2023-03-09 00:30:38] [INFO ] Found NUPN structural information;
[2023-03-09 00:30:38] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
FORMULA CloudReconfiguration-PT-309-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-09 00:30:38] [INFO ] Computed 4 place invariants in 50 ms
Incomplete random walk after 10000 steps, including 69 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 15) seen :2
FORMULA CloudReconfiguration-PT-309-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :1
FORMULA CloudReconfiguration-PT-309-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
[2023-03-09 00:30:38] [INFO ] Invariant cache hit.
[2023-03-09 00:30:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-09 00:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:30:40] [INFO ] [Real]Absence check using state equation in 1168 ms returned sat
[2023-03-09 00:30:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:30:41] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 00:30:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:30:42] [INFO ] [Nat]Absence check using state equation in 1218 ms returned sat
[2023-03-09 00:30:42] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 182 ms.
[2023-03-09 00:30:45] [INFO ] Added : 125 causal constraints over 25 iterations in 3265 ms. Result :unknown
[2023-03-09 00:30:46] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 00:30:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:30:47] [INFO ] [Real]Absence check using state equation in 1157 ms returned sat
[2023-03-09 00:30:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:30:47] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 00:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:30:48] [INFO ] [Nat]Absence check using state equation in 1133 ms returned sat
[2023-03-09 00:30:49] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 147 ms.
[2023-03-09 00:30:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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-09 00:30:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 00:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:30:54] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2023-03-09 00:30:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:30:54] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-09 00:30:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:30:56] [INFO ] [Nat]Absence check using state equation in 1735 ms returned sat
[2023-03-09 00:30:56] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 137 ms.
[2023-03-09 00:30:59] [INFO ] Added : 105 causal constraints over 21 iterations in 2791 ms. Result :unknown
[2023-03-09 00:30:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 00:30:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:00] [INFO ] [Real]Absence check using state equation in 1165 ms returned sat
[2023-03-09 00:31:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:31:01] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 00:31:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:02] [INFO ] [Nat]Absence check using state equation in 1221 ms returned sat
[2023-03-09 00:31:02] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 156 ms.
[2023-03-09 00:31:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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-09 00:31:06] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 00:31:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:07] [INFO ] [Real]Absence check using state equation in 1233 ms returned sat
[2023-03-09 00:31:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:31:08] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 00:31:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:09] [INFO ] [Nat]Absence check using state equation in 1223 ms returned sat
[2023-03-09 00:31:09] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 147 ms.
[2023-03-09 00:31:12] [INFO ] Added : 135 causal constraints over 27 iterations in 3299 ms. Result :unknown
[2023-03-09 00:31:13] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 00:31:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:14] [INFO ] [Real]Absence check using state equation in 1205 ms returned sat
[2023-03-09 00:31:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:31:14] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-09 00:31:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:16] [INFO ] [Nat]Absence check using state equation in 1223 ms returned sat
[2023-03-09 00:31:16] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 148 ms.
[2023-03-09 00:31:19] [INFO ] Added : 130 causal constraints over 26 iterations in 3312 ms. Result :unknown
[2023-03-09 00:31:19] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 00:31:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:20] [INFO ] [Real]Absence check using state equation in 1112 ms returned sat
[2023-03-09 00:31:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:31:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 00:31:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:22] [INFO ] [Nat]Absence check using state equation in 1099 ms returned sat
[2023-03-09 00:31:22] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 161 ms.
[2023-03-09 00:31:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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-09 00:31:26] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 00:31:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:27] [INFO ] [Real]Absence check using state equation in 1187 ms returned sat
[2023-03-09 00:31:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:31:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 00:31:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:29] [INFO ] [Nat]Absence check using state equation in 1240 ms returned sat
[2023-03-09 00:31:29] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 143 ms.
[2023-03-09 00:31:32] [INFO ] Added : 130 causal constraints over 26 iterations in 3331 ms. Result :unknown
[2023-03-09 00:31:33] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 00:31:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:34] [INFO ] [Real]Absence check using state equation in 1206 ms returned sat
[2023-03-09 00:31:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:31:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 00:31:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:36] [INFO ] [Nat]Absence check using state equation in 1214 ms returned sat
[2023-03-09 00:31:36] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 142 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-09 00:31:39] [INFO ] Added : 130 causal constraints over 26 iterations in 3330 ms. Result :unknown
[2023-03-09 00:31:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 00:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:41] [INFO ] [Real]Absence check using state equation in 1077 ms returned sat
[2023-03-09 00:31:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:31:41] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 00:31:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:42] [INFO ] [Nat]Absence check using state equation in 1073 ms returned sat
[2023-03-09 00:31:42] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 134 ms.
[2023-03-09 00:31:46] [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 9
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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-09 00:31:46] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 00:31:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:47] [INFO ] [Real]Absence check using state equation in 1073 ms returned sat
[2023-03-09 00:31:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:31:48] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-09 00:31:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:49] [INFO ] [Nat]Absence check using state equation in 1150 ms returned sat
[2023-03-09 00:31:49] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 149 ms.
[2023-03-09 00:31:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... 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: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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-09 00:31:53] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2023-03-09 00:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:54] [INFO ] [Real]Absence check using state equation in 1094 ms returned sat
[2023-03-09 00:31:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:31:54] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2023-03-09 00:31:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:31:55] [INFO ] [Nat]Absence check using state equation in 1082 ms returned sat
[2023-03-09 00:31:56] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 133 ms.
[2023-03-09 00:31:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... 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: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudReconfiguration-PT-309-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2937 edges and 2585 vertex of which 844 / 2585 are part of one of the 63 SCC in 17 ms
Free SCC test removed 781 places
Drop transitions removed 953 transitions
Reduce isomorphic transitions removed 953 transitions.
Graph (complete) has 2422 edges and 1804 vertex of which 1790 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1202 transitions
Trivial Post-agglo rules discarded 1202 transitions
Performed 1202 trivial Post agglomeration. Transition count delta: 1202
Iterating post reduction 0 with 1211 rules applied. Total rules applied 1213 place count 1790 transition count 922
Reduce places removed 1202 places and 0 transitions.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 1337 rules applied. Total rules applied 2550 place count 588 transition count 787
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 2 with 69 rules applied. Total rules applied 2619 place count 528 transition count 778
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 2625 place count 525 transition count 775
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 2629 place count 523 transition count 773
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 5 with 9 rules applied. Total rules applied 2638 place count 522 transition count 765
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2648 place count 514 transition count 763
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 23 Pre rules applied. Total rules applied 2648 place count 514 transition count 740
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 2694 place count 491 transition count 740
Discarding 79 places :
Symmetric choice reduction at 7 with 79 rule applications. Total rules 2773 place count 412 transition count 661
Iterating global reduction 7 with 79 rules applied. Total rules applied 2852 place count 412 transition count 661
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2852 place count 412 transition count 652
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2870 place count 403 transition count 652
Discarding 61 places :
Symmetric choice reduction at 7 with 61 rule applications. Total rules 2931 place count 342 transition count 591
Iterating global reduction 7 with 61 rules applied. Total rules applied 2992 place count 342 transition count 591
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 7 with 36 rules applied. Total rules applied 3028 place count 342 transition count 555
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 8 with 30 rules applied. Total rules applied 3058 place count 324 transition count 543
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 3064 place count 318 transition count 543
Discarding 21 places :
Symmetric choice reduction at 10 with 21 rule applications. Total rules 3085 place count 297 transition count 510
Iterating global reduction 10 with 21 rules applied. Total rules applied 3106 place count 297 transition count 510
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3115 place count 297 transition count 501
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 3124 place count 288 transition count 483
Iterating global reduction 11 with 9 rules applied. Total rules applied 3133 place count 288 transition count 483
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3136 place count 285 transition count 477
Iterating global reduction 11 with 3 rules applied. Total rules applied 3139 place count 285 transition count 477
Performed 153 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 11 with 306 rules applied. Total rules applied 3445 place count 132 transition count 244
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 3448 place count 132 transition count 241
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 3454 place count 129 transition count 238
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3460 place count 129 transition count 232
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3466 place count 126 transition count 229
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3472 place count 126 transition count 223
Performed 35 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 14 with 70 rules applied. Total rules applied 3542 place count 91 transition count 263
Drop transitions removed 11 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 14 with 39 rules applied. Total rules applied 3581 place count 91 transition count 224
Discarding 21 places :
Symmetric choice reduction at 15 with 21 rule applications. Total rules 3602 place count 70 transition count 190
Iterating global reduction 15 with 21 rules applied. Total rules applied 3623 place count 70 transition count 190
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 3633 place count 70 transition count 180
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 3638 place count 65 transition count 170
Iterating global reduction 16 with 5 rules applied. Total rules applied 3643 place count 65 transition count 170
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 3648 place count 65 transition count 165
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 17 with 16 rules applied. Total rules applied 3664 place count 65 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 3666 place count 64 transition count 148
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 3669 place count 64 transition count 145
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 3673 place count 61 transition count 144
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 3675 place count 61 transition count 144
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3676 place count 61 transition count 143
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3677 place count 60 transition count 142
Iterating global reduction 18 with 1 rules applied. Total rules applied 3678 place count 60 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 3679 place count 59 transition count 141
Applied a total of 3679 rules in 424 ms. Remains 59 /2585 variables (removed 2526) and now considering 141/3095 (removed 2954) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 59/2585 places, 141/3095 transitions.
Normalized transition count is 133 out of 141 initially.
// Phase 1: matrix 133 rows 59 cols
[2023-03-09 00:32:00] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 13311 resets, run finished after 1005 ms. (steps per millisecond=995 ) properties (out of 8) seen :8
FORMULA CloudReconfiguration-PT-309-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 82785 ms.
ITS solved all properties within timeout

BK_STOP 1678321922068

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="CloudReconfiguration-PT-309"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is CloudReconfiguration-PT-309, 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 r107-tall-167814483700069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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