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

About the Execution of ITS-Tools for CloudDeployment-PT-4b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
611.491 60522.00 94343.00 308.90 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-162038291800307.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 CloudDeployment-PT-4b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291800307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.9K Mar 28 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 591K 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 CloudDeployment-PT-4b-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620574190700

Running Version 0
[2021-05-09 15:29:54] [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 15:29:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:29:55] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2021-05-09 15:29:55] [INFO ] Transformed 1182 places.
[2021-05-09 15:29:55] [INFO ] Transformed 1824 transitions.
[2021-05-09 15:29:55] [INFO ] Found NUPN structural information;
[2021-05-09 15:29:55] [INFO ] Parsed PT model containing 1182 places and 1824 transitions in 296 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 1824 rows 1182 cols
[2021-05-09 15:29:55] [INFO ] Computed 17 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 79 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 16) seen :5
FORMULA CloudDeployment-PT-4b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :3
FORMULA CloudDeployment-PT-4b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
// Phase 1: matrix 1824 rows 1182 cols
[2021-05-09 15:29:55] [INFO ] Computed 17 place invariants in 26 ms
[2021-05-09 15:29:56] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 157 ms returned sat
[2021-05-09 15:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:29:59] [INFO ] [Real]Absence check using state equation in 2784 ms returned sat
[2021-05-09 15:29:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:30:00] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 41 ms returned sat
[2021-05-09 15:30:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:30:01] [INFO ] [Nat]Absence check using state equation in 833 ms returned sat
[2021-05-09 15:30:01] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 309 ms.
[2021-05-09 15:30:04] [INFO ] Added : 150 causal constraints over 30 iterations in 3598 ms. Result :unknown
[2021-05-09 15:30:05] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 43 ms returned sat
[2021-05-09 15:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:30:05] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2021-05-09 15:30:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:30:06] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 35 ms returned sat
[2021-05-09 15:30:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:30:06] [INFO ] [Nat]Absence check using state equation in 836 ms returned sat
[2021-05-09 15:30:07] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 197 ms.
[2021-05-09 15:30:10] [INFO ] Added : 210 causal constraints over 42 iterations in 3745 ms. Result :unknown
[2021-05-09 15:30:11] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 21 ms returned sat
[2021-05-09 15:30:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:30:11] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2021-05-09 15:30:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:30:11] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 136 ms returned sat
[2021-05-09 15:30:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:30:13] [INFO ] [Nat]Absence check using state equation in 1834 ms returned sat
[2021-05-09 15:30:14] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 130 ms.
[2021-05-09 15:30:16] [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 2
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 15:30:17] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 33 ms returned sat
[2021-05-09 15:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:30:17] [INFO ] [Real]Absence check using state equation in 799 ms returned sat
[2021-05-09 15:30:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:30:18] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 21 ms returned sat
[2021-05-09 15:30:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:30:18] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2021-05-09 15:30:18] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 94 ms.
[2021-05-09 15:30:23] [INFO ] Added : 255 causal constraints over 51 iterations in 4295 ms. Result :unknown
[2021-05-09 15:30:23] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 35 ms returned sat
[2021-05-09 15:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:30:24] [INFO ] [Real]Absence check using state equation in 830 ms returned sat
[2021-05-09 15:30:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:30:24] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 21 ms returned sat
[2021-05-09 15:30:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:30:25] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2021-05-09 15:30:25] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 164 ms.
[2021-05-09 15:30:29] [INFO ] Added : 210 causal constraints over 42 iterations in 4159 ms. Result :unknown
[2021-05-09 15:30:29] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 31 ms returned sat
[2021-05-09 15:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:30:30] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2021-05-09 15:30:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:30:31] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 36 ms returned sat
[2021-05-09 15:30:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:30:32] [INFO ] [Nat]Absence check using state equation in 943 ms returned sat
[2021-05-09 15:30:32] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 172 ms.
[2021-05-09 15:30: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: Stream close... while checking expression at index 5
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 15:30:36] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 32 ms returned sat
[2021-05-09 15:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:30:37] [INFO ] [Real]Absence check using state equation in 1182 ms returned sat
[2021-05-09 15:30:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:30:37] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 49 ms returned sat
[2021-05-09 15:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:30:38] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2021-05-09 15:30:38] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 201 ms.
[2021-05-09 15:30:42] [INFO ] Added : 215 causal constraints over 43 iterations in 3710 ms. Result :unknown
[2021-05-09 15:30:42] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 20 ms returned sat
[2021-05-09 15:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:30:43] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2021-05-09 15:30:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:30:43] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 38 ms returned sat
[2021-05-09 15:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:30:44] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2021-05-09 15:30:44] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 99 ms.
[2021-05-09 15:30:48] [INFO ] Added : 220 causal constraints over 44 iterations in 3915 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 59900 steps, including 577 resets, run finished after 296 ms. (steps per millisecond=202 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 51500 steps, including 601 resets, run finished after 176 ms. (steps per millisecond=292 ) properties (out of 8) seen :1 could not realise parikh vector
FORMULA CloudDeployment-PT-4b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 46500 steps, including 338 resets, run finished after 137 ms. (steps per millisecond=339 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 7 out of 1182 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1182/1182 places, 1824/1824 transitions.
Graph (trivial) has 1185 edges and 1182 vertex of which 306 / 1182 are part of one of the 30 SCC in 50 ms
Free SCC test removed 276 places
Drop transitions removed 594 transitions
Reduce isomorphic transitions removed 594 transitions.
Graph (complete) has 2386 edges and 906 vertex of which 878 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 434 transitions
Trivial Post-agglo rules discarded 434 transitions
Performed 434 trivial Post agglomeration. Transition count delta: 434
Iterating post reduction 0 with 449 rules applied. Total rules applied 451 place count 878 transition count 778
Reduce places removed 434 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 438 rules applied. Total rules applied 889 place count 444 transition count 774
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 893 place count 440 transition count 774
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 893 place count 440 transition count 758
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 925 place count 424 transition count 758
Discarding 170 places :
Symmetric choice reduction at 3 with 170 rule applications. Total rules 1095 place count 254 transition count 588
Iterating global reduction 3 with 170 rules applied. Total rules applied 1265 place count 254 transition count 588
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 3 with 14 rules applied. Total rules applied 1279 place count 254 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1280 place count 253 transition count 574
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 1280 place count 253 transition count 554
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 1320 place count 233 transition count 554
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1322 place count 231 transition count 552
Iterating global reduction 5 with 2 rules applied. Total rules applied 1324 place count 231 transition count 552
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1325 place count 230 transition count 551
Iterating global reduction 5 with 1 rules applied. Total rules applied 1326 place count 230 transition count 551
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 5 with 116 rules applied. Total rules applied 1442 place count 172 transition count 493
Performed 31 Post agglomeration using F-continuation condition with reduction of 53 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 1504 place count 141 transition count 615
Drop transitions removed 12 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1518 place count 141 transition count 601
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1519 place count 140 transition count 587
Iterating global reduction 6 with 1 rules applied. Total rules applied 1520 place count 140 transition count 587
Drop transitions removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 6 with 98 rules applied. Total rules applied 1618 place count 140 transition count 489
Free-agglomeration rule applied 40 times with reduction of 12 identical transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 1658 place count 140 transition count 437
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 88 transitions.
Graph (complete) has 643 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 129 rules applied. Total rules applied 1787 place count 99 transition count 349
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1788 place count 99 transition count 348
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1791 place count 96 transition count 333
Iterating global reduction 8 with 3 rules applied. Total rules applied 1794 place count 96 transition count 333
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 8 with 48 rules applied. Total rules applied 1842 place count 96 transition count 285
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1843 place count 96 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1844 place count 95 transition count 284
Applied a total of 1844 rules in 424 ms. Remains 95 /1182 variables (removed 1087) and now considering 284/1824 (removed 1540) transitions.
Finished structural reductions, in 1 iterations. Remains : 95/1182 places, 284/1824 transitions.
Normalized transition count is 164 out of 284 initially.
// Phase 1: matrix 164 rows 95 cols
[2021-05-09 15:30:49] [INFO ] Computed 15 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 18008 resets, run finished after 1571 ms. (steps per millisecond=636 ) properties (out of 7) seen :7
FORMULA CloudDeployment-PT-4b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620574251222

--------------------
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-4b"
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 CloudDeployment-PT-4b, 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-162038291800307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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