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-167814477800069.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-309, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814477800069
=====================================================================

--------------------
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 1678230070256

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-309
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-07 23:01:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-07 23:01:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 23:01:11] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-07 23:01:11] [INFO ] Transformed 2585 places.
[2023-03-07 23:01:11] [INFO ] Transformed 3095 transitions.
[2023-03-07 23:01:11] [INFO ] Found NUPN structural information;
[2023-03-07 23:01:11] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
FORMULA CloudReconfiguration-PT-309-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-07 23:01:12] [INFO ] Computed 4 place invariants in 55 ms
Incomplete random walk after 10000 steps, including 69 resets, run finished after 56 ms. (steps per millisecond=178 ) 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 18 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 :0
Incomplete Best-First random walk after 10000 steps, including 21 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 19 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 22 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :1
FORMULA CloudReconfiguration-PT-309-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=1250 ) 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 :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
[2023-03-07 23:01:12] [INFO ] Invariant cache hit.
[2023-03-07 23:01:13] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 54 ms returned sat
[2023-03-07 23:01:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:01:14] [INFO ] [Real]Absence check using state equation in 1490 ms returned sat
[2023-03-07 23:01:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:01:15] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 23:01:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:01:16] [INFO ] [Nat]Absence check using state equation in 1210 ms returned sat
[2023-03-07 23:01:16] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 153 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-07 23:01:19] [INFO ] Added : 120 causal constraints over 24 iterations in 3354 ms. Result :unknown
[2023-03-07 23:01:20] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 23:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:01:21] [INFO ] [Real]Absence check using state equation in 1242 ms returned sat
[2023-03-07 23:01:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:01:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 23:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:01:22] [INFO ] [Nat]Absence check using state equation in 1172 ms returned sat
[2023-03-07 23:01:23] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 152 ms.
[2023-03-07 23:01:26] [INFO ] Added : 135 causal constraints over 27 iterations in 3436 ms. Result :unknown
[2023-03-07 23:01:26] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 23:01:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:01:28] [INFO ] [Real]Absence check using state equation in 1202 ms returned sat
[2023-03-07 23:01:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:01:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 23:01:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:01:30] [INFO ] [Nat]Absence check using state equation in 1698 ms returned sat
[2023-03-07 23:01:30] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 150 ms.
[2023-03-07 23:01:33] [INFO ] Added : 110 causal constraints over 22 iterations in 2841 ms. Result :unknown
[2023-03-07 23:01:33] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 23:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:01:34] [INFO ] [Real]Absence check using state equation in 1129 ms returned sat
[2023-03-07 23:01:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:01:35] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-07 23:01:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:01:36] [INFO ] [Nat]Absence check using state equation in 1131 ms returned sat
[2023-03-07 23:01:36] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 140 ms.
[2023-03-07 23:01:39] [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-07 23:01:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2023-03-07 23:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:01:41] [INFO ] [Real]Absence check using state equation in 1216 ms returned sat
[2023-03-07 23:01:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:01:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 23:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:01:43] [INFO ] [Nat]Absence check using state equation in 1184 ms returned sat
[2023-03-07 23:01:43] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 135 ms.
[2023-03-07 23:01:46] [INFO ] Added : 130 causal constraints over 26 iterations in 3400 ms. Result :unknown
[2023-03-07 23:01:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-07 23:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:01:48] [INFO ] [Real]Absence check using state equation in 1124 ms returned sat
[2023-03-07 23:01:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:01:48] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-07 23:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:01:49] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2023-03-07 23:01:50] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 149 ms.
[2023-03-07 23:01:53] [INFO ] Added : 130 causal constraints over 26 iterations in 3388 ms. Result :unknown
[2023-03-07 23:01:53] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 23:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:01:54] [INFO ] [Real]Absence check using state equation in 1168 ms returned sat
[2023-03-07 23:01:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:01:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 23:01:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:01:56] [INFO ] [Nat]Absence check using state equation in 1047 ms returned sat
[2023-03-07 23:01:56] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 138 ms.
[2023-03-07 23:02:00] [INFO ] Added : 140 causal constraints over 28 iterations in 3542 ms. Result :unknown
[2023-03-07 23:02:00] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 23:02:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:02:01] [INFO ] [Real]Absence check using state equation in 1162 ms returned sat
[2023-03-07 23:02:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:02:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 23:02:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:02:03] [INFO ] [Nat]Absence check using state equation in 1232 ms returned sat
[2023-03-07 23:02:03] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 148 ms.
[2023-03-07 23:02:06] [INFO ] Added : 130 causal constraints over 26 iterations in 3340 ms. Result :unknown
[2023-03-07 23:02:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 23:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:02:08] [INFO ] [Real]Absence check using state equation in 1105 ms returned sat
[2023-03-07 23:02:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:02:08] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 23:02:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:02:09] [INFO ] [Nat]Absence check using state equation in 1135 ms returned sat
[2023-03-07 23:02:10] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 132 ms.
[2023-03-07 23:02:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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 23:02:13] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2023-03-07 23:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:02:14] [INFO ] [Real]Absence check using state equation in 994 ms returned sat
[2023-03-07 23:02:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:02:15] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 63 ms returned sat
[2023-03-07 23:02:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:02:16] [INFO ] [Nat]Absence check using state equation in 1056 ms returned sat
[2023-03-07 23:02:16] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 166 ms.
[2023-03-07 23:02:19] [INFO ] Added : 127 causal constraints over 26 iterations in 3530 ms. Result :unknown
[2023-03-07 23:02:20] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 23:02:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:02:21] [INFO ] [Real]Absence check using state equation in 1044 ms returned sat
[2023-03-07 23:02:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:02:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-07 23:02:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:02:22] [INFO ] [Nat]Absence check using state equation in 1033 ms returned sat
[2023-03-07 23:02:23] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 127 ms.
[2023-03-07 23:02:26] [INFO ] Added : 125 causal constraints over 25 iterations in 3518 ms. Result :unknown
[2023-03-07 23:02:26] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-07 23:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:02:27] [INFO ] [Real]Absence check using state equation in 1043 ms returned sat
[2023-03-07 23:02:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:02:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 23:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:02:29] [INFO ] [Nat]Absence check using state equation in 1077 ms returned sat
[2023-03-07 23:02:29] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 131 ms.
[2023-03-07 23:02:33] [INFO ] Added : 145 causal constraints over 29 iterations in 3515 ms. Result :unknown
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-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
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 2931 edges and 2585 vertex of which 843 / 2585 are part of one of the 63 SCC in 11 ms
Free SCC test removed 780 places
Drop transitions removed 952 transitions
Reduce isomorphic transitions removed 952 transitions.
Graph (complete) has 2423 edges and 1805 vertex of which 1791 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 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1207 rules applied. Total rules applied 1209 place count 1791 transition count 927
Reduce places removed 1198 places and 0 transitions.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 1 with 1333 rules applied. Total rules applied 2542 place count 593 transition count 792
Reduce places removed 61 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 70 rules applied. Total rules applied 2612 place count 532 transition count 783
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 9 rules applied. Total rules applied 2621 place count 529 transition count 777
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 7 rules applied. Total rules applied 2628 place count 525 transition count 774
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 5 with 11 rules applied. Total rules applied 2639 place count 524 transition count 764
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2651 place count 514 transition count 762
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 23 Pre rules applied. Total rules applied 2651 place count 514 transition count 739
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 2697 place count 491 transition count 739
Discarding 78 places :
Symmetric choice reduction at 7 with 78 rule applications. Total rules 2775 place count 413 transition count 661
Iterating global reduction 7 with 78 rules applied. Total rules applied 2853 place count 413 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 2853 place count 413 transition count 652
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2871 place count 404 transition count 652
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 2931 place count 344 transition count 592
Iterating global reduction 7 with 60 rules applied. Total rules applied 2991 place count 344 transition count 592
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 7 with 35 rules applied. Total rules applied 3026 place count 344 transition count 557
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 27 rules applied. Total rules applied 3053 place count 327 transition count 547
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 6 rules applied. Total rules applied 3059 place count 322 transition count 546
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3061 place count 321 transition count 545
Discarding 21 places :
Symmetric choice reduction at 11 with 21 rule applications. Total rules 3082 place count 300 transition count 512
Iterating global reduction 11 with 21 rules applied. Total rules applied 3103 place count 300 transition count 512
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 3112 place count 300 transition count 503
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 3121 place count 291 transition count 485
Iterating global reduction 12 with 9 rules applied. Total rules applied 3130 place count 291 transition count 485
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 3133 place count 288 transition count 479
Iterating global reduction 12 with 3 rules applied. Total rules applied 3136 place count 288 transition count 479
Performed 150 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 12 with 300 rules applied. Total rules applied 3436 place count 138 transition count 251
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 3438 place count 138 transition count 249
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 3444 place count 135 transition count 246
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3450 place count 135 transition count 240
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 14 with 6 rules applied. Total rules applied 3456 place count 132 transition count 237
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3462 place count 132 transition count 231
Performed 36 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 15 with 72 rules applied. Total rules applied 3534 place count 96 transition count 272
Drop transitions removed 10 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 15 with 38 rules applied. Total rules applied 3572 place count 96 transition count 234
Discarding 20 places :
Symmetric choice reduction at 16 with 20 rule applications. Total rules 3592 place count 76 transition count 201
Iterating global reduction 16 with 20 rules applied. Total rules applied 3612 place count 76 transition count 201
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 16 with 11 rules applied. Total rules applied 3623 place count 76 transition count 190
Discarding 4 places :
Symmetric choice reduction at 17 with 4 rule applications. Total rules 3627 place count 72 transition count 182
Iterating global reduction 17 with 4 rules applied. Total rules applied 3631 place count 72 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 3635 place count 72 transition count 178
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 18 with 19 rules applied. Total rules applied 3654 place count 72 transition count 159
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 18 with 2 rules applied. Total rules applied 3656 place count 71 transition count 158
Free-agglomeration rule applied 5 times.
Iterating global reduction 18 with 5 rules applied. Total rules applied 3661 place count 71 transition count 153
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 3668 place count 66 transition count 151
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3669 place count 66 transition count 150
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3670 place count 66 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3671 place count 65 transition count 149
Applied a total of 3671 rules in 454 ms. Remains 65 /2585 variables (removed 2520) and now considering 149/3095 (removed 2946) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 455 ms. Remains : 65/2585 places, 149/3095 transitions.
Normalized transition count is 141 out of 149 initially.
// Phase 1: matrix 141 rows 65 cols
[2023-03-07 23:02:33] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 13356 resets, run finished after 1089 ms. (steps per millisecond=918 ) properties (out of 11) seen :11
FORMULA CloudReconfiguration-PT-309-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-11 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-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 83090 ms.
ITS solved all properties within timeout

BK_STOP 1678230155866

--------------------
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="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-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 r103-tall-167814477800069"
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 ;