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.r047-tajo-171620398500581.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 greatspnxred
Input is BusinessProcesses-PT-17, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398500581
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 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 161K 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-17-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716307973549

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:12:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 16:12:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:12:55] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2024-05-21 16:12:55] [INFO ] Transformed 650 places.
[2024-05-21 16:12:55] [INFO ] Transformed 580 transitions.
[2024-05-21 16:12:55] [INFO ] Found NUPN structural information;
[2024-05-21 16:12:56] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 487 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 25 ms.
Deduced a syphon composed of 4 places in 17 ms
Reduce places removed 4 places and 4 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 576 rows 646 cols
[2024-05-21 16:12:56] [INFO ] Computed 108 invariants in 86 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (64 resets) in 150 ms. (66 steps per ms)
FORMULA BusinessProcesses-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (105 resets) in 193 ms. (463 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-21 16:12:56] [INFO ] Invariant cache hit.
[2024-05-21 16:12:57] [INFO ] [Real]Absence check using 62 positive place invariants in 132 ms returned sat
[2024-05-21 16:12:57] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 44 ms returned sat
[2024-05-21 16:12:58] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2024-05-21 16:12:58] [INFO ] Deduced a trap composed of 16 places in 551 ms of which 68 ms to minimize.
[2024-05-21 16:12:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:12:59] [INFO ] [Nat]Absence check using 62 positive place invariants in 32 ms returned sat
[2024-05-21 16:12:59] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 34 ms returned sat
[2024-05-21 16:12:59] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2024-05-21 16:13:00] [INFO ] Deduced a trap composed of 16 places in 358 ms of which 4 ms to minimize.
[2024-05-21 16:13:00] [INFO ] Deduced a trap composed of 12 places in 321 ms of which 7 ms to minimize.
[2024-05-21 16:13:00] [INFO ] Deduced a trap composed of 16 places in 280 ms of which 4 ms to minimize.
[2024-05-21 16:13:01] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 6 ms to minimize.
[2024-05-21 16:13:01] [INFO ] Deduced a trap composed of 127 places in 197 ms of which 3 ms to minimize.
[2024-05-21 16:13:01] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 4 ms to minimize.
[2024-05-21 16:13:01] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 3 ms to minimize.
[2024-05-21 16:13:02] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 3 ms to minimize.
[2024-05-21 16:13:02] [INFO ] Deduced a trap composed of 24 places in 399 ms of which 31 ms to minimize.
[2024-05-21 16:13:02] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 4 ms to minimize.
[2024-05-21 16:13:03] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 4 ms to minimize.
[2024-05-21 16:13:03] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 4 ms to minimize.
[2024-05-21 16:13:03] [INFO ] Deduced a trap composed of 129 places in 232 ms of which 4 ms to minimize.
[2024-05-21 16:13:03] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 4 ms to minimize.
[2024-05-21 16:13:04] [INFO ] Deduced a trap composed of 121 places in 188 ms of which 5 ms to minimize.
[2024-05-21 16:13:04] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 16:13:04] [INFO ] [Real]Absence check using 62 positive place invariants in 27 ms returned sat
[2024-05-21 16:13:04] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2024-05-21 16:13:04] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2024-05-21 16:13:04] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 4 ms to minimize.
[2024-05-21 16:13:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:13:05] [INFO ] [Nat]Absence check using 62 positive place invariants in 40 ms returned sat
[2024-05-21 16:13:05] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 18 ms returned sat
[2024-05-21 16:13:05] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2024-05-21 16:13:05] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 6 ms to minimize.
[2024-05-21 16:13:05] [INFO ] Deduced a trap composed of 126 places in 287 ms of which 6 ms to minimize.
[2024-05-21 16:13:06] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 4 ms to minimize.
[2024-05-21 16:13:06] [INFO ] Deduced a trap composed of 137 places in 310 ms of which 16 ms to minimize.
[2024-05-21 16:13:06] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 17 ms to minimize.
[2024-05-21 16:13:06] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:13:07] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 3 ms to minimize.
[2024-05-21 16:13:07] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 4 ms to minimize.
[2024-05-21 16:13:07] [INFO ] Deduced a trap composed of 123 places in 233 ms of which 3 ms to minimize.
[2024-05-21 16:13:07] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 3 ms to minimize.
[2024-05-21 16:13:08] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 3 ms to minimize.
[2024-05-21 16:13:08] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 3 ms to minimize.
[2024-05-21 16:13:08] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:13:08] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 3 ms to minimize.
[2024-05-21 16:13:08] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 3 ms to minimize.
[2024-05-21 16:13:09] [INFO ] Deduced a trap composed of 125 places in 206 ms of which 3 ms to minimize.
[2024-05-21 16:13:09] [INFO ] Deduced a trap composed of 125 places in 263 ms of which 6 ms to minimize.
[2024-05-21 16:13:09] [INFO ] Deduced a trap composed of 31 places in 244 ms of which 3 ms to minimize.
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 119 places in 289 ms of which 14 ms to minimize.
[2024-05-21 16:13:10] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 16:13:10] [INFO ] [Real]Absence check using 62 positive place invariants in 39 ms returned sat
[2024-05-21 16:13:10] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2024-05-21 16:13:10] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 4 ms to minimize.
[2024-05-21 16:13:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:13:11] [INFO ] [Nat]Absence check using 62 positive place invariants in 29 ms returned sat
[2024-05-21 16:13:11] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 14 ms returned sat
[2024-05-21 16:13:11] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 6 ms to minimize.
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 3 ms to minimize.
[2024-05-21 16:13:12] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 19 ms to minimize.
[2024-05-21 16:13:12] [INFO ] Deduced a trap composed of 128 places in 319 ms of which 18 ms to minimize.
[2024-05-21 16:13:12] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 4 ms to minimize.
[2024-05-21 16:13:13] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 4 ms to minimize.
[2024-05-21 16:13:13] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 3 ms to minimize.
[2024-05-21 16:13:13] [INFO ] Deduced a trap composed of 128 places in 196 ms of which 3 ms to minimize.
[2024-05-21 16:13:13] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 4 ms to minimize.
[2024-05-21 16:13:13] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 4 ms to minimize.
[2024-05-21 16:13:14] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 4 ms to minimize.
[2024-05-21 16:13:14] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 3 ms to minimize.
[2024-05-21 16:13:14] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:13:14] [INFO ] Deduced a trap composed of 136 places in 183 ms of which 5 ms to minimize.
[2024-05-21 16:13:15] [INFO ] Deduced a trap composed of 133 places in 176 ms of which 4 ms to minimize.
[2024-05-21 16:13:15] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 3 ms to minimize.
[2024-05-21 16:13:15] [INFO ] Deduced a trap composed of 122 places in 173 ms of which 3 ms to minimize.
[2024-05-21 16:13:15] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 4 ms to minimize.
[2024-05-21 16:13:15] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 4 ms to minimize.
[2024-05-21 16:13:16] [INFO ] Deduced a trap composed of 145 places in 164 ms of which 4 ms to minimize.
[2024-05-21 16:13:16] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 16:13:16] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2024-05-21 16:13:16] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2024-05-21 16:13:16] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2024-05-21 16:13:16] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 4 ms to minimize.
[2024-05-21 16:13:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:13:16] [INFO ] [Nat]Absence check using 62 positive place invariants in 22 ms returned sat
[2024-05-21 16:13:16] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2024-05-21 16:13:17] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2024-05-21 16:13:17] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 4 ms to minimize.
[2024-05-21 16:13:17] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 4 ms to minimize.
[2024-05-21 16:13:17] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 4 ms to minimize.
[2024-05-21 16:13:17] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 4 ms to minimize.
[2024-05-21 16:13:18] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 4 ms to minimize.
[2024-05-21 16:13:18] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 4 ms to minimize.
[2024-05-21 16:13:18] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 4 ms to minimize.
[2024-05-21 16:13:18] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 7 ms to minimize.
[2024-05-21 16:13:18] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 3 ms to minimize.
[2024-05-21 16:13:19] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 3 ms to minimize.
[2024-05-21 16:13:19] [INFO ] Deduced a trap composed of 143 places in 171 ms of which 4 ms to minimize.
[2024-05-21 16:13:19] [INFO ] Deduced a trap composed of 60 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:13:19] [INFO ] Deduced a trap composed of 121 places in 172 ms of which 4 ms to minimize.
[2024-05-21 16:13:19] [INFO ] Deduced a trap composed of 132 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:13:20] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:13:20] [INFO ] Deduced a trap composed of 56 places in 213 ms of which 4 ms to minimize.
[2024-05-21 16:13:20] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 4 ms to minimize.
[2024-05-21 16:13:20] [INFO ] Deduced a trap composed of 55 places in 218 ms of which 4 ms to minimize.
[2024-05-21 16:13:20] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 4 ms to minimize.
[2024-05-21 16:13:21] [INFO ] Deduced a trap composed of 132 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:13:21] [INFO ] Deduced a trap composed of 55 places in 180 ms of which 4 ms to minimize.
[2024-05-21 16:13:21] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 4 ms to minimize.
[2024-05-21 16:13:21] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 5 ms to minimize.
[2024-05-21 16:13:21] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 16:13:21] [INFO ] [Real]Absence check using 62 positive place invariants in 22 ms returned sat
[2024-05-21 16:13:21] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2024-05-21 16:13:22] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2024-05-21 16:13:22] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 4 ms to minimize.
[2024-05-21 16:13:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:13:22] [INFO ] [Nat]Absence check using 62 positive place invariants in 22 ms returned sat
[2024-05-21 16:13:22] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2024-05-21 16:13:22] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2024-05-21 16:13:23] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 4 ms to minimize.
[2024-05-21 16:13:23] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:13:23] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:13:23] [INFO ] Deduced a trap composed of 141 places in 211 ms of which 4 ms to minimize.
[2024-05-21 16:13:23] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 4 ms to minimize.
[2024-05-21 16:13:23] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:13:24] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:13:24] [INFO ] Deduced a trap composed of 145 places in 272 ms of which 4 ms to minimize.
[2024-05-21 16:13:24] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 4 ms to minimize.
[2024-05-21 16:13:24] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 4 ms to minimize.
[2024-05-21 16:13:25] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 4 ms to minimize.
[2024-05-21 16:13:25] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 4 ms to minimize.
[2024-05-21 16:13:25] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 4 ms to minimize.
[2024-05-21 16:13:25] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 4 ms to minimize.
[2024-05-21 16:13:26] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 4 ms to minimize.
[2024-05-21 16:13:26] [INFO ] Deduced a trap composed of 17 places in 301 ms of which 7 ms to minimize.
[2024-05-21 16:13:26] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 4 ms to minimize.
[2024-05-21 16:13:27] [INFO ] Deduced a trap composed of 21 places in 288 ms of which 6 ms to minimize.
[2024-05-21 16:13:27] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 19 ms to minimize.
[2024-05-21 16:13:27] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 4 ms to minimize.
[2024-05-21 16:13:27] [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 4
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 16:13:27] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2024-05-21 16:13:27] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2024-05-21 16:13:27] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2024-05-21 16:13:28] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 3 ms to minimize.
[2024-05-21 16:13:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:13:28] [INFO ] [Nat]Absence check using 62 positive place invariants in 35 ms returned sat
[2024-05-21 16:13:28] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2024-05-21 16:13:28] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2024-05-21 16:13:28] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:13:28] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 3 ms to minimize.
[2024-05-21 16:13:29] [INFO ] Deduced a trap composed of 23 places in 276 ms of which 4 ms to minimize.
[2024-05-21 16:13:29] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 4 ms to minimize.
[2024-05-21 16:13:29] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:13:29] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:13:30] [INFO ] Deduced a trap composed of 129 places in 187 ms of which 4 ms to minimize.
[2024-05-21 16:13:30] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 4 ms to minimize.
[2024-05-21 16:13:30] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 4 ms to minimize.
[2024-05-21 16:13:30] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:13:30] [INFO ] Deduced a trap composed of 140 places in 206 ms of which 4 ms to minimize.
[2024-05-21 16:13:31] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 4 ms to minimize.
[2024-05-21 16:13:31] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 4 ms to minimize.
[2024-05-21 16:13:31] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 4 ms to minimize.
[2024-05-21 16:13:31] [INFO ] Deduced a trap composed of 140 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:13:31] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:13:32] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 3 ms to minimize.
[2024-05-21 16:13:32] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:13:32] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 4 ms to minimize.
[2024-05-21 16:13:32] [INFO ] Deduced a trap composed of 61 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:13:32] [INFO ] Deduced a trap composed of 147 places in 203 ms of which 3 ms to minimize.
[2024-05-21 16:13:33] [INFO ] Deduced a trap composed of 154 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:13:33] [INFO ] Deduced a trap composed of 151 places in 190 ms of which 4 ms to minimize.
[2024-05-21 16:13:33] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 16:13:33] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2024-05-21 16:13:33] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 14 ms returned sat
[2024-05-21 16:13:33] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-05-21 16:13:33] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 4 ms to minimize.
[2024-05-21 16:13:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:13:34] [INFO ] [Nat]Absence check using 62 positive place invariants in 28 ms returned sat
[2024-05-21 16:13:34] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 14 ms returned sat
[2024-05-21 16:13:34] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2024-05-21 16:13:34] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 4 ms to minimize.
[2024-05-21 16:13:34] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 5 ms to minimize.
[2024-05-21 16:13:35] [INFO ] Deduced a trap composed of 150 places in 218 ms of which 4 ms to minimize.
[2024-05-21 16:13:35] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:13:35] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 5 ms to minimize.
[2024-05-21 16:13:35] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 4 ms to minimize.
[2024-05-21 16:13:35] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 4 ms to minimize.
[2024-05-21 16:13:36] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 4 ms to minimize.
[2024-05-21 16:13:36] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 4 ms to minimize.
[2024-05-21 16:13:36] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 4 ms to minimize.
[2024-05-21 16:13:36] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 4 ms to minimize.
[2024-05-21 16:13:37] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 4 ms to minimize.
[2024-05-21 16:13:37] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:13:37] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:13:37] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:13:37] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3073 ms
[2024-05-21 16:13:37] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 40 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-21 16:13:39] [INFO ] [Real]Absence check using 62 positive place invariants in 27 ms returned sat
[2024-05-21 16:13:39] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 15 ms returned sat
[2024-05-21 16:13:39] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2024-05-21 16:13:39] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:13:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:13:39] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2024-05-21 16:13:39] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 14 ms returned sat
[2024-05-21 16:13:40] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2024-05-21 16:13:40] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:13:40] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:13:40] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:13:40] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:13:40] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:13:41] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:13:41] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:13:41] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:13:41] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:13:41] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:13:41] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:13:42] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:13:42] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:13:42] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:13:42] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:13:42] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:13:42] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:13:42] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:13:42] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2711 ms
[2024-05-21 16:13:42] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 42 ms.
[2024-05-21 16:13:44] [INFO ] Added : 265 causal constraints over 53 iterations in 1865 ms. Result :unknown
[2024-05-21 16:13:44] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2024-05-21 16:13:44] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 14 ms returned sat
[2024-05-21 16:13:45] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-05-21 16:13:45] [INFO ] Deduced a trap composed of 131 places in 199 ms of which 4 ms to minimize.
[2024-05-21 16:13:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:13:45] [INFO ] [Nat]Absence check using 62 positive place invariants in 23 ms returned sat
[2024-05-21 16:13:45] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 10 ms returned sat
[2024-05-21 16:13:45] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2024-05-21 16:13:45] [INFO ] Deduced a trap composed of 131 places in 197 ms of which 4 ms to minimize.
[2024-05-21 16:13:46] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 5 ms to minimize.
[2024-05-21 16:13:46] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 4 ms to minimize.
[2024-05-21 16:13:46] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 4 ms to minimize.
[2024-05-21 16:13:46] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 3 ms to minimize.
[2024-05-21 16:13:46] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:13:47] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 3 ms to minimize.
[2024-05-21 16:13:47] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:13:47] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:13:47] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:13:47] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 4 ms to minimize.
[2024-05-21 16:13:48] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:13:48] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:13:48] [INFO ] Deduced a trap composed of 143 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:13:48] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:13:48] [INFO ] Deduced a trap composed of 125 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:13:48] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:13:49] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:13:49] [INFO ] Deduced a trap composed of 143 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:13:49] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:13:49] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 4 ms to minimize.
[2024-05-21 16:13:49] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:13:49] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:13:50] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:13:50] [INFO ] Deduced a trap composed of 125 places in 177 ms of which 3 ms to minimize.
[2024-05-21 16:13:50] [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 8
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 359 edges and 646 vertex of which 7 / 646 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1304 edges and 640 vertex of which 636 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 141 place count 636 transition count 428
Reduce places removed 139 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 140 rules applied. Total rules applied 281 place count 497 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 282 place count 496 transition count 427
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 282 place count 496 transition count 332
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 490 place count 383 transition count 332
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 569 place count 304 transition count 253
Iterating global reduction 3 with 79 rules applied. Total rules applied 648 place count 304 transition count 253
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 648 place count 304 transition count 245
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 666 place count 294 transition count 245
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 871 place count 190 transition count 144
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 3 with 2 rules applied. Total rules applied 873 place count 189 transition count 148
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 875 place count 189 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 877 place count 187 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 878 place count 187 transition count 146
Applied a total of 878 rules in 142 ms. Remains 187 /646 variables (removed 459) and now considering 146/576 (removed 430) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 187/646 places, 146/576 transitions.
// Phase 1: matrix 146 rows 187 cols
[2024-05-21 16:13:50] [INFO ] Computed 82 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (25893 resets) in 3010 ms. (332 steps per ms)
FORMULA BusinessProcesses-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (14364 resets) in 2045 ms. (488 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 16:13:55] [INFO ] Invariant cache hit.
[2024-05-21 16:13:55] [INFO ] [Real]Absence check using 59 positive place invariants in 19 ms returned sat
[2024-05-21 16:13:55] [INFO ] [Real]Absence check using 59 positive and 23 generalized place invariants in 8 ms returned sat
[2024-05-21 16:13:55] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-21 16:13:55] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-21 16:13:55] [INFO ] [Real]Added 13 Read/Feed constraints in 9 ms returned sat
[2024-05-21 16:13:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:13:55] [INFO ] [Nat]Absence check using 59 positive place invariants in 8 ms returned sat
[2024-05-21 16:13:55] [INFO ] [Nat]Absence check using 59 positive and 23 generalized place invariants in 4 ms returned sat
[2024-05-21 16:13:55] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 16:13:55] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-05-21 16:13:55] [INFO ] Computed and/alt/rep : 94/443/94 causal constraints (skipped 50 transitions) in 13 ms.
[2024-05-21 16:13:56] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:13:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-21 16:13:56] [INFO ] Added : 29 causal constraints over 6 iterations in 243 ms. Result :sat
Minimization took 181 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 187 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p344) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 145/145 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 187 transition count 142
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 184 transition count 142
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 184 transition count 138
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 178 transition count 138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 177 transition count 137
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 177 transition count 137
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 24 place count 174 transition count 134
Applied a total of 24 rules in 22 ms. Remains 174 /187 variables (removed 13) and now considering 134/145 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 174/187 places, 134/145 transitions.
// Phase 1: matrix 134 rows 174 cols
[2024-05-21 16:13:56] [INFO ] Computed 80 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA BusinessProcesses-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (28625 resets) in 2906 ms. (343 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 63877 ms.
ITS solved all properties within timeout

BK_STOP 1716308039450

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-17"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BusinessProcesses-PT-17, 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 r047-tajo-171620398500581"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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