Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r143-tall-165271830500298.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is MultiCrashLeafsetExtension-PT-S32C02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-tall-165271830500298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 17K Apr 29 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 29 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 29 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K May 9 08:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 16M May 10 09:34 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-S32C02-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652747722012

Running Version 0
[2022-05-17 00:35:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 00:35:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:35:24] [INFO ] Load time of PNML (sax parser for PT used): 711 ms
[2022-05-17 00:35:24] [INFO ] Transformed 13544 places.
[2022-05-17 00:35:24] [INFO ] Transformed 21807 transitions.
[2022-05-17 00:35:24] [INFO ] Parsed PT model containing 13544 places and 21807 transitions in 869 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Normalized transition count is 20751 out of 21807 initially.
// Phase 1: matrix 20751 rows 13544 cols
[2022-05-17 00:35:26] [INFO ] Computed 1333 place invariants in 2120 ms
Incomplete random walk after 10000 steps, including 472 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :2
[2022-05-17 00:35:28] [INFO ] Flow matrix only has 20751 transitions (discarded 1056 similar events)
// Phase 1: matrix 20751 rows 13544 cols
[2022-05-17 00:35:30] [INFO ] Computed 1333 place invariants in 1977 ms
[2022-05-17 00:35:31] [INFO ] [Real]Absence check using 74 positive place invariants in 299 ms returned sat
[2022-05-17 00:35:32] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 711 ms returned sat
[2022-05-17 00:35:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:35: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 0
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.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 00:35:36] [INFO ] [Real]Absence check using 74 positive place invariants in 279 ms returned sat
[2022-05-17 00:35:37] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 391 ms returned unsat
[2022-05-17 00:35:38] [INFO ] [Real]Absence check using 74 positive place invariants in 273 ms returned sat
[2022-05-17 00:35:38] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 389 ms returned unsat
[2022-05-17 00:35:40] [INFO ] [Real]Absence check using 74 positive place invariants in 279 ms returned sat
[2022-05-17 00:35:40] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 454 ms returned unsat
[2022-05-17 00:35:42] [INFO ] [Real]Absence check using 74 positive place invariants in 279 ms returned sat
[2022-05-17 00:35:42] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 375 ms returned unsat
[2022-05-17 00:35:43] [INFO ] [Real]Absence check using 74 positive place invariants in 261 ms returned sat
[2022-05-17 00:35:44] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 546 ms returned unsat
[2022-05-17 00:35:45] [INFO ] [Real]Absence check using 74 positive place invariants in 254 ms returned sat
[2022-05-17 00:35:46] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 681 ms returned sat
[2022-05-17 00:35:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:35:49] [INFO ] [Real]Absence check using state equation in 2921 ms returned unknown
[2022-05-17 00:35:50] [INFO ] [Real]Absence check using 74 positive place invariants in 265 ms returned sat
[2022-05-17 00:35:51] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 697 ms returned sat
[2022-05-17 00:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:35:54] [INFO ] [Real]Absence check using state equation in 2908 ms returned unknown
[2022-05-17 00:35:55] [INFO ] [Real]Absence check using 74 positive place invariants in 246 ms returned sat
[2022-05-17 00:35:56] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 352 ms returned unsat
[2022-05-17 00:35:57] [INFO ] [Real]Absence check using 74 positive place invariants in 266 ms returned sat
[2022-05-17 00:35:58] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 721 ms returned sat
[2022-05-17 00:35:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:36:01] [INFO ] [Real]Absence check using state equation in 2873 ms returned unknown
[2022-05-17 00:36:02] [INFO ] [Real]Absence check using 74 positive place invariants in 256 ms returned sat
[2022-05-17 00:36:03] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 515 ms returned unsat
[2022-05-17 00:36:04] [INFO ] [Real]Absence check using 74 positive place invariants in 252 ms returned sat
[2022-05-17 00:36:05] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 718 ms returned sat
[2022-05-17 00:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:36:08] [INFO ] [Real]Absence check using state equation in 2933 ms returned unknown
[2022-05-17 00:36:09] [INFO ] [Real]Absence check using 74 positive place invariants in 261 ms returned sat
[2022-05-17 00:36:10] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 402 ms returned unsat
[2022-05-17 00:36:11] [INFO ] [Real]Absence check using 74 positive place invariants in 275 ms returned sat
[2022-05-17 00:36:11] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 387 ms returned unsat
[2022-05-17 00:36:13] [INFO ] [Real]Absence check using 74 positive place invariants in 256 ms returned sat
[2022-05-17 00:36:13] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 704 ms returned sat
[2022-05-17 00:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:36:16] [INFO ] [Real]Absence check using state equation in 2904 ms returned unknown
[2022-05-17 00:36:18] [INFO ] [Real]Absence check using 74 positive place invariants in 269 ms returned sat
[2022-05-17 00:36:19] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 830 ms returned sat
[2022-05-17 00:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:36:21] [INFO ] [Real]Absence check using state equation in 2720 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 13544 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 13544/13544 places, 21807/21807 transitions.
Graph (complete) has 52829 edges and 13544 vertex of which 13504 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.45 ms
Discarding 40 places :
Also discarding 0 output transitions
Drop transitions removed 2112 transitions
Trivial Post-agglo rules discarded 2112 transitions
Performed 2112 trivial Post agglomeration. Transition count delta: 2112
Iterating post reduction 0 with 2112 rules applied. Total rules applied 2113 place count 13504 transition count 19695
Reduce places removed 2112 places and 0 transitions.
Iterating post reduction 1 with 2112 rules applied. Total rules applied 4225 place count 11392 transition count 19695
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 4225 place count 11392 transition count 19563
Deduced a syphon composed of 132 places in 19 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 4489 place count 11260 transition count 19563
Discarding 1980 places :
Symmetric choice reduction at 2 with 1980 rule applications. Total rules 6469 place count 9280 transition count 17583
Iterating global reduction 2 with 1980 rules applied. Total rules applied 8449 place count 9280 transition count 17583
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8449 place count 9280 transition count 17579
Deduced a syphon composed of 4 places in 18 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 8457 place count 9276 transition count 17579
Discarding 990 places :
Symmetric choice reduction at 2 with 990 rule applications. Total rules 9447 place count 8286 transition count 15599
Iterating global reduction 2 with 990 rules applied. Total rules applied 10437 place count 8286 transition count 15599
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 16 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 10503 place count 8253 transition count 15566
Free-agglomeration rule (complex) applied 576 times.
Iterating global reduction 2 with 576 rules applied. Total rules applied 11079 place count 8253 transition count 15980
Reduce places removed 576 places and 0 transitions.
Iterating post reduction 2 with 576 rules applied. Total rules applied 11655 place count 7677 transition count 15980
Applied a total of 11655 rules in 14538 ms. Remains 7677 /13544 variables (removed 5867) and now considering 15980/21807 (removed 5827) transitions.
Finished structural reductions, in 1 iterations. Remains : 7677/13544 places, 15980/21807 transitions.
Normalized transition count is 14414 out of 15980 initially.
// Phase 1: matrix 14414 rows 7677 cols
[2022-05-17 00:36:37] [INFO ] Computed 1293 place invariants in 820 ms
Incomplete random walk after 1000000 steps, including 76561 resets, run finished after 27551 ms. (steps per millisecond=36 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 3726 ms. (steps per millisecond=268 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 3644 ms. (steps per millisecond=274 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 3653 ms. (steps per millisecond=273 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7088 resets, run finished after 3676 ms. (steps per millisecond=272 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 3582 ms. (steps per millisecond=279 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 3636 ms. (steps per millisecond=275 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 3806 ms. (steps per millisecond=262 ) properties (out of 7) seen :0
[2022-05-17 00:37:30] [INFO ] Flow matrix only has 14414 transitions (discarded 1566 similar events)
// Phase 1: matrix 14414 rows 7677 cols
[2022-05-17 00:37:31] [INFO ] Computed 1293 place invariants in 819 ms
[2022-05-17 00:37:32] [INFO ] [Real]Absence check using 65 positive place invariants in 184 ms returned sat
[2022-05-17 00:37:32] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 396 ms returned sat
[2022-05-17 00:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:37:41] [INFO ] [Real]Absence check using state equation in 9170 ms returned sat
[2022-05-17 00:37:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:37:43] [INFO ] [Nat]Absence check using 65 positive place invariants in 187 ms returned sat
[2022-05-17 00:37:43] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 435 ms returned sat
[2022-05-17 00:37:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:37:52] [INFO ] [Nat]Absence check using state equation in 8906 ms returned sat
[2022-05-17 00:37:52] [INFO ] State equation strengthened by 7075 read => feed constraints.
[2022-05-17 00:37:56] [INFO ] [Nat]Added 7075 Read/Feed constraints in 3412 ms returned unsat
[2022-05-17 00:37:56] [INFO ] [Real]Absence check using 65 positive place invariants in 169 ms returned sat
[2022-05-17 00:37:57] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 365 ms returned sat
[2022-05-17 00:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:38:04] [INFO ] [Real]Absence check using state equation in 7282 ms returned sat
[2022-05-17 00:38:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:38:05] [INFO ] [Nat]Absence check using 65 positive place invariants in 166 ms returned sat
[2022-05-17 00:38:06] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 376 ms returned sat
[2022-05-17 00:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:38:15] [INFO ] [Nat]Absence check using state equation in 9118 ms returned sat
[2022-05-17 00:38:17] [INFO ] [Nat]Added 7075 Read/Feed constraints in 2729 ms returned unsat
[2022-05-17 00:38:18] [INFO ] [Real]Absence check using 65 positive place invariants in 165 ms returned sat
[2022-05-17 00:38:19] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 455 ms returned sat
[2022-05-17 00:38:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:38:27] [INFO ] [Real]Absence check using state equation in 8137 ms returned sat
[2022-05-17 00:38:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:38:28] [INFO ] [Nat]Absence check using 65 positive place invariants in 163 ms returned sat
[2022-05-17 00:38:28] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 380 ms returned sat
[2022-05-17 00:38:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:38:36] [INFO ] [Nat]Absence check using state equation in 7724 ms returned sat
[2022-05-17 00:38:40] [INFO ] [Nat]Added 7075 Read/Feed constraints in 3450 ms returned unsat
[2022-05-17 00:38:40] [INFO ] [Real]Absence check using 65 positive place invariants in 158 ms returned sat
[2022-05-17 00:38:41] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 390 ms returned sat
[2022-05-17 00:38:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:38:49] [INFO ] [Real]Absence check using state equation in 8434 ms returned sat
[2022-05-17 00:38:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:38:50] [INFO ] [Nat]Absence check using 65 positive place invariants in 174 ms returned sat
[2022-05-17 00:38:51] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 408 ms returned sat
[2022-05-17 00:38:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:39:00] [INFO ] [Nat]Absence check using state equation in 9703 ms returned sat
[2022-05-17 00:39:04] [INFO ] [Nat]Added 7075 Read/Feed constraints in 3214 ms returned unsat
[2022-05-17 00:39:04] [INFO ] [Real]Absence check using 65 positive place invariants in 161 ms returned sat
[2022-05-17 00:39:05] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 386 ms returned sat
[2022-05-17 00:39:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:39:13] [INFO ] [Real]Absence check using state equation in 8388 ms returned sat
[2022-05-17 00:39:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:39:14] [INFO ] [Nat]Absence check using 65 positive place invariants in 166 ms returned sat
[2022-05-17 00:39:15] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 393 ms returned sat
[2022-05-17 00:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:39:23] [INFO ] [Nat]Absence check using state equation in 7892 ms returned sat
[2022-05-17 00:39:25] [INFO ] [Nat]Added 7075 Read/Feed constraints in 2485 ms returned unsat
[2022-05-17 00:39:26] [INFO ] [Real]Absence check using 65 positive place invariants in 160 ms returned sat
[2022-05-17 00:39:26] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 390 ms returned sat
[2022-05-17 00:39:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:39:35] [INFO ] [Real]Absence check using state equation in 8293 ms returned sat
[2022-05-17 00:39:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:39:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 165 ms returned sat
[2022-05-17 00:39:36] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 387 ms returned sat
[2022-05-17 00:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:39:46] [INFO ] [Nat]Absence check using state equation in 9544 ms returned sat
[2022-05-17 00:39:48] [INFO ] [Nat]Added 7075 Read/Feed constraints in 2549 ms returned unsat
[2022-05-17 00:39:49] [INFO ] [Real]Absence check using 65 positive place invariants in 170 ms returned sat
[2022-05-17 00:39:49] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 387 ms returned sat
[2022-05-17 00:39:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:39:57] [INFO ] [Real]Absence check using state equation in 7747 ms returned sat
[2022-05-17 00:39:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:39:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 165 ms returned sat
[2022-05-17 00:39:59] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 403 ms returned sat
[2022-05-17 00:39:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:40:08] [INFO ] [Nat]Absence check using state equation in 9169 ms returned sat
[2022-05-17 00:40:11] [INFO ] [Nat]Added 7075 Read/Feed constraints in 2889 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 0, 0, 0, 0, 0] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652748012246

--------------------
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="MultiCrashLeafsetExtension-PT-S32C02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is MultiCrashLeafsetExtension-PT-S32C02, 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 r143-tall-165271830500298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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