Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 7.5K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 156K May 10 09:33 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-14-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652633627312

Running Version 202205111006
[2022-05-15 16:53:48] [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]
[2022-05-15 16:53:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:53:48] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2022-05-15 16:53:48] [INFO ] Transformed 624 places.
[2022-05-15 16:53:48] [INFO ] Transformed 564 transitions.
[2022-05-15 16:53:48] [INFO ] Found NUPN structural information;
[2022-05-15 16:53:48] [INFO ] Parsed PT model containing 624 places and 564 transitions in 234 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 556 rows 616 cols
[2022-05-15 16:53:48] [INFO ] Computed 99 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 67 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 15) seen :4
FORMULA BusinessProcesses-PT-14-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
// Phase 1: matrix 556 rows 616 cols
[2022-05-15 16:53:48] [INFO ] Computed 99 place invariants in 17 ms
[2022-05-15 16:53:50] [INFO ] [Real]Absence check using 60 positive place invariants in 28 ms returned sat
[2022-05-15 16:53:50] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2022-05-15 16:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:53:50] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2022-05-15 16:53:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:53:50] [INFO ] [Nat]Absence check using 60 positive place invariants in 21 ms returned sat
[2022-05-15 16:53:50] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 13 ms returned sat
[2022-05-15 16:53:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:53:51] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2022-05-15 16:53:51] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 8 ms to minimize.
[2022-05-15 16:53:51] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 1 ms to minimize.
[2022-05-15 16:53:52] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 1 ms to minimize.
[2022-05-15 16:53:52] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 2 ms to minimize.
[2022-05-15 16:53:52] [INFO ] Deduced a trap composed of 117 places in 138 ms of which 1 ms to minimize.
[2022-05-15 16:53:52] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 0 ms to minimize.
[2022-05-15 16:53:52] [INFO ] Deduced a trap composed of 121 places in 129 ms of which 0 ms to minimize.
[2022-05-15 16:53:52] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2022-05-15 16:53:53] [INFO ] Deduced a trap composed of 121 places in 132 ms of which 0 ms to minimize.
[2022-05-15 16:53:53] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 1 ms to minimize.
[2022-05-15 16:53:53] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 1 ms to minimize.
[2022-05-15 16:53:53] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 1 ms to minimize.
[2022-05-15 16:53:53] [INFO ] Deduced a trap composed of 132 places in 118 ms of which 1 ms to minimize.
[2022-05-15 16:53:53] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2022-05-15 16:53:53] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 1 ms to minimize.
[2022-05-15 16:53:54] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 1 ms to minimize.
[2022-05-15 16:53:54] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2022-05-15 16:53:54] [INFO ] Deduced a trap composed of 121 places in 119 ms of which 0 ms to minimize.
[2022-05-15 16:53:54] [INFO ] Deduced a trap composed of 130 places in 115 ms of which 0 ms to minimize.
[2022-05-15 16:53:54] [INFO ] Deduced a trap composed of 149 places in 110 ms of which 1 ms to minimize.
[2022-05-15 16:53:54] [INFO ] Deduced a trap composed of 116 places in 118 ms of which 0 ms to minimize.
[2022-05-15 16:53:54] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 1 ms to minimize.
[2022-05-15 16:53:55] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 0 ms to minimize.
[2022-05-15 16:53:55] [INFO ] Deduced a trap composed of 119 places in 120 ms of which 0 ms to minimize.
[2022-05-15 16:53:55] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 1 ms to minimize.
[2022-05-15 16:53:55] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 0 ms to minimize.
[2022-05-15 16:53:55] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 1 ms to minimize.
[2022-05-15 16:53:55] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 1 ms to minimize.
[2022-05-15 16:53:55] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 16:53:55] [INFO ] [Real]Absence check using 60 positive place invariants in 20 ms returned sat
[2022-05-15 16:53:55] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2022-05-15 16:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:53:56] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-05-15 16:53:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:53:56] [INFO ] [Nat]Absence check using 60 positive place invariants in 26 ms returned sat
[2022-05-15 16:53:56] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2022-05-15 16:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:53:56] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2022-05-15 16:53:56] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 0 ms to minimize.
[2022-05-15 16:53:56] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
[2022-05-15 16:53:56] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2022-05-15 16:53:57] [INFO ] Deduced a trap composed of 136 places in 142 ms of which 0 ms to minimize.
[2022-05-15 16:53:57] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 1 ms to minimize.
[2022-05-15 16:53:57] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2022-05-15 16:53:57] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 5 ms to minimize.
[2022-05-15 16:53:57] [INFO ] Deduced a trap composed of 130 places in 145 ms of which 1 ms to minimize.
[2022-05-15 16:53:57] [INFO ] Deduced a trap composed of 136 places in 140 ms of which 1 ms to minimize.
[2022-05-15 16:53:58] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 0 ms to minimize.
[2022-05-15 16:53:58] [INFO ] Deduced a trap composed of 151 places in 140 ms of which 1 ms to minimize.
[2022-05-15 16:53:58] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 0 ms to minimize.
[2022-05-15 16:53:58] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 1 ms to minimize.
[2022-05-15 16:53:58] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 0 ms to minimize.
[2022-05-15 16:53:58] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 1 ms to minimize.
[2022-05-15 16:53:59] [INFO ] Deduced a trap composed of 146 places in 136 ms of which 0 ms to minimize.
[2022-05-15 16:53:59] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
[2022-05-15 16:53:59] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2022-05-15 16:53:59] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2022-05-15 16:53:59] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2022-05-15 16:53:59] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
[2022-05-15 16:53:59] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2022-05-15 16:53:59] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
[2022-05-15 16:53:59] [INFO ] Deduced a trap composed of 143 places in 131 ms of which 1 ms to minimize.
[2022-05-15 16:53:59] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3391 ms
[2022-05-15 16:53:59] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 44 ms.
[2022-05-15 16:54:01] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 16:54:01] [INFO ] [Real]Absence check using 60 positive place invariants in 20 ms returned sat
[2022-05-15 16:54:01] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2022-05-15 16:54:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:01] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2022-05-15 16:54:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:54:01] [INFO ] [Nat]Absence check using 60 positive place invariants in 21 ms returned sat
[2022-05-15 16:54:01] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2022-05-15 16:54:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:01] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2022-05-15 16:54:01] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2022-05-15 16:54:01] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2022-05-15 16:54:02] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2022-05-15 16:54:02] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2022-05-15 16:54:02] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 4 ms to minimize.
[2022-05-15 16:54:02] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2022-05-15 16:54:02] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2022-05-15 16:54:02] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2022-05-15 16:54:02] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2022-05-15 16:54:02] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-05-15 16:54:02] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-05-15 16:54:02] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 0 ms to minimize.
[2022-05-15 16:54:03] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2022-05-15 16:54:03] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2022-05-15 16:54:03] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2022-05-15 16:54:03] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 0 ms to minimize.
[2022-05-15 16:54:03] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1531 ms
[2022-05-15 16:54:03] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 30 ms.
[2022-05-15 16:54:04] [INFO ] Added : 189 causal constraints over 38 iterations in 1265 ms. Result :sat
Minimization took 98 ms.
[2022-05-15 16:54:04] [INFO ] [Real]Absence check using 60 positive place invariants in 18 ms returned sat
[2022-05-15 16:54:04] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2022-05-15 16:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:04] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2022-05-15 16:54:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:54:05] [INFO ] [Nat]Absence check using 60 positive place invariants in 22 ms returned sat
[2022-05-15 16:54:05] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 15 ms returned sat
[2022-05-15 16:54:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:05] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2022-05-15 16:54:05] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 1 ms to minimize.
[2022-05-15 16:54:05] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 0 ms to minimize.
[2022-05-15 16:54:05] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2022-05-15 16:54:05] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 1 ms to minimize.
[2022-05-15 16:54:06] [INFO ] Deduced a trap composed of 143 places in 126 ms of which 0 ms to minimize.
[2022-05-15 16:54:06] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 1 ms to minimize.
[2022-05-15 16:54:06] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2022-05-15 16:54:06] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 1 ms to minimize.
[2022-05-15 16:54:06] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2022-05-15 16:54:06] [INFO ] Deduced a trap composed of 140 places in 120 ms of which 1 ms to minimize.
[2022-05-15 16:54:06] [INFO ] Deduced a trap composed of 142 places in 137 ms of which 0 ms to minimize.
[2022-05-15 16:54:07] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2022-05-15 16:54:07] [INFO ] Deduced a trap composed of 147 places in 129 ms of which 0 ms to minimize.
[2022-05-15 16:54:07] [INFO ] Deduced a trap composed of 146 places in 126 ms of which 0 ms to minimize.
[2022-05-15 16:54:07] [INFO ] Deduced a trap composed of 139 places in 127 ms of which 1 ms to minimize.
[2022-05-15 16:54:07] [INFO ] Deduced a trap composed of 146 places in 121 ms of which 0 ms to minimize.
[2022-05-15 16:54:07] [INFO ] Deduced a trap composed of 151 places in 138 ms of which 1 ms to minimize.
[2022-05-15 16:54:08] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2022-05-15 16:54:08] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2022-05-15 16:54:08] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
[2022-05-15 16:54:08] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 0 ms to minimize.
[2022-05-15 16:54:08] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 0 ms to minimize.
[2022-05-15 16:54:08] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 0 ms to minimize.
[2022-05-15 16:54:08] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2022-05-15 16:54:09] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2022-05-15 16:54:09] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2022-05-15 16:54:09] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2022-05-15 16:54:09] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2022-05-15 16:54:09] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2022-05-15 16:54:09] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 0 ms to minimize.
[2022-05-15 16:54:09] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 0 ms to minimize.
[2022-05-15 16:54:09] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 0 ms to minimize.
[2022-05-15 16:54:09] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2022-05-15 16:54:09] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 0 ms to minimize.
[2022-05-15 16:54:09] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 0 ms to minimize.
[2022-05-15 16:54:10] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2022-05-15 16:54: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 16:54:10] [INFO ] [Real]Absence check using 60 positive place invariants in 22 ms returned sat
[2022-05-15 16:54:10] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2022-05-15 16:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:10] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2022-05-15 16:54:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:54:10] [INFO ] [Nat]Absence check using 60 positive place invariants in 22 ms returned sat
[2022-05-15 16:54:10] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2022-05-15 16:54:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:10] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2022-05-15 16:54:10] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2022-05-15 16:54:11] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2022-05-15 16:54:11] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 0 ms to minimize.
[2022-05-15 16:54:11] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2022-05-15 16:54:11] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 0 ms to minimize.
[2022-05-15 16:54:11] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 0 ms to minimize.
[2022-05-15 16:54:11] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2022-05-15 16:54:12] [INFO ] Deduced a trap composed of 150 places in 122 ms of which 0 ms to minimize.
[2022-05-15 16:54:12] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 0 ms to minimize.
[2022-05-15 16:54:12] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 1 ms to minimize.
[2022-05-15 16:54:12] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 1 ms to minimize.
[2022-05-15 16:54:12] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 0 ms to minimize.
[2022-05-15 16:54:12] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2022-05-15 16:54:12] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-05-15 16:54:13] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2022-05-15 16:54:13] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 0 ms to minimize.
[2022-05-15 16:54:13] [INFO ] Deduced a trap composed of 133 places in 125 ms of which 0 ms to minimize.
[2022-05-15 16:54:13] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 0 ms to minimize.
[2022-05-15 16:54:13] [INFO ] Deduced a trap composed of 153 places in 163 ms of which 0 ms to minimize.
[2022-05-15 16:54:13] [INFO ] Deduced a trap composed of 142 places in 126 ms of which 0 ms to minimize.
[2022-05-15 16:54:14] [INFO ] Deduced a trap composed of 147 places in 126 ms of which 1 ms to minimize.
[2022-05-15 16:54:14] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 0 ms to minimize.
[2022-05-15 16:54:14] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 0 ms to minimize.
[2022-05-15 16:54:14] [INFO ] Deduced a trap composed of 140 places in 118 ms of which 0 ms to minimize.
[2022-05-15 16:54:14] [INFO ] Deduced a trap composed of 140 places in 116 ms of which 0 ms to minimize.
[2022-05-15 16:54:14] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2022-05-15 16:54:14] [INFO ] Deduced a trap composed of 140 places in 128 ms of which 0 ms to minimize.
[2022-05-15 16:54:15] [INFO ] Deduced a trap composed of 158 places in 117 ms of which 0 ms to minimize.
[2022-05-15 16:54:15] [INFO ] Deduced a trap composed of 124 places in 116 ms of which 1 ms to minimize.
[2022-05-15 16:54:15] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 0 ms to minimize.
[2022-05-15 16:54:15] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 1 ms to minimize.
[2022-05-15 16:54:15] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 16:54:15] [INFO ] [Real]Absence check using 60 positive place invariants in 20 ms returned sat
[2022-05-15 16:54:15] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2022-05-15 16:54:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:15] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2022-05-15 16:54:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:54:15] [INFO ] [Nat]Absence check using 60 positive place invariants in 25 ms returned sat
[2022-05-15 16:54:15] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2022-05-15 16:54:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:16] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2022-05-15 16:54:16] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 1 ms to minimize.
[2022-05-15 16:54:16] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 1 ms to minimize.
[2022-05-15 16:54:16] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 1 ms to minimize.
[2022-05-15 16:54:16] [INFO ] Deduced a trap composed of 146 places in 133 ms of which 0 ms to minimize.
[2022-05-15 16:54:16] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2022-05-15 16:54:17] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 0 ms to minimize.
[2022-05-15 16:54:17] [INFO ] Deduced a trap composed of 144 places in 129 ms of which 0 ms to minimize.
[2022-05-15 16:54:17] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 1 ms to minimize.
[2022-05-15 16:54:17] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 1 ms to minimize.
[2022-05-15 16:54:17] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2022-05-15 16:54:17] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2022-05-15 16:54:17] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 0 ms to minimize.
[2022-05-15 16:54:17] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 0 ms to minimize.
[2022-05-15 16:54:18] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 0 ms to minimize.
[2022-05-15 16:54:18] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 0 ms to minimize.
[2022-05-15 16:54:18] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2022-05-15 16:54:18] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 1 ms to minimize.
[2022-05-15 16:54:18] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 0 ms to minimize.
[2022-05-15 16:54:18] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2022-05-15 16:54:18] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2022-05-15 16:54:18] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2022-05-15 16:54:18] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
[2022-05-15 16:54:18] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 0 ms to minimize.
[2022-05-15 16:54:19] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2022-05-15 16:54:19] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
[2022-05-15 16:54:19] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2022-05-15 16:54:19] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3130 ms
[2022-05-15 16:54:19] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 34 ms.
[2022-05-15 16:54:20] [INFO ] Added : 225 causal constraints over 45 iterations in 1575 ms. Result :unknown
[2022-05-15 16:54:20] [INFO ] [Real]Absence check using 60 positive place invariants in 23 ms returned sat
[2022-05-15 16:54:20] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 8 ms returned sat
[2022-05-15 16:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:21] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2022-05-15 16:54:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:54:21] [INFO ] [Nat]Absence check using 60 positive place invariants in 23 ms returned sat
[2022-05-15 16:54:21] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2022-05-15 16:54:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:21] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2022-05-15 16:54:21] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 1 ms to minimize.
[2022-05-15 16:54:21] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 0 ms to minimize.
[2022-05-15 16:54:21] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2022-05-15 16:54:22] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 0 ms to minimize.
[2022-05-15 16:54:22] [INFO ] Deduced a trap composed of 143 places in 132 ms of which 0 ms to minimize.
[2022-05-15 16:54:22] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2022-05-15 16:54:22] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 1 ms to minimize.
[2022-05-15 16:54:22] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 0 ms to minimize.
[2022-05-15 16:54:22] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2022-05-15 16:54:22] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 0 ms to minimize.
[2022-05-15 16:54:23] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 0 ms to minimize.
[2022-05-15 16:54:23] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 0 ms to minimize.
[2022-05-15 16:54:23] [INFO ] Deduced a trap composed of 138 places in 112 ms of which 0 ms to minimize.
[2022-05-15 16:54:23] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 1 ms to minimize.
[2022-05-15 16:54:23] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2022-05-15 16:54:23] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2022-05-15 16:54:23] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2022-05-15 16:54:24] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 0 ms to minimize.
[2022-05-15 16:54:24] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 0 ms to minimize.
[2022-05-15 16:54:24] [INFO ] Deduced a trap composed of 143 places in 111 ms of which 0 ms to minimize.
[2022-05-15 16:54:24] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 0 ms to minimize.
[2022-05-15 16:54:24] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 1 ms to minimize.
[2022-05-15 16:54:24] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2022-05-15 16:54:24] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 0 ms to minimize.
[2022-05-15 16:54:25] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 1 ms to minimize.
[2022-05-15 16:54:25] [INFO ] Deduced a trap composed of 150 places in 111 ms of which 0 ms to minimize.
[2022-05-15 16:54:25] [INFO ] Deduced a trap composed of 150 places in 113 ms of which 0 ms to minimize.
[2022-05-15 16:54:25] [INFO ] Deduced a trap composed of 139 places in 111 ms of which 1 ms to minimize.
[2022-05-15 16:54:25] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 1 ms to minimize.
[2022-05-15 16:54:25] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 0 ms to minimize.
[2022-05-15 16:54:25] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 1 ms to minimize.
[2022-05-15 16:54:25] [INFO ] Deduced a trap composed of 149 places in 109 ms of which 0 ms to minimize.
[2022-05-15 16:54:26] [INFO ] Deduced a trap composed of 147 places in 108 ms of which 0 ms to minimize.
[2022-05-15 16:54:26] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 16:54:26] [INFO ] [Real]Absence check using 60 positive place invariants in 20 ms returned sat
[2022-05-15 16:54:26] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2022-05-15 16:54:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:26] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2022-05-15 16:54:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:54:26] [INFO ] [Nat]Absence check using 60 positive place invariants in 21 ms returned sat
[2022-05-15 16:54:26] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2022-05-15 16:54:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:26] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2022-05-15 16:54:26] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2022-05-15 16:54:27] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 0 ms to minimize.
[2022-05-15 16:54:27] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 0 ms to minimize.
[2022-05-15 16:54:27] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2022-05-15 16:54:27] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2022-05-15 16:54:27] [INFO ] Deduced a trap composed of 132 places in 136 ms of which 1 ms to minimize.
[2022-05-15 16:54:27] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 0 ms to minimize.
[2022-05-15 16:54:27] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 0 ms to minimize.
[2022-05-15 16:54:28] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2022-05-15 16:54:28] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 0 ms to minimize.
[2022-05-15 16:54:28] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 1 ms to minimize.
[2022-05-15 16:54:28] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 1 ms to minimize.
[2022-05-15 16:54:28] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 0 ms to minimize.
[2022-05-15 16:54:28] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 1 ms to minimize.
[2022-05-15 16:54:29] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 1 ms to minimize.
[2022-05-15 16:54:29] [INFO ] Deduced a trap composed of 142 places in 133 ms of which 1 ms to minimize.
[2022-05-15 16:54:29] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 0 ms to minimize.
[2022-05-15 16:54:29] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 1 ms to minimize.
[2022-05-15 16:54:29] [INFO ] Deduced a trap composed of 130 places in 126 ms of which 0 ms to minimize.
[2022-05-15 16:54:29] [INFO ] Deduced a trap composed of 130 places in 118 ms of which 0 ms to minimize.
[2022-05-15 16:54:29] [INFO ] Deduced a trap composed of 142 places in 116 ms of which 0 ms to minimize.
[2022-05-15 16:54:30] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 1 ms to minimize.
[2022-05-15 16:54:30] [INFO ] Deduced a trap composed of 154 places in 119 ms of which 0 ms to minimize.
[2022-05-15 16:54:30] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 1 ms to minimize.
[2022-05-15 16:54:30] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 0 ms to minimize.
[2022-05-15 16:54:30] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 0 ms to minimize.
[2022-05-15 16:54:30] [INFO ] Deduced a trap composed of 146 places in 128 ms of which 1 ms to minimize.
[2022-05-15 16:54:31] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 0 ms to minimize.
[2022-05-15 16:54:31] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 0 ms to minimize.
[2022-05-15 16:54:31] [INFO ] Deduced a trap composed of 144 places in 131 ms of which 1 ms to minimize.
[2022-05-15 16:54:31] [INFO ] Deduced a trap composed of 142 places in 128 ms of which 0 ms to minimize.
[2022-05-15 16:54:31] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 16:54:31] [INFO ] [Real]Absence check using 60 positive place invariants in 20 ms returned sat
[2022-05-15 16:54:31] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2022-05-15 16:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:31] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2022-05-15 16:54:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:54:31] [INFO ] [Nat]Absence check using 60 positive place invariants in 21 ms returned sat
[2022-05-15 16:54:31] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2022-05-15 16:54:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:32] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2022-05-15 16:54:32] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 1 ms to minimize.
[2022-05-15 16:54:32] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 0 ms to minimize.
[2022-05-15 16:54:32] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2022-05-15 16:54:32] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2022-05-15 16:54:32] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2022-05-15 16:54:33] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 1 ms to minimize.
[2022-05-15 16:54:33] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 0 ms to minimize.
[2022-05-15 16:54:33] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2022-05-15 16:54:33] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 1 ms to minimize.
[2022-05-15 16:54:33] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 1 ms to minimize.
[2022-05-15 16:54:33] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 0 ms to minimize.
[2022-05-15 16:54:33] [INFO ] Deduced a trap composed of 141 places in 128 ms of which 0 ms to minimize.
[2022-05-15 16:54:34] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 0 ms to minimize.
[2022-05-15 16:54:34] [INFO ] Deduced a trap composed of 130 places in 125 ms of which 1 ms to minimize.
[2022-05-15 16:54:34] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 0 ms to minimize.
[2022-05-15 16:54:34] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2216 ms
[2022-05-15 16:54:34] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 36 ms.
[2022-05-15 16:54:36] [INFO ] Added : 247 causal constraints over 50 iterations in 1740 ms. Result :sat
Minimization took 97 ms.
[2022-05-15 16:54:36] [INFO ] [Real]Absence check using 60 positive place invariants in 21 ms returned sat
[2022-05-15 16:54:36] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2022-05-15 16:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:36] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2022-05-15 16:54:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:54:36] [INFO ] [Nat]Absence check using 60 positive place invariants in 21 ms returned sat
[2022-05-15 16:54:36] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2022-05-15 16:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:36] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2022-05-15 16:54:36] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2022-05-15 16:54:37] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 1 ms to minimize.
[2022-05-15 16:54:37] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 0 ms to minimize.
[2022-05-15 16:54:37] [INFO ] Deduced a trap composed of 144 places in 125 ms of which 0 ms to minimize.
[2022-05-15 16:54:37] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 0 ms to minimize.
[2022-05-15 16:54:37] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2022-05-15 16:54:37] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2022-05-15 16:54:38] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 1 ms to minimize.
[2022-05-15 16:54:38] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 0 ms to minimize.
[2022-05-15 16:54:38] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 1 ms to minimize.
[2022-05-15 16:54:38] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2022-05-15 16:54:38] [INFO ] Deduced a trap composed of 132 places in 120 ms of which 1 ms to minimize.
[2022-05-15 16:54:38] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2022-05-15 16:54:38] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 0 ms to minimize.
[2022-05-15 16:54:38] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2022-05-15 16:54:39] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 3 ms to minimize.
[2022-05-15 16:54:39] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 0 ms to minimize.
[2022-05-15 16:54:39] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2022-05-15 16:54:39] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 0 ms to minimize.
[2022-05-15 16:54:39] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2022-05-15 16:54:39] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 0 ms to minimize.
[2022-05-15 16:54:39] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 0 ms to minimize.
[2022-05-15 16:54:39] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2811 ms
[2022-05-15 16:54:39] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 34 ms.
[2022-05-15 16:54:41] [INFO ] Added : 195 causal constraints over 39 iterations in 1392 ms. Result :sat
Minimization took 92 ms.
[2022-05-15 16:54:41] [INFO ] [Real]Absence check using 60 positive place invariants in 19 ms returned sat
[2022-05-15 16:54:41] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2022-05-15 16:54:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:41] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2022-05-15 16:54:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:54:41] [INFO ] [Nat]Absence check using 60 positive place invariants in 20 ms returned sat
[2022-05-15 16:54:41] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2022-05-15 16:54:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:54:41] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2022-05-15 16:54:41] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 1 ms to minimize.
[2022-05-15 16:54:42] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2022-05-15 16:54:42] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 0 ms to minimize.
[2022-05-15 16:54:42] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 0 ms to minimize.
[2022-05-15 16:54:42] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 1 ms to minimize.
[2022-05-15 16:54:42] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 1 ms to minimize.
[2022-05-15 16:54:42] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 0 ms to minimize.
[2022-05-15 16:54:42] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 0 ms to minimize.
[2022-05-15 16:54:42] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2022-05-15 16:54:43] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2022-05-15 16:54:43] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 0 ms to minimize.
[2022-05-15 16:54:43] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 0 ms to minimize.
[2022-05-15 16:54:43] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 0 ms to minimize.
[2022-05-15 16:54:43] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2022-05-15 16:54:43] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2022-05-15 16:54:43] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2022-05-15 16:54:43] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 0 ms to minimize.
[2022-05-15 16:54:43] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 0 ms to minimize.
[2022-05-15 16:54:44] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2022-05-15 16:54:44] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2339 ms
[2022-05-15 16:54:44] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 28 ms.
[2022-05-15 16:54:46] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 0 ms to minimize.
[2022-05-15 16:54:46] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2022-05-15 16:54:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2022-05-15 16:54:46] [INFO ] Added : 297 causal constraints over 60 iterations in 2358 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 616 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 356 edges and 616 vertex of which 7 / 616 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1252 edges and 610 vertex of which 605 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions 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 605 transition count 408
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 280 place count 466 transition count 408
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 280 place count 466 transition count 318
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 195 rules applied. Total rules applied 475 place count 361 transition count 318
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 559 place count 277 transition count 234
Iterating global reduction 2 with 84 rules applied. Total rules applied 643 place count 277 transition count 234
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 643 place count 277 transition count 224
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 2 with 23 rules applied. Total rules applied 666 place count 264 transition count 224
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 850 place count 171 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 852 place count 170 transition count 137
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 854 place count 170 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 856 place count 168 transition count 135
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 857 place count 168 transition count 135
Applied a total of 857 rules in 125 ms. Remains 168 /616 variables (removed 448) and now considering 135/556 (removed 421) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/616 places, 135/556 transitions.
// Phase 1: matrix 135 rows 168 cols
[2022-05-15 16:54:46] [INFO ] Computed 75 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 43778 resets, run finished after 2893 ms. (steps per millisecond=345 ) properties (out of 5) seen :5
FORMULA BusinessProcesses-PT-14-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 61375 ms.

BK_STOP 1652633689836

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-14"
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-14, 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 r024-tall-165251918500429"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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