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.r046-smll-165252115700028.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 gold2021
Input is CloudDeployment-PT-6b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-165252115700028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 6.7K Apr 30 10:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 30 10:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 10:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 30 10:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 4.8M 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 CloudDeployment-PT-6b-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652523692249

Running Version 0
[2022-05-14 10:21:35] [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-14 10:21:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 10:21:36] [INFO ] Load time of PNML (sax parser for PT used): 973 ms
[2022-05-14 10:21:36] [INFO ] Transformed 1888 places.
[2022-05-14 10:21:36] [INFO ] Transformed 6804 transitions.
[2022-05-14 10:21:36] [INFO ] Found NUPN structural information;
[2022-05-14 10:21:36] [INFO ] Parsed PT model containing 1888 places and 6804 transitions in 1125 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 6804 rows 1888 cols
[2022-05-14 10:21:37] [INFO ] Computed 25 place invariants in 318 ms
Incomplete random walk after 10000 steps, including 49 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 16) seen :4
FORMULA CloudDeployment-PT-6b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 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 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 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 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :1
FORMULA CloudDeployment-PT-6b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 6804 rows 1888 cols
[2022-05-14 10:21:37] [INFO ] Computed 25 place invariants in 164 ms
[2022-05-14 10:21:38] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 74 ms returned sat
[2022-05-14 10:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:21:41] [INFO ] [Real]Absence check using state equation in 2991 ms returned sat
[2022-05-14 10:21:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:21:42] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 90 ms returned sat
[2022-05-14 10:21:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:21:45] [INFO ] [Nat]Absence check using state equation in 2984 ms returned sat
[2022-05-14 10:21:50] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 4483 ms.
[2022-05-14 10:21:50] [INFO ] Added : 0 causal constraints over 0 iterations in 4486 ms. Result :unknown
[2022-05-14 10:21:51] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 95 ms returned sat
[2022-05-14 10:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:21:54] [INFO ] [Real]Absence check using state equation in 3130 ms returned sat
[2022-05-14 10:21:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:21:55] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 81 ms returned sat
[2022-05-14 10:21:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:21:58] [INFO ] [Nat]Absence check using state equation in 3019 ms returned sat
[2022-05-14 10:22:01] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 3121 ms.
[2022-05-14 10:22:01] [INFO ] Added : 0 causal constraints over 0 iterations in 3122 ms. Result :unknown
[2022-05-14 10:22:02] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 60 ms returned sat
[2022-05-14 10:22:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:22:05] [INFO ] [Real]Absence check using state equation in 2897 ms returned sat
[2022-05-14 10:22:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:22:06] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 100 ms returned sat
[2022-05-14 10:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:22:09] [INFO ] [Nat]Absence check using state equation in 3149 ms returned sat
[2022-05-14 10:22:12] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 3229 ms.
[2022-05-14 10:22:12] [INFO ] Added : 0 causal constraints over 0 iterations in 3232 ms. Result :unknown
[2022-05-14 10:22:13] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 57 ms returned sat
[2022-05-14 10:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:22:16] [INFO ] [Real]Absence check using state equation in 2746 ms returned sat
[2022-05-14 10:22:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:22:16] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 62 ms returned sat
[2022-05-14 10:22:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:22:19] [INFO ] [Nat]Absence check using state equation in 2713 ms returned sat
[2022-05-14 10:22:22] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2659 ms.
[2022-05-14 10:22:22] [INFO ] Added : 0 causal constraints over 0 iterations in 2664 ms. Result :unknown
[2022-05-14 10:22:22] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 58 ms returned sat
[2022-05-14 10:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:22:25] [INFO ] [Real]Absence check using state equation in 2990 ms returned sat
[2022-05-14 10:22:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:22:26] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 97 ms returned sat
[2022-05-14 10:22:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:22:30] [INFO ] [Nat]Absence check using state equation in 3325 ms returned sat
[2022-05-14 10:22:32] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2257 ms.
[2022-05-14 10:22:32] [INFO ] Added : 0 causal constraints over 0 iterations in 2259 ms. Result :unknown
[2022-05-14 10:22:33] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 95 ms returned sat
[2022-05-14 10:22:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:22:36] [INFO ] [Real]Absence check using state equation in 3473 ms returned sat
[2022-05-14 10:22:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:22:37] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 103 ms returned sat
[2022-05-14 10:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:22:40] [INFO ] [Nat]Absence check using state equation in 3232 ms returned sat
[2022-05-14 10:22:43] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2463 ms.
[2022-05-14 10:22:43] [INFO ] Added : 0 causal constraints over 0 iterations in 2463 ms. Result :unknown
[2022-05-14 10:22:43] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 57 ms returned sat
[2022-05-14 10:22:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:22:46] [INFO ] [Real]Absence check using state equation in 2615 ms returned sat
[2022-05-14 10:22:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:22:46] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 60 ms returned sat
[2022-05-14 10:22:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:22:49] [INFO ] [Nat]Absence check using state equation in 3002 ms returned sat
[2022-05-14 10:22:52] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2267 ms.
[2022-05-14 10:22:52] [INFO ] Added : 0 causal constraints over 0 iterations in 2267 ms. Result :unknown
[2022-05-14 10:22:52] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 56 ms returned sat
[2022-05-14 10:22:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:22:56] [INFO ] [Real]Absence check using state equation in 3365 ms returned sat
[2022-05-14 10:22:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:22:56] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 73 ms returned sat
[2022-05-14 10:22:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:22:59] [INFO ] [Nat]Absence check using state equation in 2962 ms returned sat
[2022-05-14 10:23:02] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2415 ms.
[2022-05-14 10:23:02] [INFO ] Added : 0 causal constraints over 0 iterations in 2416 ms. Result :unknown
[2022-05-14 10:23:02] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 66 ms returned sat
[2022-05-14 10:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:23:05] [INFO ] [Real]Absence check using state equation in 2930 ms returned sat
[2022-05-14 10:23:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:23:06] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 60 ms returned sat
[2022-05-14 10:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:23:09] [INFO ] [Nat]Absence check using state equation in 3110 ms returned sat
[2022-05-14 10:23:12] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2309 ms.
[2022-05-14 10:23:12] [INFO ] Added : 0 causal constraints over 0 iterations in 2310 ms. Result :unknown
[2022-05-14 10:23:12] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 90 ms returned sat
[2022-05-14 10:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:23:16] [INFO ] [Real]Absence check using state equation in 3683 ms returned sat
[2022-05-14 10:23:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:23:17] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 101 ms returned sat
[2022-05-14 10:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:23:21] [INFO ] [Nat]Absence check using state equation in 3896 ms returned sat
[2022-05-14 10:23:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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:671)
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)
[2022-05-14 10:23:22] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 90 ms returned sat
[2022-05-14 10:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:23:25] [INFO ] [Real]Absence check using state equation in 2916 ms returned sat
[2022-05-14 10:23:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:23:25] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 70 ms returned sat
[2022-05-14 10:23:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:23:29] [INFO ] [Nat]Absence check using state equation in 3066 ms returned sat
[2022-05-14 10:23:31] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2282 ms.
[2022-05-14 10:23:31] [INFO ] Added : 0 causal constraints over 0 iterations in 2283 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 15400 steps, including 240 resets, run finished after 96 ms. (steps per millisecond=160 ) properties (out of 11) seen :0 could not realise parikh vector
Incomplete Parikh walk after 10200 steps, including 115 resets, run finished after 55 ms. (steps per millisecond=185 ) properties (out of 11) seen :1 could not realise parikh vector
FORMULA CloudDeployment-PT-6b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 9900 steps, including 110 resets, run finished after 49 ms. (steps per millisecond=202 ) properties (out of 10) seen :1 could not realise parikh vector
FORMULA CloudDeployment-PT-6b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 16200 steps, including 116 resets, run finished after 73 ms. (steps per millisecond=221 ) properties (out of 9) seen :1 could not realise parikh vector
FORMULA CloudDeployment-PT-6b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 34200 steps, including 298 resets, run finished after 176 ms. (steps per millisecond=194 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 10800 steps, including 111 resets, run finished after 60 ms. (steps per millisecond=180 ) properties (out of 8) seen :1 could not realise parikh vector
FORMULA CloudDeployment-PT-6b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 13600 steps, including 147 resets, run finished after 80 ms. (steps per millisecond=170 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 17300 steps, including 129 resets, run finished after 91 ms. (steps per millisecond=190 ) properties (out of 7) seen :1 could not realise parikh vector
FORMULA CloudDeployment-PT-6b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 15000 steps, including 163 resets, run finished after 83 ms. (steps per millisecond=180 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11400 steps, including 102 resets, run finished after 61 ms. (steps per millisecond=186 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA CloudDeployment-PT-6b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 1888 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Graph (trivial) has 1900 edges and 1888 vertex of which 488 / 1888 are part of one of the 48 SCC in 22 ms
Free SCC test removed 440 places
Drop transitions removed 4634 transitions
Reduce isomorphic transitions removed 4634 transitions.
Graph (complete) has 4322 edges and 1448 vertex of which 1404 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.13 ms
Discarding 44 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 682 transitions
Trivial Post-agglo rules discarded 682 transitions
Performed 682 trivial Post agglomeration. Transition count delta: 682
Iterating post reduction 0 with 706 rules applied. Total rules applied 708 place count 1404 transition count 1458
Reduce places removed 682 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 1 with 684 rules applied. Total rules applied 1392 place count 722 transition count 1456
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 1396 place count 721 transition count 1453
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1399 place count 718 transition count 1453
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 1399 place count 718 transition count 1429
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1447 place count 694 transition count 1429
Discarding 319 places :
Symmetric choice reduction at 4 with 319 rule applications. Total rules 1766 place count 375 transition count 1110
Iterating global reduction 4 with 319 rules applied. Total rules applied 2085 place count 375 transition count 1110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 2115 place count 375 transition count 1080
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 30 Pre rules applied. Total rules applied 2115 place count 375 transition count 1050
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 2175 place count 345 transition count 1050
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2179 place count 341 transition count 1046
Iterating global reduction 5 with 4 rules applied. Total rules applied 2183 place count 341 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2186 place count 338 transition count 1043
Iterating global reduction 5 with 3 rules applied. Total rules applied 2189 place count 338 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2191 place count 336 transition count 1041
Iterating global reduction 5 with 2 rules applied. Total rules applied 2193 place count 336 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2194 place count 335 transition count 1040
Iterating global reduction 5 with 1 rules applied. Total rules applied 2195 place count 335 transition count 1040
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 5 with 172 rules applied. Total rules applied 2367 place count 249 transition count 954
Performed 38 Post agglomeration using F-continuation condition with reduction of 31 identical transitions.
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 2443 place count 211 transition count 1176
Drop transitions removed 19 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 2468 place count 211 transition count 1151
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 2480 place count 205 transition count 1211
Drop transitions removed 225 transitions
Redundant transition composition rules discarded 225 transitions
Iterating global reduction 6 with 225 rules applied. Total rules applied 2705 place count 205 transition count 986
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2765 place count 205 transition count 896
Reduce places removed 60 places and 0 transitions.
Drop transitions removed 137 transitions
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 197 transitions.
Graph (complete) has 1241 edges and 145 vertex of which 144 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 258 rules applied. Total rules applied 3023 place count 144 transition count 699
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3024 place count 144 transition count 698
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 3028 place count 140 transition count 670
Iterating global reduction 8 with 4 rules applied. Total rules applied 3032 place count 140 transition count 670
Drop transitions removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 8 with 102 rules applied. Total rules applied 3134 place count 140 transition count 568
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 3135 place count 139 transition count 567
Applied a total of 3135 rules in 666 ms. Remains 139 /1888 variables (removed 1749) and now considering 567/6804 (removed 6237) transitions.
Finished structural reductions, in 1 iterations. Remains : 139/1888 places, 567/6804 transitions.
Normalized transition count is 285 out of 567 initially.
// Phase 1: matrix 285 rows 139 cols
[2022-05-14 10:23:33] [INFO ] Computed 23 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 12306 resets, run finished after 2569 ms. (steps per millisecond=389 ) properties (out of 5) seen :5
FORMULA CloudDeployment-PT-6b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652523816847

--------------------
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="CloudDeployment-PT-6b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is CloudDeployment-PT-6b, 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 r046-smll-165252115700028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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