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-165271830400265.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-S24C02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-tall-165271830400265
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.9M
-rw-r--r-- 1 mcc users 16K Apr 29 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 29 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 29 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 9 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:15 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 7.6M 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-S24C02-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652743810123

Running Version 0
[2022-05-16 23:30:11] [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-16 23:30:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 23:30:12] [INFO ] Load time of PNML (sax parser for PT used): 363 ms
[2022-05-16 23:30:12] [INFO ] Transformed 7032 places.
[2022-05-16 23:30:12] [INFO ] Transformed 10855 transitions.
[2022-05-16 23:30:12] [INFO ] Parsed PT model containing 7032 places and 10855 transitions in 449 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 10255 out of 10855 initially.
// Phase 1: matrix 10255 rows 7032 cols
[2022-05-16 23:30:13] [INFO ] Computed 813 place invariants in 881 ms
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 469 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :1
[2022-05-16 23:30:14] [INFO ] Flow matrix only has 10255 transitions (discarded 600 similar events)
// Phase 1: matrix 10255 rows 7032 cols
[2022-05-16 23:30:14] [INFO ] Computed 813 place invariants in 480 ms
[2022-05-16 23:30:15] [INFO ] [Real]Absence check using 58 positive place invariants in 121 ms returned sat
[2022-05-16 23:30:15] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 352 ms returned sat
[2022-05-16 23:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:30:19] [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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-16 23:30:20] [INFO ] [Real]Absence check using 58 positive place invariants in 108 ms returned sat
[2022-05-16 23:30:20] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 176 ms returned unsat
[2022-05-16 23:30:21] [INFO ] [Real]Absence check using 58 positive place invariants in 95 ms returned sat
[2022-05-16 23:30:21] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 287 ms returned sat
[2022-05-16 23:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:30:25] [INFO ] [Real]Absence check using state equation in 4105 ms returned unknown
[2022-05-16 23:30:26] [INFO ] [Real]Absence check using 58 positive place invariants in 96 ms returned sat
[2022-05-16 23:30:26] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 307 ms returned sat
[2022-05-16 23:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:30:30] [INFO ] [Real]Absence check using state equation in 4038 ms returned unknown
[2022-05-16 23:30:31] [INFO ] [Real]Absence check using 58 positive place invariants in 94 ms returned sat
[2022-05-16 23:30:31] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 176 ms returned unsat
[2022-05-16 23:30:32] [INFO ] [Real]Absence check using 58 positive place invariants in 99 ms returned sat
[2022-05-16 23:30:32] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 188 ms returned unsat
[2022-05-16 23:30:33] [INFO ] [Real]Absence check using 58 positive place invariants in 96 ms returned sat
[2022-05-16 23:30:33] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 172 ms returned unsat
[2022-05-16 23:30:34] [INFO ] [Real]Absence check using 58 positive place invariants in 102 ms returned sat
[2022-05-16 23:30:34] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 308 ms returned sat
[2022-05-16 23:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:30:38] [INFO ] [Real]Absence check using state equation in 4044 ms returned unknown
[2022-05-16 23:30:39] [INFO ] [Real]Absence check using 58 positive place invariants in 92 ms returned sat
[2022-05-16 23:30:39] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 186 ms returned unsat
[2022-05-16 23:30:39] [INFO ] [Real]Absence check using 58 positive place invariants in 95 ms returned sat
[2022-05-16 23:30:40] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 318 ms returned sat
[2022-05-16 23:30:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:30:44] [INFO ] [Real]Absence check using state equation in 4042 ms returned unknown
[2022-05-16 23:30:44] [INFO ] [Real]Absence check using 58 positive place invariants in 93 ms returned sat
[2022-05-16 23:30:45] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 185 ms returned unsat
[2022-05-16 23:30:45] [INFO ] [Real]Absence check using 58 positive place invariants in 101 ms returned sat
[2022-05-16 23:30:46] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 306 ms returned sat
[2022-05-16 23:30:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:30:50] [INFO ] [Real]Absence check using state equation in 4033 ms returned unknown
[2022-05-16 23:30:50] [INFO ] [Real]Absence check using 58 positive place invariants in 93 ms returned sat
[2022-05-16 23:30:51] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 179 ms returned unsat
[2022-05-16 23:30:51] [INFO ] [Real]Absence check using 58 positive place invariants in 93 ms returned sat
[2022-05-16 23:30:51] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 180 ms returned unsat
[2022-05-16 23:30:52] [INFO ] [Real]Absence check using 58 positive place invariants in 90 ms returned sat
[2022-05-16 23:30:52] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 178 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 75, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 7032 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7032/7032 places, 10855/10855 transitions.
Graph (complete) has 26261 edges and 7032 vertex of which 7000 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.36 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1200 place count 7000 transition count 9656
Reduce places removed 1199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2400 place count 5801 transition count 9655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2401 place count 5800 transition count 9655
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 2401 place count 5800 transition count 9555
Deduced a syphon composed of 100 places in 9 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 2601 place count 5700 transition count 9555
Discarding 1099 places :
Symmetric choice reduction at 3 with 1099 rule applications. Total rules 3700 place count 4601 transition count 8456
Iterating global reduction 3 with 1099 rules applied. Total rules applied 4799 place count 4601 transition count 8456
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4799 place count 4601 transition count 8453
Deduced a syphon composed of 3 places in 14 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 4805 place count 4598 transition count 8453
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 5354 place count 4049 transition count 7355
Iterating global reduction 3 with 549 rules applied. Total rules applied 5903 place count 4049 transition count 7355
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 5953 place count 4024 transition count 7330
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 3 with 336 rules applied. Total rules applied 6289 place count 4024 transition count 7543
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 3 with 336 rules applied. Total rules applied 6625 place count 3688 transition count 7543
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 6650 place count 3688 transition count 7543
Applied a total of 6650 rules in 4647 ms. Remains 3688 /7032 variables (removed 3344) and now considering 7543/10855 (removed 3312) transitions.
Finished structural reductions, in 1 iterations. Remains : 3688/7032 places, 7543/10855 transitions.
Normalized transition count is 6658 out of 7543 initially.
// Phase 1: matrix 6658 rows 3688 cols
[2022-05-16 23:30:57] [INFO ] Computed 781 place invariants in 215 ms
Incomplete random walk after 1000000 steps, including 76436 resets, run finished after 15628 ms. (steps per millisecond=63 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2809 ms. (steps per millisecond=355 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2818 ms. (steps per millisecond=354 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 9166 resets, run finished after 2806 ms. (steps per millisecond=356 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 9166 resets, run finished after 2784 ms. (steps per millisecond=359 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2790 ms. (steps per millisecond=358 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2789 ms. (steps per millisecond=358 ) properties (out of 6) seen :1
[2022-05-16 23:31:30] [INFO ] Flow matrix only has 6658 transitions (discarded 885 similar events)
// Phase 1: matrix 6658 rows 3688 cols
[2022-05-16 23:31:30] [INFO ] Computed 781 place invariants in 206 ms
[2022-05-16 23:31:30] [INFO ] [Real]Absence check using 49 positive place invariants in 88 ms returned sat
[2022-05-16 23:31:30] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 173 ms returned sat
[2022-05-16 23:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:31:33] [INFO ] [Real]Absence check using state equation in 2185 ms returned sat
[2022-05-16 23:31:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:31:33] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2022-05-16 23:31:33] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 162 ms returned sat
[2022-05-16 23:31:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:31:36] [INFO ] [Nat]Absence check using state equation in 2183 ms returned sat
[2022-05-16 23:31:36] [INFO ] State equation strengthened by 3227 read => feed constraints.
[2022-05-16 23:31:38] [INFO ] [Nat]Added 3227 Read/Feed constraints in 1943 ms returned unsat
[2022-05-16 23:31:38] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2022-05-16 23:31:38] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 173 ms returned sat
[2022-05-16 23:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:31:40] [INFO ] [Real]Absence check using state equation in 2273 ms returned sat
[2022-05-16 23:31:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:31:41] [INFO ] [Nat]Absence check using 49 positive place invariants in 87 ms returned sat
[2022-05-16 23:31:41] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 170 ms returned sat
[2022-05-16 23:31:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:31:44] [INFO ] [Nat]Absence check using state equation in 2288 ms returned sat
[2022-05-16 23:31:45] [INFO ] [Nat]Added 3227 Read/Feed constraints in 1312 ms returned unsat
[2022-05-16 23:31:45] [INFO ] [Real]Absence check using 49 positive place invariants in 65 ms returned sat
[2022-05-16 23:31:45] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 163 ms returned sat
[2022-05-16 23:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:31:48] [INFO ] [Real]Absence check using state equation in 2177 ms returned sat
[2022-05-16 23:31:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:31:48] [INFO ] [Nat]Absence check using 49 positive place invariants in 68 ms returned sat
[2022-05-16 23:31:48] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 156 ms returned sat
[2022-05-16 23:31:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:31:51] [INFO ] [Nat]Absence check using state equation in 2161 ms returned sat
[2022-05-16 23:31:52] [INFO ] [Nat]Added 3227 Read/Feed constraints in 1219 ms returned unsat
[2022-05-16 23:31:52] [INFO ] [Real]Absence check using 49 positive place invariants in 70 ms returned sat
[2022-05-16 23:31:52] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 22 ms returned unsat
[2022-05-16 23:31:52] [INFO ] [Real]Absence check using 49 positive place invariants in 72 ms returned sat
[2022-05-16 23:31:53] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 158 ms returned sat
[2022-05-16 23:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:31:55] [INFO ] [Real]Absence check using state equation in 2264 ms returned sat
[2022-05-16 23:31:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:31:55] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2022-05-16 23:31:56] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 156 ms returned sat
[2022-05-16 23:31:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:31:58] [INFO ] [Nat]Absence check using state equation in 2339 ms returned sat
[2022-05-16 23:31:59] [INFO ] [Nat]Added 3227 Read/Feed constraints in 1014 ms returned unsat
[2022-05-16 23:31:59] [INFO ] [Real]Absence check using 49 positive place invariants in 67 ms returned sat
[2022-05-16 23:32:00] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 159 ms returned sat
[2022-05-16 23:32:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:32:02] [INFO ] [Real]Absence check using state equation in 2212 ms returned sat
[2022-05-16 23:32:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:32:02] [INFO ] [Nat]Absence check using 49 positive place invariants in 69 ms returned sat
[2022-05-16 23:32:02] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 159 ms returned sat
[2022-05-16 23:32:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:32:05] [INFO ] [Nat]Absence check using state equation in 2195 ms returned sat
[2022-05-16 23:32:06] [INFO ] [Nat]Added 3227 Read/Feed constraints in 1509 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 0, 1, 0, 0] Max seen :[0, 0, 0, 1, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652743928374

--------------------
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-S24C02"
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-S24C02, 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-165271830400265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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