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.r028-tall-165251936100166.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 gold2021
Input is BusinessProcesses-PT-16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 5.9K Apr 29 23:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 29 23:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 23:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 29 23:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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.7K 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 159K 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-16-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652541401869

Running Version 0
[2022-05-14 15:16:43] [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-14 15:16:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 15:16:43] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2022-05-14 15:16:43] [INFO ] Transformed 638 places.
[2022-05-14 15:16:43] [INFO ] Transformed 578 transitions.
[2022-05-14 15:16:43] [INFO ] Found NUPN structural information;
[2022-05-14 15:16:43] [INFO ] Parsed PT model containing 638 places and 578 transitions in 132 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
// Phase 1: matrix 570 rows 630 cols
[2022-05-14 15:16:43] [INFO ] Computed 100 place invariants in 45 ms
Incomplete random walk after 10000 steps, including 66 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :7
FORMULA BusinessProcesses-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_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 :1
FORMULA BusinessProcesses-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
// Phase 1: matrix 570 rows 630 cols
[2022-05-14 15:16:43] [INFO ] Computed 100 place invariants in 24 ms
[2022-05-14 15:16:44] [INFO ] [Real]Absence check using 62 positive place invariants in 31 ms returned sat
[2022-05-14 15:16:44] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2022-05-14 15:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:44] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2022-05-14 15:16:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:44] [INFO ] [Nat]Absence check using 62 positive place invariants in 23 ms returned sat
[2022-05-14 15:16:44] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 16 ms returned sat
[2022-05-14 15:16:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:44] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2022-05-14 15:16:44] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 3 ms to minimize.
[2022-05-14 15:16:45] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2022-05-14 15:16:45] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2022-05-14 15:16:45] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 9 ms to minimize.
[2022-05-14 15:16:45] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 1 ms to minimize.
[2022-05-14 15:16:45] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:16:45] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2022-05-14 15:16:45] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 1 ms to minimize.
[2022-05-14 15:16:46] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:16:46] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2022-05-14 15:16:46] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2022-05-14 15:16:46] [INFO ] Deduced a trap composed of 115 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:16:46] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2022-05-14 15:16:46] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 0 ms to minimize.
[2022-05-14 15:16:46] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 0 ms to minimize.
[2022-05-14 15:16:46] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2153 ms
[2022-05-14 15:16:46] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 34 ms.
[2022-05-14 15:16:48] [INFO ] Added : 254 causal constraints over 52 iterations in 1915 ms. Result :sat
Minimization took 105 ms.
[2022-05-14 15:16:49] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2022-05-14 15:16:49] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2022-05-14 15:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:49] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2022-05-14 15:16:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:49] [INFO ] [Nat]Absence check using 62 positive place invariants in 23 ms returned sat
[2022-05-14 15:16:49] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2022-05-14 15:16:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:49] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2022-05-14 15:16:49] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2022-05-14 15:16:49] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2022-05-14 15:16:49] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2022-05-14 15:16:49] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2022-05-14 15:16:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 341 ms
[2022-05-14 15:16:49] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 31 ms.
[2022-05-14 15:16:51] [INFO ] Added : 220 causal constraints over 44 iterations in 1649 ms. Result :sat
Minimization took 92 ms.
[2022-05-14 15:16:51] [INFO ] [Real]Absence check using 62 positive place invariants in 22 ms returned sat
[2022-05-14 15:16:51] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 24 ms returned sat
[2022-05-14 15:16:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:51] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2022-05-14 15:16:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:52] [INFO ] [Nat]Absence check using 62 positive place invariants in 23 ms returned sat
[2022-05-14 15:16:52] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 13 ms returned sat
[2022-05-14 15:16:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:52] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2022-05-14 15:16:52] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2022-05-14 15:16:52] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2022-05-14 15:16:52] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2022-05-14 15:16:52] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2022-05-14 15:16:52] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2022-05-14 15:16:52] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 0 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 0 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 0 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 1 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 1 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2022-05-14 15:16:53] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 96 places in 69 ms of which 1 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 98 places in 73 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 1 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 0 ms to minimize.
[2022-05-14 15:16:54] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 0 ms to minimize.
[2022-05-14 15:16:55] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 0 ms to minimize.
[2022-05-14 15:16:55] [INFO ] Deduced a trap composed of 104 places in 60 ms of which 1 ms to minimize.
[2022-05-14 15:16:55] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2022-05-14 15:16:55] [INFO ] Deduced a trap composed of 93 places in 63 ms of which 1 ms to minimize.
[2022-05-14 15:16:55] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3060 ms
[2022-05-14 15:16:55] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 31 ms.
[2022-05-14 15:16:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 15:16:57] [INFO ] [Real]Absence check using 62 positive place invariants in 21 ms returned sat
[2022-05-14 15:16:57] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2022-05-14 15:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:57] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2022-05-14 15:16:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:57] [INFO ] [Nat]Absence check using 62 positive place invariants in 23 ms returned sat
[2022-05-14 15:16:57] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2022-05-14 15:16:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:57] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2022-05-14 15:16:57] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:16:57] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 0 ms to minimize.
[2022-05-14 15:16:58] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 0 ms to minimize.
[2022-05-14 15:16:58] [INFO ] Deduced a trap composed of 118 places in 126 ms of which 0 ms to minimize.
[2022-05-14 15:16:58] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:16:58] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 5 ms to minimize.
[2022-05-14 15:16:58] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:16:58] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 0 ms to minimize.
[2022-05-14 15:16:58] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:16:59] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2022-05-14 15:16:59] [INFO ] Deduced a trap composed of 141 places in 122 ms of which 1 ms to minimize.
[2022-05-14 15:16:59] [INFO ] Deduced a trap composed of 145 places in 124 ms of which 1 ms to minimize.
[2022-05-14 15:16:59] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 1 ms to minimize.
[2022-05-14 15:16:59] [INFO ] Deduced a trap composed of 151 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:16:59] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2022-05-14 15:16:59] [INFO ] Deduced a trap composed of 149 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:17:00] [INFO ] Deduced a trap composed of 144 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:17:00] [INFO ] Deduced a trap composed of 144 places in 114 ms of which 1 ms to minimize.
[2022-05-14 15:17:00] [INFO ] Deduced a trap composed of 143 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:17:00] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2022-05-14 15:17:00] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 1 ms to minimize.
[2022-05-14 15:17:00] [INFO ] Deduced a trap composed of 149 places in 103 ms of which 0 ms to minimize.
[2022-05-14 15:17:00] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:17:01] [INFO ] Deduced a trap composed of 147 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:17:01] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2022-05-14 15:17:01] [INFO ] Deduced a trap composed of 145 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:17:01] [INFO ] Deduced a trap composed of 150 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:17:01] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:17:01] [INFO ] Deduced a trap composed of 148 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:17:01] [INFO ] Deduced a trap composed of 140 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:17:01] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2022-05-14 15:17:02] [INFO ] Deduced a trap composed of 140 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:17:02] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 1 ms to minimize.
[2022-05-14 15:17:02] [INFO ] Deduced a trap composed of 151 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:17:02] [INFO ] Deduced a trap composed of 152 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:17:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 15:17:02] [INFO ] [Real]Absence check using 62 positive place invariants in 30 ms returned sat
[2022-05-14 15:17:02] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2022-05-14 15:17:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:02] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2022-05-14 15:17:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:17:02] [INFO ] [Nat]Absence check using 62 positive place invariants in 22 ms returned sat
[2022-05-14 15:17:02] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 13 ms returned sat
[2022-05-14 15:17:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:03] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2022-05-14 15:17:03] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2022-05-14 15:17:03] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:17:03] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:17:03] [INFO ] Deduced a trap composed of 133 places in 113 ms of which 1 ms to minimize.
[2022-05-14 15:17:03] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2022-05-14 15:17:03] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:17:03] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2022-05-14 15:17:04] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2022-05-14 15:17:04] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 0 ms to minimize.
[2022-05-14 15:17:04] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1130 ms
[2022-05-14 15:17:04] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 30 ms.
[2022-05-14 15:17:06] [INFO ] Added : 263 causal constraints over 54 iterations in 1900 ms. Result :sat
Minimization took 115 ms.
[2022-05-14 15:17:06] [INFO ] [Real]Absence check using 62 positive place invariants in 22 ms returned sat
[2022-05-14 15:17:06] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 13 ms returned sat
[2022-05-14 15:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:06] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2022-05-14 15:17:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:17:06] [INFO ] [Nat]Absence check using 62 positive place invariants in 21 ms returned sat
[2022-05-14 15:17:06] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2022-05-14 15:17:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:06] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2022-05-14 15:17:06] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:17:07] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:17:07] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:17:07] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:17:07] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:17:07] [INFO ] Deduced a trap composed of 138 places in 109 ms of which 0 ms to minimize.
[2022-05-14 15:17:07] [INFO ] Deduced a trap composed of 157 places in 105 ms of which 0 ms to minimize.
[2022-05-14 15:17:07] [INFO ] Deduced a trap composed of 152 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:17:08] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:17:08] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:17:08] [INFO ] Deduced a trap composed of 132 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:17:08] [INFO ] Deduced a trap composed of 154 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:17:08] [INFO ] Deduced a trap composed of 156 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:17:08] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:17:08] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:17:09] [INFO ] Deduced a trap composed of 147 places in 104 ms of which 0 ms to minimize.
[2022-05-14 15:17:09] [INFO ] Deduced a trap composed of 148 places in 104 ms of which 0 ms to minimize.
[2022-05-14 15:17:09] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 0 ms to minimize.
[2022-05-14 15:17:09] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:17:09] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 1 ms to minimize.
[2022-05-14 15:17:09] [INFO ] Deduced a trap composed of 138 places in 105 ms of which 0 ms to minimize.
[2022-05-14 15:17:09] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:17:09] [INFO ] Deduced a trap composed of 144 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:17:10] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:17:10] [INFO ] Deduced a trap composed of 159 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:17:10] [INFO ] Deduced a trap composed of 162 places in 105 ms of which 1 ms to minimize.
[2022-05-14 15:17:10] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:17:10] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 0 ms to minimize.
[2022-05-14 15:17:10] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 0 ms to minimize.
[2022-05-14 15:17:10] [INFO ] Deduced a trap composed of 138 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:17:10] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:17:11] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:17:11] [INFO ] Deduced a trap composed of 134 places in 105 ms of which 0 ms to minimize.
[2022-05-14 15:17:11] [INFO ] Deduced a trap composed of 158 places in 100 ms of which 1 ms to minimize.
[2022-05-14 15:17:11] [INFO ] Deduced a trap composed of 166 places in 99 ms of which 0 ms to minimize.
[2022-05-14 15:17:11] [INFO ] Deduced a trap composed of 163 places in 96 ms of which 0 ms to minimize.
[2022-05-14 15:17: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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 15:17:11] [INFO ] [Real]Absence check using 62 positive place invariants in 20 ms returned sat
[2022-05-14 15:17:11] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2022-05-14 15:17:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:11] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2022-05-14 15:17:12] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:17:12] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2022-05-14 15:17:12] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2022-05-14 15:17:12] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:17:12] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:17:12] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:17:12] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:17:13] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 0 ms to minimize.
[2022-05-14 15:17:13] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:17:13] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:17:13] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:17:13] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:17:13] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:17:13] [INFO ] Deduced a trap composed of 150 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:17:14] [INFO ] Deduced a trap composed of 164 places in 105 ms of which 1 ms to minimize.
[2022-05-14 15:17:14] [INFO ] Deduced a trap composed of 150 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:17:14] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2253 ms
[2022-05-14 15:17:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:17:14] [INFO ] [Nat]Absence check using 62 positive place invariants in 21 ms returned sat
[2022-05-14 15:17:14] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 13 ms returned sat
[2022-05-14 15:17:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:14] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2022-05-14 15:17:14] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:17:14] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:17:14] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:17:15] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:17:15] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:17:15] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 1 ms to minimize.
[2022-05-14 15:17:15] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:17:15] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:17:15] [INFO ] Deduced a trap composed of 126 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:17:15] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2022-05-14 15:17:16] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:17:16] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:17:16] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 0 ms to minimize.
[2022-05-14 15:17:16] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 1 ms to minimize.
[2022-05-14 15:17:16] [INFO ] Deduced a trap composed of 132 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:17:16] [INFO ] Deduced a trap composed of 126 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:17:16] [INFO ] Deduced a trap composed of 127 places in 105 ms of which 0 ms to minimize.
[2022-05-14 15:17:17] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 0 ms to minimize.
[2022-05-14 15:17:17] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:17:17] [INFO ] Deduced a trap composed of 155 places in 105 ms of which 0 ms to minimize.
[2022-05-14 15:17:17] [INFO ] Deduced a trap composed of 130 places in 113 ms of which 1 ms to minimize.
[2022-05-14 15:17:17] [INFO ] Deduced a trap composed of 129 places in 104 ms of which 0 ms to minimize.
[2022-05-14 15:17:17] [INFO ] Deduced a trap composed of 153 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:17:17] [INFO ] Deduced a trap composed of 144 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:17:17] [INFO ] Deduced a trap composed of 138 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:17:18] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:17:18] [INFO ] Deduced a trap composed of 143 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:17:18] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 0 ms to minimize.
[2022-05-14 15:17:18] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 1 ms to minimize.
[2022-05-14 15:17:18] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 0 ms to minimize.
[2022-05-14 15:17:18] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:17:18] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:17:19] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:17:19] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2022-05-14 15:17:19] [INFO ] Deduced a trap composed of 167 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:17:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 15:17:19] [INFO ] [Real]Absence check using 62 positive place invariants in 21 ms returned sat
[2022-05-14 15:17:19] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 13 ms returned sat
[2022-05-14 15:17:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:19] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2022-05-14 15:17:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:17:19] [INFO ] [Nat]Absence check using 62 positive place invariants in 23 ms returned sat
[2022-05-14 15:17:19] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 13 ms returned sat
[2022-05-14 15:17:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:19] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-05-14 15:17:20] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 0 ms to minimize.
[2022-05-14 15:17:20] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:17:20] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2022-05-14 15:17:20] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2022-05-14 15:17:20] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 1 ms to minimize.
[2022-05-14 15:17:20] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2022-05-14 15:17:20] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:17:21] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 0 ms to minimize.
[2022-05-14 15:17:21] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:17:21] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:17:21] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:17:21] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2022-05-14 15:17:21] [INFO ] Deduced a trap composed of 154 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:17:21] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 0 ms to minimize.
[2022-05-14 15:17:22] [INFO ] Deduced a trap composed of 149 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:17:22] [INFO ] Deduced a trap composed of 146 places in 110 ms of which 1 ms to minimize.
[2022-05-14 15:17:22] [INFO ] Deduced a trap composed of 147 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:17:22] [INFO ] Deduced a trap composed of 152 places in 111 ms of which 0 ms to minimize.
[2022-05-14 15:17:22] [INFO ] Deduced a trap composed of 142 places in 110 ms of which 1 ms to minimize.
[2022-05-14 15:17:22] [INFO ] Deduced a trap composed of 161 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:17:22] [INFO ] Deduced a trap composed of 136 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:17:23] [INFO ] Deduced a trap composed of 149 places in 112 ms of which 0 ms to minimize.
[2022-05-14 15:17:23] [INFO ] Deduced a trap composed of 163 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:17:23] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3304 ms
[2022-05-14 15:17:23] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 31 ms.
[2022-05-14 15:17:24] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 0 ms to minimize.
[2022-05-14 15:17:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 22800 steps, including 109 resets, run finished after 110 ms. (steps per millisecond=207 ) properties (out of 8) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 18100 steps, including 102 resets, run finished after 41 ms. (steps per millisecond=441 ) properties (out of 7) seen :2 could not realise parikh vector
FORMULA BusinessProcesses-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 17400 steps, including 101 resets, run finished after 38 ms. (steps per millisecond=457 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 5 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 570/570 transitions.
Graph (trivial) has 365 edges and 630 vertex of which 7 / 630 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1283 edges and 624 vertex of which 618 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 143 place count 618 transition count 420
Reduce places removed 141 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 145 rules applied. Total rules applied 288 place count 477 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 292 place count 473 transition count 416
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 292 place count 473 transition count 326
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 489 place count 366 transition count 326
Discarding 87 places :
Symmetric choice reduction at 3 with 87 rule applications. Total rules 576 place count 279 transition count 239
Iterating global reduction 3 with 87 rules applied. Total rules applied 663 place count 279 transition count 239
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 663 place count 279 transition count 229
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 686 place count 266 transition count 229
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 872 place count 173 transition count 136
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 874 place count 172 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 876 place count 172 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 878 place count 170 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 879 place count 170 transition count 138
Applied a total of 879 rules in 136 ms. Remains 170 /630 variables (removed 460) and now considering 138/570 (removed 432) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/630 places, 138/570 transitions.
// Phase 1: matrix 138 rows 170 cols
[2022-05-14 15:17:25] [INFO ] Computed 75 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 42992 resets, run finished after 2681 ms. (steps per millisecond=372 ) properties (out of 5) seen :5
FORMULA BusinessProcesses-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652541448890

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-16"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is BusinessProcesses-PT-16, 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 r028-tall-165251936100166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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