Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.5K Apr 29 14:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 14:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 14:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 14:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 660K May 10 09:33 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-305-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652648323361

Running Version 202205111006
[2022-05-15 20:58:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 20:58:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:58:46] [INFO ] Load time of PNML (sax parser for PT used): 401 ms
[2022-05-15 20:58:46] [INFO ] Transformed 2585 places.
[2022-05-15 20:58:46] [INFO ] Transformed 3095 transitions.
[2022-05-15 20:58:46] [INFO ] Found NUPN structural information;
[2022-05-15 20:58:46] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 605 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-15 20:58:46] [INFO ] Computed 4 place invariants in 96 ms
Incomplete random walk after 10000 steps, including 81 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :2
FORMULA CloudReconfiguration-PT-305-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :1
FORMULA CloudReconfiguration-PT-305-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 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 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 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 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-15 20:58:46] [INFO ] Computed 4 place invariants in 35 ms
[2022-05-15 20:58:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 80 ms returned sat
[2022-05-15 20:58:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:58:50] [INFO ] [Real]Absence check using state equation in 2279 ms returned sat
[2022-05-15 20:58:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:58:51] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 71 ms returned sat
[2022-05-15 20:58:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:58:53] [INFO ] [Nat]Absence check using state equation in 2264 ms returned sat
[2022-05-15 20:58:54] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 374 ms.
[2022-05-15 20:58:55] [INFO ] Added : 20 causal constraints over 4 iterations in 1628 ms. Result :unknown
[2022-05-15 20:58:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 20:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:58:58] [INFO ] [Real]Absence check using state equation in 2185 ms returned sat
[2022-05-15 20:58:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:58:59] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 20:58:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:59:02] [INFO ] [Nat]Absence check using state equation in 2281 ms returned sat
[2022-05-15 20:59:02] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 233 ms.
[2022-05-15 20:59:04] [INFO ] Added : 35 causal constraints over 7 iterations in 1875 ms. Result :unknown
[2022-05-15 20:59:04] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 73 ms returned sat
[2022-05-15 20:59:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:59:06] [INFO ] [Real]Absence check using state equation in 1730 ms returned sat
[2022-05-15 20:59:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:59:07] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-15 20:59:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:59:09] [INFO ] [Nat]Absence check using state equation in 1709 ms returned sat
[2022-05-15 20:59:09] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 210 ms.
[2022-05-15 20:59:11] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 20:59:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 73 ms returned sat
[2022-05-15 20:59:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:59:14] [INFO ] [Real]Absence check using state equation in 2194 ms returned sat
[2022-05-15 20:59:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:59:15] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-15 20:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:59:17] [INFO ] [Nat]Absence check using state equation in 1886 ms returned sat
[2022-05-15 20:59:17] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 294 ms.
[2022-05-15 20:59:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 20:59:20] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 20:59:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:59:23] [INFO ] [Real]Absence check using state equation in 2253 ms returned sat
[2022-05-15 20:59:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:59:23] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 20:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:59:25] [INFO ] [Nat]Absence check using state equation in 2208 ms returned sat
[2022-05-15 20:59:26] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 235 ms.
[2022-05-15 20:59:28] [INFO ] Added : 35 causal constraints over 7 iterations in 2149 ms. Result :unknown
[2022-05-15 20:59:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 108 ms returned sat
[2022-05-15 20:59:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:59:30] [INFO ] [Real]Absence check using state equation in 1850 ms returned sat
[2022-05-15 20:59:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:59:31] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 20:59:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:59:34] [INFO ] [Nat]Absence check using state equation in 2675 ms returned sat
[2022-05-15 20:59:34] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 210 ms.
[2022-05-15 20:59:36] [INFO ] Added : 40 causal constraints over 8 iterations in 1629 ms. Result :unknown
[2022-05-15 20:59:36] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 20:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:59:38] [INFO ] [Real]Absence check using state equation in 1821 ms returned sat
[2022-05-15 20:59:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:59:39] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 20:59:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:59:41] [INFO ] [Nat]Absence check using state equation in 1806 ms returned sat
[2022-05-15 20:59:41] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 198 ms.
[2022-05-15 20:59: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 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 20:59:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 20:59:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:59:46] [INFO ] [Real]Absence check using state equation in 2033 ms returned sat
[2022-05-15 20:59:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:59:47] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 20:59:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:59:50] [INFO ] [Nat]Absence check using state equation in 3038 ms returned sat
[2022-05-15 20:59:50] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 202 ms.
[2022-05-15 20:59:51] [INFO ] Added : 25 causal constraints over 5 iterations in 1229 ms. Result :unknown
[2022-05-15 20:59:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 20:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:59:54] [INFO ] [Real]Absence check using state equation in 2131 ms returned sat
[2022-05-15 20:59:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:59:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-15 20:59:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:59:57] [INFO ] [Nat]Absence check using state equation in 2065 ms returned sat
[2022-05-15 20:59:58] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 282 ms.
[2022-05-15 20:59:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 21:00:00] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 84 ms returned sat
[2022-05-15 21:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:00:02] [INFO ] [Real]Absence check using state equation in 2008 ms returned sat
[2022-05-15 21:00:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:00:03] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 21:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:00:05] [INFO ] [Nat]Absence check using state equation in 1974 ms returned sat
[2022-05-15 21:00:05] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 296 ms.
[2022-05-15 21:00:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 21:00:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 21:00:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:00:10] [INFO ] [Real]Absence check using state equation in 1926 ms returned sat
[2022-05-15 21:00:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:00:11] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 72 ms returned sat
[2022-05-15 21:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:00:13] [INFO ] [Nat]Absence check using state equation in 1987 ms returned sat
[2022-05-15 21:00:14] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 285 ms.
[2022-05-15 21:00:15] [INFO ] Added : 40 causal constraints over 8 iterations in 2111 ms. Result :unknown
[2022-05-15 21:00:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 21:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:00:18] [INFO ] [Real]Absence check using state equation in 2165 ms returned sat
[2022-05-15 21:00:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:00:19] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-15 21:00:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:00:21] [INFO ] [Nat]Absence check using state equation in 1971 ms returned sat
[2022-05-15 21:00:21] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 201 ms.
[2022-05-15 21:00:23] [INFO ] Added : 50 causal constraints over 10 iterations in 2279 ms. Result :unknown
[2022-05-15 21:00:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 21:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:00:26] [INFO ] [Real]Absence check using state equation in 1843 ms returned sat
[2022-05-15 21:00:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:00:27] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-15 21:00:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:00:28] [INFO ] [Nat]Absence check using state equation in 1855 ms returned sat
[2022-05-15 21:00:29] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 200 ms.
[2022-05-15 21:00:31] [INFO ] Added : 60 causal constraints over 12 iterations in 2508 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 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, 0]
Support contains 13 out of 2585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2929 edges and 2585 vertex of which 872 / 2585 are part of one of the 64 SCC in 16 ms
Free SCC test removed 808 places
Drop transitions removed 986 transitions
Reduce isomorphic transitions removed 986 transitions.
Graph (complete) has 2389 edges and 1777 vertex of which 1763 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.8 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 1178 transitions
Trivial Post-agglo rules discarded 1178 transitions
Performed 1178 trivial Post agglomeration. Transition count delta: 1178
Iterating post reduction 0 with 1187 rules applied. Total rules applied 1189 place count 1763 transition count 913
Reduce places removed 1178 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 1 with 1316 rules applied. Total rules applied 2505 place count 585 transition count 775
Reduce places removed 62 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 71 rules applied. Total rules applied 2576 place count 523 transition count 766
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 2585 place count 520 transition count 760
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 2593 place count 516 transition count 756
Reduce places removed 2 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 5 with 9 rules applied. Total rules applied 2602 place count 514 transition count 749
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2609 place count 507 transition count 749
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2609 place count 507 transition count 727
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2653 place count 485 transition count 727
Discarding 77 places :
Symmetric choice reduction at 7 with 77 rule applications. Total rules 2730 place count 408 transition count 650
Iterating global reduction 7 with 77 rules applied. Total rules applied 2807 place count 408 transition count 650
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2807 place count 408 transition count 641
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 2825 place count 399 transition count 641
Discarding 59 places :
Symmetric choice reduction at 7 with 59 rule applications. Total rules 2884 place count 340 transition count 582
Iterating global reduction 7 with 59 rules applied. Total rules applied 2943 place count 340 transition count 582
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 7 with 33 rules applied. Total rules applied 2976 place count 340 transition count 549
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 8 with 28 rules applied. Total rules applied 3004 place count 324 transition count 537
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 7 rules applied. Total rules applied 3011 place count 318 transition count 536
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3012 place count 317 transition count 536
Discarding 18 places :
Symmetric choice reduction at 11 with 18 rule applications. Total rules 3030 place count 299 transition count 509
Iterating global reduction 11 with 18 rules applied. Total rules applied 3048 place count 299 transition count 509
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 3055 place count 299 transition count 502
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 3062 place count 292 transition count 488
Iterating global reduction 12 with 7 rules applied. Total rules applied 3069 place count 292 transition count 488
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 3072 place count 289 transition count 482
Iterating global reduction 12 with 3 rules applied. Total rules applied 3075 place count 289 transition count 482
Performed 149 Post agglomeration using F-continuation condition with reduction of 76 identical transitions.
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 12 with 298 rules applied. Total rules applied 3373 place count 140 transition count 257
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 3377 place count 140 transition count 253
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 3383 place count 137 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3389 place count 137 transition count 244
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 3393 place count 135 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 3397 place count 135 transition count 238
Performed 35 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 15 with 70 rules applied. Total rules applied 3467 place count 100 transition count 276
Drop transitions removed 20 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 15 with 47 rules applied. Total rules applied 3514 place count 100 transition count 229
Discarding 21 places :
Symmetric choice reduction at 16 with 21 rule applications. Total rules 3535 place count 79 transition count 201
Iterating global reduction 16 with 21 rules applied. Total rules applied 3556 place count 79 transition count 201
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 3566 place count 79 transition count 191
Discarding 6 places :
Symmetric choice reduction at 17 with 6 rule applications. Total rules 3572 place count 73 transition count 179
Iterating global reduction 17 with 6 rules applied. Total rules applied 3578 place count 73 transition count 179
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 3583 place count 73 transition count 174
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 18 with 26 rules applied. Total rules applied 3609 place count 73 transition count 148
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3610 place count 72 transition count 145
Iterating global reduction 18 with 1 rules applied. Total rules applied 3611 place count 72 transition count 145
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3612 place count 71 transition count 144
Iterating global reduction 18 with 1 rules applied. Total rules applied 3613 place count 71 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 3614 place count 71 transition count 143
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3615 place count 71 transition count 142
Free-agglomeration rule applied 5 times.
Iterating global reduction 19 with 5 rules applied. Total rules applied 3620 place count 71 transition count 137
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 19 with 5 rules applied. Total rules applied 3625 place count 66 transition count 137
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 3628 place count 66 transition count 134
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 20 with 4 rules applied. Total rules applied 3632 place count 66 transition count 134
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 3634 place count 66 transition count 132
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 3635 place count 65 transition count 131
Iterating global reduction 20 with 1 rules applied. Total rules applied 3636 place count 65 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 3637 place count 64 transition count 130
Applied a total of 3637 rules in 448 ms. Remains 64 /2585 variables (removed 2521) and now considering 130/3095 (removed 2965) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/2585 places, 130/3095 transitions.
Normalized transition count is 125 out of 130 initially.
// Phase 1: matrix 125 rows 64 cols
[2022-05-15 21:00:32] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 13573 resets, run finished after 1211 ms. (steps per millisecond=825 ) properties (out of 13) seen :12
FORMULA CloudReconfiguration-PT-305-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 3859 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 1) seen :0
[2022-05-15 21:00:33] [INFO ] Flow matrix only has 125 transitions (discarded 5 similar events)
// Phase 1: matrix 125 rows 64 cols
[2022-05-15 21:00:33] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 21:00:33] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-15 21:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:00:33] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-15 21:00:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:00:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-15 21:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:00:34] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-15 21:00:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 21:00:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2022-05-15 21:00:34] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 6 ms to minimize.
[2022-05-15 21:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
Current structural bounds on expressions (after SMT) : [0] Max seen :[0]
FORMULA CloudReconfiguration-PT-305-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 108741 ms.

BK_STOP 1652648434244

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-305, 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 r042-smll-165252095400245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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