Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 753K Mar 31 16:48 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 EisenbergMcGuire-PT-06-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680811586905

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-06
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 20:06:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-06 20:06:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 20:06:28] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-04-06 20:06:28] [INFO ] Transformed 414 places.
[2023-04-06 20:06:28] [INFO ] Transformed 1296 transitions.
[2023-04-06 20:06:28] [INFO ] Found NUPN structural information;
[2023-04-06 20:06:28] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 702 out of 1296 initially.
// Phase 1: matrix 702 rows 414 cols
[2023-04-06 20:06:28] [INFO ] Computed 19 invariants in 27 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :12
FORMULA EisenbergMcGuire-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
[2023-04-06 20:06:29] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
// Phase 1: matrix 702 rows 414 cols
[2023-04-06 20:06:29] [INFO ] Computed 19 invariants in 5 ms
[2023-04-06 20:06:29] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-04-06 20:06:29] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:06:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 20:06:29] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-04-06 20:06:29] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 20:06:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-06 20:06:29] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:06:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 20:06:29] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2023-04-06 20:06:29] [INFO ] State equation strengthened by 314 read => feed constraints.
[2023-04-06 20:06:29] [INFO ] [Nat]Added 314 Read/Feed constraints in 42 ms returned sat
[2023-04-06 20:06:30] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 4 ms to minimize.
[2023-04-06 20:06:30] [INFO ] Deduced a trap composed of 60 places in 189 ms of which 0 ms to minimize.
[2023-04-06 20:06:30] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 1 ms to minimize.
[2023-04-06 20:06:30] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2023-04-06 20:06:30] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 1 ms to minimize.
[2023-04-06 20:06:31] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 1 ms to minimize.
[2023-04-06 20:06:31] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2023-04-06 20:06:31] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 1 ms to minimize.
[2023-04-06 20:06:31] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 0 ms to minimize.
[2023-04-06 20:06:31] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2023-04-06 20:06:31] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 0 ms to minimize.
[2023-04-06 20:06:31] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-04-06 20:06:32] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2023-04-06 20:06:32] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2023-04-06 20:06:32] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-04-06 20:06:32] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2264 ms
[2023-04-06 20:06:32] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 60 ms.
[2023-04-06 20:06:34] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 0 ms to minimize.
[2023-04-06 20:06:34] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-06 20:06:34] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-06 20:06:34] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 20:06:35] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2023-04-06 20:06:35] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 20:06:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-04-06 20:06:35] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 20:06:35] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-04-06 20:06:35] [INFO ] [Nat]Added 314 Read/Feed constraints in 33 ms returned sat
[2023-04-06 20:06:35] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 2 ms to minimize.
[2023-04-06 20:06:35] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 0 ms to minimize.
[2023-04-06 20:06:35] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 0 ms to minimize.
[2023-04-06 20:06:36] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2023-04-06 20:06:36] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 0 ms to minimize.
[2023-04-06 20:06:36] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2023-04-06 20:06:36] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2023-04-06 20:06:36] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-06 20:06:36] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 0 ms to minimize.
[2023-04-06 20:06:36] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 20:06:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1378 ms
[2023-04-06 20:06:36] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 68 ms.
[2023-04-06 20:06:38] [INFO ] Added : 250 causal constraints over 50 iterations in 2292 ms. Result :sat
Minimization took 138 ms.
[2023-04-06 20:06:39] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-06 20:06:39] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:06:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 20:06:39] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2023-04-06 20:06:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 20:06:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-06 20:06:39] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 20:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 20:06:39] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2023-04-06 20:06:39] [INFO ] [Nat]Added 314 Read/Feed constraints in 33 ms returned sat
[2023-04-06 20:06:39] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-04-06 20:06:39] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 0 ms to minimize.
[2023-04-06 20:06:40] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 0 ms to minimize.
[2023-04-06 20:06:40] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 0 ms to minimize.
[2023-04-06 20:06:40] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 0 ms to minimize.
[2023-04-06 20:06:40] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 0 ms to minimize.
[2023-04-06 20:06:40] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2023-04-06 20:06:40] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2023-04-06 20:06:41] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2023-04-06 20:06:41] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2023-04-06 20:06:41] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2023-04-06 20:06:41] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 20:06:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1633 ms
[2023-04-06 20:06:41] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 45 ms.
[2023-04-06 20:06:44] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 1 ms to minimize.
[2023-04-06 20:06:44] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 0 ms to minimize.
[2023-04-06 20:06:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 423 ms
[2023-04-06 20:06:44] [INFO ] Added : 285 causal constraints over 58 iterations in 3112 ms. Result :unknown
[2023-04-06 20:06:44] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-06 20:06:44] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:06:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 20:06:44] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-04-06 20:06:44] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 20:06:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-06 20:06:44] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 20:06:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 20:06:44] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2023-04-06 20:06:44] [INFO ] [Nat]Added 314 Read/Feed constraints in 36 ms returned sat
[2023-04-06 20:06:45] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2023-04-06 20:06:45] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 0 ms to minimize.
[2023-04-06 20:06:45] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 0 ms to minimize.
[2023-04-06 20:06:45] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2023-04-06 20:06:45] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-06 20:06:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 541 ms
[2023-04-06 20:06:45] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 49 ms.
[2023-04-06 20:06:47] [INFO ] Added : 179 causal constraints over 36 iterations in 1569 ms. Result :sat
Minimization took 126 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 19054 ms.
ITS solved all properties within timeout

BK_STOP 1680811608575

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is EisenbergMcGuire-PT-06, 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 r523-tall-167987247800245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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