Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 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-11-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716651004696

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 15:30:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:30:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:30:07] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-25 15:30:07] [INFO ] Transformed 567 places.
[2024-05-25 15:30:07] [INFO ] Transformed 508 transitions.
[2024-05-25 15:30:07] [INFO ] Found NUPN structural information;
[2024-05-25 15:30:07] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 7 places in 17 ms
Reduce places removed 7 places and 7 transitions.
// Phase 1: matrix 501 rows 560 cols
[2024-05-25 15:30:07] [INFO ] Computed 95 invariants in 55 ms
Incomplete random walk after 10000 steps, including 75 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 16) seen :9
FORMULA BusinessProcesses-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
[2024-05-25 15:30:08] [INFO ] Invariant cache hit.
[2024-05-25 15:30:08] [INFO ] [Real]Absence check using 53 positive place invariants in 41 ms returned sat
[2024-05-25 15:30:08] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 22 ms returned sat
[2024-05-25 15:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:08] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2024-05-25 15:30:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:30:09] [INFO ] [Nat]Absence check using 53 positive place invariants in 35 ms returned sat
[2024-05-25 15:30:09] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2024-05-25 15:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:09] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2024-05-25 15:30:10] [INFO ] Deduced a trap composed of 8 places in 506 ms of which 3 ms to minimize.
[2024-05-25 15:30:10] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 1 ms to minimize.
[2024-05-25 15:30:10] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 1 ms to minimize.
[2024-05-25 15:30:10] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2024-05-25 15:30:11] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 16 ms to minimize.
[2024-05-25 15:30:11] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 1 ms to minimize.
[2024-05-25 15:30:11] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 12 ms to minimize.
[2024-05-25 15:30:11] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 1 ms to minimize.
[2024-05-25 15:30:12] [INFO ] Deduced a trap composed of 111 places in 303 ms of which 0 ms to minimize.
[2024-05-25 15:30:12] [INFO ] Deduced a trap composed of 119 places in 160 ms of which 0 ms to minimize.
[2024-05-25 15:30:12] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 0 ms to minimize.
[2024-05-25 15:30:12] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 0 ms to minimize.
[2024-05-25 15:30:12] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:30:12] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:30:13] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 9 ms to minimize.
[2024-05-25 15:30:13] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:30:13] [INFO ] Deduced a trap composed of 63 places in 271 ms of which 1 ms to minimize.
[2024-05-25 15:30:13] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 27 ms to minimize.
[2024-05-25 15:30:13] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 1 ms to minimize.
[2024-05-25 15:30:14] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 1 ms to minimize.
[2024-05-25 15:30:14] [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.verifyPossible(DeadlockTester.java:919)
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)
[2024-05-25 15:30:14] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2024-05-25 15:30:14] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2024-05-25 15:30:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:14] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-25 15:30:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:30:14] [INFO ] [Nat]Absence check using 53 positive place invariants in 15 ms returned sat
[2024-05-25 15:30:14] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 43 ms returned sat
[2024-05-25 15:30:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:14] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-25 15:30:14] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2024-05-25 15:30:15] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 1 ms to minimize.
[2024-05-25 15:30:15] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 0 ms to minimize.
[2024-05-25 15:30:15] [INFO ] Deduced a trap composed of 102 places in 161 ms of which 1 ms to minimize.
[2024-05-25 15:30:15] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 5 ms to minimize.
[2024-05-25 15:30:15] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 0 ms to minimize.
[2024-05-25 15:30:16] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 0 ms to minimize.
[2024-05-25 15:30:16] [INFO ] Deduced a trap composed of 112 places in 138 ms of which 0 ms to minimize.
[2024-05-25 15:30:16] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2024-05-25 15:30:16] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 1 ms to minimize.
[2024-05-25 15:30:16] [INFO ] Deduced a trap composed of 111 places in 149 ms of which 0 ms to minimize.
[2024-05-25 15:30:16] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:30:17] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:30:17] [INFO ] Deduced a trap composed of 105 places in 140 ms of which 4 ms to minimize.
[2024-05-25 15:30:17] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 1 ms to minimize.
[2024-05-25 15:30:17] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 0 ms to minimize.
[2024-05-25 15:30:17] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 0 ms to minimize.
[2024-05-25 15:30:17] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 0 ms to minimize.
[2024-05-25 15:30:18] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 1 ms to minimize.
[2024-05-25 15:30:18] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2024-05-25 15:30:18] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 0 ms to minimize.
[2024-05-25 15:30:18] [INFO ] Deduced a trap composed of 113 places in 139 ms of which 1 ms to minimize.
[2024-05-25 15:30:18] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 1 ms to minimize.
[2024-05-25 15:30:18] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 1 ms to minimize.
[2024-05-25 15:30:19] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 0 ms to minimize.
[2024-05-25 15:30:19] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:30:19] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 0 ms to minimize.
[2024-05-25 15:30:19] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 1 ms to minimize.
[2024-05-25 15:30:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
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)
[2024-05-25 15:30:19] [INFO ] [Real]Absence check using 53 positive place invariants in 18 ms returned sat
[2024-05-25 15:30:19] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2024-05-25 15:30:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:19] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-25 15:30:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:30:19] [INFO ] [Nat]Absence check using 53 positive place invariants in 17 ms returned sat
[2024-05-25 15:30:20] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2024-05-25 15:30:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:20] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-25 15:30:20] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 0 ms to minimize.
[2024-05-25 15:30:20] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 0 ms to minimize.
[2024-05-25 15:30:20] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 13 ms to minimize.
[2024-05-25 15:30:20] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 19 ms to minimize.
[2024-05-25 15:30:21] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 1 ms to minimize.
[2024-05-25 15:30:21] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:30:21] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 1 ms to minimize.
[2024-05-25 15:30:21] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 9 ms to minimize.
[2024-05-25 15:30:21] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 0 ms to minimize.
[2024-05-25 15:30:21] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 0 ms to minimize.
[2024-05-25 15:30:22] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 0 ms to minimize.
[2024-05-25 15:30:22] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:30:22] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 1 ms to minimize.
[2024-05-25 15:30:22] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 0 ms to minimize.
[2024-05-25 15:30:22] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2024-05-25 15:30:22] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 1 ms to minimize.
[2024-05-25 15:30:23] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 13 ms to minimize.
[2024-05-25 15:30:23] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 1 ms to minimize.
[2024-05-25 15:30:23] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:30:23] [INFO ] Deduced a trap composed of 133 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:30:23] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-05-25 15:30:23] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2024-05-25 15:30:23] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2024-05-25 15:30:24] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2024-05-25 15:30:24] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 0 ms to minimize.
[2024-05-25 15:30:24] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 0 ms to minimize.
[2024-05-25 15:30:24] [INFO ] Deduced a trap composed of 130 places in 141 ms of which 1 ms to minimize.
[2024-05-25 15:30:24] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 0 ms to minimize.
[2024-05-25 15:30:24] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:30:24] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 1 ms to minimize.
[2024-05-25 15:30:24] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
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)
[2024-05-25 15:30:25] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2024-05-25 15:30:25] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2024-05-25 15:30:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:25] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-25 15:30:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:30:25] [INFO ] [Nat]Absence check using 53 positive place invariants in 16 ms returned sat
[2024-05-25 15:30:25] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 16 ms returned sat
[2024-05-25 15:30:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:25] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-25 15:30:25] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:30:25] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 1 ms to minimize.
[2024-05-25 15:30:25] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 1 ms to minimize.
[2024-05-25 15:30:26] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 0 ms to minimize.
[2024-05-25 15:30:26] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 0 ms to minimize.
[2024-05-25 15:30:26] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2024-05-25 15:30:26] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:30:26] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 0 ms to minimize.
[2024-05-25 15:30:26] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 0 ms to minimize.
[2024-05-25 15:30:27] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:30:27] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 0 ms to minimize.
[2024-05-25 15:30:27] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:30:27] [INFO ] Deduced a trap composed of 109 places in 132 ms of which 0 ms to minimize.
[2024-05-25 15:30:27] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 1 ms to minimize.
[2024-05-25 15:30:27] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2024-05-25 15:30:27] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 0 ms to minimize.
[2024-05-25 15:30:28] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2024-05-25 15:30:28] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 0 ms to minimize.
[2024-05-25 15:30:28] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 1 ms to minimize.
[2024-05-25 15:30:28] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:30:28] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2024-05-25 15:30:28] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 1 ms to minimize.
[2024-05-25 15:30:29] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:30:29] [INFO ] Deduced a trap composed of 126 places in 120 ms of which 0 ms to minimize.
[2024-05-25 15:30:29] [INFO ] Deduced a trap composed of 127 places in 127 ms of which 0 ms to minimize.
[2024-05-25 15:30:29] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 0 ms to minimize.
[2024-05-25 15:30:29] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 1 ms to minimize.
[2024-05-25 15:30:29] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 0 ms to minimize.
[2024-05-25 15:30:30] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:30:30] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
[2024-05-25 15:30:30] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 1 ms to minimize.
[2024-05-25 15:30:30] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
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)
[2024-05-25 15:30:30] [INFO ] [Real]Absence check using 53 positive place invariants in 40 ms returned sat
[2024-05-25 15:30:30] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 19 ms returned sat
[2024-05-25 15:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:30] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2024-05-25 15:30:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:30:30] [INFO ] [Nat]Absence check using 53 positive place invariants in 15 ms returned sat
[2024-05-25 15:30:30] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2024-05-25 15:30:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:30] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-25 15:30:31] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2024-05-25 15:30:31] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2024-05-25 15:30:31] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 0 ms to minimize.
[2024-05-25 15:30:31] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2024-05-25 15:30:31] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2024-05-25 15:30:31] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-25 15:30:31] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:30:31] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-25 15:30:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1040 ms
[2024-05-25 15:30:32] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 33 ms.
[2024-05-25 15:30:33] [INFO ] Added : 190 causal constraints over 38 iterations in 1166 ms. Result :sat
Minimization took 104 ms.
[2024-05-25 15:30:33] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2024-05-25 15:30:33] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2024-05-25 15:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:33] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-25 15:30:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:30:33] [INFO ] [Nat]Absence check using 53 positive place invariants in 15 ms returned sat
[2024-05-25 15:30:33] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2024-05-25 15:30:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:33] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-25 15:30:33] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2024-05-25 15:30:34] [INFO ] Deduced a trap composed of 103 places in 152 ms of which 1 ms to minimize.
[2024-05-25 15:30:34] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2024-05-25 15:30:34] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 0 ms to minimize.
[2024-05-25 15:30:34] [INFO ] Deduced a trap composed of 114 places in 143 ms of which 0 ms to minimize.
[2024-05-25 15:30:34] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 1 ms to minimize.
[2024-05-25 15:30:35] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 1 ms to minimize.
[2024-05-25 15:30:35] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:30:35] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 0 ms to minimize.
[2024-05-25 15:30:35] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 0 ms to minimize.
[2024-05-25 15:30:35] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:30:35] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 1 ms to minimize.
[2024-05-25 15:30:35] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 0 ms to minimize.
[2024-05-25 15:30:36] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 0 ms to minimize.
[2024-05-25 15:30:36] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 0 ms to minimize.
[2024-05-25 15:30:36] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 0 ms to minimize.
[2024-05-25 15:30:36] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 0 ms to minimize.
[2024-05-25 15:30:36] [INFO ] Deduced a trap composed of 141 places in 122 ms of which 0 ms to minimize.
[2024-05-25 15:30:36] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:30:37] [INFO ] Deduced a trap composed of 138 places in 122 ms of which 1 ms to minimize.
[2024-05-25 15:30:37] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3234 ms
[2024-05-25 15:30:37] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 52 ms.
[2024-05-25 15:30:38] [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 5
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.refineWithCausalOrder(DeadlockTester.java:1189)
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)
[2024-05-25 15:30:38] [INFO ] [Real]Absence check using 53 positive place invariants in 15 ms returned sat
[2024-05-25 15:30:38] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 12 ms returned sat
[2024-05-25 15:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:38] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-25 15:30:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:30:38] [INFO ] [Nat]Absence check using 53 positive place invariants in 17 ms returned sat
[2024-05-25 15:30:38] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2024-05-25 15:30:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:39] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-25 15:30:39] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 0 ms to minimize.
[2024-05-25 15:30:39] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:30:39] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 0 ms to minimize.
[2024-05-25 15:30:39] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 0 ms to minimize.
[2024-05-25 15:30:39] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 10 ms to minimize.
[2024-05-25 15:30:40] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2024-05-25 15:30:40] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:30:40] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2024-05-25 15:30:40] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 1 ms to minimize.
[2024-05-25 15:30:40] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2024-05-25 15:30:40] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 0 ms to minimize.
[2024-05-25 15:30:41] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2024-05-25 15:30:41] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 1 ms to minimize.
[2024-05-25 15:30:41] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 0 ms to minimize.
[2024-05-25 15:30:41] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 0 ms to minimize.
[2024-05-25 15:30:41] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 0 ms to minimize.
[2024-05-25 15:30:41] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2024-05-25 15:30:41] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:30:42] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 1 ms to minimize.
[2024-05-25 15:30:42] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
[2024-05-25 15:30:42] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 0 ms to minimize.
[2024-05-25 15:30:42] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 1 ms to minimize.
[2024-05-25 15:30:42] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 0 ms to minimize.
[2024-05-25 15:30:42] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 0 ms to minimize.
[2024-05-25 15:30:43] [INFO ] Deduced a trap composed of 105 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:30:43] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:30:43] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 0 ms to minimize.
[2024-05-25 15:30:43] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 0 ms to minimize.
[2024-05-25 15:30:43] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2024-05-25 15:30:43] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 0 ms to minimize.
[2024-05-25 15:30:43] [INFO ] Trap strengthening (SAT) tested/added 30/30 trap constraints in 4752 ms
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 308 edges and 560 vertex of which 7 / 560 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1132 edges and 554 vertex of which 549 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 120 place count 549 transition count 374
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 238 place count 431 transition count 374
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 238 place count 431 transition count 284
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 197 rules applied. Total rules applied 435 place count 324 transition count 284
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 500 place count 259 transition count 219
Iterating global reduction 2 with 65 rules applied. Total rules applied 565 place count 259 transition count 219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 565 place count 259 transition count 216
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 571 place count 256 transition count 216
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 177 rules applied. Total rules applied 748 place count 166 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 750 place count 165 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 752 place count 165 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 754 place count 163 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 755 place count 163 transition count 131
Applied a total of 755 rules in 213 ms. Remains 163 /560 variables (removed 397) and now considering 131/501 (removed 370) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 163/560 places, 131/501 transitions.
// Phase 1: matrix 131 rows 163 cols
[2024-05-25 15:30:44] [INFO ] Computed 71 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 54042 resets, run finished after 2841 ms. (steps per millisecond=351 ) properties (out of 6) seen :5
FORMULA BusinessProcesses-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 27727 resets, run finished after 1717 ms. (steps per millisecond=582 ) properties (out of 1) seen :0
[2024-05-25 15:30:48] [INFO ] Invariant cache hit.
[2024-05-25 15:30:48] [INFO ] [Real]Absence check using 49 positive place invariants in 34 ms returned sat
[2024-05-25 15:30:48] [INFO ] [Real]Absence check using 49 positive and 22 generalized place invariants in 3 ms returned sat
[2024-05-25 15:30:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:48] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-25 15:30:48] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-25 15:30:48] [INFO ] [Real]Added 13 Read/Feed constraints in 29 ms returned sat
[2024-05-25 15:30:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:30:49] [INFO ] [Nat]Absence check using 49 positive place invariants in 12 ms returned sat
[2024-05-25 15:30:49] [INFO ] [Nat]Absence check using 49 positive and 22 generalized place invariants in 8 ms returned sat
[2024-05-25 15:30:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:30:49] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-25 15:30:49] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2024-05-25 15:30:49] [INFO ] Computed and/alt/rep : 85/406/85 causal constraints (skipped 44 transitions) in 10 ms.
[2024-05-25 15:30:49] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2024-05-25 15:30:49] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2024-05-25 15:30:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2024-05-25 15:30:49] [INFO ] Added : 33 causal constraints over 8 iterations in 301 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA BusinessProcesses-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 42156 ms.

BK_STOP 1716651049797

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-11"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-11, 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 r065-tajo-171620414900331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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