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.r255-tall-167856440400097.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 MultiCrashLeafsetExtension-PT-S16C05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440400097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 14K Feb 26 02:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 02:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.6M 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 MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678758431585

Running Version 202205111006
[2023-03-14 01:47:12] [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-14 01:47:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 01:47:13] [INFO ] Load time of PNML (sax parser for PT used): 383 ms
[2023-03-14 01:47:13] [INFO ] Transformed 4914 places.
[2023-03-14 01:47:13] [INFO ] Transformed 6913 transitions.
[2023-03-14 01:47:13] [INFO ] Parsed PT model containing 4914 places and 6913 transitions in 516 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 6641 out of 6913 initially.
// Phase 1: matrix 6641 rows 4914 cols
[2023-03-14 01:47:13] [INFO ] Computed 535 place invariants in 324 ms
Incomplete random walk after 10000 steps, including 191 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :3
[2023-03-14 01:47:14] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2023-03-14 01:47:14] [INFO ] Computed 535 place invariants in 177 ms
[2023-03-14 01:47:15] [INFO ] [Real]Absence check using 48 positive place invariants in 540 ms returned sat
[2023-03-14 01:47:15] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 150 ms returned unsat
[2023-03-14 01:47:16] [INFO ] [Real]Absence check using 48 positive place invariants in 56 ms returned sat
[2023-03-14 01:47:16] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 173 ms returned sat
[2023-03-14 01:47:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:47:20] [INFO ] [Real]Absence check using state equation in 4391 ms returned unknown
[2023-03-14 01:47:21] [INFO ] [Real]Absence check using 48 positive place invariants in 50 ms returned sat
[2023-03-14 01:47:21] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 115 ms returned unsat
[2023-03-14 01:47:21] [INFO ] [Real]Absence check using 48 positive place invariants in 49 ms returned sat
[2023-03-14 01:47:22] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 120 ms returned unsat
[2023-03-14 01:47:22] [INFO ] [Real]Absence check using 48 positive place invariants in 49 ms returned sat
[2023-03-14 01:47:22] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 126 ms returned unsat
[2023-03-14 01:47:23] [INFO ] [Real]Absence check using 48 positive place invariants in 48 ms returned sat
[2023-03-14 01:47:23] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 163 ms returned sat
[2023-03-14 01:47:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:47:27] [INFO ] [Real]Absence check using state equation in 4276 ms returned sat
[2023-03-14 01:47:27] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-14 01:47:27] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:910)
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-14 01:47:28] [INFO ] [Real]Absence check using 48 positive place invariants in 51 ms returned sat
[2023-03-14 01:47:28] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 172 ms returned sat
[2023-03-14 01:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:47:32] [INFO ] [Real]Absence check using state equation in 4376 ms returned unknown
[2023-03-14 01:47:33] [INFO ] [Real]Absence check using 48 positive place invariants in 51 ms returned sat
[2023-03-14 01:47:33] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 122 ms returned unsat
[2023-03-14 01:47:33] [INFO ] [Real]Absence check using 48 positive place invariants in 53 ms returned sat
[2023-03-14 01:47:34] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 178 ms returned sat
[2023-03-14 01:47:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:47:38] [INFO ] [Real]Absence check using state equation in 4019 ms returned sat
[2023-03-14 01:47:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 01:47:39] [INFO ] [Nat]Absence check using 48 positive place invariants in 54 ms returned sat
[2023-03-14 01:47:39] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 175 ms returned sat
[2023-03-14 01:47:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 01:47:42] [INFO ] [Nat]Absence check using state equation in 3049 ms returned sat
[2023-03-14 01:47:43] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 01:47:43] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1046 ms returned unknown
[2023-03-14 01:47:43] [INFO ] [Real]Absence check using 48 positive place invariants in 48 ms returned sat
[2023-03-14 01:47:43] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 115 ms returned unsat
[2023-03-14 01:47:44] [INFO ] [Real]Absence check using 48 positive place invariants in 50 ms returned sat
[2023-03-14 01:47:44] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 118 ms returned unsat
[2023-03-14 01:47:44] [INFO ] [Real]Absence check using 48 positive place invariants in 48 ms returned sat
[2023-03-14 01:47:45] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 162 ms returned sat
[2023-03-14 01:47:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:47:49] [INFO ] [Real]Absence check using state equation in 4406 ms returned unknown
[2023-03-14 01:47:49] [INFO ] [Real]Absence check using 48 positive place invariants in 50 ms returned sat
[2023-03-14 01:47:50] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 120 ms returned unsat
[2023-03-14 01:47:50] [INFO ] [Real]Absence check using 48 positive place invariants in 56 ms returned sat
[2023-03-14 01:47:50] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 117 ms returned unsat
[2023-03-14 01:47:51] [INFO ] [Real]Absence check using 48 positive place invariants in 66 ms returned sat
[2023-03-14 01:47:51] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 168 ms returned sat
[2023-03-14 01:47:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:47:55] [INFO ] [Real]Absence check using state equation in 4178 ms returned sat
[2023-03-14 01:47:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 01:47:56] [INFO ] [Nat]Absence check using 48 positive place invariants in 50 ms returned sat
[2023-03-14 01:47:56] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 180 ms returned sat
[2023-03-14 01:47:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 01:48:00] [INFO ] [Nat]Absence check using state equation in 3879 ms returned sat
[2023-03-14 01:48:00] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 01:48:00] [INFO ] [Nat]Added 1906 Read/Feed constraints in 521 ms returned unknown
[2023-03-14 01:48:01] [INFO ] [Real]Absence check using 48 positive place invariants in 49 ms returned sat
[2023-03-14 01:48:01] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 158 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 51, 1, 1, 1, 1, 17, 1, 17, 1, 1, 1, 1, 1, 17, 1] Max seen :[1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 4914 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.22 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions removed 1356 transitions
Trivial Post-agglo rules discarded 1356 transitions
Performed 1356 trivial Post agglomeration. Transition count delta: 1356
Iterating post reduction 0 with 1356 rules applied. Total rules applied 1357 place count 4884 transition count 5557
Reduce places removed 1356 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1358 rules applied. Total rules applied 2715 place count 3528 transition count 5555
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2717 place count 3526 transition count 5555
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 170 Pre rules applied. Total rules applied 2717 place count 3526 transition count 5385
Deduced a syphon composed of 170 places in 5 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 3057 place count 3356 transition count 5385
Discarding 1186 places :
Symmetric choice reduction at 3 with 1186 rule applications. Total rules 4243 place count 2170 transition count 4199
Iterating global reduction 3 with 1186 rules applied. Total rules applied 5429 place count 2170 transition count 4199
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 5429 place count 2170 transition count 4191
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 5445 place count 2162 transition count 4191
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 5679 place count 1928 transition count 3021
Iterating global reduction 3 with 234 rules applied. Total rules applied 5913 place count 1928 transition count 3021
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 5947 place count 1911 transition count 3004
Free-agglomeration rule (complex) applied 164 times.
Iterating global reduction 3 with 164 rules applied. Total rules applied 6111 place count 1911 transition count 3776
Reduce places removed 164 places and 0 transitions.
Iterating post reduction 3 with 164 rules applied. Total rules applied 6275 place count 1747 transition count 3776
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 6309 place count 1747 transition count 3776
Applied a total of 6309 rules in 1435 ms. Remains 1747 /4914 variables (removed 3167) and now considering 3776/6913 (removed 3137) transitions.
Finished structural reductions, in 1 iterations. Remains : 1747/4914 places, 3776/6913 transitions.
Normalized transition count is 3378 out of 3776 initially.
// Phase 1: matrix 3378 rows 1747 cols
[2023-03-14 01:48:02] [INFO ] Computed 505 place invariants in 44 ms
Incomplete random walk after 1000000 steps, including 31856 resets, run finished after 14220 ms. (steps per millisecond=70 ) properties (out of 6) seen :4
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5669 resets, run finished after 3189 ms. (steps per millisecond=313 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 5668 resets, run finished after 3213 ms. (steps per millisecond=311 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000000 steps, including 5669 resets, run finished after 3197 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5669 resets, run finished after 3177 ms. (steps per millisecond=314 ) properties (out of 4) seen :2
[2023-03-14 01:48:29] [INFO ] Flow matrix only has 3378 transitions (discarded 398 similar events)
// Phase 1: matrix 3378 rows 1747 cols
[2023-03-14 01:48:29] [INFO ] Computed 505 place invariants in 44 ms
[2023-03-14 01:48:30] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2023-03-14 01:48:30] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 56 ms returned unsat
[2023-03-14 01:48:30] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2023-03-14 01:48:30] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 84 ms returned sat
[2023-03-14 01:48:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:48:31] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2023-03-14 01:48:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 01:48:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-14 01:48:31] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 87 ms returned sat
[2023-03-14 01:48:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 01:48:32] [INFO ] [Nat]Absence check using state equation in 1033 ms returned sat
[2023-03-14 01:48:32] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-14 01:48:33] [INFO ] [Nat]Added 1906 Read/Feed constraints in 446 ms returned unsat
[2023-03-14 01:48:33] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2023-03-14 01:48:33] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 48 ms returned unsat
[2023-03-14 01:48:33] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-14 01:48:33] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 82 ms returned sat
[2023-03-14 01:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:48:34] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2023-03-14 01:48:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 01:48:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2023-03-14 01:48:35] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 71 ms returned sat
[2023-03-14 01:48:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 01:48:35] [INFO ] [Nat]Absence check using state equation in 934 ms returned sat
[2023-03-14 01:48:36] [INFO ] [Nat]Added 1906 Read/Feed constraints in 397 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 0, 1, 0] Max seen :[1, 0, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 83570 ms.

BK_STOP 1678758516429

--------------------
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="MultiCrashLeafsetExtension-PT-S16C05"
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 MultiCrashLeafsetExtension-PT-S16C05, 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 r255-tall-167856440400097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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