Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 177K May 5 16:51 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-18-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620548397853

Running Version 0
[2021-05-09 08:19:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 08:19:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:19:59] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2021-05-09 08:19:59] [INFO ] Transformed 717 places.
[2021-05-09 08:19:59] [INFO ] Transformed 642 transitions.
[2021-05-09 08:19:59] [INFO ] Found NUPN structural information;
[2021-05-09 08:19:59] [INFO ] Parsed PT model containing 717 places and 642 transitions in 135 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 15 places in 12 ms
Reduce places removed 15 places and 15 transitions.
// Phase 1: matrix 627 rows 702 cols
[2021-05-09 08:19:59] [INFO ] Computed 114 place invariants in 45 ms
Incomplete random walk after 10000 steps, including 52 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :7
FORMULA BusinessProcesses-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
// Phase 1: matrix 627 rows 702 cols
[2021-05-09 08:19:59] [INFO ] Computed 114 place invariants in 15 ms
[2021-05-09 08:20:00] [INFO ] [Real]Absence check using 73 positive place invariants in 34 ms returned sat
[2021-05-09 08:20:00] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:00] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-09 08:20:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:00] [INFO ] [Nat]Absence check using 73 positive place invariants in 24 ms returned sat
[2021-05-09 08:20:00] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 08:20:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:00] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2021-05-09 08:20:00] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 7 ms to minimize.
[2021-05-09 08:20:01] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 2 ms to minimize.
[2021-05-09 08:20:01] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 1 ms to minimize.
[2021-05-09 08:20:01] [INFO ] Deduced a trap composed of 144 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:20:01] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 0 ms to minimize.
[2021-05-09 08:20:01] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:20:01] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2021-05-09 08:20:02] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 1 ms to minimize.
[2021-05-09 08:20:02] [INFO ] Deduced a trap composed of 48 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:20:02] [INFO ] Deduced a trap composed of 128 places in 167 ms of which 0 ms to minimize.
[2021-05-09 08:20:02] [INFO ] Deduced a trap composed of 128 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:20:02] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:20:03] [INFO ] Deduced a trap composed of 143 places in 197 ms of which 1 ms to minimize.
[2021-05-09 08:20:03] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 1 ms to minimize.
[2021-05-09 08:20:03] [INFO ] Deduced a trap composed of 141 places in 163 ms of which 1 ms to minimize.
[2021-05-09 08:20:03] [INFO ] Deduced a trap composed of 143 places in 146 ms of which 1 ms to minimize.
[2021-05-09 08:20:03] [INFO ] Deduced a trap composed of 82 places in 176 ms of which 0 ms to minimize.
[2021-05-09 08:20:04] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 0 ms to minimize.
[2021-05-09 08:20:04] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:20:04] [INFO ] Deduced a trap composed of 163 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:20:04] [INFO ] Deduced a trap composed of 144 places in 132 ms of which 0 ms to minimize.
[2021-05-09 08:20:04] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 1 ms to minimize.
[2021-05-09 08:20:04] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2021-05-09 08:20:05] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 0 ms to minimize.
[2021-05-09 08:20:05] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4391 ms
[2021-05-09 08:20:05] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 51 ms.
[2021-05-09 08:20:05] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 1 ms to minimize.
[2021-05-09 08:20:05] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 08:20:05] [INFO ] [Real]Absence check using 73 positive place invariants in 21 ms returned sat
[2021-05-09 08:20:05] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 08:20:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:06] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2021-05-09 08:20:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:06] [INFO ] [Nat]Absence check using 73 positive place invariants in 34 ms returned sat
[2021-05-09 08:20:06] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:06] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2021-05-09 08:20:06] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2021-05-09 08:20:06] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 1 ms to minimize.
[2021-05-09 08:20:07] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:20:07] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:20:07] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 1 ms to minimize.
[2021-05-09 08:20:07] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 0 ms to minimize.
[2021-05-09 08:20:07] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 1 ms to minimize.
[2021-05-09 08:20:07] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 0 ms to minimize.
[2021-05-09 08:20:08] [INFO ] Deduced a trap composed of 28 places in 225 ms of which 0 ms to minimize.
[2021-05-09 08:20:08] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 6 ms to minimize.
[2021-05-09 08:20:08] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 1 ms to minimize.
[2021-05-09 08:20:08] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 1 ms to minimize.
[2021-05-09 08:20:09] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 0 ms to minimize.
[2021-05-09 08:20:09] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 1 ms to minimize.
[2021-05-09 08:20:09] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:20:09] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 1 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Deduced a trap composed of 148 places in 181 ms of which 0 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 1 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 0 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Deduced a trap composed of 154 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 1 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Deduced a trap composed of 168 places in 156 ms of which 1 ms to minimize.
[2021-05-09 08:20:11] [INFO ] Deduced a trap composed of 172 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:20:11] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 08:20:11] [INFO ] [Real]Absence check using 73 positive place invariants in 29 ms returned sat
[2021-05-09 08:20:11] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:20:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:11] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2021-05-09 08:20:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:11] [INFO ] [Nat]Absence check using 73 positive place invariants in 33 ms returned sat
[2021-05-09 08:20:11] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 19 ms returned sat
[2021-05-09 08:20:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:11] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2021-05-09 08:20:12] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:20:12] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:20:12] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:20:12] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:20:12] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:20:12] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:20:12] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:20:13] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 1 ms to minimize.
[2021-05-09 08:20:13] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2021-05-09 08:20:13] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2021-05-09 08:20:13] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:20:13] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 1 ms to minimize.
[2021-05-09 08:20:13] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:20:13] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:20:13] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:20:14] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:20:14] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:20:14] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:20:14] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:20:14] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:20:14] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:20:14] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:20:15] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 0 ms to minimize.
[2021-05-09 08:20:15] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2021-05-09 08:20:15] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:20:15] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3360 ms
[2021-05-09 08:20:15] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 32 ms.
00)
^^
(error "Incorrect format for a number - no leading zeros allowed: 00")
[2021-05-09 08:20:16] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2021-05-09 08:20: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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 08:20:16] [INFO ] [Real]Absence check using 73 positive place invariants in 28 ms returned sat
[2021-05-09 08:20:16] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 08:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:17] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2021-05-09 08:20:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:17] [INFO ] [Nat]Absence check using 73 positive place invariants in 33 ms returned sat
[2021-05-09 08:20:17] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:20:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:17] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2021-05-09 08:20:17] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:20:17] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 0 ms to minimize.
[2021-05-09 08:20:17] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 1 ms to minimize.
[2021-05-09 08:20:18] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:20:18] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:20:18] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:20:18] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:20:18] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 0 ms to minimize.
[2021-05-09 08:20:18] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:20:18] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:20:19] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:20:19] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2021-05-09 08:20:19] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:20:19] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:20:19] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 0 ms to minimize.
[2021-05-09 08:20:19] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 1 ms to minimize.
[2021-05-09 08:20:19] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:20:19] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 1 ms to minimize.
[2021-05-09 08:20:20] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:20:20] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2021-05-09 08:20:20] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2675 ms
[2021-05-09 08:20:20] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 48 ms.
[2021-05-09 08:20:22] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 08:20:22] [INFO ] [Real]Absence check using 73 positive place invariants in 30 ms returned sat
[2021-05-09 08:20:22] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:22] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2021-05-09 08:20:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:22] [INFO ] [Nat]Absence check using 73 positive place invariants in 27 ms returned sat
[2021-05-09 08:20:22] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:20:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:22] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2021-05-09 08:20:23] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2021-05-09 08:20:23] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:20:23] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:20:23] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:20:23] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:20:23] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:20:23] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
[2021-05-09 08:20:24] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:20:24] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2021-05-09 08:20:24] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 0 ms to minimize.
[2021-05-09 08:20:24] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2021-05-09 08:20:24] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1486 ms
[2021-05-09 08:20:24] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 48 ms.
[2021-05-09 08:20:26] [INFO ] Added : 331 causal constraints over 67 iterations in 2303 ms. Result :sat
Minimization took 171 ms.
[2021-05-09 08:20:27] [INFO ] [Real]Absence check using 73 positive place invariants in 25 ms returned sat
[2021-05-09 08:20:27] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:20:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:27] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2021-05-09 08:20:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:27] [INFO ] [Nat]Absence check using 73 positive place invariants in 28 ms returned sat
[2021-05-09 08:20:27] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 08:20:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:27] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2021-05-09 08:20:27] [INFO ] Deduced a trap composed of 141 places in 191 ms of which 1 ms to minimize.
[2021-05-09 08:20:28] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 0 ms to minimize.
[2021-05-09 08:20:28] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 0 ms to minimize.
[2021-05-09 08:20:28] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 0 ms to minimize.
[2021-05-09 08:20:28] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 0 ms to minimize.
[2021-05-09 08:20:28] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 0 ms to minimize.
[2021-05-09 08:20:29] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:20:29] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:20:29] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2021-05-09 08:20:29] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:20:29] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2021-05-09 08:20:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1767 ms
[2021-05-09 08:20:29] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 48 ms.
[2021-05-09 08:20:31] [INFO ] Added : 279 causal constraints over 56 iterations in 1809 ms. Result :sat
Minimization took 130 ms.
[2021-05-09 08:20:31] [INFO ] [Real]Absence check using 73 positive place invariants in 30 ms returned sat
[2021-05-09 08:20:31] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:31] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2021-05-09 08:20:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:32] [INFO ] [Nat]Absence check using 73 positive place invariants in 32 ms returned sat
[2021-05-09 08:20:32] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:20:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:32] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2021-05-09 08:20:32] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 1 ms to minimize.
[2021-05-09 08:20:32] [INFO ] Deduced a trap composed of 166 places in 179 ms of which 0 ms to minimize.
[2021-05-09 08:20:32] [INFO ] Deduced a trap composed of 78 places in 162 ms of which 1 ms to minimize.
[2021-05-09 08:20:33] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 0 ms to minimize.
[2021-05-09 08:20:33] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 1 ms to minimize.
[2021-05-09 08:20:33] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:20:33] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 0 ms to minimize.
[2021-05-09 08:20:33] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 0 ms to minimize.
[2021-05-09 08:20:34] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:20:34] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:20:34] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 0 ms to minimize.
[2021-05-09 08:20:34] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:20:34] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:20:34] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 0 ms to minimize.
[2021-05-09 08:20:35] [INFO ] Deduced a trap composed of 157 places in 165 ms of which 0 ms to minimize.
[2021-05-09 08:20:35] [INFO ] Deduced a trap composed of 157 places in 182 ms of which 1 ms to minimize.
[2021-05-09 08:20:35] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 0 ms to minimize.
[2021-05-09 08:20:35] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 1 ms to minimize.
[2021-05-09 08:20:35] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 1 ms to minimize.
[2021-05-09 08:20:35] [INFO ] Deduced a trap composed of 157 places in 150 ms of which 0 ms to minimize.
[2021-05-09 08:20:36] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 0 ms to minimize.
[2021-05-09 08:20:36] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 0 ms to minimize.
[2021-05-09 08:20:36] [INFO ] Deduced a trap composed of 151 places in 177 ms of which 1 ms to minimize.
[2021-05-09 08:20:36] [INFO ] Deduced a trap composed of 155 places in 141 ms of which 0 ms to minimize.
[2021-05-09 08:20:36] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 1 ms to minimize.
[2021-05-09 08:20:37] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 1 ms to minimize.
[2021-05-09 08:20:37] [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 6
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 08:20:37] [INFO ] [Real]Absence check using 73 positive place invariants in 32 ms returned sat
[2021-05-09 08:20:37] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:37] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2021-05-09 08:20:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:37] [INFO ] [Nat]Absence check using 73 positive place invariants in 33 ms returned sat
[2021-05-09 08:20:37] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:20:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:38] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2021-05-09 08:20:38] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 0 ms to minimize.
[2021-05-09 08:20:38] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 0 ms to minimize.
[2021-05-09 08:20:38] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2021-05-09 08:20:38] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 1 ms to minimize.
[2021-05-09 08:20:39] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2021-05-09 08:20:39] [INFO ] Deduced a trap composed of 137 places in 139 ms of which 0 ms to minimize.
[2021-05-09 08:20:39] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:20:39] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:20:39] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:20:39] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:20:39] [INFO ] Deduced a trap composed of 142 places in 133 ms of which 0 ms to minimize.
[2021-05-09 08:20:40] [INFO ] Deduced a trap composed of 161 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:20:40] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:20:40] [INFO ] Deduced a trap composed of 137 places in 192 ms of which 0 ms to minimize.
[2021-05-09 08:20:40] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:20:40] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:20:41] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:20:41] [INFO ] Deduced a trap composed of 151 places in 145 ms of which 1 ms to minimize.
[2021-05-09 08:20:41] [INFO ] Deduced a trap composed of 63 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:20:41] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 0 ms to minimize.
[2021-05-09 08:20:41] [INFO ] Deduced a trap composed of 72 places in 161 ms of which 0 ms to minimize.
[2021-05-09 08:20:41] [INFO ] Deduced a trap composed of 141 places in 184 ms of which 0 ms to minimize.
[2021-05-09 08:20:42] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 0 ms to minimize.
[2021-05-09 08:20:42] [INFO ] Deduced a trap composed of 161 places in 185 ms of which 1 ms to minimize.
[2021-05-09 08:20:42] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 1 ms to minimize.
[2021-05-09 08:20:42] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 1 ms to minimize.
[2021-05-09 08:20:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 08:20:42] [INFO ] [Real]Absence check using 73 positive place invariants in 29 ms returned sat
[2021-05-09 08:20:42] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:43] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2021-05-09 08:20:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:43] [INFO ] [Nat]Absence check using 73 positive place invariants in 40 ms returned sat
[2021-05-09 08:20:43] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 08:20:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:43] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2021-05-09 08:20:43] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 1 ms to minimize.
[2021-05-09 08:20:44] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 1 ms to minimize.
[2021-05-09 08:20:44] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 0 ms to minimize.
[2021-05-09 08:20:44] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2021-05-09 08:20:44] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 0 ms to minimize.
[2021-05-09 08:20:44] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 0 ms to minimize.
[2021-05-09 08:20:45] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 0 ms to minimize.
[2021-05-09 08:20:45] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 0 ms to minimize.
[2021-05-09 08:20:45] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 1 ms to minimize.
[2021-05-09 08:20:45] [INFO ] Deduced a trap composed of 157 places in 186 ms of which 0 ms to minimize.
[2021-05-09 08:20:45] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 1 ms to minimize.
[2021-05-09 08:20:46] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 0 ms to minimize.
[2021-05-09 08:20:46] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 0 ms to minimize.
[2021-05-09 08:20:46] [INFO ] Deduced a trap composed of 148 places in 167 ms of which 1 ms to minimize.
[2021-05-09 08:20:46] [INFO ] Deduced a trap composed of 151 places in 173 ms of which 1 ms to minimize.
[2021-05-09 08:20:46] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 0 ms to minimize.
[2021-05-09 08:20:47] [INFO ] Deduced a trap composed of 146 places in 171 ms of which 0 ms to minimize.
[2021-05-09 08:20:47] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:20:47] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 1 ms to minimize.
[2021-05-09 08:20:47] [INFO ] Deduced a trap composed of 152 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:20:47] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 0 ms to minimize.
[2021-05-09 08:20:47] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 1 ms to minimize.
[2021-05-09 08:20:48] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:20:48] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 1 ms to minimize.
[2021-05-09 08:20:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 22700 steps, including 110 resets, run finished after 61 ms. (steps per millisecond=372 ) properties (out of 9) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 22600 steps, including 115 resets, run finished after 60 ms. (steps per millisecond=376 ) properties (out of 8) seen :0 could not realise parikh vector
Support contains 8 out of 702 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 702/702 places, 627/627 transitions.
Graph (trivial) has 404 edges and 702 vertex of which 8 / 702 are part of one of the 1 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1408 edges and 695 vertex of which 686 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 161 place count 686 transition count 457
Reduce places removed 159 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 160 rules applied. Total rules applied 321 place count 527 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 322 place count 526 transition count 456
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 322 place count 526 transition count 354
Deduced a syphon composed of 102 places in 2 ms
Ensure Unique test removed 23 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 227 rules applied. Total rules applied 549 place count 401 transition count 354
Discarding 91 places :
Symmetric choice reduction at 3 with 91 rule applications. Total rules 640 place count 310 transition count 263
Iterating global reduction 3 with 91 rules applied. Total rules applied 731 place count 310 transition count 263
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 731 place count 310 transition count 253
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 754 place count 297 transition count 253
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 755 place count 296 transition count 252
Iterating global reduction 3 with 1 rules applied. Total rules applied 756 place count 296 transition count 252
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 968 place count 190 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 970 place count 189 transition count 149
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 971 place count 189 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 972 place count 188 transition count 148
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 976 place count 188 transition count 148
Applied a total of 976 rules in 138 ms. Remains 188 /702 variables (removed 514) and now considering 148/627 (removed 479) transitions.
Finished structural reductions, in 1 iterations. Remains : 188/702 places, 148/627 transitions.
// Phase 1: matrix 148 rows 188 cols
[2021-05-09 08:20:48] [INFO ] Computed 80 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 53688 resets, run finished after 2642 ms. (steps per millisecond=378 ) properties (out of 8) seen :7
FORMULA BusinessProcesses-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 29894 resets, run finished after 1549 ms. (steps per millisecond=645 ) properties (out of 1) seen :0
// Phase 1: matrix 148 rows 188 cols
[2021-05-09 08:20:52] [INFO ] Computed 80 place invariants in 5 ms
[2021-05-09 08:20:52] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2021-05-09 08:20:52] [INFO ] [Real]Absence check using 65 positive and 15 generalized place invariants in 4 ms returned sat
[2021-05-09 08:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:52] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-09 08:20:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:53] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2021-05-09 08:20:53] [INFO ] [Nat]Absence check using 65 positive and 15 generalized place invariants in 5 ms returned sat
[2021-05-09 08:20:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:53] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-09 08:20:53] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-09 08:20:53] [INFO ] [Nat]Added 7 Read/Feed constraints in 38 ms returned sat
[2021-05-09 08:20:53] [INFO ] Computed and/alt/rep : 102/467/102 causal constraints (skipped 44 transitions) in 17 ms.
[2021-05-09 08:20:53] [INFO ] Added : 34 causal constraints over 7 iterations in 145 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 7100 steps, including 234 resets, run finished after 41 ms. (steps per millisecond=173 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 188/188 places, 148/148 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 188 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 187 transition count 147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 187 transition count 143
Deduced a syphon composed of 4 places in 0 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 12 place count 181 transition count 143
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 178 transition count 140
Applied a total of 18 rules in 31 ms. Remains 178 /188 variables (removed 10) and now considering 140/148 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 178/188 places, 140/148 transitions.
// Phase 1: matrix 140 rows 178 cols
[2021-05-09 08:20:53] [INFO ] Computed 78 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 55977 resets, run finished after 3067 ms. (steps per millisecond=326 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 30772 resets, run finished after 2042 ms. (steps per millisecond=489 ) properties (out of 1) seen :0
// Phase 1: matrix 140 rows 178 cols
[2021-05-09 08:20:58] [INFO ] Computed 78 place invariants in 5 ms
[2021-05-09 08:20:58] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2021-05-09 08:20:58] [INFO ] [Real]Absence check using 65 positive and 13 generalized place invariants in 4 ms returned sat
[2021-05-09 08:20:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:58] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-09 08:20:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2021-05-09 08:20:58] [INFO ] [Nat]Absence check using 65 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 08:20:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:58] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-09 08:20:58] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-09 08:20:58] [INFO ] [Nat]Added 7 Read/Feed constraints in 12 ms returned sat
[2021-05-09 08:20:58] [INFO ] Computed and/alt/rep : 94/454/94 causal constraints (skipped 44 transitions) in 12 ms.
[2021-05-09 08:20:58] [INFO ] Added : 32 causal constraints over 7 iterations in 95 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4700 steps, including 158 resets, run finished after 18 ms. (steps per millisecond=261 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 178/178 places, 140/140 transitions.
Applied a total of 0 rules in 10 ms. Remains 178 /178 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 178/178 places, 140/140 transitions.
Starting structural reductions, iteration 0 : 178/178 places, 140/140 transitions.
Applied a total of 0 rules in 10 ms. Remains 178 /178 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 178 cols
[2021-05-09 08:20:58] [INFO ] Computed 78 place invariants in 2 ms
[2021-05-09 08:20:59] [INFO ] Implicit Places using invariants in 110 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 20, 22, 24, 26, 28, 30, 32, 34, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 37 places :
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Implicit Place search using SMT only with invariants took 113 ms to find 37 implicit places.
[2021-05-09 08:20:59] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 137 rows 141 cols
[2021-05-09 08:20:59] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-09 08:20:59] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 141/178 places, 137/140 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 135 transition count 113
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 135 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 134 transition count 118
Applied a total of 14 rules in 15 ms. Remains 134 /141 variables (removed 7) and now considering 118/137 (removed 19) transitions.
// Phase 1: matrix 118 rows 134 cols
[2021-05-09 08:20:59] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-09 08:20:59] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 118 rows 134 cols
[2021-05-09 08:20:59] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-09 08:20:59] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-09 08:20:59] [INFO ] Implicit Places using invariants and state equation in 211 ms returned [3, 11, 12, 14, 16, 18, 19, 34, 36, 40, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80]
Discarding 28 places :
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Implicit Place search using SMT with State Equation took 279 ms to find 28 implicit places.
Starting structural reductions, iteration 2 : 106/178 places, 111/140 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 106 transition count 98
Reduce places removed 13 places and 0 transitions.
Graph (complete) has 265 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 92 transition count 98
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 92 transition count 97
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 34 place count 86 transition count 82
Iterating global reduction 3 with 6 rules applied. Total rules applied 40 place count 86 transition count 82
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 43 place count 86 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 46 place count 83 transition count 79
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 49 place count 80 transition count 76
Iterating global reduction 5 with 3 rules applied. Total rules applied 52 place count 80 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 55 place count 80 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 56 place count 79 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 66 place count 74 transition count 68
Applied a total of 66 rules in 16 ms. Remains 74 /106 variables (removed 32) and now considering 68/111 (removed 43) transitions.
// Phase 1: matrix 68 rows 74 cols
[2021-05-09 08:20:59] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 08:20:59] [INFO ] Implicit Places using invariants in 38 ms returned [3, 4, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions, iteration 3 : 71/178 places, 68/140 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 71 transition count 65
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 68 transition count 65
Applied a total of 6 rules in 6 ms. Remains 68 /71 variables (removed 3) and now considering 65/68 (removed 3) transitions.
// Phase 1: matrix 65 rows 68 cols
[2021-05-09 08:20:59] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-09 08:20:59] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 65 rows 68 cols
[2021-05-09 08:20:59] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-09 08:20:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-09 08:20:59] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [22, 25, 27]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 136 ms to find 3 implicit places.
Starting structural reductions, iteration 4 : 65/178 places, 65/140 transitions.
Graph (complete) has 162 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 64
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 2 place count 64 transition count 61
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 61 transition count 61
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 59 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 57 transition count 59
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 56 transition count 58
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 56 transition count 58
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 29 place count 48 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 31 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 47 transition count 50
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 47 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 34 place count 47 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 36 place count 46 transition count 48
Applied a total of 36 rules in 9 ms. Remains 46 /65 variables (removed 19) and now considering 48/65 (removed 17) transitions.
// Phase 1: matrix 48 rows 46 cols
[2021-05-09 08:20:59] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-09 08:20:59] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 48 rows 46 cols
[2021-05-09 08:20:59] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 08:20:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-09 08:20:59] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Finished structural reductions, in 5 iterations. Remains : 46/178 places, 48/140 transitions.
// Phase 1: matrix 48 rows 46 cols
[2021-05-09 08:20:59] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 94224 resets, run finished after 485 ms. (steps per millisecond=2061 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 45421 resets, run finished after 286 ms. (steps per millisecond=3496 ) properties (out of 1) seen :0
// Phase 1: matrix 48 rows 46 cols
[2021-05-09 08:21:00] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 08:21:00] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-09 08:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:00] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-09 08:21:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-09 08:21:00] [INFO ] [Real]Added 30 Read/Feed constraints in 7 ms returned sat
[2021-05-09 08:21:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2021-05-09 08:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:00] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-09 08:21:00] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-09 08:21:00] [INFO ] Computed and/alt/rep : 10/44/10 causal constraints (skipped 36 transitions) in 4 ms.
[2021-05-09 08:21:00] [INFO ] Added : 9 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 2500 steps, including 121 resets, run finished after 4 ms. (steps per millisecond=625 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 48/48 transitions.
Applied a total of 0 rules in 13 ms. Remains 46 /46 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 48/48 transitions.
Starting structural reductions, iteration 0 : 46/46 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 46 cols
[2021-05-09 08:21:00] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 08:21:00] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 48 rows 46 cols
[2021-05-09 08:21:00] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 08:21:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-09 08:21:00] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2021-05-09 08:21:00] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 48 rows 46 cols
[2021-05-09 08:21:00] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 08:21:00] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 48/48 transitions.
Starting property specific reduction for BusinessProcesses-PT-18-UpperBounds-11
// Phase 1: matrix 48 rows 46 cols
[2021-05-09 08:21:00] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 943 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 48 rows 46 cols
[2021-05-09 08:21:00] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-09 08:21:00] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-09 08:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:00] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-09 08:21:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-09 08:21:00] [INFO ] [Real]Added 30 Read/Feed constraints in 5 ms returned sat
[2021-05-09 08:21:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-09 08:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:00] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-09 08:21:00] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2021-05-09 08:21:00] [INFO ] Computed and/alt/rep : 10/44/10 causal constraints (skipped 36 transitions) in 3 ms.
[2021-05-09 08:21:00] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 2500 steps, including 123 resets, run finished after 4 ms. (steps per millisecond=625 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 48/48 transitions.
// Phase 1: matrix 48 rows 46 cols
[2021-05-09 08:21:00] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 94610 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 45271 resets, run finished after 342 ms. (steps per millisecond=2923 ) properties (out of 1) seen :0
// Phase 1: matrix 48 rows 46 cols
[2021-05-09 08:21:01] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 08:21:02] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-09 08:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:02] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-09 08:21:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-09 08:21:02] [INFO ] [Real]Added 30 Read/Feed constraints in 5 ms returned sat
[2021-05-09 08:21:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-09 08:21:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:02] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-09 08:21:02] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2021-05-09 08:21:02] [INFO ] Computed and/alt/rep : 10/44/10 causal constraints (skipped 36 transitions) in 4 ms.
[2021-05-09 08:21:02] [INFO ] Added : 9 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 2500 steps, including 123 resets, run finished after 3 ms. (steps per millisecond=833 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 48/48 transitions.
Starting structural reductions, iteration 0 : 46/46 places, 48/48 transitions.
Applied a total of 0 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 46 cols
[2021-05-09 08:21:02] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 08:21:02] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 48 rows 46 cols
[2021-05-09 08:21:02] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 08:21:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-09 08:21:02] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2021-05-09 08:21:02] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 48 rows 46 cols
[2021-05-09 08:21:02] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 08:21:02] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 48/48 transitions.
Ending property specific reduction for BusinessProcesses-PT-18-UpperBounds-11 in 1492 ms.
[2021-05-09 08:21:02] [INFO ] Flatten gal took : 32 ms
[2021-05-09 08:21:02] [INFO ] Applying decomposition
[2021-05-09 08:21:02] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6540199760218873935.txt, -o, /tmp/graph6540199760218873935.bin, -w, /tmp/graph6540199760218873935.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6540199760218873935.bin, -l, -1, -v, -w, /tmp/graph6540199760218873935.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:21:02] [INFO ] Decomposing Gal with order
[2021-05-09 08:21:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:21:02] [INFO ] Removed a total of 51 redundant transitions.
[2021-05-09 08:21:02] [INFO ] Flatten gal took : 37 ms
[2021-05-09 08:21:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 6 ms.
[2021-05-09 08:21:02] [INFO ] Time to serialize gal into /tmp/UpperBounds1494503556484481767.gal : 5 ms
[2021-05-09 08:21:02] [INFO ] Time to serialize properties into /tmp/UpperBounds7009615033526638064.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds1494503556484481767.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7009615033526638064.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds1494503556484481767.gal -t CGAL -reachable-file /tmp/UpperBounds7009615033526638064.prop --nowitness
Loading property file /tmp/UpperBounds7009615033526638064.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,51457,0.032142,4584,105,31,1961,187,164,2519,41,883,0
Total reachable state count : 51457

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property BusinessProcesses-PT-18-UpperBounds-11 :0 <= u15.p574 <= 1
FORMULA BusinessProcesses-PT-18-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-18-UpperBounds-11,0,0.032968,4584,1,0,1961,187,250,2519,52,883,249

BK_STOP 1620548463163

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-18, 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 r026-tajo-162038143900459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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