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.r103-tall-167814477800013.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 lolaxred
Input is CloudReconfiguration-PT-302, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814477800013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.0K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 11:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:46 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-302-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678227984908

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-302
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-07 22:26:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-07 22:26:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 22:26:26] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2023-03-07 22:26:26] [INFO ] Transformed 2585 places.
[2023-03-07 22:26:26] [INFO ] Transformed 3095 transitions.
[2023-03-07 22:26:26] [INFO ] Found NUPN structural information;
[2023-03-07 22:26:26] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-07 22:26:26] [INFO ] Computed 4 place invariants in 56 ms
Incomplete random walk after 10000 steps, including 73 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :3
FORMULA CloudReconfiguration-PT-302-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 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 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :1
FORMULA CloudReconfiguration-PT-302-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :1
FORMULA CloudReconfiguration-PT-302-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
[2023-03-07 22:26:27] [INFO ] Invariant cache hit.
[2023-03-07 22:26:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 22:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:28] [INFO ] [Real]Absence check using state equation in 1150 ms returned sat
[2023-03-07 22:26:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:26:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:30] [INFO ] [Nat]Absence check using state equation in 1115 ms returned sat
[2023-03-07 22:26:30] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 152 ms.
[2023-03-07 22:26:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-07 22:26:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:26:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:35] [INFO ] [Real]Absence check using state equation in 1174 ms returned sat
[2023-03-07 22:26:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:26:36] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-07 22:26:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:37] [INFO ] [Nat]Absence check using state equation in 1128 ms returned sat
[2023-03-07 22:26:37] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 126 ms.
[2023-03-07 22:26:40] [INFO ] Added : 135 causal constraints over 27 iterations in 3483 ms. Result :unknown
[2023-03-07 22:26:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:42] [INFO ] [Real]Absence check using state equation in 1155 ms returned sat
[2023-03-07 22:26:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:26:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:44] [INFO ] [Nat]Absence check using state equation in 1366 ms returned sat
[2023-03-07 22:26:44] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 140 ms.
[2023-03-07 22:26:47] [INFO ] Added : 130 causal constraints over 26 iterations in 3238 ms. Result :unknown
[2023-03-07 22:26:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 22:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:49] [INFO ] [Real]Absence check using state equation in 1133 ms returned sat
[2023-03-07 22:26:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:26:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:50] [INFO ] [Nat]Absence check using state equation in 1339 ms returned sat
[2023-03-07 22:26:51] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 133 ms.
[2023-03-07 22:26:54] [INFO ] Added : 130 causal constraints over 26 iterations in 3244 ms. Result :unknown
[2023-03-07 22:26:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 22:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:55] [INFO ] [Real]Absence check using state equation in 1169 ms returned sat
[2023-03-07 22:26:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:26:56] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-07 22:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:57] [INFO ] [Nat]Absence check using state equation in 1210 ms returned sat
[2023-03-07 22:26:57] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 153 ms.
[2023-03-07 22:27:00] [INFO ] Added : 130 causal constraints over 26 iterations in 3337 ms. Result :unknown
[2023-03-07 22:27:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:27:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:02] [INFO ] [Real]Absence check using state equation in 1242 ms returned sat
[2023-03-07 22:27:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:27:03] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:27:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:04] [INFO ] [Nat]Absence check using state equation in 1199 ms returned sat
[2023-03-07 22:27:04] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 143 ms.
[2023-03-07 22:27:07] [INFO ] Added : 90 causal constraints over 18 iterations in 3367 ms. Result :unknown
[2023-03-07 22:27:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 22:27:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:09] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2023-03-07 22:27:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:27:10] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 22:27:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:11] [INFO ] [Nat]Absence check using state equation in 1174 ms returned sat
[2023-03-07 22:27:11] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 145 ms.
[2023-03-07 22:27: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: 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-07 22:27:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2023-03-07 22:27:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:16] [INFO ] [Real]Absence check using state equation in 1189 ms returned sat
[2023-03-07 22:27:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:27:16] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:27:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:17] [INFO ] [Nat]Absence check using state equation in 1215 ms returned sat
[2023-03-07 22:27:18] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 141 ms.
[2023-03-07 22:27:21] [INFO ] Added : 130 causal constraints over 26 iterations in 3370 ms. Result :unknown
[2023-03-07 22:27:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:22] [INFO ] [Real]Absence check using state equation in 1100 ms returned sat
[2023-03-07 22:27:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:27:23] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:27:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:24] [INFO ] [Nat]Absence check using state equation in 1116 ms returned sat
[2023-03-07 22:27:24] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 129 ms.
[2023-03-07 22:27:28] [INFO ] Added : 140 causal constraints over 28 iterations in 3426 ms. Result :unknown
[2023-03-07 22:27:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:27:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:29] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2023-03-07 22:27:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:27:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:27:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:31] [INFO ] [Nat]Absence check using state equation in 1173 ms returned sat
[2023-03-07 22:27:31] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 127 ms.
[2023-03-07 22:27:34] [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-07 22:27:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:27:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:36] [INFO ] [Real]Absence check using state equation in 1176 ms returned sat
[2023-03-07 22:27:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:27:36] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 22:27:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:37] [INFO ] [Nat]Absence check using state equation in 1207 ms returned sat
[2023-03-07 22:27:38] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 130 ms.
[2023-03-07 22:27:41] [INFO ] Added : 130 causal constraints over 26 iterations in 3402 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 11 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2932 edges and 2585 vertex of which 845 / 2585 are part of one of the 63 SCC in 14 ms
Free SCC test removed 782 places
Drop transitions removed 954 transitions
Reduce isomorphic transitions removed 954 transitions.
Graph (complete) has 2421 edges and 1803 vertex of which 1789 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.6 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 1789 transition count 921
Reduce places removed 1202 places and 0 transitions.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 1 with 1344 rules applied. Total rules applied 2557 place count 587 transition count 779
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 75 rules applied. Total rules applied 2632 place count 523 transition count 768
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 11 rules applied. Total rules applied 2643 place count 519 transition count 761
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 8 rules applied. Total rules applied 2651 place count 515 transition count 757
Reduce places removed 2 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 5 with 10 rules applied. Total rules applied 2661 place count 513 transition count 749
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 10 rules applied. Total rules applied 2671 place count 505 transition count 747
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2672 place count 504 transition count 747
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 21 Pre rules applied. Total rules applied 2672 place count 504 transition count 726
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 42 rules applied. Total rules applied 2714 place count 483 transition count 726
Discarding 80 places :
Symmetric choice reduction at 8 with 80 rule applications. Total rules 2794 place count 403 transition count 646
Iterating global reduction 8 with 80 rules applied. Total rules applied 2874 place count 403 transition count 646
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 2874 place count 403 transition count 637
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 2892 place count 394 transition count 637
Discarding 60 places :
Symmetric choice reduction at 8 with 60 rule applications. Total rules 2952 place count 334 transition count 577
Iterating global reduction 8 with 60 rules applied. Total rules applied 3012 place count 334 transition count 577
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 35 rules applied. Total rules applied 3047 place count 334 transition count 542
Reduce places removed 17 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 9 with 29 rules applied. Total rules applied 3076 place count 317 transition count 530
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3082 place count 311 transition count 530
Discarding 20 places :
Symmetric choice reduction at 11 with 20 rule applications. Total rules 3102 place count 291 transition count 499
Iterating global reduction 11 with 20 rules applied. Total rules applied 3122 place count 291 transition count 499
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 3130 place count 291 transition count 491
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 3139 place count 282 transition count 473
Iterating global reduction 12 with 9 rules applied. Total rules applied 3148 place count 282 transition count 473
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 3151 place count 279 transition count 467
Iterating global reduction 12 with 3 rules applied. Total rules applied 3154 place count 279 transition count 467
Performed 148 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 12 with 296 rules applied. Total rules applied 3450 place count 131 transition count 236
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 3453 place count 131 transition count 233
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 13 with 6 rules applied. Total rules applied 3459 place count 128 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3465 place count 128 transition count 224
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 14 with 6 rules applied. Total rules applied 3471 place count 125 transition count 221
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3477 place count 125 transition count 215
Performed 31 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 15 with 62 rules applied. Total rules applied 3539 place count 94 transition count 248
Drop transitions removed 16 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 15 with 38 rules applied. Total rules applied 3577 place count 94 transition count 210
Discarding 20 places :
Symmetric choice reduction at 16 with 20 rule applications. Total rules 3597 place count 74 transition count 182
Iterating global reduction 16 with 20 rules applied. Total rules applied 3617 place count 74 transition count 182
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 16 with 13 rules applied. Total rules applied 3630 place count 74 transition count 169
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3631 place count 73 transition count 167
Iterating global reduction 17 with 1 rules applied. Total rules applied 3632 place count 73 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 3633 place count 73 transition count 166
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 18 with 15 rules applied. Total rules applied 3648 place count 73 transition count 151
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 3650 place count 71 transition count 144
Iterating global reduction 18 with 2 rules applied. Total rules applied 3652 place count 71 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 3653 place count 71 transition count 143
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 19 with 2 rules applied. Total rules applied 3655 place count 70 transition count 142
Free-agglomeration rule applied 3 times.
Iterating global reduction 19 with 3 rules applied. Total rules applied 3658 place count 70 transition count 139
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 3662 place count 67 transition count 138
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 3664 place count 67 transition count 138
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3665 place count 67 transition count 137
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 3667 place count 67 transition count 137
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 3668 place count 67 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 3669 place count 66 transition count 135
Applied a total of 3669 rules in 308 ms. Remains 66 /2585 variables (removed 2519) and now considering 135/3095 (removed 2960) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 66/2585 places, 135/3095 transitions.
Normalized transition count is 130 out of 135 initially.
// Phase 1: matrix 130 rows 66 cols
[2023-03-07 22:27:41] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 11742 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties (out of 11) seen :11
FORMULA CloudReconfiguration-PT-302-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 76391 ms.
ITS solved all properties within timeout

BK_STOP 1678228063790

--------------------
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-302"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CloudReconfiguration-PT-302, 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 r103-tall-167814477800013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-302.tgz
mv CloudReconfiguration-PT-302 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 ;