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-165252095600325.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-315, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095600325
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 7.0K Apr 29 14:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 14:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 14:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 14:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:20 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-315-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652678927626

Running Version 202205111006
[2022-05-16 05:28:50] [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-16 05:28:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 05:28:50] [INFO ] Load time of PNML (sax parser for PT used): 339 ms
[2022-05-16 05:28:50] [INFO ] Transformed 2585 places.
[2022-05-16 05:28:50] [INFO ] Transformed 3095 transitions.
[2022-05-16 05:28:50] [INFO ] Found NUPN structural information;
[2022-05-16 05:28:50] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 576 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 112 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-16 05:28:51] [INFO ] Computed 4 place invariants in 75 ms
Incomplete random walk after 10000 steps, including 83 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :4
FORMULA CloudReconfiguration-PT-315-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 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 23 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :1
FORMULA CloudReconfiguration-PT-315-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :1
FORMULA CloudReconfiguration-PT-315-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-16 05:28:51] [INFO ] Computed 4 place invariants in 25 ms
[2022-05-16 05:28:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 74 ms returned sat
[2022-05-16 05:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 05:28:54] [INFO ] [Real]Absence check using state equation in 2007 ms returned sat
[2022-05-16 05:28:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 05:28:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-16 05:28:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 05:28:57] [INFO ] [Nat]Absence check using state equation in 1711 ms returned sat
[2022-05-16 05:28:58] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 419 ms.
[2022-05-16 05:29:00] [INFO ] Added : 25 causal constraints over 5 iterations in 2404 ms. Result :unknown
[2022-05-16 05:29:00] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 99 ms returned sat
[2022-05-16 05:29:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 05:29:03] [INFO ] [Real]Absence check using state equation in 2231 ms returned sat
[2022-05-16 05:29:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 05:29:04] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 105 ms returned sat
[2022-05-16 05:29:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 05:29:06] [INFO ] [Nat]Absence check using state equation in 2740 ms returned sat
[2022-05-16 05:29:07] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 329 ms.
[2022-05-16 05:29:08] [INFO ] Added : 20 causal constraints over 4 iterations in 1325 ms. Result :unknown
[2022-05-16 05:29:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 05:29:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 05:29:11] [INFO ] [Real]Absence check using state equation in 2039 ms returned sat
[2022-05-16 05:29:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 05:29:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 05:29:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 05:29:14] [INFO ] [Nat]Absence check using state equation in 2195 ms returned sat
[2022-05-16 05:29:14] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 216 ms.
[2022-05-16 05:29:16] [INFO ] Added : 35 causal constraints over 7 iterations in 1893 ms. Result :unknown
[2022-05-16 05:29:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 99 ms returned sat
[2022-05-16 05:29:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 05:29:19] [INFO ] [Real]Absence check using state equation in 1955 ms returned sat
[2022-05-16 05:29:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 05:29:20] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 74 ms returned sat
[2022-05-16 05:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 05:29:22] [INFO ] [Nat]Absence check using state equation in 2157 ms returned sat
[2022-05-16 05:29:22] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 225 ms.
[2022-05-16 05:29:24] [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: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-16 05:29:25] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 05:29:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 05:29:27] [INFO ] [Real]Absence check using state equation in 1934 ms returned sat
[2022-05-16 05:29:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 05:29:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 101 ms returned sat
[2022-05-16 05:29:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 05:29:30] [INFO ] [Nat]Absence check using state equation in 1834 ms returned sat
[2022-05-16 05:29:30] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 235 ms.
[2022-05-16 05:29:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-16 05:29:33] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 05:29:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 05:29:35] [INFO ] [Real]Absence check using state equation in 1977 ms returned sat
[2022-05-16 05:29:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 05:29:36] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 78 ms returned sat
[2022-05-16 05:29:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 05:29:38] [INFO ] [Nat]Absence check using state equation in 2031 ms returned sat
[2022-05-16 05:29:38] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 213 ms.
[2022-05-16 05:29:40] [INFO ] Added : 35 causal constraints over 7 iterations in 2191 ms. Result :unknown
[2022-05-16 05:29:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 05:29:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 05:29:43] [INFO ] [Real]Absence check using state equation in 2069 ms returned sat
[2022-05-16 05:29:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 05:29:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 05:29:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 05:29:48] [INFO ] [Nat]Absence check using state equation in 3519 ms returned sat
[2022-05-16 05:29:48] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 250 ms.
[2022-05-16 05:29:48] [INFO ] Added : 5 causal constraints over 1 iterations in 655 ms. Result :unknown
[2022-05-16 05:29:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 100 ms returned sat
[2022-05-16 05:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 05:29:51] [INFO ] [Real]Absence check using state equation in 2062 ms returned sat
[2022-05-16 05:29:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 05:29:52] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2022-05-16 05:29:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 05:29:54] [INFO ] [Nat]Absence check using state equation in 2087 ms returned sat
[2022-05-16 05:29:55] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 210 ms.
[2022-05-16 05:29:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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: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-16 05:29:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 107 ms returned sat
[2022-05-16 05:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 05:30:00] [INFO ] [Real]Absence check using state equation in 2082 ms returned sat
[2022-05-16 05:30:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 05:30:01] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 05:30:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 05:30:02] [INFO ] [Nat]Absence check using state equation in 1670 ms returned sat
[2022-05-16 05:30:03] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 275 ms.
[2022-05-16 05:30:05] [INFO ] Added : 35 causal constraints over 7 iterations in 2561 ms. Result :unknown
[2022-05-16 05:30:06] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-16 05:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 05:30:08] [INFO ] [Real]Absence check using state equation in 1932 ms returned sat
[2022-05-16 05:30:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 05:30:08] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 05:30:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 05:30:10] [INFO ] [Nat]Absence check using state equation in 1945 ms returned sat
[2022-05-16 05:30:11] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 172 ms.
[2022-05-16 05:30:13] [INFO ] Added : 45 causal constraints over 9 iterations in 2213 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudReconfiguration-PT-315-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 9 out of 2585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2936 edges and 2585 vertex of which 842 / 2585 are part of one of the 61 SCC in 21 ms
Free SCC test removed 781 places
Drop transitions removed 950 transitions
Reduce isomorphic transitions removed 950 transitions.
Graph (complete) has 2425 edges and 1804 vertex of which 1790 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.16 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 1201 transitions
Trivial Post-agglo rules discarded 1201 transitions
Performed 1201 trivial Post agglomeration. Transition count delta: 1201
Iterating post reduction 0 with 1210 rules applied. Total rules applied 1212 place count 1790 transition count 926
Reduce places removed 1201 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 1 with 1345 rules applied. Total rules applied 2557 place count 589 transition count 782
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 76 rules applied. Total rules applied 2633 place count 525 transition count 770
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 9 rules applied. Total rules applied 2642 place count 521 transition count 765
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 2647 place count 518 transition count 763
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 5 with 10 rules applied. Total rules applied 2657 place count 517 transition count 754
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 12 rules applied. Total rules applied 2669 place count 508 transition count 751
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2670 place count 507 transition count 751
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 23 Pre rules applied. Total rules applied 2670 place count 507 transition count 728
Deduced a syphon composed of 23 places in 6 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 46 rules applied. Total rules applied 2716 place count 484 transition count 728
Discarding 78 places :
Symmetric choice reduction at 8 with 78 rule applications. Total rules 2794 place count 406 transition count 650
Iterating global reduction 8 with 78 rules applied. Total rules applied 2872 place count 406 transition count 650
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 2872 place count 406 transition count 641
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 2890 place count 397 transition count 641
Discarding 60 places :
Symmetric choice reduction at 8 with 60 rule applications. Total rules 2950 place count 337 transition count 581
Iterating global reduction 8 with 60 rules applied. Total rules applied 3010 place count 337 transition count 581
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 36 rules applied. Total rules applied 3046 place count 337 transition count 545
Reduce places removed 18 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 26 rules applied. Total rules applied 3072 place count 319 transition count 537
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 3076 place count 315 transition count 537
Discarding 21 places :
Symmetric choice reduction at 11 with 21 rule applications. Total rules 3097 place count 294 transition count 504
Iterating global reduction 11 with 21 rules applied. Total rules applied 3118 place count 294 transition count 504
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 3127 place count 294 transition count 495
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 3136 place count 285 transition count 477
Iterating global reduction 12 with 9 rules applied. Total rules applied 3145 place count 285 transition count 477
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 3148 place count 282 transition count 471
Iterating global reduction 12 with 3 rules applied. Total rules applied 3151 place count 282 transition count 471
Performed 147 Post agglomeration using F-continuation condition with reduction of 69 identical transitions.
Deduced a syphon composed of 147 places in 1 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 12 with 294 rules applied. Total rules applied 3445 place count 135 transition count 255
Drop transitions removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 3452 place count 135 transition count 248
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3454 place count 134 transition count 247
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 3456 place count 134 transition count 245
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 3458 place count 133 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 3460 place count 133 transition count 242
Performed 40 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 15 with 80 rules applied. Total rules applied 3540 place count 93 transition count 272
Drop transitions removed 11 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 15 with 50 rules applied. Total rules applied 3590 place count 93 transition count 222
Discarding 22 places :
Symmetric choice reduction at 16 with 22 rule applications. Total rules 3612 place count 71 transition count 186
Iterating global reduction 16 with 22 rules applied. Total rules applied 3634 place count 71 transition count 186
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 16 with 9 rules applied. Total rules applied 3643 place count 71 transition count 177
Discarding 6 places :
Symmetric choice reduction at 17 with 6 rule applications. Total rules 3649 place count 65 transition count 165
Iterating global reduction 17 with 6 rules applied. Total rules applied 3655 place count 65 transition count 165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 3658 place count 65 transition count 162
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 18 with 19 rules applied. Total rules applied 3677 place count 65 transition count 143
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3678 place count 64 transition count 140
Iterating global reduction 18 with 1 rules applied. Total rules applied 3679 place count 64 transition count 140
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3680 place count 63 transition count 139
Iterating global reduction 18 with 1 rules applied. Total rules applied 3681 place count 63 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 3682 place count 63 transition count 138
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3683 place count 63 transition count 137
Free-agglomeration rule applied 6 times.
Iterating global reduction 19 with 6 rules applied. Total rules applied 3689 place count 63 transition count 131
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 3696 place count 57 transition count 130
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3697 place count 57 transition count 129
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 3698 place count 57 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 3699 place count 56 transition count 128
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 3700 place count 56 transition count 127
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 21 with 4 rules applied. Total rules applied 3704 place count 56 transition count 127
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 3706 place count 56 transition count 125
Discarding 2 places :
Symmetric choice reduction at 21 with 2 rule applications. Total rules 3708 place count 54 transition count 123
Iterating global reduction 21 with 2 rules applied. Total rules applied 3710 place count 54 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 3711 place count 53 transition count 122
Applied a total of 3711 rules in 608 ms. Remains 53 /2585 variables (removed 2532) and now considering 122/3095 (removed 2973) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/2585 places, 122/3095 transitions.
Normalized transition count is 114 out of 122 initially.
// Phase 1: matrix 114 rows 53 cols
[2022-05-16 05:30:13] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 13055 resets, run finished after 1424 ms. (steps per millisecond=702 ) properties (out of 9) seen :9
FORMULA CloudReconfiguration-PT-315-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 85205 ms.

BK_STOP 1652679015492

--------------------
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-315"
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-315, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-smll-165252095600325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-315.tgz
mv CloudReconfiguration-PT-315 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;