Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696000605.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BusinessProcesses-PT-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000605
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 192K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678735708470

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:28:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 19:28:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:28:30] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-13 19:28:30] [INFO ] Transformed 782 places.
[2023-03-13 19:28:30] [INFO ] Transformed 697 transitions.
[2023-03-13 19:28:30] [INFO ] Found NUPN structural information;
[2023-03-13 19:28:30] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 63 places in 14 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 638 rows 719 cols
[2023-03-13 19:28:30] [INFO ] Computed 121 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 52 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 15) seen :11
FORMULA BusinessProcesses-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
[2023-03-13 19:28:31] [INFO ] Invariant cache hit.
[2023-03-13 19:28:31] [INFO ] [Real]Absence check using 78 positive place invariants in 31 ms returned sat
[2023-03-13 19:28:31] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2023-03-13 19:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 19:28:31] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2023-03-13 19:28:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 19:28:32] [INFO ] [Nat]Absence check using 78 positive place invariants in 32 ms returned sat
[2023-03-13 19:28:32] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-13 19:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 19:28:32] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2023-03-13 19:28:32] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 9 ms to minimize.
[2023-03-13 19:28:32] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 1 ms to minimize.
[2023-03-13 19:28:32] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 1 ms to minimize.
[2023-03-13 19:28:32] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 0 ms to minimize.
[2023-03-13 19:28:33] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2023-03-13 19:28:33] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2023-03-13 19:28:33] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 1 ms to minimize.
[2023-03-13 19:28:33] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2023-03-13 19:28:33] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 1 ms to minimize.
[2023-03-13 19:28:33] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 0 ms to minimize.
[2023-03-13 19:28:34] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2023-03-13 19:28:34] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 0 ms to minimize.
[2023-03-13 19:28:34] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2003 ms
[2023-03-13 19:28:34] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 55 ms.
[2023-03-13 19:28:36] [INFO ] Added : 320 causal constraints over 64 iterations in 2571 ms. Result :unknown
[2023-03-13 19:28:37] [INFO ] [Real]Absence check using 78 positive place invariants in 30 ms returned sat
[2023-03-13 19:28:37] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-13 19:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 19:28:37] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2023-03-13 19:28:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 19:28:37] [INFO ] [Nat]Absence check using 78 positive place invariants in 33 ms returned sat
[2023-03-13 19:28:37] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-13 19:28:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 19:28:37] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-03-13 19:28:38] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 1 ms to minimize.
[2023-03-13 19:28:38] [INFO ] Deduced a trap composed of 148 places in 218 ms of which 1 ms to minimize.
[2023-03-13 19:28:38] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 0 ms to minimize.
[2023-03-13 19:28:38] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 1 ms to minimize.
[2023-03-13 19:28:39] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
[2023-03-13 19:28:39] [INFO ] Deduced a trap composed of 149 places in 208 ms of which 1 ms to minimize.
[2023-03-13 19:28:39] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 1 ms to minimize.
[2023-03-13 19:28:39] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 1 ms to minimize.
[2023-03-13 19:28:40] [INFO ] Deduced a trap composed of 146 places in 202 ms of which 0 ms to minimize.
[2023-03-13 19:28:40] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 0 ms to minimize.
[2023-03-13 19:28:40] [INFO ] Deduced a trap composed of 172 places in 259 ms of which 1 ms to minimize.
[2023-03-13 19:28:40] [INFO ] Deduced a trap composed of 175 places in 352 ms of which 1 ms to minimize.
[2023-03-13 19:28:41] [INFO ] Deduced a trap composed of 157 places in 204 ms of which 1 ms to minimize.
[2023-03-13 19:28:41] [INFO ] Deduced a trap composed of 153 places in 176 ms of which 1 ms to minimize.
[2023-03-13 19:28:41] [INFO ] Deduced a trap composed of 165 places in 168 ms of which 0 ms to minimize.
[2023-03-13 19:28:41] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3764 ms
[2023-03-13 19:28:41] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 48 ms.
[2023-03-13 19:28:42] [INFO ] Deduced a trap composed of 11 places in 417 ms of which 1 ms to minimize.
[2023-03-13 19:28:42] [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 1
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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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-03-13 19:28:43] [INFO ] [Real]Absence check using 78 positive place invariants in 31 ms returned sat
[2023-03-13 19:28:43] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-13 19:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 19:28:43] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2023-03-13 19:28:43] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 1 ms to minimize.
[2023-03-13 19:28:43] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 0 ms to minimize.
[2023-03-13 19:28:44] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 1 ms to minimize.
[2023-03-13 19:28:44] [INFO ] Deduced a trap composed of 155 places in 223 ms of which 1 ms to minimize.
[2023-03-13 19:28:44] [INFO ] Deduced a trap composed of 138 places in 207 ms of which 0 ms to minimize.
[2023-03-13 19:28:44] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 3 ms to minimize.
[2023-03-13 19:28:45] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 1 ms to minimize.
[2023-03-13 19:28:45] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 1 ms to minimize.
[2023-03-13 19:28:45] [INFO ] Deduced a trap composed of 149 places in 226 ms of which 0 ms to minimize.
[2023-03-13 19:28:45] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 1 ms to minimize.
[2023-03-13 19:28:46] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 1 ms to minimize.
[2023-03-13 19:28:46] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 1 ms to minimize.
[2023-03-13 19:28:46] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 1 ms to minimize.
[2023-03-13 19:28:46] [INFO ] Deduced a trap composed of 139 places in 188 ms of which 1 ms to minimize.
[2023-03-13 19:28:47] [INFO ] Deduced a trap composed of 136 places in 195 ms of which 1 ms to minimize.
[2023-03-13 19:28:47] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 1 ms to minimize.
[2023-03-13 19:28:47] [INFO ] Deduced a trap composed of 146 places in 227 ms of which 0 ms to minimize.
[2023-03-13 19:28:47] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 1 ms to minimize.
[2023-03-13 19:28:48] [INFO ] Deduced a trap composed of 145 places in 244 ms of which 1 ms to minimize.
[2023-03-13 19:28:48] [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 2
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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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-03-13 19:28:48] [INFO ] [Real]Absence check using 78 positive place invariants in 24 ms returned sat
[2023-03-13 19:28:48] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2023-03-13 19:28:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 19:28:48] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2023-03-13 19:28:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 19:28:48] [INFO ] [Nat]Absence check using 78 positive place invariants in 36 ms returned sat
[2023-03-13 19:28:48] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 14 ms returned sat
[2023-03-13 19:28:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 19:28:48] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2023-03-13 19:28:49] [INFO ] Deduced a trap composed of 8 places in 274 ms of which 1 ms to minimize.
[2023-03-13 19:28:49] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 0 ms to minimize.
[2023-03-13 19:28:49] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2023-03-13 19:28:50] [INFO ] Deduced a trap composed of 41 places in 296 ms of which 2 ms to minimize.
[2023-03-13 19:28:50] [INFO ] Deduced a trap composed of 148 places in 289 ms of which 1 ms to minimize.
[2023-03-13 19:28:50] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 1 ms to minimize.
[2023-03-13 19:28:50] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 1 ms to minimize.
[2023-03-13 19:28:51] [INFO ] Deduced a trap composed of 138 places in 274 ms of which 0 ms to minimize.
[2023-03-13 19:28:51] [INFO ] Deduced a trap composed of 153 places in 242 ms of which 4 ms to minimize.
[2023-03-13 19:28:51] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 1 ms to minimize.
[2023-03-13 19:28:52] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 1 ms to minimize.
[2023-03-13 19:28:52] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 1 ms to minimize.
[2023-03-13 19:28:52] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 0 ms to minimize.
[2023-03-13 19:28:52] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 1 ms to minimize.
[2023-03-13 19:28:52] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 0 ms to minimize.
[2023-03-13 19:28:53] [INFO ] Deduced a trap composed of 126 places in 162 ms of which 1 ms to minimize.
[2023-03-13 19:28:53] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 1 ms to minimize.
[2023-03-13 19:28:53] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 4 ms to minimize.
[2023-03-13 19:28:53] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2023-03-13 19:28:53] [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 3
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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 411 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 713 vertex of which 686 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.3 ms
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 167 rules applied. Total rules applied 169 place count 686 transition count 450
Reduce places removed 167 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 169 rules applied. Total rules applied 338 place count 519 transition count 448
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 340 place count 517 transition count 448
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 340 place count 517 transition count 345
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 227 rules applied. Total rules applied 567 place count 393 transition count 345
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 657 place count 303 transition count 255
Iterating global reduction 3 with 90 rules applied. Total rules applied 747 place count 303 transition count 255
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 747 place count 303 transition count 246
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 767 place count 292 transition count 246
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 977 place count 186 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 981 place count 184 transition count 149
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 983 place count 184 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 985 place count 182 transition count 147
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 986 place count 182 transition count 147
Applied a total of 986 rules in 169 ms. Remains 182 /719 variables (removed 537) and now considering 147/638 (removed 491) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 182/719 places, 147/638 transitions.
Normalized transition count is 146 out of 147 initially.
// Phase 1: matrix 146 rows 182 cols
[2023-03-13 19:28:53] [INFO ] Computed 82 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 52802 resets, run finished after 3830 ms. (steps per millisecond=261 ) properties (out of 4) seen :4
FORMULA BusinessProcesses-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 27236 ms.
ITS solved all properties within timeout

BK_STOP 1678735737969

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="BusinessProcesses-PT-20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BusinessProcesses-PT-20, 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 r042-tajo-167813696000605"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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