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-165251918500437.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-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 7.6K Apr 29 23:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 23:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 29 23:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 29 23:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 157K 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-15-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652634763199

Running Version 202205111006
[2022-05-15 17:12:44] [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 17:12:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 17:12:44] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2022-05-15 17:12:44] [INFO ] Transformed 630 places.
[2022-05-15 17:12:44] [INFO ] Transformed 566 transitions.
[2022-05-15 17:12:44] [INFO ] Found NUPN structural information;
[2022-05-15 17:12:44] [INFO ] Parsed PT model containing 630 places and 566 transitions in 217 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
// Phase 1: matrix 562 rows 626 cols
[2022-05-15 17:12:44] [INFO ] Computed 102 place invariants in 48 ms
Incomplete random walk after 10000 steps, including 67 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 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 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 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 11 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 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 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 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
// Phase 1: matrix 562 rows 626 cols
[2022-05-15 17:12:44] [INFO ] Computed 102 place invariants in 19 ms
[2022-05-15 17:12:45] [INFO ] [Real]Absence check using 61 positive place invariants in 32 ms returned sat
[2022-05-15 17:12:45] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 32 ms returned sat
[2022-05-15 17:12:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:12:45] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2022-05-15 17:12:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:12:45] [INFO ] [Nat]Absence check using 61 positive place invariants in 22 ms returned sat
[2022-05-15 17:12:45] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 12 ms returned sat
[2022-05-15 17:12:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:12:45] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2022-05-15 17:12:45] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 7 ms to minimize.
[2022-05-15 17:12:46] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2022-05-15 17:12:46] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2022-05-15 17:12:46] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2022-05-15 17:12:46] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2022-05-15 17:12:46] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 0 ms to minimize.
[2022-05-15 17:12:46] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2022-05-15 17:12:46] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2022-05-15 17:12:46] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2022-05-15 17:12:46] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2022-05-15 17:12:46] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2022-05-15 17:12:47] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 0 ms to minimize.
[2022-05-15 17:12:47] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 0 ms to minimize.
[2022-05-15 17:12:47] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2022-05-15 17:12:47] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 0 ms to minimize.
[2022-05-15 17:12:47] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1572 ms
[2022-05-15 17:12:47] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 37 ms.
[2022-05-15 17:12:49] [INFO ] Added : 303 causal constraints over 61 iterations in 2408 ms. Result :sat
Minimization took 116 ms.
[2022-05-15 17:12:50] [INFO ] [Real]Absence check using 61 positive place invariants in 27 ms returned sat
[2022-05-15 17:12:50] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2022-05-15 17:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:12:50] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2022-05-15 17:12:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:12:50] [INFO ] [Nat]Absence check using 61 positive place invariants in 21 ms returned sat
[2022-05-15 17:12:50] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 12 ms returned sat
[2022-05-15 17:12:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:12:50] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2022-05-15 17:12:50] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2022-05-15 17:12:50] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2022-05-15 17:12:51] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 1 ms to minimize.
[2022-05-15 17:12:51] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2022-05-15 17:12:51] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 0 ms to minimize.
[2022-05-15 17:12:51] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 0 ms to minimize.
[2022-05-15 17:12:51] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2022-05-15 17:12:51] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 1 ms to minimize.
[2022-05-15 17:12:52] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 0 ms to minimize.
[2022-05-15 17:12:52] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 1 ms to minimize.
[2022-05-15 17:12:52] [INFO ] Deduced a trap composed of 153 places in 138 ms of which 1 ms to minimize.
[2022-05-15 17:12:52] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-05-15 17:12:52] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2022-05-15 17:12:52] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2022-05-15 17:12:52] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2022-05-15 17:12:52] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2022-05-15 17:12:53] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2022-05-15 17:12:53] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2022-05-15 17:12:53] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2022-05-15 17:12:53] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 3 ms to minimize.
[2022-05-15 17:12:53] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2624 ms
[2022-05-15 17:12:53] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 38 ms.
[2022-05-15 17:12:55] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 1 ms to minimize.
[2022-05-15 17:12: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 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.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
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 17:12:55] [INFO ] [Real]Absence check using 61 positive place invariants in 21 ms returned sat
[2022-05-15 17:12:55] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2022-05-15 17:12:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:12:55] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2022-05-15 17:12:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:12:56] [INFO ] [Nat]Absence check using 61 positive place invariants in 22 ms returned sat
[2022-05-15 17:12:56] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2022-05-15 17:12:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:12:56] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2022-05-15 17:12:56] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 0 ms to minimize.
[2022-05-15 17:12:56] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2022-05-15 17:12:56] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 0 ms to minimize.
[2022-05-15 17:12:56] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 1 ms to minimize.
[2022-05-15 17:12:57] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2022-05-15 17:12:57] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 1 ms to minimize.
[2022-05-15 17:12:57] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2022-05-15 17:12:57] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 0 ms to minimize.
[2022-05-15 17:12:57] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 1 ms to minimize.
[2022-05-15 17:12:57] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 0 ms to minimize.
[2022-05-15 17:12:57] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2022-05-15 17:12:58] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 1 ms to minimize.
[2022-05-15 17:12:58] [INFO ] Deduced a trap composed of 156 places in 141 ms of which 2 ms to minimize.
[2022-05-15 17:12:58] [INFO ] Deduced a trap composed of 150 places in 126 ms of which 1 ms to minimize.
[2022-05-15 17:12:58] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2022-05-15 17:12:58] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 0 ms to minimize.
[2022-05-15 17:12:58] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 1 ms to minimize.
[2022-05-15 17:12:59] [INFO ] Deduced a trap composed of 158 places in 123 ms of which 1 ms to minimize.
[2022-05-15 17:12:59] [INFO ] Deduced a trap composed of 144 places in 123 ms of which 0 ms to minimize.
[2022-05-15 17:12:59] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2022-05-15 17:12:59] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3083 ms
[2022-05-15 17:12:59] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 33 ms.
[2022-05-15 17:13:01] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 2 ms to minimize.
[2022-05-15 17:13: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
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 17:13:01] [INFO ] [Real]Absence check using 61 positive place invariants in 20 ms returned sat
[2022-05-15 17:13:01] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 20 ms returned sat
[2022-05-15 17:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:01] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2022-05-15 17:13:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:13:01] [INFO ] [Nat]Absence check using 61 positive place invariants in 23 ms returned sat
[2022-05-15 17:13:01] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 12 ms returned sat
[2022-05-15 17:13:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:01] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2022-05-15 17:13:01] [INFO ] Deduced a trap composed of 138 places in 134 ms of which 1 ms to minimize.
[2022-05-15 17:13:02] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 0 ms to minimize.
[2022-05-15 17:13:02] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2022-05-15 17:13:02] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2022-05-15 17:13:02] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2022-05-15 17:13:02] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2022-05-15 17:13:02] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 0 ms to minimize.
[2022-05-15 17:13:02] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2022-05-15 17:13:03] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 2 ms to minimize.
[2022-05-15 17:13:03] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2022-05-15 17:13:03] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 2 ms to minimize.
[2022-05-15 17:13:03] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 4 ms to minimize.
[2022-05-15 17:13:03] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2022-05-15 17:13:03] [INFO ] Deduced a trap composed of 129 places in 127 ms of which 1 ms to minimize.
[2022-05-15 17:13:04] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2022-05-15 17:13:04] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 1 ms to minimize.
[2022-05-15 17:13:04] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 0 ms to minimize.
[2022-05-15 17:13:04] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2022-05-15 17:13:04] [INFO ] Deduced a trap composed of 133 places in 126 ms of which 0 ms to minimize.
[2022-05-15 17:13:04] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 0 ms to minimize.
[2022-05-15 17:13:04] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 0 ms to minimize.
[2022-05-15 17:13:05] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2022-05-15 17:13:05] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 0 ms to minimize.
[2022-05-15 17:13:05] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 0 ms to minimize.
[2022-05-15 17:13:05] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2022-05-15 17:13:05] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 1 ms to minimize.
[2022-05-15 17:13:05] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 1 ms to minimize.
[2022-05-15 17:13:05] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 0 ms to minimize.
[2022-05-15 17:13:05] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 0 ms to minimize.
[2022-05-15 17:13:06] [INFO ] Deduced a trap composed of 139 places in 117 ms of which 0 ms to minimize.
[2022-05-15 17:13:06] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 1 ms to minimize.
[2022-05-15 17:13:06] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 0 ms to minimize.
[2022-05-15 17:13:06] [INFO ] Deduced a trap composed of 155 places in 129 ms of which 0 ms to minimize.
[2022-05-15 17:13:06] [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 17:13:06] [INFO ] [Real]Absence check using 61 positive place invariants in 22 ms returned sat
[2022-05-15 17:13:06] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2022-05-15 17:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:06] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2022-05-15 17:13:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:13:07] [INFO ] [Nat]Absence check using 61 positive place invariants in 24 ms returned sat
[2022-05-15 17:13:07] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2022-05-15 17:13:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:07] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2022-05-15 17:13:07] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2022-05-15 17:13:07] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 1 ms to minimize.
[2022-05-15 17:13:07] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2022-05-15 17:13:07] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 1 ms to minimize.
[2022-05-15 17:13:08] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 1 ms to minimize.
[2022-05-15 17:13:08] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 1 ms to minimize.
[2022-05-15 17:13:08] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 1 ms to minimize.
[2022-05-15 17:13:08] [INFO ] Deduced a trap composed of 134 places in 149 ms of which 1 ms to minimize.
[2022-05-15 17:13:08] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2022-05-15 17:13:08] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
[2022-05-15 17:13:09] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2022-05-15 17:13:09] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 0 ms to minimize.
[2022-05-15 17:13:09] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 0 ms to minimize.
[2022-05-15 17:13:09] [INFO ] Deduced a trap composed of 136 places in 131 ms of which 0 ms to minimize.
[2022-05-15 17:13:09] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 0 ms to minimize.
[2022-05-15 17:13:09] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 0 ms to minimize.
[2022-05-15 17:13:10] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 0 ms to minimize.
[2022-05-15 17:13:10] [INFO ] Deduced a trap composed of 124 places in 139 ms of which 2 ms to minimize.
[2022-05-15 17:13:10] [INFO ] Deduced a trap composed of 144 places in 138 ms of which 1 ms to minimize.
[2022-05-15 17:13:10] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 0 ms to minimize.
[2022-05-15 17:13:10] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 0 ms to minimize.
[2022-05-15 17:13:10] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 0 ms to minimize.
[2022-05-15 17:13:11] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 1 ms to minimize.
[2022-05-15 17:13:11] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2022-05-15 17:13:11] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2022-05-15 17:13:11] [INFO ] Deduced a trap composed of 153 places in 141 ms of which 0 ms to minimize.
[2022-05-15 17:13:11] [INFO ] Deduced a trap composed of 145 places in 132 ms of which 0 ms to minimize.
[2022-05-15 17:13:11] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 0 ms to minimize.
[2022-05-15 17:13:11] [INFO ] Deduced a trap composed of 147 places in 134 ms of which 1 ms to minimize.
[2022-05-15 17:13: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 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 17:13:12] [INFO ] [Real]Absence check using 61 positive place invariants in 23 ms returned sat
[2022-05-15 17:13:12] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2022-05-15 17:13:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:12] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2022-05-15 17:13:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:13:12] [INFO ] [Nat]Absence check using 61 positive place invariants in 24 ms returned sat
[2022-05-15 17:13:12] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2022-05-15 17:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:12] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-05-15 17:13:12] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 0 ms to minimize.
[2022-05-15 17:13:13] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2022-05-15 17:13:13] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 1 ms to minimize.
[2022-05-15 17:13:13] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2022-05-15 17:13:13] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2022-05-15 17:13:13] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2022-05-15 17:13:13] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2022-05-15 17:13:13] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2022-05-15 17:13:13] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2022-05-15 17:13:13] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2022-05-15 17:13:13] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2022-05-15 17:13:14] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2022-05-15 17:13:14] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 2 ms to minimize.
[2022-05-15 17:13:14] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2022-05-15 17:13:14] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2022-05-15 17:13:14] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2022-05-15 17:13:14] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2022-05-15 17:13:14] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2022-05-15 17:13:14] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2022-05-15 17:13:14] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1935 ms
[2022-05-15 17:13:14] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 41 ms.
[2022-05-15 17:13:17] [INFO ] Added : 315 causal constraints over 63 iterations in 2455 ms. Result :sat
Minimization took 118 ms.
[2022-05-15 17:13:17] [INFO ] [Real]Absence check using 61 positive place invariants in 21 ms returned sat
[2022-05-15 17:13:17] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2022-05-15 17:13:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:17] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2022-05-15 17:13:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:13:17] [INFO ] [Nat]Absence check using 61 positive place invariants in 21 ms returned sat
[2022-05-15 17:13:17] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 12 ms returned sat
[2022-05-15 17:13:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:17] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2022-05-15 17:13:18] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2022-05-15 17:13:18] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2022-05-15 17:13:18] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2022-05-15 17:13:18] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2022-05-15 17:13:18] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2022-05-15 17:13:18] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2022-05-15 17:13:18] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 0 ms to minimize.
[2022-05-15 17:13:18] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2022-05-15 17:13:18] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 0 ms to minimize.
[2022-05-15 17:13:18] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2022-05-15 17:13:19] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-05-15 17:13:19] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 0 ms to minimize.
[2022-05-15 17:13:19] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2022-05-15 17:13:19] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2022-05-15 17:13:19] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 0 ms to minimize.
[2022-05-15 17:13:19] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2022-05-15 17:13:19] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 0 ms to minimize.
[2022-05-15 17:13:19] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2022-05-15 17:13:19] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2022-05-15 17:13:19] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1792 ms
[2022-05-15 17:13:19] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 29 ms.
[2022-05-15 17:13:21] [INFO ] Added : 307 causal constraints over 62 iterations in 2273 ms. Result :sat
Minimization took 131 ms.
[2022-05-15 17:13:22] [INFO ] [Real]Absence check using 61 positive place invariants in 22 ms returned sat
[2022-05-15 17:13:22] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2022-05-15 17:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:22] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2022-05-15 17:13:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:13:22] [INFO ] [Nat]Absence check using 61 positive place invariants in 22 ms returned sat
[2022-05-15 17:13:22] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2022-05-15 17:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:22] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2022-05-15 17:13:22] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 0 ms to minimize.
[2022-05-15 17:13:23] [INFO ] Deduced a trap composed of 147 places in 129 ms of which 0 ms to minimize.
[2022-05-15 17:13:23] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2022-05-15 17:13:23] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2022-05-15 17:13:23] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2022-05-15 17:13:23] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2022-05-15 17:13:23] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 0 ms to minimize.
[2022-05-15 17:13:23] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2022-05-15 17:13:24] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 0 ms to minimize.
[2022-05-15 17:13:24] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2022-05-15 17:13:24] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 0 ms to minimize.
[2022-05-15 17:13:24] [INFO ] Deduced a trap composed of 151 places in 115 ms of which 1 ms to minimize.
[2022-05-15 17:13:24] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2022-05-15 17:13:24] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 0 ms to minimize.
[2022-05-15 17:13:24] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 1 ms to minimize.
[2022-05-15 17:13:25] [INFO ] Deduced a trap composed of 145 places in 124 ms of which 0 ms to minimize.
[2022-05-15 17:13:25] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 0 ms to minimize.
[2022-05-15 17:13:25] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 0 ms to minimize.
[2022-05-15 17:13:25] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 0 ms to minimize.
[2022-05-15 17:13:25] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 0 ms to minimize.
[2022-05-15 17:13:25] [INFO ] Deduced a trap composed of 148 places in 115 ms of which 1 ms to minimize.
[2022-05-15 17:13:25] [INFO ] Deduced a trap composed of 144 places in 124 ms of which 1 ms to minimize.
[2022-05-15 17:13:26] [INFO ] Deduced a trap composed of 146 places in 125 ms of which 1 ms to minimize.
[2022-05-15 17:13:26] [INFO ] Deduced a trap composed of 140 places in 128 ms of which 1 ms to minimize.
[2022-05-15 17:13:26] [INFO ] Deduced a trap composed of 147 places in 119 ms of which 0 ms to minimize.
[2022-05-15 17:13:26] [INFO ] Deduced a trap composed of 142 places in 117 ms of which 0 ms to minimize.
[2022-05-15 17:13:26] [INFO ] Deduced a trap composed of 145 places in 124 ms of which 1 ms to minimize.
[2022-05-15 17:13:26] [INFO ] Deduced a trap composed of 143 places in 117 ms of which 1 ms to minimize.
[2022-05-15 17:13:26] [INFO ] Deduced a trap composed of 153 places in 117 ms of which 0 ms to minimize.
[2022-05-15 17:13:27] [INFO ] Deduced a trap composed of 150 places in 118 ms of which 1 ms to minimize.
[2022-05-15 17:13:27] [INFO ] Deduced a trap composed of 149 places in 133 ms of which 0 ms to minimize.
[2022-05-15 17:13:27] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 1 ms to minimize.
[2022-05-15 17:13:27] [INFO ] Deduced a trap composed of 178 places in 130 ms of which 0 ms to minimize.
[2022-05-15 17:13:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 17:13:27] [INFO ] [Real]Absence check using 61 positive place invariants in 21 ms returned sat
[2022-05-15 17:13:27] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2022-05-15 17:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:27] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2022-05-15 17:13:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:13:28] [INFO ] [Nat]Absence check using 61 positive place invariants in 21 ms returned sat
[2022-05-15 17:13:28] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2022-05-15 17:13:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:28] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2022-05-15 17:13:28] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 1 ms to minimize.
[2022-05-15 17:13:28] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 0 ms to minimize.
[2022-05-15 17:13:28] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 0 ms to minimize.
[2022-05-15 17:13:28] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2022-05-15 17:13:29] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2022-05-15 17:13:29] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 0 ms to minimize.
[2022-05-15 17:13:29] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2022-05-15 17:13:29] [INFO ] Deduced a trap composed of 144 places in 127 ms of which 0 ms to minimize.
[2022-05-15 17:13:29] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2022-05-15 17:13:29] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2022-05-15 17:13:29] [INFO ] Deduced a trap composed of 161 places in 125 ms of which 0 ms to minimize.
[2022-05-15 17:13:30] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2022-05-15 17:13:30] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2022-05-15 17:13:30] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2022-05-15 17:13:30] [INFO ] Deduced a trap composed of 124 places in 113 ms of which 1 ms to minimize.
[2022-05-15 17:13:30] [INFO ] Deduced a trap composed of 127 places in 119 ms of which 1 ms to minimize.
[2022-05-15 17:13:30] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 1 ms to minimize.
[2022-05-15 17:13:30] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2022-05-15 17:13:31] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2022-05-15 17:13:31] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2022-05-15 17:13:31] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 0 ms to minimize.
[2022-05-15 17:13:31] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 0 ms to minimize.
[2022-05-15 17:13:31] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2022-05-15 17:13:31] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 0 ms to minimize.
[2022-05-15 17:13:31] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 0 ms to minimize.
[2022-05-15 17:13:31] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 0 ms to minimize.
[2022-05-15 17:13:31] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2022-05-15 17:13:31] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 0 ms to minimize.
[2022-05-15 17:13:31] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 0 ms to minimize.
[2022-05-15 17:13:31] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-05-15 17:13:32] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 0 ms to minimize.
[2022-05-15 17:13:32] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 0 ms to minimize.
[2022-05-15 17:13:32] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2022-05-15 17:13:32] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2022-05-15 17:13:32] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2022-05-15 17:13:32] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2022-05-15 17:13:32] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2022-05-15 17:13:32] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 0 ms to minimize.
[2022-05-15 17:13:32] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2022-05-15 17:13:32] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 0 ms to minimize.
[2022-05-15 17:13:32] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2022-05-15 17:13:32] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2022-05-15 17:13:32] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2022-05-15 17:13:32] [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: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)
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]
FORMULA BusinessProcesses-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 626/626 places, 562/562 transitions.
Graph (trivial) has 353 edges and 626 vertex of which 7 / 626 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1267 edges and 620 vertex of which 616 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 138 place count 616 transition count 417
Reduce places removed 136 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 480 transition count 415
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 278 place count 478 transition count 415
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 278 place count 478 transition count 321
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 485 place count 365 transition count 321
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 563 place count 287 transition count 243
Iterating global reduction 3 with 78 rules applied. Total rules applied 641 place count 287 transition count 243
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 641 place count 287 transition count 236
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 657 place count 278 transition count 236
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 853 place count 179 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 855 place count 178 transition count 143
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 857 place count 178 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 859 place count 176 transition count 141
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 860 place count 176 transition count 141
Applied a total of 860 rules in 133 ms. Remains 176 /626 variables (removed 450) and now considering 141/562 (removed 421) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/626 places, 141/562 transitions.
// Phase 1: matrix 141 rows 176 cols
[2022-05-15 17:13:33] [INFO ] Computed 76 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 28533 resets, run finished after 2783 ms. (steps per millisecond=359 ) properties (out of 6) seen :5
FORMULA BusinessProcesses-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 16561 resets, run finished after 1836 ms. (steps per millisecond=544 ) properties (out of 1) seen :0
// Phase 1: matrix 141 rows 176 cols
[2022-05-15 17:13:37] [INFO ] Computed 76 place invariants in 9 ms
[2022-05-15 17:13:38] [INFO ] [Real]Absence check using 58 positive place invariants in 6 ms returned sat
[2022-05-15 17:13:38] [INFO ] [Real]Absence check using 58 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 17:13:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:38] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-15 17:13:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:13:38] [INFO ] [Nat]Absence check using 58 positive place invariants in 32 ms returned sat
[2022-05-15 17:13:38] [INFO ] [Nat]Absence check using 58 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-15 17:13:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:38] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-15 17:13:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-15 17:13:38] [INFO ] [Nat]Added 12 Read/Feed constraints in 6 ms returned sat
[2022-05-15 17:13:38] [INFO ] Computed and/alt/rep : 91/422/91 causal constraints (skipped 48 transitions) in 9 ms.
[2022-05-15 17:13:38] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 0 ms to minimize.
[2022-05-15 17:13:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-15 17:13:38] [INFO ] Added : 20 causal constraints over 4 iterations in 100 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 141/141 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 176 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 174 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 174 transition count 137
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 171 transition count 137
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 168 transition count 134
Applied a total of 15 rules in 16 ms. Remains 168 /176 variables (removed 8) and now considering 134/141 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/176 places, 134/141 transitions.
// Phase 1: matrix 134 rows 168 cols
[2022-05-15 17:13:38] [INFO ] Computed 75 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 30034 resets, run finished after 2574 ms. (steps per millisecond=388 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 18581 resets, run finished after 1899 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
// Phase 1: matrix 134 rows 168 cols
[2022-05-15 17:13:42] [INFO ] Computed 75 place invariants in 6 ms
[2022-05-15 17:13:42] [INFO ] [Real]Absence check using 59 positive place invariants in 15 ms returned sat
[2022-05-15 17:13:42] [INFO ] [Real]Absence check using 59 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-15 17:13:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:42] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-05-15 17:13:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:13:42] [INFO ] [Nat]Absence check using 59 positive place invariants in 7 ms returned sat
[2022-05-15 17:13:42] [INFO ] [Nat]Absence check using 59 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-15 17:13:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:43] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-15 17:13:43] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-15 17:13:43] [INFO ] [Nat]Added 12 Read/Feed constraints in 5 ms returned sat
[2022-05-15 17:13:43] [INFO ] Computed and/alt/rep : 83/399/83 causal constraints (skipped 49 transitions) in 9 ms.
[2022-05-15 17:13:43] [INFO ] Added : 32 causal constraints over 7 iterations in 109 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 168/168 places, 134/134 transitions.
Applied a total of 0 rules in 8 ms. Remains 168 /168 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/168 places, 134/134 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 168/168 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 168 /168 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 168 cols
[2022-05-15 17:13:43] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-15 17:13:43] [INFO ] Implicit Places using invariants in 140 ms returned [1, 2, 3, 4, 5, 10, 11, 34, 35, 36, 37, 42, 43, 44, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 142 ms to find 24 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 144/168 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 144 /144 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 144/168 places, 134/134 transitions.
Successfully produced net in file /tmp/petri1000_4686672397783049627.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 133 rows 144 cols
[2022-05-15 17:13:43] [INFO ] Computed 52 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 30083 resets, run finished after 1672 ms. (steps per millisecond=598 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 18512 resets, run finished after 1212 ms. (steps per millisecond=825 ) properties (out of 1) seen :0
// Phase 1: matrix 133 rows 144 cols
[2022-05-15 17:13:46] [INFO ] Computed 52 place invariants in 3 ms
[2022-05-15 17:13:46] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2022-05-15 17:13:46] [INFO ] [Real]Absence check using 35 positive and 17 generalized place invariants in 2 ms returned sat
[2022-05-15 17:13:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:46] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-05-15 17:13:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:13:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2022-05-15 17:13:46] [INFO ] [Nat]Absence check using 35 positive and 17 generalized place invariants in 12 ms returned sat
[2022-05-15 17:13:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:46] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-15 17:13:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-15 17:13:46] [INFO ] [Nat]Added 12 Read/Feed constraints in 6 ms returned sat
[2022-05-15 17:13:46] [INFO ] Computed and/alt/rep : 83/396/83 causal constraints (skipped 48 transitions) in 12 ms.
[2022-05-15 17:13:46] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2022-05-15 17:13:46] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2022-05-15 17:13:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2022-05-15 17:13:46] [INFO ] Added : 26 causal constraints over 6 iterations in 245 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 144/144 places, 133/133 transitions.
Graph (complete) has 560 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 143 /144 variables (removed 1) and now considering 133/133 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/144 places, 133/133 transitions.
// Phase 1: matrix 133 rows 143 cols
[2022-05-15 17:13:46] [INFO ] Computed 51 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 29985 resets, run finished after 1654 ms. (steps per millisecond=604 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 18506 resets, run finished after 1200 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 133 rows 143 cols
[2022-05-15 17:13:49] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-15 17:13:49] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2022-05-15 17:13:49] [INFO ] [Real]Absence check using 35 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-15 17:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:49] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-05-15 17:13:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:13:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2022-05-15 17:13:49] [INFO ] [Nat]Absence check using 35 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-15 17:13:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:49] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-05-15 17:13:49] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-15 17:13:49] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-15 17:13:49] [INFO ] Computed and/alt/rep : 83/396/83 causal constraints (skipped 48 transitions) in 10 ms.
[2022-05-15 17:13:49] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2022-05-15 17:13:49] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2022-05-15 17:13:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2022-05-15 17:13:49] [INFO ] Added : 26 causal constraints over 6 iterations in 214 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 133/133 transitions.
Applied a total of 0 rules in 6 ms. Remains 143 /143 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 133/133 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 133/133 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 143 cols
[2022-05-15 17:13:50] [INFO ] Computed 51 place invariants in 0 ms
[2022-05-15 17:13:50] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 133 rows 143 cols
[2022-05-15 17:13:50] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-15 17:13:50] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-15 17:13:50] [INFO ] Implicit Places using invariants and state equation in 244 ms returned [5, 27, 29, 32, 34, 36, 38, 40, 42, 44, 51, 53, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93]
Discarding 30 places :
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 334 ms to find 30 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 113/143 places, 129/133 transitions.
Graph (complete) has 357 edges and 113 vertex of which 103 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 14 rules applied. Total rules applied 15 place count 103 transition count 115
Reduce places removed 13 places and 0 transitions.
Graph (complete) has 275 edges and 90 vertex of which 89 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 29 place count 89 transition count 115
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 89 transition count 114
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 42 place count 77 transition count 74
Iterating global reduction 3 with 12 rules applied. Total rules applied 54 place count 77 transition count 74
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 77 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 58 place count 75 transition count 72
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 61 place count 72 transition count 69
Iterating global reduction 5 with 3 rules applied. Total rules applied 64 place count 72 transition count 69
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 13 rules applied. Total rules applied 77 place count 65 transition count 63
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 79 place count 64 transition count 62
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 64 transition count 61
Applied a total of 80 rules in 15 ms. Remains 64 /113 variables (removed 49) and now considering 61/129 (removed 68) transitions.
// Phase 1: matrix 61 rows 64 cols
[2022-05-15 17:13:50] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-15 17:13:50] [INFO ] Implicit Places using invariants in 47 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 61/143 places, 61/133 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 61 transition count 58
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 58 transition count 58
Applied a total of 6 rules in 4 ms. Remains 58 /61 variables (removed 3) and now considering 58/61 (removed 3) transitions.
// Phase 1: matrix 58 rows 58 cols
[2022-05-15 17:13:50] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-15 17:13:50] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 58 rows 58 cols
[2022-05-15 17:13:50] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 17:13:50] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 17:13:50] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [13, 19, 21]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 120 ms to find 3 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 55/143 places, 58/133 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 54 transition count 56
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 23 rules applied. Total rules applied 26 place count 40 transition count 47
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 37 transition count 44
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 37 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 37 transition count 43
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 2 with 2 rules applied. Total rules applied 35 place count 36 transition count 42
Applied a total of 35 rules in 6 ms. Remains 36 /55 variables (removed 19) and now considering 42/58 (removed 16) transitions.
// Phase 1: matrix 42 rows 36 cols
[2022-05-15 17:13:50] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 17:13:50] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 42 rows 36 cols
[2022-05-15 17:13:50] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 17:13:50] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-15 17:13:50] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 4 : 36/143 places, 42/133 transitions.
Finished structural reductions, in 4 iterations. Remains : 36/143 places, 42/133 transitions.
// Phase 1: matrix 42 rows 36 cols
[2022-05-15 17:13:50] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 52881 resets, run finished after 512 ms. (steps per millisecond=1953 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 29482 resets, run finished after 314 ms. (steps per millisecond=3184 ) properties (out of 1) seen :0
// Phase 1: matrix 42 rows 36 cols
[2022-05-15 17:13:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 17:13:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 17:13:51] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 17:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-15 17:13:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:13:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 17:13:51] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 17:13:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:51] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-15 17:13:51] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-15 17:13:51] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2022-05-15 17:13:51] [INFO ] Computed and/alt/rep : 39/239/39 causal constraints (skipped 1 transitions) in 3 ms.
[2022-05-15 17:13:51] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-05-15 17:13:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-05-15 17:13:51] [INFO ] Added : 29 causal constraints over 6 iterations in 75 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 36/36 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 36/36 places, 42/42 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 36/36 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 36 cols
[2022-05-15 17:13:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 17:13:51] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 42 rows 36 cols
[2022-05-15 17:13:51] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 17:13:51] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-15 17:13:51] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2022-05-15 17:13:51] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 42 rows 36 cols
[2022-05-15 17:13:51] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 17:13:51] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/36 places, 42/42 transitions.
Starting property specific reduction for BusinessProcesses-PT-15-UpperBounds-07
// Phase 1: matrix 42 rows 36 cols
[2022-05-15 17:13:51] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 512 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 296 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
// Phase 1: matrix 42 rows 36 cols
[2022-05-15 17:13:51] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 17:13:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 17:13:51] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 17:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-15 17:13:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:13:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 17:13:51] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 17:13:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-15 17:13:51] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-15 17:13:51] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2022-05-15 17:13:51] [INFO ] Computed and/alt/rep : 39/239/39 causal constraints (skipped 1 transitions) in 2 ms.
[2022-05-15 17:13:51] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 17:13:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-05-15 17:13:51] [INFO ] Added : 29 causal constraints over 6 iterations in 82 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 36/36 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 36 /36 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 36/36 places, 42/42 transitions.
// Phase 1: matrix 42 rows 36 cols
[2022-05-15 17:13:51] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 52331 resets, run finished after 400 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 29610 resets, run finished after 271 ms. (steps per millisecond=3690 ) properties (out of 1) seen :0
// Phase 1: matrix 42 rows 36 cols
[2022-05-15 17:13:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 17:13:52] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-15 17:13:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 17:13:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:52] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-15 17:13:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:13:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 17:13:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 17:13:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:13:52] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-15 17:13:52] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-15 17:13:52] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2022-05-15 17:13:52] [INFO ] Computed and/alt/rep : 39/239/39 causal constraints (skipped 1 transitions) in 3 ms.
[2022-05-15 17:13:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 17:13:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-15 17:13:52] [INFO ] Added : 29 causal constraints over 6 iterations in 81 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 36/36 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 36 /36 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 36/36 places, 42/42 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 36/36 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 36 cols
[2022-05-15 17:13:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 17:13:52] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 42 rows 36 cols
[2022-05-15 17:13:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 17:13:52] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-15 17:13:52] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-05-15 17:13:52] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 42 rows 36 cols
[2022-05-15 17:13:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 17:13:52] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/36 places, 42/42 transitions.
Ending property specific reduction for BusinessProcesses-PT-15-UpperBounds-07 in 1198 ms.
[2022-05-15 17:13:53] [INFO ] Flatten gal took : 22 ms
[2022-05-15 17:13:53] [INFO ] Applying decomposition
[2022-05-15 17:13:53] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17524518786273531580.txt' '-o' '/tmp/graph17524518786273531580.bin' '-w' '/tmp/graph17524518786273531580.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17524518786273531580.bin' '-l' '-1' '-v' '-w' '/tmp/graph17524518786273531580.weights' '-q' '0' '-e' '0.001'
[2022-05-15 17:13:53] [INFO ] Decomposing Gal with order
[2022-05-15 17:13:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 17:13:53] [INFO ] Removed a total of 29 redundant transitions.
[2022-05-15 17:13:53] [INFO ] Flatten gal took : 54 ms
[2022-05-15 17:13:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 4 ms.
[2022-05-15 17:13:53] [INFO ] Time to serialize gal into /tmp/UpperBounds305317360039598500.gal : 8 ms
[2022-05-15 17:13:53] [INFO ] Time to serialize properties into /tmp/UpperBounds15738976414506485198.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds305317360039598500.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15738976414506485198.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds15738976414506485198.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,813,0.033922,4068,73,55,1030,491,125,1152,63,947,0
Total reachable state count : 813

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property BusinessProcesses-PT-15-UpperBounds-07 :0 <= i3.u0.p69 <= 1
FORMULA BusinessProcesses-PT-15-UpperBounds-07 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-15-UpperBounds-07,0,0.03595,4068,1,0,1030,491,192,1152,84,947,144
Total runtime 68911 ms.

BK_STOP 1652634833494

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-15"
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-15, 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-165251918500437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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