Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 156K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678503337020

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:55:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 02:55:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:55:38] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-11 02:55:38] [INFO ] Transformed 624 places.
[2023-03-11 02:55:38] [INFO ] Transformed 564 transitions.
[2023-03-11 02:55:38] [INFO ] Found NUPN structural information;
[2023-03-11 02:55:38] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
// Phase 1: matrix 556 rows 616 cols
[2023-03-11 02:55:38] [INFO ] Computed 99 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 68 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :5
FORMULA BusinessProcesses-PT-14-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :1
FORMULA BusinessProcesses-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) 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 10) seen :0
[2023-03-11 02:55:38] [INFO ] Invariant cache hit.
[2023-03-11 02:55:39] [INFO ] [Real]Absence check using 60 positive place invariants in 24 ms returned sat
[2023-03-11 02:55:39] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 12 ms returned sat
[2023-03-11 02:55:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:55:39] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2023-03-11 02:55:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:55:39] [INFO ] [Nat]Absence check using 60 positive place invariants in 21 ms returned sat
[2023-03-11 02:55:39] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2023-03-11 02:55:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:55:39] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-11 02:55:39] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 3 ms to minimize.
[2023-03-11 02:55:39] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2023-03-11 02:55:40] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2023-03-11 02:55:40] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2023-03-11 02:55:40] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2023-03-11 02:55:40] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2023-03-11 02:55:40] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 1 ms to minimize.
[2023-03-11 02:55:40] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 1 ms to minimize.
[2023-03-11 02:55:40] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 1 ms to minimize.
[2023-03-11 02:55:41] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
[2023-03-11 02:55:41] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 1 ms to minimize.
[2023-03-11 02:55:41] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2023-03-11 02:55:41] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 0 ms to minimize.
[2023-03-11 02:55:41] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 0 ms to minimize.
[2023-03-11 02:55:41] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 1 ms to minimize.
[2023-03-11 02:55:41] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 0 ms to minimize.
[2023-03-11 02:55:42] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 0 ms to minimize.
[2023-03-11 02:55:42] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2023-03-11 02:55:42] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 1 ms to minimize.
[2023-03-11 02:55:42] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2023-03-11 02:55:42] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2023-03-11 02:55:42] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2023-03-11 02:55:42] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2023-03-11 02:55:42] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2023-03-11 02:55:43] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2023-03-11 02:55:43] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2023-03-11 02:55:43] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2023-03-11 02:55:43] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3617 ms
[2023-03-11 02:55:43] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 47 ms.
[2023-03-11 02:55:44] [INFO ] Added : 130 causal constraints over 26 iterations in 1103 ms. Result :unknown
[2023-03-11 02:55:44] [INFO ] [Real]Absence check using 60 positive place invariants in 25 ms returned sat
[2023-03-11 02:55:44] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 23 ms returned sat
[2023-03-11 02:55:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:55:44] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2023-03-11 02:55:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:55:45] [INFO ] [Nat]Absence check using 60 positive place invariants in 41 ms returned sat
[2023-03-11 02:55:45] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 17 ms returned sat
[2023-03-11 02:55:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:55:45] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2023-03-11 02:55:45] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 1 ms to minimize.
[2023-03-11 02:55:45] [INFO ] Deduced a trap composed of 149 places in 199 ms of which 1 ms to minimize.
[2023-03-11 02:55:45] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 0 ms to minimize.
[2023-03-11 02:55:46] [INFO ] Deduced a trap composed of 127 places in 196 ms of which 1 ms to minimize.
[2023-03-11 02:55:46] [INFO ] Deduced a trap composed of 141 places in 181 ms of which 0 ms to minimize.
[2023-03-11 02:55:46] [INFO ] Deduced a trap composed of 148 places in 182 ms of which 1 ms to minimize.
[2023-03-11 02:55:46] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 1 ms to minimize.
[2023-03-11 02:55:46] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2023-03-11 02:55:47] [INFO ] Deduced a trap composed of 119 places in 167 ms of which 1 ms to minimize.
[2023-03-11 02:55:47] [INFO ] Deduced a trap composed of 111 places in 157 ms of which 0 ms to minimize.
[2023-03-11 02:55:47] [INFO ] Deduced a trap composed of 128 places in 150 ms of which 0 ms to minimize.
[2023-03-11 02:55:47] [INFO ] Deduced a trap composed of 123 places in 149 ms of which 1 ms to minimize.
[2023-03-11 02:55:47] [INFO ] Deduced a trap composed of 110 places in 142 ms of which 1 ms to minimize.
[2023-03-11 02:55:48] [INFO ] Deduced a trap composed of 116 places in 196 ms of which 1 ms to minimize.
[2023-03-11 02:55:48] [INFO ] Deduced a trap composed of 116 places in 167 ms of which 1 ms to minimize.
[2023-03-11 02:55:48] [INFO ] Deduced a trap composed of 142 places in 172 ms of which 1 ms to minimize.
[2023-03-11 02:55:48] [INFO ] Deduced a trap composed of 139 places in 194 ms of which 1 ms to minimize.
[2023-03-11 02:55:48] [INFO ] Deduced a trap composed of 121 places in 162 ms of which 1 ms to minimize.
[2023-03-11 02:55:49] [INFO ] Deduced a trap composed of 115 places in 166 ms of which 0 ms to minimize.
[2023-03-11 02:55:49] [INFO ] Deduced a trap composed of 144 places in 156 ms of which 0 ms to minimize.
[2023-03-11 02:55:49] [INFO ] Deduced a trap composed of 127 places in 191 ms of which 0 ms to minimize.
[2023-03-11 02:55:49] [INFO ] Deduced a trap composed of 150 places in 197 ms of which 0 ms to minimize.
[2023-03-11 02:55:49] [INFO ] Deduced a trap composed of 133 places in 193 ms of which 1 ms to minimize.
[2023-03-11 02:55:49] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2023-03-11 02:55:50] [INFO ] [Real]Absence check using 60 positive place invariants in 26 ms returned sat
[2023-03-11 02:55:50] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 13 ms returned sat
[2023-03-11 02:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:55:50] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2023-03-11 02:55:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:55:50] [INFO ] [Nat]Absence check using 60 positive place invariants in 24 ms returned sat
[2023-03-11 02:55:50] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2023-03-11 02:55:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:55:50] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2023-03-11 02:55:50] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 0 ms to minimize.
[2023-03-11 02:55:51] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 1 ms to minimize.
[2023-03-11 02:55:51] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 0 ms to minimize.
[2023-03-11 02:55:51] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 0 ms to minimize.
[2023-03-11 02:55:51] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 1 ms to minimize.
[2023-03-11 02:55:51] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 1 ms to minimize.
[2023-03-11 02:55:51] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 6 ms to minimize.
[2023-03-11 02:55:52] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 1 ms to minimize.
[2023-03-11 02:55:52] [INFO ] Deduced a trap composed of 144 places in 188 ms of which 0 ms to minimize.
[2023-03-11 02:55:52] [INFO ] Deduced a trap composed of 151 places in 152 ms of which 0 ms to minimize.
[2023-03-11 02:55:52] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 1 ms to minimize.
[2023-03-11 02:55:52] [INFO ] Deduced a trap composed of 162 places in 142 ms of which 1 ms to minimize.
[2023-03-11 02:55:53] [INFO ] Deduced a trap composed of 141 places in 141 ms of which 1 ms to minimize.
[2023-03-11 02:55:53] [INFO ] Deduced a trap composed of 151 places in 171 ms of which 1 ms to minimize.
[2023-03-11 02:55:53] [INFO ] Deduced a trap composed of 143 places in 140 ms of which 1 ms to minimize.
[2023-03-11 02:55:53] [INFO ] Deduced a trap composed of 136 places in 140 ms of which 2 ms to minimize.
[2023-03-11 02:55:53] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 1 ms to minimize.
[2023-03-11 02:55:53] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 1 ms to minimize.
[2023-03-11 02:55:54] [INFO ] Deduced a trap composed of 154 places in 173 ms of which 2 ms to minimize.
[2023-03-11 02:55:54] [INFO ] Deduced a trap composed of 139 places in 135 ms of which 1 ms to minimize.
[2023-03-11 02:55:54] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 0 ms to minimize.
[2023-03-11 02:55:54] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 1 ms to minimize.
[2023-03-11 02:55:54] [INFO ] Deduced a trap composed of 146 places in 140 ms of which 0 ms to minimize.
[2023-03-11 02:55:54] [INFO ] Deduced a trap composed of 138 places in 140 ms of which 1 ms to minimize.
[2023-03-11 02:55:55] [INFO ] Deduced a trap composed of 147 places in 149 ms of which 0 ms to minimize.
[2023-03-11 02:55:55] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 1 ms to minimize.
[2023-03-11 02:55: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2023-03-11 02:55:55] [INFO ] [Real]Absence check using 60 positive place invariants in 22 ms returned sat
[2023-03-11 02:55:55] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2023-03-11 02:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:55:55] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2023-03-11 02:55:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:55:55] [INFO ] [Nat]Absence check using 60 positive place invariants in 21 ms returned sat
[2023-03-11 02:55:56] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 15 ms returned sat
[2023-03-11 02:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:55:56] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2023-03-11 02:55:56] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 1 ms to minimize.
[2023-03-11 02:55:56] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 1 ms to minimize.
[2023-03-11 02:55:56] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2023-03-11 02:55:56] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2023-03-11 02:55:56] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 0 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 0 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 1 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 1 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 0 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 0 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 1 ms to minimize.
[2023-03-11 02:55:59] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 1 ms to minimize.
[2023-03-11 02:55:59] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 1 ms to minimize.
[2023-03-11 02:55:59] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3040 ms
[2023-03-11 02:55:59] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 41 ms.
[2023-03-11 02:56:00] [INFO ] Added : 313 causal constraints over 63 iterations in 1593 ms. Result :sat
Minimization took 16 ms.
[2023-03-11 02:56:00] [INFO ] [Real]Absence check using 60 positive place invariants in 16 ms returned sat
[2023-03-11 02:56:00] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 8 ms returned sat
[2023-03-11 02:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:56:01] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-11 02:56:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:56:01] [INFO ] [Nat]Absence check using 60 positive place invariants in 16 ms returned sat
[2023-03-11 02:56:01] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 7 ms returned sat
[2023-03-11 02:56:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:56:01] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2023-03-11 02:56:01] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2023-03-11 02:56:01] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2023-03-11 02:56:01] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2023-03-11 02:56:02] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2023-03-11 02:56:02] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2023-03-11 02:56:02] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2023-03-11 02:56:02] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2023-03-11 02:56:02] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 0 ms to minimize.
[2023-03-11 02:56:02] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 0 ms to minimize.
[2023-03-11 02:56:02] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2023-03-11 02:56:02] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 0 ms to minimize.
[2023-03-11 02:56:03] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2023-03-11 02:56:03] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2023-03-11 02:56:03] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1727 ms
[2023-03-11 02:56:03] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 47 ms.
[2023-03-11 02:56:04] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 1 ms to minimize.
[2023-03-11 02:56:04] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 0 ms to minimize.
[2023-03-11 02:56:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 314 ms
[2023-03-11 02:56:05] [INFO ] Added : 264 causal constraints over 54 iterations in 1889 ms. Result :sat
Minimization took 139 ms.
[2023-03-11 02:56:05] [INFO ] [Real]Absence check using 60 positive place invariants in 22 ms returned sat
[2023-03-11 02:56:05] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 12 ms returned sat
[2023-03-11 02:56:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:56:05] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2023-03-11 02:56:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:56:05] [INFO ] [Nat]Absence check using 60 positive place invariants in 24 ms returned sat
[2023-03-11 02:56:05] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 17 ms returned sat
[2023-03-11 02:56:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:56:06] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2023-03-11 02:56:06] [INFO ] Deduced a trap composed of 116 places in 188 ms of which 1 ms to minimize.
[2023-03-11 02:56:06] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 0 ms to minimize.
[2023-03-11 02:56:06] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 0 ms to minimize.
[2023-03-11 02:56:06] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 0 ms to minimize.
[2023-03-11 02:56:06] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2023-03-11 02:56:07] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 0 ms to minimize.
[2023-03-11 02:56:07] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 1 ms to minimize.
[2023-03-11 02:56:07] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 1 ms to minimize.
[2023-03-11 02:56:07] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 0 ms to minimize.
[2023-03-11 02:56:07] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 0 ms to minimize.
[2023-03-11 02:56:08] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 1 ms to minimize.
[2023-03-11 02:56:08] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 0 ms to minimize.
[2023-03-11 02:56:08] [INFO ] Deduced a trap composed of 133 places in 177 ms of which 1 ms to minimize.
[2023-03-11 02:56:08] [INFO ] Deduced a trap composed of 129 places in 168 ms of which 1 ms to minimize.
[2023-03-11 02:56:08] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
[2023-03-11 02:56:09] [INFO ] Deduced a trap composed of 147 places in 152 ms of which 1 ms to minimize.
[2023-03-11 02:56:09] [INFO ] Deduced a trap composed of 158 places in 137 ms of which 1 ms to minimize.
[2023-03-11 02:56:09] [INFO ] Deduced a trap composed of 150 places in 183 ms of which 1 ms to minimize.
[2023-03-11 02:56:09] [INFO ] Deduced a trap composed of 155 places in 162 ms of which 0 ms to minimize.
[2023-03-11 02:56:09] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 0 ms to minimize.
[2023-03-11 02:56:09] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 1 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 153 places in 173 ms of which 1 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 148 places in 137 ms of which 0 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 0 ms to minimize.
[2023-03-11 02:56:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2023-03-11 02:56:10] [INFO ] [Real]Absence check using 60 positive place invariants in 17 ms returned sat
[2023-03-11 02:56:10] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 8 ms returned sat
[2023-03-11 02:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:56:11] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2023-03-11 02:56:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:56:11] [INFO ] [Nat]Absence check using 60 positive place invariants in 25 ms returned sat
[2023-03-11 02:56:11] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 20 ms returned sat
[2023-03-11 02:56:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:56:11] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2023-03-11 02:56:11] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 1 ms to minimize.
[2023-03-11 02:56:11] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 1 ms to minimize.
[2023-03-11 02:56:12] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 0 ms to minimize.
[2023-03-11 02:56:12] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 1 ms to minimize.
[2023-03-11 02:56:12] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 1 ms to minimize.
[2023-03-11 02:56:12] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 1 ms to minimize.
[2023-03-11 02:56:12] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 1 ms to minimize.
[2023-03-11 02:56:13] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 1 ms to minimize.
[2023-03-11 02:56:13] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 1 ms to minimize.
[2023-03-11 02:56:13] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 0 ms to minimize.
[2023-03-11 02:56:13] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2023-03-11 02:56:13] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 1 ms to minimize.
[2023-03-11 02:56:13] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2023-03-11 02:56:13] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2023-03-11 02:56:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2377 ms
[2023-03-11 02:56:13] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 35 ms.
[2023-03-11 02:56:15] [INFO ] Added : 367 causal constraints over 74 iterations in 2077 ms. Result :sat
Minimization took 111 ms.
[2023-03-11 02:56:16] [INFO ] [Real]Absence check using 60 positive place invariants in 17 ms returned sat
[2023-03-11 02:56:16] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2023-03-11 02:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:56:16] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2023-03-11 02:56:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:56:16] [INFO ] [Nat]Absence check using 60 positive place invariants in 37 ms returned sat
[2023-03-11 02:56:16] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 16 ms returned sat
[2023-03-11 02:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:56:16] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2023-03-11 02:56:17] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 0 ms to minimize.
[2023-03-11 02:56:17] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 0 ms to minimize.
[2023-03-11 02:56:17] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 0 ms to minimize.
[2023-03-11 02:56:17] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 1 ms to minimize.
[2023-03-11 02:56:17] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 1 ms to minimize.
[2023-03-11 02:56:18] [INFO ] Deduced a trap composed of 161 places in 158 ms of which 1 ms to minimize.
[2023-03-11 02:56:18] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 0 ms to minimize.
[2023-03-11 02:56:18] [INFO ] Deduced a trap composed of 140 places in 135 ms of which 0 ms to minimize.
[2023-03-11 02:56:18] [INFO ] Deduced a trap composed of 150 places in 129 ms of which 0 ms to minimize.
[2023-03-11 02:56:18] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 0 ms to minimize.
[2023-03-11 02:56:18] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 1 ms to minimize.
[2023-03-11 02:56:19] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2023-03-11 02:56:19] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 0 ms to minimize.
[2023-03-11 02:56:19] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 1 ms to minimize.
[2023-03-11 02:56:19] [INFO ] Deduced a trap composed of 63 places in 188 ms of which 1 ms to minimize.
[2023-03-11 02:56:19] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 0 ms to minimize.
[2023-03-11 02:56:20] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 1 ms to minimize.
[2023-03-11 02:56:20] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 0 ms to minimize.
[2023-03-11 02:56:20] [INFO ] Deduced a trap composed of 142 places in 193 ms of which 1 ms to minimize.
[2023-03-11 02:56:20] [INFO ] Deduced a trap composed of 154 places in 155 ms of which 0 ms to minimize.
[2023-03-11 02:56:20] [INFO ] Deduced a trap composed of 145 places in 154 ms of which 1 ms to minimize.
[2023-03-11 02:56:20] [INFO ] Deduced a trap composed of 140 places in 196 ms of which 1 ms to minimize.
[2023-03-11 02:56:21] [INFO ] Deduced a trap composed of 140 places in 204 ms of which 1 ms to minimize.
[2023-03-11 02:56:21] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 0 ms to minimize.
[2023-03-11 02:56:21] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 1 ms to minimize.
[2023-03-11 02:56:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2023-03-11 02:56:21] [INFO ] [Real]Absence check using 60 positive place invariants in 23 ms returned sat
[2023-03-11 02:56:21] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2023-03-11 02:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:56:21] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2023-03-11 02:56:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:56:22] [INFO ] [Nat]Absence check using 60 positive place invariants in 24 ms returned sat
[2023-03-11 02:56:22] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2023-03-11 02:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:56:22] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2023-03-11 02:56:22] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 1 ms to minimize.
[2023-03-11 02:56:22] [INFO ] Deduced a trap composed of 144 places in 154 ms of which 1 ms to minimize.
[2023-03-11 02:56:22] [INFO ] Deduced a trap composed of 139 places in 155 ms of which 0 ms to minimize.
[2023-03-11 02:56:22] [INFO ] Deduced a trap composed of 140 places in 123 ms of which 0 ms to minimize.
[2023-03-11 02:56:23] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 1 ms to minimize.
[2023-03-11 02:56:23] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2023-03-11 02:56:23] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 1 ms to minimize.
[2023-03-11 02:56:23] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 0 ms to minimize.
[2023-03-11 02:56:23] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 1 ms to minimize.
[2023-03-11 02:56:23] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 0 ms to minimize.
[2023-03-11 02:56:23] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 1 ms to minimize.
[2023-03-11 02:56:24] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 1 ms to minimize.
[2023-03-11 02:56:24] [INFO ] Deduced a trap composed of 110 places in 108 ms of which 1 ms to minimize.
[2023-03-11 02:56:24] [INFO ] Deduced a trap composed of 113 places in 98 ms of which 0 ms to minimize.
[2023-03-11 02:56:24] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2033 ms
[2023-03-11 02:56:24] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 33 ms.
[2023-03-11 02:56:25] [INFO ] Added : 241 causal constraints over 49 iterations in 1295 ms. Result :sat
Minimization took 76 ms.
[2023-03-11 02:56:25] [INFO ] [Real]Absence check using 60 positive place invariants in 17 ms returned sat
[2023-03-11 02:56:25] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2023-03-11 02:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:56:26] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2023-03-11 02:56:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:56:26] [INFO ] [Nat]Absence check using 60 positive place invariants in 24 ms returned sat
[2023-03-11 02:56:26] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2023-03-11 02:56:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:56:26] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2023-03-11 02:56:26] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 0 ms to minimize.
[2023-03-11 02:56:26] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 0 ms to minimize.
[2023-03-11 02:56:26] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2023-03-11 02:56:26] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 0 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 0 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 0 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2023-03-11 02:56:27] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 0 ms to minimize.
[2023-03-11 02:56:28] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 0 ms to minimize.
[2023-03-11 02:56:28] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 0 ms to minimize.
[2023-03-11 02:56:28] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 0 ms to minimize.
[2023-03-11 02:56:28] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2023-03-11 02:56:28] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 0 ms to minimize.
[2023-03-11 02:56:28] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2023-03-11 02:56:28] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 0 ms to minimize.
[2023-03-11 02:56:28] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2023-03-11 02:56:29] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 0 ms to minimize.
[2023-03-11 02:56:29] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 0 ms to minimize.
[2023-03-11 02:56:29] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2023-03-11 02:56:29] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2023-03-11 02:56:29] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2023-03-11 02:56:29] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3069 ms
[2023-03-11 02:56:29] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 33 ms.
[2023-03-11 02:56:31] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 1 ms to minimize.
[2023-03-11 02:56:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 353 edges and 616 vertex of which 7 / 616 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 1252 edges and 610 vertex of which 604 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 604 transition count 409
Reduce places removed 138 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 466 transition count 407
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 282 place count 464 transition count 407
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 282 place count 464 transition count 320
Deduced a syphon composed of 87 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 189 rules applied. Total rules applied 471 place count 362 transition count 320
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 554 place count 279 transition count 237
Iterating global reduction 3 with 83 rules applied. Total rules applied 637 place count 279 transition count 237
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 637 place count 279 transition count 227
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 660 place count 266 transition count 227
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 846 place count 172 transition count 135
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 848 place count 171 transition count 139
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 850 place count 171 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 852 place count 169 transition count 137
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 853 place count 169 transition count 137
Applied a total of 853 rules in 169 ms. Remains 169 /616 variables (removed 447) and now considering 137/556 (removed 419) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 169/616 places, 137/556 transitions.
// Phase 1: matrix 137 rows 169 cols
[2023-03-11 02:56:31] [INFO ] Computed 74 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 43227 resets, run finished after 2678 ms. (steps per millisecond=373 ) properties (out of 5) seen :5
FORMULA BusinessProcesses-PT-14-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 55988 ms.
ITS solved all properties within timeout

BK_STOP 1678503394794

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-14"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is BusinessProcesses-PT-14, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692700557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;