Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 157K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717225910970

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:11:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 07:11:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:11:52] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-06-01 07:11:52] [INFO ] Transformed 630 places.
[2024-06-01 07:11:52] [INFO ] Transformed 566 transitions.
[2024-06-01 07:11:52] [INFO ] Found NUPN structural information;
[2024-06-01 07:11:52] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 562 rows 626 cols
[2024-06-01 07:11:52] [INFO ] Computed 102 invariants in 41 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (66 resets) in 55 ms. (178 steps per ms)
FORMULA BusinessProcesses-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120010 steps (147 resets) in 137 ms. (869 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 07:11:52] [INFO ] Invariant cache hit.
[2024-06-01 07:11:53] [INFO ] [Real]Absence check using 61 positive place invariants in 25 ms returned sat
[2024-06-01 07:11:53] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 20 ms returned sat
[2024-06-01 07:11:53] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 32 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:11:53] [INFO ] [Nat]Absence check using 61 positive place invariants in 21 ms returned sat
[2024-06-01 07:11:53] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 28 ms returned sat
[2024-06-01 07:11:54] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 4 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 129 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 4 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 4 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2896 ms
[2024-06-01 07:11:57] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 48 ms.
[2024-06-01 07:11:58] [INFO ] Added : 240 causal constraints over 48 iterations in 1751 ms. Result :unknown
[2024-06-01 07:11:58] [INFO ] [Real]Absence check using 61 positive place invariants in 20 ms returned sat
[2024-06-01 07:11:58] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 19 ms returned sat
[2024-06-01 07:11:59] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 4 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:11:59] [INFO ] [Nat]Absence check using 61 positive place invariants in 22 ms returned sat
[2024-06-01 07:11:59] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2024-06-01 07:11:59] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 4 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 4 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 4 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 4 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 4 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 4 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 124 places in 176 ms of which 4 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 132 places in 155 ms of which 4 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 130 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 4 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 132 places in 173 ms of which 4 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 139 places in 186 ms of which 4 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 4 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 4 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 4 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 4 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:12:04] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:12:04] [INFO ] [Real]Absence check using 61 positive place invariants in 26 ms returned sat
[2024-06-01 07:12:04] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2024-06-01 07:12:04] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 118 places in 198 ms of which 4 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:12:05] [INFO ] [Nat]Absence check using 61 positive place invariants in 28 ms returned sat
[2024-06-01 07:12:05] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2024-06-01 07:12:05] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 118 places in 213 ms of which 4 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 116 places in 202 ms of which 4 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 4 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 29 places in 218 ms of which 4 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 5 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 4 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 4 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 4 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 121 places in 172 ms of which 4 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 4 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 4 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:12: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 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:12:10] [INFO ] [Real]Absence check using 61 positive place invariants in 25 ms returned sat
[2024-06-01 07:12:10] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2024-06-01 07:12:10] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:12:10] [INFO ] [Nat]Absence check using 61 positive place invariants in 23 ms returned sat
[2024-06-01 07:12:10] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2024-06-01 07:12:11] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 4 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 4 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 4 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 4 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 129 places in 202 ms of which 4 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 134 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 4 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 60 places in 214 ms of which 4 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 136 places in 177 ms of which 4 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 149 places in 177 ms of which 4 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 4 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 114 places in 175 ms of which 4 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 132 places in 178 ms of which 4 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 4 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 4 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 4 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 5 ms to minimize.
[2024-06-01 07:12:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:12:16] [INFO ] [Real]Absence check using 61 positive place invariants in 21 ms returned sat
[2024-06-01 07:12:16] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2024-06-01 07:12:16] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 4 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:12:16] [INFO ] [Nat]Absence check using 61 positive place invariants in 37 ms returned sat
[2024-06-01 07:12:16] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 19 ms returned sat
[2024-06-01 07:12:17] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 5 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 4 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 4 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 4 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 136 places in 176 ms of which 4 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 131 places in 204 ms of which 4 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 113 places in 216 ms of which 4 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 4 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 4 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 4 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 4 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 139 places in 183 ms of which 4 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 129 places in 224 ms of which 4 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 4 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 127 places in 184 ms of which 4 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 4 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:12: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 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:12:21] [INFO ] [Real]Absence check using 61 positive place invariants in 26 ms returned sat
[2024-06-01 07:12:21] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2024-06-01 07:12:22] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 4 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:12:22] [INFO ] [Nat]Absence check using 61 positive place invariants in 27 ms returned sat
[2024-06-01 07:12:22] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 27 ms returned sat
[2024-06-01 07:12:22] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 4 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 4 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 18 places in 220 ms of which 4 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 4 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 152 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 4 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 133 places in 192 ms of which 4 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 4 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 4 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 4 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 132 places in 198 ms of which 4 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 4 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 4 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 114 places in 184 ms of which 4 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 127 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 4 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 4 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 126 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 118 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:12:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:12:27] [INFO ] [Real]Absence check using 61 positive place invariants in 25 ms returned sat
[2024-06-01 07:12:27] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 17 ms returned sat
[2024-06-01 07:12:27] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 4 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:12:28] [INFO ] [Nat]Absence check using 61 positive place invariants in 25 ms returned sat
[2024-06-01 07:12:28] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2024-06-01 07:12:28] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 4 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 4 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:12:33] [INFO ] [Real]Absence check using 61 positive place invariants in 26 ms returned sat
[2024-06-01 07:12:33] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 17 ms returned sat
[2024-06-01 07:12:33] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:12:33] [INFO ] [Nat]Absence check using 61 positive place invariants in 30 ms returned sat
[2024-06-01 07:12:34] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2024-06-01 07:12:34] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 6 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 4 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 5 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:12:39] [INFO ] [Real]Absence check using 61 positive place invariants in 24 ms returned sat
[2024-06-01 07:12:39] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2024-06-01 07:12:39] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 4 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:12:39] [INFO ] [Nat]Absence check using 61 positive place invariants in 26 ms returned sat
[2024-06-01 07:12:39] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2024-06-01 07:12:39] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 4 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 124 places in 173 ms of which 4 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 4 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 4 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 121 places in 185 ms of which 5 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 4 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 4 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 144 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 4 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 141 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 4 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 139 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 83 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 121 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:12:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:12:44] [INFO ] [Real]Absence check using 61 positive place invariants in 21 ms returned sat
[2024-06-01 07:12:44] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2024-06-01 07:12:44] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 4 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:12:45] [INFO ] [Nat]Absence check using 61 positive place invariants in 27 ms returned sat
[2024-06-01 07:12:45] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 21 ms returned sat
[2024-06-01 07:12:45] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 4 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 4 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 4 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 123 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 4 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 125 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 4 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 4 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 4 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 123 places in 180 ms of which 4 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 4 ms to minimize.
[2024-06-01 07:12:49] [INFO ] Deduced a trap composed of 126 places in 170 ms of which 4 ms to minimize.
[2024-06-01 07:12:49] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 6 ms to minimize.
[2024-06-01 07:12:49] [INFO ] Deduced a trap composed of 144 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:12:49] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:12:49] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:12:50] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:12:50] [INFO ] [Real]Absence check using 61 positive place invariants in 25 ms returned sat
[2024-06-01 07:12:50] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2024-06-01 07:12:50] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 3 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:12:51] [INFO ] [Nat]Absence check using 61 positive place invariants in 26 ms returned sat
[2024-06-01 07:12:51] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2024-06-01 07:12:51] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 4 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 4 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 4 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 141 places in 183 ms of which 4 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 5 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 4 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 4 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 63 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 4 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 4 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:12:56] [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 10
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:12:56] [INFO ] [Real]Absence check using 61 positive place invariants in 25 ms returned sat
[2024-06-01 07:12:56] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 17 ms returned sat
[2024-06-01 07:12:56] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 4 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:12:56] [INFO ] [Nat]Absence check using 61 positive place invariants in 28 ms returned sat
[2024-06-01 07:12:56] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2024-06-01 07:12:57] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 4 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 4 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 123 places in 204 ms of which 4 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 4 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 4 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 4 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 96 places in 195 ms of which 4 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 4 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 106 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:13:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 12 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 562/562 transitions.
Graph (trivial) has 348 edges and 626 vertex of which 7 / 626 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1267 edges and 620 vertex of which 616 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 135 place count 616 transition count 420
Reduce places removed 133 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 138 rules applied. Total rules applied 273 place count 483 transition count 415
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 278 place count 478 transition count 415
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 278 place count 478 transition count 322
Deduced a syphon composed of 93 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 481 place count 368 transition count 322
Discarding 75 places :
Symmetric choice reduction at 3 with 75 rule applications. Total rules 556 place count 293 transition count 247
Iterating global reduction 3 with 75 rules applied. Total rules applied 631 place count 293 transition count 247
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 631 place count 293 transition count 240
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 646 place count 285 transition count 240
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 836 place count 189 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 838 place count 188 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 840 place count 188 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 842 place count 186 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 843 place count 186 transition count 148
Applied a total of 843 rules in 160 ms. Remains 186 /626 variables (removed 440) and now considering 148/562 (removed 414) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 186/626 places, 148/562 transitions.
// Phase 1: matrix 148 rows 186 cols
[2024-06-01 07:13:02] [INFO ] Computed 79 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (24083 resets) in 2912 ms. (343 steps per ms)
FORMULA BusinessProcesses-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (11085 resets) in 1710 ms. (584 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 74524 ms.
ITS solved all properties within timeout

BK_STOP 1717225986826

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-15, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399800565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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