Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r107-tall-167814483800117.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is CloudReconfiguration-PT-315, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814483800117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.4K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.8K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 11:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 11:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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-315-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678332627882

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-315
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 03:30:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 03:30:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 03:30:29] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2023-03-09 03:30:29] [INFO ] Transformed 2585 places.
[2023-03-09 03:30:29] [INFO ] Transformed 3095 transitions.
[2023-03-09 03:30:29] [INFO ] Found NUPN structural information;
[2023-03-09 03:30:29] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-09 03:30:29] [INFO ] Computed 4 place invariants in 61 ms
Incomplete random walk after 10000 steps, including 80 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :4
FORMULA CloudReconfiguration-PT-315-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 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 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 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 27 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
[2023-03-09 03:30:29] [INFO ] Invariant cache hit.
[2023-03-09 03:30:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-09 03:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:30:31] [INFO ] [Real]Absence check using state equation in 1162 ms returned sat
[2023-03-09 03:30:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:30:32] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:30:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:30:33] [INFO ] [Nat]Absence check using state equation in 1225 ms returned sat
[2023-03-09 03:30:33] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 190 ms.
[2023-03-09 03:30:36] [INFO ] Added : 120 causal constraints over 24 iterations in 3259 ms. Result :unknown
[2023-03-09 03:30:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-09 03:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:30:38] [INFO ] [Real]Absence check using state equation in 1204 ms returned sat
[2023-03-09 03:30:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:30:39] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:30:40] [INFO ] [Nat]Absence check using state equation in 1094 ms returned sat
[2023-03-09 03:30:40] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 148 ms.
[2023-03-09 03:30:43] [INFO ] Added : 130 causal constraints over 26 iterations in 3440 ms. Result :unknown
[2023-03-09 03:30:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 03:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:30:45] [INFO ] [Real]Absence check using state equation in 1277 ms returned sat
[2023-03-09 03:30:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:30:45] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:30:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:30:47] [INFO ] [Nat]Absence check using state equation in 1175 ms returned sat
[2023-03-09 03:30:47] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 126 ms.
[2023-03-09 03:30:50] [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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 03:30:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:30:52] [INFO ] [Real]Absence check using state equation in 1147 ms returned sat
[2023-03-09 03:30:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:30:52] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-09 03:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:30:53] [INFO ] [Nat]Absence check using state equation in 1161 ms returned sat
[2023-03-09 03:30:53] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 136 ms.
[2023-03-09 03:30:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 03:30:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:30:58] [INFO ] [Real]Absence check using state equation in 1091 ms returned sat
[2023-03-09 03:30:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:30:59] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 03:30:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:00] [INFO ] [Nat]Absence check using state equation in 1105 ms returned sat
[2023-03-09 03:31:00] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 131 ms.
[2023-03-09 03:31:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 03:31:04] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2023-03-09 03:31:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:05] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2023-03-09 03:31:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:31:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:31:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:06] [INFO ] [Nat]Absence check using state equation in 1115 ms returned sat
[2023-03-09 03:31:07] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 129 ms.
[2023-03-09 03:31:10] [INFO ] Added : 130 causal constraints over 26 iterations in 3492 ms. Result :unknown
[2023-03-09 03:31:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2023-03-09 03:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:11] [INFO ] [Real]Absence check using state equation in 1148 ms returned sat
[2023-03-09 03:31:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:31:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:31:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:13] [INFO ] [Nat]Absence check using state equation in 1160 ms returned sat
[2023-03-09 03:31:13] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 131 ms.
[2023-03-09 03:31:17] [INFO ] Added : 135 causal constraints over 27 iterations in 3451 ms. Result :unknown
[2023-03-09 03:31:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2023-03-09 03:31:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:18] [INFO ] [Real]Absence check using state equation in 1117 ms returned sat
[2023-03-09 03:31:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:31:19] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:31:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:20] [INFO ] [Nat]Absence check using state equation in 1166 ms returned sat
[2023-03-09 03:31:20] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 125 ms.
[2023-03-09 03:31:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 03:31:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2023-03-09 03:31:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:25] [INFO ] [Real]Absence check using state equation in 1121 ms returned sat
[2023-03-09 03:31:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:31:25] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-09 03:31:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:26] [INFO ] [Nat]Absence check using state equation in 1106 ms returned sat
[2023-03-09 03:31:26] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 134 ms.
[2023-03-09 03:31:30] [INFO ] Added : 145 causal constraints over 29 iterations in 3529 ms. Result :unknown
[2023-03-09 03:31:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2023-03-09 03:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:31] [INFO ] [Real]Absence check using state equation in 1140 ms returned sat
[2023-03-09 03:31:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:31:32] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 03:31:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:33] [INFO ] [Nat]Absence check using state equation in 1154 ms returned sat
[2023-03-09 03:31:33] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 123 ms.
[2023-03-09 03:31:36] [INFO ] Added : 140 causal constraints over 28 iterations in 3451 ms. Result :unknown
[2023-03-09 03:31:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 03:31:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:38] [INFO ] [Real]Absence check using state equation in 1184 ms returned sat
[2023-03-09 03:31:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:31:38] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:31:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:40] [INFO ] [Nat]Absence check using state equation in 1207 ms returned sat
[2023-03-09 03:31:40] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 124 ms.
[2023-03-09 03:31:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 03:31:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 03:31:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:45] [INFO ] [Real]Absence check using state equation in 1133 ms returned sat
[2023-03-09 03:31:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:31:45] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2023-03-09 03:31:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:46] [INFO ] [Nat]Absence check using state equation in 1130 ms returned sat
[2023-03-09 03:31:47] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 126 ms.
[2023-03-09 03:31:50] [INFO ] Added : 140 causal constraints over 28 iterations in 3404 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]
Support contains 12 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 834 / 2585 are part of one of the 61 SCC in 13 ms
Free SCC test removed 773 places
Drop transitions removed 942 transitions
Reduce isomorphic transitions removed 942 transitions.
Graph (complete) has 2433 edges and 1812 vertex of which 1798 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 1205 transitions
Trivial Post-agglo rules discarded 1205 transitions
Performed 1205 trivial Post agglomeration. Transition count delta: 1205
Iterating post reduction 0 with 1214 rules applied. Total rules applied 1216 place count 1798 transition count 930
Reduce places removed 1205 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 1341 rules applied. Total rules applied 2557 place count 593 transition count 794
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 2627 place count 533 transition count 784
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 2633 place count 530 transition count 781
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 2637 place count 528 transition count 779
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 5 with 9 rules applied. Total rules applied 2646 place count 527 transition count 771
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2655 place count 519 transition count 770
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2655 place count 519 transition count 748
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2699 place count 497 transition count 748
Discarding 78 places :
Symmetric choice reduction at 7 with 78 rule applications. Total rules 2777 place count 419 transition count 670
Iterating global reduction 7 with 78 rules applied. Total rules applied 2855 place count 419 transition count 670
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2855 place count 419 transition count 661
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2873 place count 410 transition count 661
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 2933 place count 350 transition count 601
Iterating global reduction 7 with 60 rules applied. Total rules applied 2993 place count 350 transition count 601
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 7 with 36 rules applied. Total rules applied 3029 place count 350 transition count 565
Reduce places removed 18 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 28 rules applied. Total rules applied 3057 place count 332 transition count 555
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 3062 place count 327 transition count 555
Discarding 20 places :
Symmetric choice reduction at 10 with 20 rule applications. Total rules 3082 place count 307 transition count 524
Iterating global reduction 10 with 20 rules applied. Total rules applied 3102 place count 307 transition count 524
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3111 place count 307 transition count 515
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 3119 place count 299 transition count 499
Iterating global reduction 11 with 8 rules applied. Total rules applied 3127 place count 299 transition count 499
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3130 place count 296 transition count 493
Iterating global reduction 11 with 3 rules applied. Total rules applied 3133 place count 296 transition count 493
Performed 153 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 11 with 306 rules applied. Total rules applied 3439 place count 143 transition count 259
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 3444 place count 143 transition count 254
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 3452 place count 139 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3458 place count 139 transition count 244
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3464 place count 136 transition count 241
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3470 place count 136 transition count 235
Performed 38 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 14 with 76 rules applied. Total rules applied 3546 place count 98 transition count 256
Drop transitions removed 8 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 14 with 35 rules applied. Total rules applied 3581 place count 98 transition count 221
Discarding 21 places :
Symmetric choice reduction at 15 with 21 rule applications. Total rules 3602 place count 77 transition count 186
Iterating global reduction 15 with 21 rules applied. Total rules applied 3623 place count 77 transition count 186
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 15 with 11 rules applied. Total rules applied 3634 place count 77 transition count 175
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 3639 place count 72 transition count 165
Iterating global reduction 16 with 5 rules applied. Total rules applied 3644 place count 72 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 3649 place count 72 transition count 160
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 17 with 7 rules applied. Total rules applied 3656 place count 72 transition count 153
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 3659 place count 72 transition count 150
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 3664 place count 69 transition count 148
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 18 with 4 rules applied. Total rules applied 3668 place count 69 transition count 148
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 3669 place count 69 transition count 147
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 3671 place count 69 transition count 145
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 3673 place count 67 transition count 143
Iterating global reduction 19 with 2 rules applied. Total rules applied 3675 place count 67 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3676 place count 66 transition count 142
Applied a total of 3676 rules in 264 ms. Remains 66 /2585 variables (removed 2519) and now considering 142/3095 (removed 2953) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 66/2585 places, 142/3095 transitions.
Normalized transition count is 135 out of 142 initially.
// Phase 1: matrix 135 rows 66 cols
[2023-03-09 03:31:50] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 11450 resets, run finished after 1005 ms. (steps per millisecond=995 ) properties (out of 12) seen :10
FORMULA CloudReconfiguration-PT-315-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3656 resets, run finished after 322 ms. (steps per millisecond=3105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3668 resets, run finished after 324 ms. (steps per millisecond=3086 ) properties (out of 2) seen :0
[2023-03-09 03:31:52] [INFO ] Flow matrix only has 135 transitions (discarded 7 similar events)
// Phase 1: matrix 135 rows 66 cols
[2023-03-09 03:31:52] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 03:31:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 03:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-09 03:31:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:31:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 03:31:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-09 03:31:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 03:31:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-09 03:31:52] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
[2023-03-09 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-09 03:31:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 03:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:52] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 03:31:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:31:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 03:31:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:31:52] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-09 03:31:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-09 03:31:52] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2023-03-09 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
Current structural bounds on expressions (after SMT) : [0, 0] Max seen :[0, 0]
FORMULA CloudReconfiguration-PT-315-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 83285 ms.
ITS solved all properties within timeout

BK_STOP 1678332713554

--------------------
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-315"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is CloudReconfiguration-PT-315, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r107-tall-167814483800117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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