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.r132-tall-165271821300717.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 itstools
Input is MultiCrashLeafsetExtension-PT-S24C03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821300717
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.1M
-rw-r--r-- 1 mcc users 12K Apr 29 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 16:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 16:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 9 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 20K 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 8.8M 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-S24C03-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652840662908

Running Version 202205111006
[2022-05-18 02:24:24] [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-18 02:24:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 02:24:24] [INFO ] Load time of PNML (sax parser for PT used): 590 ms
[2022-05-18 02:24:24] [INFO ] Transformed 8390 places.
[2022-05-18 02:24:25] [INFO ] Transformed 12757 transitions.
[2022-05-18 02:24:25] [INFO ] Parsed PT model containing 8390 places and 12757 transitions in 1491 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Normalized transition count is 12157 out of 12757 initially.
// Phase 1: matrix 12157 rows 8390 cols
[2022-05-18 02:24:26] [INFO ] Computed 867 place invariants in 747 ms
Incomplete random walk after 10000 steps, including 318 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 57 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 58 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :1
[2022-05-18 02:24:27] [INFO ] Flow matrix only has 12157 transitions (discarded 600 similar events)
// Phase 1: matrix 12157 rows 8390 cols
[2022-05-18 02:24:27] [INFO ] Computed 867 place invariants in 549 ms
[2022-05-18 02:24:29] [INFO ] [Real]Absence check using 60 positive place invariants in 130 ms returned sat
[2022-05-18 02:24:29] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 162 ms returned unsat
[2022-05-18 02:24:30] [INFO ] [Real]Absence check using 60 positive place invariants in 122 ms returned sat
[2022-05-18 02:24:30] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 211 ms returned unsat
[2022-05-18 02:24:31] [INFO ] [Real]Absence check using 60 positive place invariants in 112 ms returned sat
[2022-05-18 02:24:31] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 366 ms returned sat
[2022-05-18 02:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:24:35] [INFO ] [Real]Absence check using state equation in 3747 ms returned unknown
[2022-05-18 02:24:36] [INFO ] [Real]Absence check using 60 positive place invariants in 116 ms returned sat
[2022-05-18 02:24:36] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 164 ms returned unsat
[2022-05-18 02:24:37] [INFO ] [Real]Absence check using 60 positive place invariants in 112 ms returned sat
[2022-05-18 02:24:37] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 384 ms returned sat
[2022-05-18 02:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:24:41] [INFO ] [Real]Absence check using state equation in 3824 ms returned unknown
[2022-05-18 02:24:42] [INFO ] [Real]Absence check using 60 positive place invariants in 129 ms returned sat
[2022-05-18 02:24:42] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 160 ms returned unsat
[2022-05-18 02:24:43] [INFO ] [Real]Absence check using 60 positive place invariants in 115 ms returned sat
[2022-05-18 02:24:43] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 376 ms returned sat
[2022-05-18 02:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:24:47] [INFO ] [Real]Absence check using state equation in 3804 ms returned unknown
[2022-05-18 02:24:48] [INFO ] [Real]Absence check using 60 positive place invariants in 101 ms returned sat
[2022-05-18 02:24:48] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 145 ms returned unsat
[2022-05-18 02:24:49] [INFO ] [Real]Absence check using 60 positive place invariants in 102 ms returned sat
[2022-05-18 02:24:49] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 356 ms returned sat
[2022-05-18 02:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:24:53] [INFO ] [Real]Absence check using state equation in 3750 ms returned unknown
[2022-05-18 02:24:54] [INFO ] [Real]Absence check using 60 positive place invariants in 110 ms returned sat
[2022-05-18 02:24:54] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 388 ms returned sat
[2022-05-18 02:24:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:24:58] [INFO ] [Real]Absence check using state equation in 3757 ms returned unknown
[2022-05-18 02:24:59] [INFO ] [Real]Absence check using 60 positive place invariants in 114 ms returned sat
[2022-05-18 02:24:59] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 361 ms returned sat
[2022-05-18 02:24:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:25:03] [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 10
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:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 02:25:04] [INFO ] [Real]Absence check using 60 positive place invariants in 103 ms returned sat
[2022-05-18 02:25:04] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 362 ms returned sat
[2022-05-18 02:25:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:25:08] [INFO ] [Real]Absence check using state equation in 3746 ms returned unknown
[2022-05-18 02:25:09] [INFO ] [Real]Absence check using 60 positive place invariants in 109 ms returned sat
[2022-05-18 02:25:09] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 343 ms returned sat
[2022-05-18 02:25:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:25:13] [INFO ] [Real]Absence check using state equation in 3757 ms returned unknown
[2022-05-18 02:25:14] [INFO ] [Real]Absence check using 60 positive place invariants in 118 ms returned sat
[2022-05-18 02:25:14] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 157 ms returned unsat
[2022-05-18 02:25:15] [INFO ] [Real]Absence check using 60 positive place invariants in 106 ms returned sat
[2022-05-18 02:25:15] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 358 ms returned sat
[2022-05-18 02:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:25:19] [INFO ] [Real]Absence check using state equation in 3763 ms returned unknown
[2022-05-18 02:25:20] [INFO ] [Real]Absence check using 60 positive place invariants in 100 ms returned sat
[2022-05-18 02:25:20] [INFO ] [Real]Absence check using 60 positive and 807 generalized place invariants in 350 ms returned sat
[2022-05-18 02:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:25:24] [INFO ] [Real]Absence check using state equation in 3848 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 25, 1, 25, 1, 1, 1, 1, 25, 1, 1, 1, 1, 1, 1] Max seen :[1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 8390 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8390/8390 places, 12757/12757 transitions.
Graph (complete) has 30079 edges and 8390 vertex of which 8356 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.38 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions removed 1797 transitions
Trivial Post-agglo rules discarded 1797 transitions
Performed 1797 trivial Post agglomeration. Transition count delta: 1797
Iterating post reduction 0 with 1797 rules applied. Total rules applied 1798 place count 8356 transition count 10960
Reduce places removed 1797 places and 0 transitions.
Iterating post reduction 1 with 1797 rules applied. Total rules applied 3595 place count 6559 transition count 10960
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 3595 place count 6559 transition count 10810
Deduced a syphon composed of 150 places in 8 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 3895 place count 6409 transition count 10810
Discarding 1647 places :
Symmetric choice reduction at 2 with 1647 rule applications. Total rules 5542 place count 4762 transition count 9163
Iterating global reduction 2 with 1647 rules applied. Total rules applied 7189 place count 4762 transition count 9163
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7189 place count 4762 transition count 9160
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 7195 place count 4759 transition count 9160
Discarding 547 places :
Symmetric choice reduction at 2 with 547 rule applications. Total rules 7742 place count 4212 transition count 7519
Iterating global reduction 2 with 547 rules applied. Total rules applied 8289 place count 4212 transition count 7519
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 2 with 50 rules applied. Total rules applied 8339 place count 4187 transition count 7494
Free-agglomeration rule (complex) applied 339 times.
Iterating global reduction 2 with 339 rules applied. Total rules applied 8678 place count 4187 transition count 8249
Reduce places removed 339 places and 0 transitions.
Iterating post reduction 2 with 339 rules applied. Total rules applied 9017 place count 3848 transition count 8249
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 3 with 75 rules applied. Total rules applied 9092 place count 3848 transition count 8249
Applied a total of 9092 rules in 4188 ms. Remains 3848 /8390 variables (removed 4542) and now considering 8249/12757 (removed 4508) transitions.
Finished structural reductions, in 1 iterations. Remains : 3848/8390 places, 8249/12757 transitions.
Normalized transition count is 7363 out of 8249 initially.
// Phase 1: matrix 7363 rows 3848 cols
[2022-05-18 02:25:29] [INFO ] Computed 833 place invariants in 222 ms
Incomplete random walk after 1000000 steps, including 52258 resets, run finished after 21600 ms. (steps per millisecond=46 ) properties (out of 10) seen :3
FORMULA MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6244 resets, run finished after 3408 ms. (steps per millisecond=293 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6244 resets, run finished after 3463 ms. (steps per millisecond=288 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6244 resets, run finished after 3425 ms. (steps per millisecond=291 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6244 resets, run finished after 3412 ms. (steps per millisecond=293 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6244 resets, run finished after 3434 ms. (steps per millisecond=291 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6244 resets, run finished after 3379 ms. (steps per millisecond=295 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6244 resets, run finished after 3359 ms. (steps per millisecond=297 ) properties (out of 7) seen :0
[2022-05-18 02:26:14] [INFO ] Flow matrix only has 7363 transitions (discarded 886 similar events)
// Phase 1: matrix 7363 rows 3848 cols
[2022-05-18 02:26:14] [INFO ] Computed 833 place invariants in 200 ms
[2022-05-18 02:26:15] [INFO ] [Real]Absence check using 49 positive place invariants in 76 ms returned sat
[2022-05-18 02:26:15] [INFO ] [Real]Absence check using 49 positive and 784 generalized place invariants in 187 ms returned sat
[2022-05-18 02:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:17] [INFO ] [Real]Absence check using state equation in 2478 ms returned sat
[2022-05-18 02:26:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:26:18] [INFO ] [Nat]Absence check using 49 positive place invariants in 89 ms returned sat
[2022-05-18 02:26:18] [INFO ] [Nat]Absence check using 49 positive and 784 generalized place invariants in 189 ms returned sat
[2022-05-18 02:26:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:21] [INFO ] [Nat]Absence check using state equation in 2682 ms returned sat
[2022-05-18 02:26:21] [INFO ] State equation strengthened by 3802 read => feed constraints.
[2022-05-18 02:26:22] [INFO ] [Nat]Added 3802 Read/Feed constraints in 628 ms returned unsat
[2022-05-18 02:26:22] [INFO ] [Real]Absence check using 49 positive place invariants in 83 ms returned sat
[2022-05-18 02:26:22] [INFO ] [Real]Absence check using 49 positive and 784 generalized place invariants in 173 ms returned sat
[2022-05-18 02:26:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:25] [INFO ] [Real]Absence check using state equation in 2631 ms returned sat
[2022-05-18 02:26:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:26:26] [INFO ] [Nat]Absence check using 49 positive place invariants in 73 ms returned sat
[2022-05-18 02:26:26] [INFO ] [Nat]Absence check using 49 positive and 784 generalized place invariants in 189 ms returned sat
[2022-05-18 02:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:28] [INFO ] [Nat]Absence check using state equation in 2746 ms returned sat
[2022-05-18 02:26:30] [INFO ] [Nat]Added 3802 Read/Feed constraints in 1219 ms returned unsat
[2022-05-18 02:26:30] [INFO ] [Real]Absence check using 49 positive place invariants in 72 ms returned sat
[2022-05-18 02:26:30] [INFO ] [Real]Absence check using 49 positive and 784 generalized place invariants in 183 ms returned sat
[2022-05-18 02:26:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:33] [INFO ] [Real]Absence check using state equation in 2622 ms returned sat
[2022-05-18 02:26:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:26:34] [INFO ] [Nat]Absence check using 49 positive place invariants in 68 ms returned sat
[2022-05-18 02:26:34] [INFO ] [Nat]Absence check using 49 positive and 784 generalized place invariants in 186 ms returned sat
[2022-05-18 02:26:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:36] [INFO ] [Nat]Absence check using state equation in 2698 ms returned sat
[2022-05-18 02:26:38] [INFO ] [Nat]Added 3802 Read/Feed constraints in 1136 ms returned unsat
[2022-05-18 02:26:38] [INFO ] [Real]Absence check using 49 positive place invariants in 74 ms returned sat
[2022-05-18 02:26:38] [INFO ] [Real]Absence check using 49 positive and 784 generalized place invariants in 185 ms returned sat
[2022-05-18 02:26:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:41] [INFO ] [Real]Absence check using state equation in 2568 ms returned sat
[2022-05-18 02:26:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:26:41] [INFO ] [Nat]Absence check using 49 positive place invariants in 70 ms returned sat
[2022-05-18 02:26:42] [INFO ] [Nat]Absence check using 49 positive and 784 generalized place invariants in 187 ms returned sat
[2022-05-18 02:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:44] [INFO ] [Nat]Absence check using state equation in 2891 ms returned sat
[2022-05-18 02:26:45] [INFO ] [Nat]Added 3802 Read/Feed constraints in 544 ms returned unsat
[2022-05-18 02:26:45] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2022-05-18 02:26:46] [INFO ] [Real]Absence check using 49 positive and 784 generalized place invariants in 187 ms returned sat
[2022-05-18 02:26:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:48] [INFO ] [Real]Absence check using state equation in 2542 ms returned sat
[2022-05-18 02:26:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:26:49] [INFO ] [Nat]Absence check using 49 positive place invariants in 67 ms returned sat
[2022-05-18 02:26:49] [INFO ] [Nat]Absence check using 49 positive and 784 generalized place invariants in 172 ms returned sat
[2022-05-18 02:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:51] [INFO ] [Nat]Absence check using state equation in 2529 ms returned sat
[2022-05-18 02:26:52] [INFO ] [Nat]Added 3802 Read/Feed constraints in 902 ms returned unsat
[2022-05-18 02:26:53] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2022-05-18 02:26:53] [INFO ] [Real]Absence check using 49 positive and 784 generalized place invariants in 188 ms returned sat
[2022-05-18 02:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:56] [INFO ] [Real]Absence check using state equation in 2555 ms returned sat
[2022-05-18 02:26:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:26:56] [INFO ] [Nat]Absence check using 49 positive place invariants in 70 ms returned sat
[2022-05-18 02:26:56] [INFO ] [Nat]Absence check using 49 positive and 784 generalized place invariants in 186 ms returned sat
[2022-05-18 02:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:59] [INFO ] [Nat]Absence check using state equation in 2727 ms returned sat
[2022-05-18 02:27:00] [INFO ] [Nat]Added 3802 Read/Feed constraints in 989 ms returned unsat
[2022-05-18 02:27:00] [INFO ] [Real]Absence check using 49 positive place invariants in 75 ms returned sat
[2022-05-18 02:27:01] [INFO ] [Real]Absence check using 49 positive and 784 generalized place invariants in 180 ms returned sat
[2022-05-18 02:27:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:27:03] [INFO ] [Real]Absence check using state equation in 2551 ms returned sat
[2022-05-18 02:27:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:27:04] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2022-05-18 02:27:04] [INFO ] [Nat]Absence check using 49 positive and 784 generalized place invariants in 174 ms returned sat
[2022-05-18 02:27:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:27:07] [INFO ] [Nat]Absence check using state equation in 2548 ms returned sat
[2022-05-18 02:27:08] [INFO ] [Nat]Added 3802 Read/Feed constraints in 1547 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-S24C03-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C03-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 164606 ms.

BK_STOP 1652840828698

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-S24C03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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