fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r095-smll-167814411000057
Last Updated
May 14, 2023

About the Execution of 2022-gold for CloudDeployment-PT-7b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1087.071 60343.00 85397.00 282.50 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/fkordon/mcc2023-input.r095-smll-167814411000057.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is CloudDeployment-PT-7b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-smll-167814411000057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 8.7K Feb 25 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 14:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 14:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 20M Mar 5 18:22 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-7b-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678174116069

Running Version 202205111006
[2023-03-07 07:28:38] [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]
[2023-03-07 07:28:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:28:40] [INFO ] Load time of PNML (sax parser for PT used): 2043 ms
[2023-03-07 07:28:40] [INFO ] Transformed 2271 places.
[2023-03-07 07:28:41] [INFO ] Transformed 19752 transitions.
[2023-03-07 07:28:41] [INFO ] Found NUPN structural information;
[2023-03-07 07:28:41] [INFO ] Parsed PT model containing 2271 places and 19752 transitions in 2546 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 19752 rows 2271 cols
[2023-03-07 07:28:42] [INFO ] Computed 29 place invariants in 1039 ms
Incomplete random walk after 10000 steps, including 41 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 16) seen :8
FORMULA CloudDeployment-PT-7b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :1
FORMULA CloudDeployment-PT-7b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
// Phase 1: matrix 19752 rows 2271 cols
[2023-03-07 07:28:44] [INFO ] Computed 29 place invariants in 857 ms
[2023-03-07 07:28:45] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 85 ms returned sat
[2023-03-07 07:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:28:49] [INFO ] [Real]Absence check using state equation in 3840 ms returned unknown
[2023-03-07 07:28:50] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 121 ms returned sat
[2023-03-07 07:28:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:28:54] [INFO ] [Real]Absence check using state equation in 4047 ms returned unknown
[2023-03-07 07:28:55] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 108 ms returned sat
[2023-03-07 07:28:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:28:59] [INFO ] [Real]Absence check using state equation in 4208 ms returned unknown
[2023-03-07 07:29:00] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 81 ms returned sat
[2023-03-07 07:29:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:29:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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)
[2023-03-07 07:29:05] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 121 ms returned sat
[2023-03-07 07:29:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:29:09] [INFO ] [Real]Absence check using state equation in 4255 ms returned unknown
[2023-03-07 07:29:10] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 128 ms returned sat
[2023-03-07 07:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:29:14] [INFO ] [Real]Absence check using state equation in 4269 ms returned unknown
[2023-03-07 07:29:15] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 121 ms returned sat
[2023-03-07 07:29:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:29:19] [INFO ] [Real]Absence check using state equation in 4134 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 2271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2271/2271 places, 19752/19752 transitions.
Graph (trivial) has 2275 edges and 2271 vertex of which 568 / 2271 are part of one of the 55 SCC in 21 ms
Free SCC test removed 513 places
Drop transitions removed 17012 transitions
Reduce isomorphic transitions removed 17012 transitions.
Graph (complete) has 5495 edges and 1758 vertex of which 1707 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.20 ms
Discarding 51 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 814 transitions
Trivial Post-agglo rules discarded 814 transitions
Performed 814 trivial Post agglomeration. Transition count delta: 814
Iterating post reduction 0 with 842 rules applied. Total rules applied 844 place count 1707 transition count 1891
Reduce places removed 814 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 816 rules applied. Total rules applied 1660 place count 893 transition count 1889
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 1664 place count 892 transition count 1886
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1667 place count 889 transition count 1886
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 1667 place count 889 transition count 1857
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1725 place count 860 transition count 1857
Discarding 415 places :
Symmetric choice reduction at 4 with 415 rule applications. Total rules 2140 place count 445 transition count 1442
Iterating global reduction 4 with 415 rules applied. Total rules applied 2555 place count 445 transition count 1442
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 2597 place count 445 transition count 1400
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 2597 place count 445 transition count 1367
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 2663 place count 412 transition count 1367
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 2668 place count 407 transition count 1362
Iterating global reduction 5 with 5 rules applied. Total rules applied 2673 place count 407 transition count 1362
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2677 place count 403 transition count 1358
Iterating global reduction 5 with 4 rules applied. Total rules applied 2681 place count 403 transition count 1358
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2684 place count 400 transition count 1355
Iterating global reduction 5 with 3 rules applied. Total rules applied 2687 place count 400 transition count 1355
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2689 place count 398 transition count 1353
Iterating global reduction 5 with 2 rules applied. Total rules applied 2691 place count 398 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2692 place count 397 transition count 1352
Iterating global reduction 5 with 1 rules applied. Total rules applied 2693 place count 397 transition count 1352
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 2895 place count 296 transition count 1251
Performed 44 Post agglomeration using F-continuation condition with reduction of 36 identical transitions.
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 2983 place count 252 transition count 1560
Drop transitions removed 20 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 3010 place count 252 transition count 1533
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 3024 place count 245 transition count 1617
Drop transitions removed 274 transitions
Redundant transition composition rules discarded 274 transitions
Iterating global reduction 6 with 274 rules applied. Total rules applied 3298 place count 245 transition count 1343
Free-agglomeration rule applied 70 times with reduction of 42 identical transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 3368 place count 245 transition count 1231
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 185 transitions
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 276 transitions.
Graph (complete) has 1620 edges and 175 vertex of which 174 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 347 rules applied. Total rules applied 3715 place count 174 transition count 955
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3716 place count 174 transition count 954
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 3721 place count 169 transition count 914
Iterating global reduction 8 with 5 rules applied. Total rules applied 3726 place count 169 transition count 914
Drop transitions removed 147 transitions
Redundant transition composition rules discarded 147 transitions
Iterating global reduction 8 with 147 rules applied. Total rules applied 3873 place count 169 transition count 767
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 3874 place count 169 transition count 767
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 3875 place count 168 transition count 766
Applied a total of 3875 rules in 1084 ms. Remains 168 /2271 variables (removed 2103) and now considering 766/19752 (removed 18986) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/2271 places, 766/19752 transitions.
Normalized transition count is 380 out of 766 initially.
// Phase 1: matrix 380 rows 168 cols
[2023-03-07 07:29:20] [INFO ] Computed 27 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3439 ms. (steps per millisecond=290 ) properties (out of 7) seen :3
FORMULA CloudDeployment-PT-7b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2993 ms. (steps per millisecond=334 ) properties (out of 4) seen :1
FORMULA CloudDeployment-PT-7b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 3325 ms. (steps per millisecond=300 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2977 ms. (steps per millisecond=335 ) properties (out of 3) seen :0
[2023-03-07 07:29:33] [INFO ] Flow matrix only has 380 transitions (discarded 386 similar events)
// Phase 1: matrix 380 rows 168 cols
[2023-03-07 07:29:33] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-07 07:29:33] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-07 07:29:33] [INFO ] [Real]Absence check using 7 positive and 20 generalized place invariants in 11 ms returned sat
[2023-03-07 07:29:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:29:33] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2023-03-07 07:29:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:29:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-07 07:29:33] [INFO ] [Nat]Absence check using 7 positive and 20 generalized place invariants in 9 ms returned sat
[2023-03-07 07:29:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:29:33] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-07 07:29:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 07:29:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2023-03-07 07:29:34] [INFO ] Computed and/alt/rep : 229/581/229 causal constraints (skipped 101 transitions) in 138 ms.
[2023-03-07 07:29:34] [INFO ] Added : 19 causal constraints over 4 iterations in 437 ms. Result :sat
Minimization took 74 ms.
[2023-03-07 07:29:34] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-07 07:29:34] [INFO ] [Real]Absence check using 7 positive and 20 generalized place invariants in 7 ms returned sat
[2023-03-07 07:29:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:29:34] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-07 07:29:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:29:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2023-03-07 07:29:34] [INFO ] [Nat]Absence check using 7 positive and 20 generalized place invariants in 7 ms returned sat
[2023-03-07 07:29:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:29:34] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-07 07:29:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-07 07:29:35] [INFO ] Computed and/alt/rep : 229/581/229 causal constraints (skipped 101 transitions) in 63 ms.
[2023-03-07 07:29:35] [INFO ] Added : 17 causal constraints over 4 iterations in 265 ms. Result :sat
Minimization took 64 ms.
[2023-03-07 07:29:35] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-07 07:29:35] [INFO ] [Real]Absence check using 7 positive and 20 generalized place invariants in 11 ms returned sat
[2023-03-07 07:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:29:35] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-07 07:29:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:29:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-07 07:29:35] [INFO ] [Nat]Absence check using 7 positive and 20 generalized place invariants in 15 ms returned sat
[2023-03-07 07:29:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:29:35] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2023-03-07 07:29:35] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2023-03-07 07:29:35] [INFO ] Computed and/alt/rep : 229/581/229 causal constraints (skipped 101 transitions) in 62 ms.
[2023-03-07 07:29:36] [INFO ] Added : 17 causal constraints over 4 iterations in 246 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA CloudDeployment-PT-7b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 57831 ms.

BK_STOP 1678174176412

--------------------
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="CloudDeployment-PT-7b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is CloudDeployment-PT-7b, 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 r095-smll-167814411000057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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