fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r045-oct2-162038292200611
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for CloudReconfiguration-PT-318

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
961.403 90578.00 124262.00 206.80 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r045-oct2-162038292200611.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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-318, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038292200611
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 150K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 661K May 5 16:51 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-318-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620590186641

Running Version 0
[2021-05-09 19:56:29] [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]
[2021-05-09 19:56:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 19:56:30] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2021-05-09 19:56:30] [INFO ] Transformed 2587 places.
[2021-05-09 19:56:30] [INFO ] Transformed 3099 transitions.
[2021-05-09 19:56:30] [INFO ] Found NUPN structural information;
[2021-05-09 19:56:30] [INFO ] Parsed PT model containing 2587 places and 3099 transitions in 210 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
// Phase 1: matrix 3099 rows 2587 cols
[2021-05-09 19:56:30] [INFO ] Computed 4 place invariants in 107 ms
Incomplete random walk after 10000 steps, including 80 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :4
FORMULA CloudReconfiguration-PT-318-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) 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 26 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 27 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 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 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 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 10000 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
// Phase 1: matrix 3099 rows 2587 cols
[2021-05-09 19:56:30] [INFO ] Computed 4 place invariants in 31 ms
[2021-05-09 19:56:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2021-05-09 19:56:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:56:33] [INFO ] [Real]Absence check using state equation in 1081 ms returned sat
[2021-05-09 19:56:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:56:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2021-05-09 19:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:56:35] [INFO ] [Nat]Absence check using state equation in 998 ms returned sat
[2021-05-09 19:56:35] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 138 ms.
[2021-05-09 19:56:38] [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 0
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 19:56:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 35 ms returned sat
[2021-05-09 19:56:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:56:40] [INFO ] [Real]Absence check using state equation in 1102 ms returned sat
[2021-05-09 19:56:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:56:40] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2021-05-09 19:56:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:56:42] [INFO ] [Nat]Absence check using state equation in 1440 ms returned sat
[2021-05-09 19:56:42] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 152 ms.
[2021-05-09 19:56:45] [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 1
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 19:56:45] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 35 ms returned sat
[2021-05-09 19:56:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:56:46] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2021-05-09 19:56:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:56:47] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 36 ms returned sat
[2021-05-09 19:56:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:56:48] [INFO ] [Nat]Absence check using state equation in 1142 ms returned sat
[2021-05-09 19:56:48] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 190 ms.
[2021-05-09 19:56:51] [INFO ] Added : 110 causal constraints over 22 iterations in 3377 ms. Result :unknown
[2021-05-09 19:56:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2021-05-09 19:56:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:56:53] [INFO ] [Real]Absence check using state equation in 1414 ms returned sat
[2021-05-09 19:56:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:56:54] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 36 ms returned sat
[2021-05-09 19:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:56:55] [INFO ] [Nat]Absence check using state equation in 1102 ms returned sat
[2021-05-09 19:56:55] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 164 ms.
[2021-05-09 19:56: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 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 19:56:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2021-05-09 19:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:01] [INFO ] [Real]Absence check using state equation in 1224 ms returned sat
[2021-05-09 19:57:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:57:01] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 54 ms returned sat
[2021-05-09 19:57:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:03] [INFO ] [Nat]Absence check using state equation in 2008 ms returned sat
[2021-05-09 19:57:04] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 366 ms.
[2021-05-09 19:57:06] [INFO ] Added : 55 causal constraints over 11 iterations in 2389 ms. Result :unknown
[2021-05-09 19:57:06] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2021-05-09 19:57:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:08] [INFO ] [Real]Absence check using state equation in 1905 ms returned sat
[2021-05-09 19:57:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:57:09] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 53 ms returned sat
[2021-05-09 19:57:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:10] [INFO ] [Nat]Absence check using state equation in 1158 ms returned sat
[2021-05-09 19:57:10] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 110 ms.
[2021-05-09 19:57:14] [INFO ] Added : 105 causal constraints over 21 iterations in 3224 ms. Result :unknown
[2021-05-09 19:57:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 35 ms returned sat
[2021-05-09 19:57:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:15] [INFO ] [Real]Absence check using state equation in 1046 ms returned sat
[2021-05-09 19:57:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:57:16] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2021-05-09 19:57:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:18] [INFO ] [Nat]Absence check using state equation in 2032 ms returned sat
[2021-05-09 19:57:18] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 327 ms.
[2021-05-09 19:57:20] [INFO ] Added : 65 causal constraints over 13 iterations in 2225 ms. Result :unknown
[2021-05-09 19:57:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2021-05-09 19:57:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:23] [INFO ] [Real]Absence check using state equation in 1889 ms returned sat
[2021-05-09 19:57:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:57:23] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 51 ms returned sat
[2021-05-09 19:57:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:25] [INFO ] [Nat]Absence check using state equation in 1424 ms returned sat
[2021-05-09 19:57:25] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 119 ms.
[2021-05-09 19:57:28] [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 7
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 19:57:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 35 ms returned sat
[2021-05-09 19:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:30] [INFO ] [Real]Absence check using state equation in 1281 ms returned sat
[2021-05-09 19:57:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:57:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2021-05-09 19:57:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:32] [INFO ] [Nat]Absence check using state equation in 1574 ms returned sat
[2021-05-09 19:57:32] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 258 ms.
[2021-05-09 19:57:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 19:57:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 35 ms returned sat
[2021-05-09 19:57:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:36] [INFO ] [Real]Absence check using state equation in 987 ms returned sat
[2021-05-09 19:57:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:57:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 62 ms returned sat
[2021-05-09 19:57:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:38] [INFO ] [Nat]Absence check using state equation in 954 ms returned sat
[2021-05-09 19:57:38] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 102 ms.
[2021-05-09 19:57:41] [INFO ] Added : 140 causal constraints over 28 iterations in 3306 ms. Result :unknown
[2021-05-09 19:57:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 34 ms returned sat
[2021-05-09 19:57:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:43] [INFO ] [Real]Absence check using state equation in 991 ms returned sat
[2021-05-09 19:57:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:57:43] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 36 ms returned sat
[2021-05-09 19:57:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:44] [INFO ] [Nat]Absence check using state equation in 1070 ms returned sat
[2021-05-09 19:57:44] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 136 ms.
[2021-05-09 19:57:48] [INFO ] Added : 135 causal constraints over 27 iterations in 3484 ms. Result :unknown
[2021-05-09 19:57:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 60 ms returned sat
[2021-05-09 19:57:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:50] [INFO ] [Real]Absence check using state equation in 1879 ms returned sat
[2021-05-09 19:57:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:57:51] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2021-05-09 19:57:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:57:52] [INFO ] [Nat]Absence check using state equation in 1332 ms returned sat
[2021-05-09 19:57:52] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 256 ms.
[2021-05-09 19:57:55] [INFO ] Added : 95 causal constraints over 19 iterations in 3288 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 2587 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2587/2587 places, 3099/3099 transitions.
Graph (trivial) has 2921 edges and 2587 vertex of which 833 / 2587 are part of one of the 62 SCC in 59 ms
Free SCC test removed 771 places
Drop transitions removed 942 transitions
Reduce isomorphic transitions removed 942 transitions.
Graph (complete) has 2443 edges and 1816 vertex of which 1802 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 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 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1205 rules applied. Total rules applied 1207 place count 1802 transition count 943
Reduce places removed 1196 places and 0 transitions.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 1 with 1331 rules applied. Total rules applied 2538 place count 606 transition count 808
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 70 rules applied. Total rules applied 2608 place count 545 transition count 799
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 12 rules applied. Total rules applied 2620 place count 542 transition count 790
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 12 rules applied. Total rules applied 2632 place count 536 transition count 784
Reduce places removed 3 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 5 with 16 rules applied. Total rules applied 2648 place count 533 transition count 771
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 17 rules applied. Total rules applied 2665 place count 520 transition count 767
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2667 place count 518 transition count 767
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 24 Pre rules applied. Total rules applied 2667 place count 518 transition count 743
Deduced a syphon composed of 24 places in 15 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 8 with 48 rules applied. Total rules applied 2715 place count 494 transition count 743
Discarding 82 places :
Symmetric choice reduction at 8 with 82 rule applications. Total rules 2797 place count 412 transition count 661
Iterating global reduction 8 with 82 rules applied. Total rules applied 2879 place count 412 transition count 661
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 2879 place count 412 transition count 652
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 2897 place count 403 transition count 652
Discarding 60 places :
Symmetric choice reduction at 8 with 60 rule applications. Total rules 2957 place count 343 transition count 592
Iterating global reduction 8 with 60 rules applied. Total rules applied 3017 place count 343 transition count 592
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 34 rules applied. Total rules applied 3051 place count 343 transition count 558
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 9 with 25 rules applied. Total rules applied 3076 place count 326 transition count 550
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 3080 place count 322 transition count 550
Discarding 21 places :
Symmetric choice reduction at 11 with 21 rule applications. Total rules 3101 place count 301 transition count 517
Iterating global reduction 11 with 21 rules applied. Total rules applied 3122 place count 301 transition count 517
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 3131 place count 301 transition count 508
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 3140 place count 292 transition count 490
Iterating global reduction 12 with 9 rules applied. Total rules applied 3149 place count 292 transition count 490
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 3152 place count 289 transition count 484
Iterating global reduction 12 with 3 rules applied. Total rules applied 3155 place count 289 transition count 484
Performed 153 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 12 with 306 rules applied. Total rules applied 3461 place count 136 transition count 252
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 3465 place count 136 transition count 248
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3471 place count 133 transition count 245
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3477 place count 133 transition count 239
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 3483 place count 130 transition count 236
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3489 place count 130 transition count 230
Performed 31 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 15 with 62 rules applied. Total rules applied 3551 place count 99 transition count 286
Drop transitions removed 26 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 15 with 48 rules applied. Total rules applied 3599 place count 99 transition count 238
Discarding 20 places :
Symmetric choice reduction at 16 with 20 rule applications. Total rules 3619 place count 79 transition count 218
Iterating global reduction 16 with 20 rules applied. Total rules applied 3639 place count 79 transition count 218
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 16 with 13 rules applied. Total rules applied 3652 place count 79 transition count 205
Discarding 4 places :
Symmetric choice reduction at 17 with 4 rule applications. Total rules 3656 place count 75 transition count 197
Iterating global reduction 17 with 4 rules applied. Total rules applied 3660 place count 75 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 3664 place count 75 transition count 193
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 18 with 32 rules applied. Total rules applied 3696 place count 75 transition count 161
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 3698 place count 73 transition count 159
Iterating global reduction 18 with 2 rules applied. Total rules applied 3700 place count 73 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 3701 place count 73 transition count 158
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3702 place count 73 transition count 157
Free-agglomeration rule applied 3 times.
Iterating global reduction 19 with 3 rules applied. Total rules applied 3705 place count 73 transition count 154
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 3708 place count 70 transition count 154
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3709 place count 70 transition count 153
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 3710 place count 69 transition count 152
Iterating global reduction 20 with 1 rules applied. Total rules applied 3711 place count 69 transition count 152
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 20 with 4 rules applied. Total rules applied 3715 place count 69 transition count 152
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 3716 place count 69 transition count 151
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 3717 place count 69 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 3718 place count 68 transition count 149
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 60 edges and 67 vertex of which 28 / 67 are part of one of the 9 SCC in 1 ms
Free SCC test removed 19 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 21 with 5 rules applied. Total rules applied 3723 place count 48 transition count 146
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 33 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 22 with 57 rules applied. Total rules applied 3780 place count 45 transition count 92
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 2 Pre rules applied. Total rules applied 3780 place count 45 transition count 90
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 23 with 4 rules applied. Total rules applied 3784 place count 43 transition count 90
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 23 with 10 rules applied. Total rules applied 3794 place count 38 transition count 85
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 23 with 13 rules applied. Total rules applied 3807 place count 38 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 24 with 4 rules applied. Total rules applied 3811 place count 36 transition count 78
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 24 with 15 rules applied. Total rules applied 3826 place count 36 transition count 63
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 25 with 6 rules applied. Total rules applied 3832 place count 36 transition count 57
Free-agglomeration rule applied 6 times.
Iterating global reduction 25 with 6 rules applied. Total rules applied 3838 place count 36 transition count 51
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 25 with 6 rules applied. Total rules applied 3844 place count 30 transition count 51
Applied a total of 3844 rules in 351 ms. Remains 30 /2587 variables (removed 2557) and now considering 51/3099 (removed 3048) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/2587 places, 51/3099 transitions.
Normalized transition count is 49 out of 51 initially.
// Phase 1: matrix 49 rows 30 cols
[2021-05-09 19:57:56] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 27319 resets, run finished after 778 ms. (steps per millisecond=1285 ) properties (out of 12) seen :12
FORMULA CloudReconfiguration-PT-318-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620590277219

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-318"
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-318, 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 r045-oct2-162038292200611"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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