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.r041-tajo-167813694800533.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 ltsminxred
Input is BusinessProcesses-PT-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800533
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 8.3K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:49 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 141K 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-11-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678643429124

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:50:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 17:50:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:50:30] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-12 17:50:30] [INFO ] Transformed 567 places.
[2023-03-12 17:50:30] [INFO ] Transformed 508 transitions.
[2023-03-12 17:50:30] [INFO ] Found NUPN structural information;
[2023-03-12 17:50:30] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 7 transitions.
// Phase 1: matrix 501 rows 560 cols
[2023-03-12 17:50:30] [INFO ] Computed 95 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 75 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 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 13 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 13 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 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 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 14 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 13 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 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
[2023-03-12 17:50:30] [INFO ] Invariant cache hit.
[2023-03-12 17:50:31] [INFO ] [Real]Absence check using 53 positive place invariants in 31 ms returned sat
[2023-03-12 17:50:31] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2023-03-12 17:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:50:31] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-12 17:50:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:50:31] [INFO ] [Nat]Absence check using 53 positive place invariants in 24 ms returned sat
[2023-03-12 17:50:31] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2023-03-12 17:50:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:50:31] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2023-03-12 17:50:31] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 4 ms to minimize.
[2023-03-12 17:50:32] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
[2023-03-12 17:50:32] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2023-03-12 17:50:32] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 0 ms to minimize.
[2023-03-12 17:50:32] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 0 ms to minimize.
[2023-03-12 17:50:32] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 1 ms to minimize.
[2023-03-12 17:50:32] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 0 ms to minimize.
[2023-03-12 17:50:33] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 1 ms to minimize.
[2023-03-12 17:50:33] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 1 ms to minimize.
[2023-03-12 17:50:33] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2023-03-12 17:50:33] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
[2023-03-12 17:50:33] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 0 ms to minimize.
[2023-03-12 17:50:33] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2023-03-12 17:50:34] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 1 ms to minimize.
[2023-03-12 17:50:34] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2023-03-12 17:50:34] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 0 ms to minimize.
[2023-03-12 17:50:34] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 0 ms to minimize.
[2023-03-12 17:50:34] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2023-03-12 17:50:34] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2023-03-12 17:50:34] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 0 ms to minimize.
[2023-03-12 17:50:34] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 0 ms to minimize.
[2023-03-12 17:50:35] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 1 ms to minimize.
[2023-03-12 17:50:35] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 0 ms to minimize.
[2023-03-12 17:50:35] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 0 ms to minimize.
[2023-03-12 17:50:35] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 0 ms to minimize.
[2023-03-12 17:50:35] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 1 ms to minimize.
[2023-03-12 17:50:35] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2023-03-12 17:50:35] [INFO ] Deduced a trap composed of 127 places in 120 ms of which 1 ms to minimize.
[2023-03-12 17:50:35] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2023-03-12 17:50:36] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 0 ms to minimize.
[2023-03-12 17:50:36] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 0 ms to minimize.
[2023-03-12 17:50:36] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 0 ms to minimize.
[2023-03-12 17:50:36] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2023-03-12 17:50:36] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2023-03-12 17:50:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-12 17:50:36] [INFO ] [Real]Absence check using 53 positive place invariants in 17 ms returned sat
[2023-03-12 17:50:36] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2023-03-12 17:50:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:50:36] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-12 17:50:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:50:36] [INFO ] [Nat]Absence check using 53 positive place invariants in 18 ms returned sat
[2023-03-12 17:50:36] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 14 ms returned sat
[2023-03-12 17:50:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:50:36] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-12 17:50:37] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 0 ms to minimize.
[2023-03-12 17:50:37] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 0 ms to minimize.
[2023-03-12 17:50:37] [INFO ] Deduced a trap composed of 116 places in 152 ms of which 1 ms to minimize.
[2023-03-12 17:50:37] [INFO ] Deduced a trap composed of 117 places in 132 ms of which 0 ms to minimize.
[2023-03-12 17:50:37] [INFO ] Deduced a trap composed of 118 places in 129 ms of which 0 ms to minimize.
[2023-03-12 17:50:37] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 1 ms to minimize.
[2023-03-12 17:50:38] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2023-03-12 17:50:38] [INFO ] Deduced a trap composed of 114 places in 155 ms of which 0 ms to minimize.
[2023-03-12 17:50:38] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2023-03-12 17:50:38] [INFO ] Deduced a trap composed of 129 places in 130 ms of which 1 ms to minimize.
[2023-03-12 17:50:38] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 0 ms to minimize.
[2023-03-12 17:50:38] [INFO ] Deduced a trap composed of 122 places in 151 ms of which 1 ms to minimize.
[2023-03-12 17:50:38] [INFO ] Deduced a trap composed of 133 places in 127 ms of which 0 ms to minimize.
[2023-03-12 17:50:39] [INFO ] Deduced a trap composed of 127 places in 94 ms of which 0 ms to minimize.
[2023-03-12 17:50:39] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 1 ms to minimize.
[2023-03-12 17:50:39] [INFO ] Deduced a trap composed of 123 places in 105 ms of which 1 ms to minimize.
[2023-03-12 17:50:39] [INFO ] Deduced a trap composed of 123 places in 93 ms of which 1 ms to minimize.
[2023-03-12 17:50:39] [INFO ] Deduced a trap composed of 118 places in 155 ms of which 1 ms to minimize.
[2023-03-12 17:50:39] [INFO ] Deduced a trap composed of 116 places in 96 ms of which 0 ms to minimize.
[2023-03-12 17:50:39] [INFO ] Deduced a trap composed of 111 places in 148 ms of which 2 ms to minimize.
[2023-03-12 17:50:40] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 1 ms to minimize.
[2023-03-12 17:50:40] [INFO ] Deduced a trap composed of 124 places in 145 ms of which 2 ms to minimize.
[2023-03-12 17:50:40] [INFO ] Deduced a trap composed of 111 places in 125 ms of which 0 ms to minimize.
[2023-03-12 17:50:40] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 0 ms to minimize.
[2023-03-12 17:50:40] [INFO ] Deduced a trap composed of 124 places in 98 ms of which 1 ms to minimize.
[2023-03-12 17:50:40] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 0 ms to minimize.
[2023-03-12 17:50:40] [INFO ] Deduced a trap composed of 110 places in 152 ms of which 0 ms to minimize.
[2023-03-12 17:50:40] [INFO ] Deduced a trap composed of 108 places in 90 ms of which 1 ms to minimize.
[2023-03-12 17:50:41] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 1 ms to minimize.
[2023-03-12 17:50:41] [INFO ] Deduced a trap composed of 110 places in 91 ms of which 1 ms to minimize.
[2023-03-12 17:50:41] [INFO ] Deduced a trap composed of 107 places in 90 ms of which 0 ms to minimize.
[2023-03-12 17:50:41] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 2 ms to minimize.
[2023-03-12 17:50:41] [INFO ] Deduced a trap composed of 127 places in 149 ms of which 1 ms to minimize.
[2023-03-12 17:50:41] [INFO ] Deduced a trap composed of 114 places in 126 ms of which 2 ms to minimize.
[2023-03-12 17:50:41] [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-12 17:50:41] [INFO ] [Real]Absence check using 53 positive place invariants in 19 ms returned sat
[2023-03-12 17:50:41] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2023-03-12 17:50:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:50:42] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2023-03-12 17:50:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:50:42] [INFO ] [Nat]Absence check using 53 positive place invariants in 21 ms returned sat
[2023-03-12 17:50:42] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2023-03-12 17:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:50:42] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2023-03-12 17:50:42] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
[2023-03-12 17:50:42] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 1 ms to minimize.
[2023-03-12 17:50:42] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2023-03-12 17:50:43] [INFO ] Deduced a trap composed of 117 places in 128 ms of which 1 ms to minimize.
[2023-03-12 17:50:43] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2023-03-12 17:50:43] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2023-03-12 17:50:43] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 0 ms to minimize.
[2023-03-12 17:50:43] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2023-03-12 17:50:43] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 0 ms to minimize.
[2023-03-12 17:50:43] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 0 ms to minimize.
[2023-03-12 17:50:43] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2023-03-12 17:50:44] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2023-03-12 17:50:44] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 0 ms to minimize.
[2023-03-12 17:50:44] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2023-03-12 17:50:44] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2023-03-12 17:50:44] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2023-03-12 17:50:44] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 0 ms to minimize.
[2023-03-12 17:50:44] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2127 ms
[2023-03-12 17:50:44] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 38 ms.
[2023-03-12 17:50:46] [INFO ] Added : 266 causal constraints over 54 iterations in 1561 ms. Result :sat
Minimization took 116 ms.
[2023-03-12 17:50:46] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2023-03-12 17:50:46] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2023-03-12 17:50:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:50:46] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2023-03-12 17:50:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:50:46] [INFO ] [Nat]Absence check using 53 positive place invariants in 21 ms returned sat
[2023-03-12 17:50:46] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2023-03-12 17:50:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:50:46] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2023-03-12 17:50:47] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 1 ms to minimize.
[2023-03-12 17:50:47] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2023-03-12 17:50:47] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2023-03-12 17:50:47] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 0 ms to minimize.
[2023-03-12 17:50:47] [INFO ] Deduced a trap composed of 116 places in 107 ms of which 0 ms to minimize.
[2023-03-12 17:50:47] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2023-03-12 17:50:47] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2023-03-12 17:50:47] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2023-03-12 17:50:48] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-12 17:50:48] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 0 ms to minimize.
[2023-03-12 17:50:48] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2023-03-12 17:50:48] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2023-03-12 17:50:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1426 ms
[2023-03-12 17:50:48] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 24 ms.
[2023-03-12 17:50:49] [INFO ] Added : 184 causal constraints over 38 iterations in 920 ms. Result :sat
Minimization took 106 ms.
[2023-03-12 17:50:49] [INFO ] [Real]Absence check using 53 positive place invariants in 23 ms returned sat
[2023-03-12 17:50:49] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 12 ms returned sat
[2023-03-12 17:50:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:50:49] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2023-03-12 17:50:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:50:49] [INFO ] [Nat]Absence check using 53 positive place invariants in 16 ms returned sat
[2023-03-12 17:50:49] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2023-03-12 17:50:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:50:49] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-12 17:50:50] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2023-03-12 17:50:50] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2023-03-12 17:50:50] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2023-03-12 17:50:50] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2023-03-12 17:50:50] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 0 ms to minimize.
[2023-03-12 17:50:50] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 1 ms to minimize.
[2023-03-12 17:50:50] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 1 ms to minimize.
[2023-03-12 17:50:51] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 0 ms to minimize.
[2023-03-12 17:50:51] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 0 ms to minimize.
[2023-03-12 17:50:51] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2023-03-12 17:50:51] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-12 17:50:51] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2023-03-12 17:50:51] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2023-03-12 17:50:51] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2023-03-12 17:50:51] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2023-03-12 17:50:51] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1873 ms
[2023-03-12 17:50:51] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 25 ms.
[2023-03-12 17:50:53] [INFO ] Added : 276 causal constraints over 56 iterations in 1395 ms. Result :sat
Minimization took 110 ms.
[2023-03-12 17:50:53] [INFO ] [Real]Absence check using 53 positive place invariants in 15 ms returned sat
[2023-03-12 17:50:53] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2023-03-12 17:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:50:53] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-12 17:50:53] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2023-03-12 17:50:53] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2023-03-12 17:50:53] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2023-03-12 17:50:54] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 0 ms to minimize.
[2023-03-12 17:50:54] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2023-03-12 17:50:54] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 0 ms to minimize.
[2023-03-12 17:50:54] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 0 ms to minimize.
[2023-03-12 17:50:54] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 1 ms to minimize.
[2023-03-12 17:50:54] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 1 ms to minimize.
[2023-03-12 17:50:54] [INFO ] Deduced a trap composed of 128 places in 102 ms of which 0 ms to minimize.
[2023-03-12 17:50:54] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2023-03-12 17:50:55] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 0 ms to minimize.
[2023-03-12 17:50:55] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 0 ms to minimize.
[2023-03-12 17:50:55] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2023-03-12 17:50:55] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 0 ms to minimize.
[2023-03-12 17:50:55] [INFO ] Deduced a trap composed of 135 places in 101 ms of which 0 ms to minimize.
[2023-03-12 17:50:55] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1908 ms
[2023-03-12 17:50:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:50:55] [INFO ] [Nat]Absence check using 53 positive place invariants in 17 ms returned sat
[2023-03-12 17:50:55] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2023-03-12 17:50:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:50:55] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2023-03-12 17:50:55] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 1 ms to minimize.
[2023-03-12 17:50:56] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 1 ms to minimize.
[2023-03-12 17:50:56] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2023-03-12 17:50:56] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 0 ms to minimize.
[2023-03-12 17:50:56] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2023-03-12 17:50:56] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2023-03-12 17:50:56] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2023-03-12 17:50:56] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2023-03-12 17:50:56] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2023-03-12 17:50:57] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2023-03-12 17:50:57] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2023-03-12 17:50:57] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 0 ms to minimize.
[2023-03-12 17:50:57] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2023-03-12 17:50:57] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 0 ms to minimize.
[2023-03-12 17:50:57] [INFO ] Deduced a trap composed of 122 places in 106 ms of which 2 ms to minimize.
[2023-03-12 17:50:57] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 0 ms to minimize.
[2023-03-12 17:50:58] [INFO ] Deduced a trap composed of 123 places in 100 ms of which 0 ms to minimize.
[2023-03-12 17:50:58] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 1 ms to minimize.
[2023-03-12 17:50:58] [INFO ] Deduced a trap composed of 152 places in 102 ms of which 0 ms to minimize.
[2023-03-12 17:50:58] [INFO ] Deduced a trap composed of 124 places in 104 ms of which 1 ms to minimize.
[2023-03-12 17:50:58] [INFO ] Deduced a trap composed of 138 places in 101 ms of which 0 ms to minimize.
[2023-03-12 17:50:58] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 0 ms to minimize.
[2023-03-12 17:50:58] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 1 ms to minimize.
[2023-03-12 17:50:58] [INFO ] Deduced a trap composed of 111 places in 123 ms of which 0 ms to minimize.
[2023-03-12 17:50:58] [INFO ] Deduced a trap composed of 120 places in 101 ms of which 1 ms to minimize.
[2023-03-12 17:50:59] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 1 ms to minimize.
[2023-03-12 17:50:59] [INFO ] Deduced a trap composed of 123 places in 103 ms of which 1 ms to minimize.
[2023-03-12 17:50:59] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2023-03-12 17:50:59] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 0 ms to minimize.
[2023-03-12 17:50:59] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 0 ms to minimize.
[2023-03-12 17:50:59] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 0 ms to minimize.
[2023-03-12 17:50:59] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2023-03-12 17:50:59] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 0 ms to minimize.
[2023-03-12 17:50:59] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 0 ms to minimize.
[2023-03-12 17:50:59] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 0 ms to minimize.
[2023-03-12 17:50:59] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 0 ms to minimize.
[2023-03-12 17:51:00] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
[2023-03-12 17:51:00] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 0 ms to minimize.
[2023-03-12 17:51:00] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 0 ms to minimize.
[2023-03-12 17:51:00] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2023-03-12 17:51:00] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2023-03-12 17:51:00] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 0 ms to minimize.
[2023-03-12 17:51:00] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 0 ms to minimize.
[2023-03-12 17:51:00] [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-12 17:51:00] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2023-03-12 17:51:00] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2023-03-12 17:51:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:51:00] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-12 17:51:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:51:00] [INFO ] [Nat]Absence check using 53 positive place invariants in 16 ms returned sat
[2023-03-12 17:51:00] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 8 ms returned sat
[2023-03-12 17:51:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:51:01] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-12 17:51:01] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2023-03-12 17:51:01] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2023-03-12 17:51:01] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 1 ms to minimize.
[2023-03-12 17:51:01] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2023-03-12 17:51:01] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2023-03-12 17:51:01] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 0 ms to minimize.
[2023-03-12 17:51:01] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2023-03-12 17:51:02] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 0 ms to minimize.
[2023-03-12 17:51:02] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2023-03-12 17:51:02] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 0 ms to minimize.
[2023-03-12 17:51:02] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2023-03-12 17:51:02] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 0 ms to minimize.
[2023-03-12 17:51:02] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 0 ms to minimize.
[2023-03-12 17:51:02] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 0 ms to minimize.
[2023-03-12 17:51:02] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2023-03-12 17:51:02] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 0 ms to minimize.
[2023-03-12 17:51:02] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2023-03-12 17:51:02] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 0 ms to minimize.
[2023-03-12 17:51:02] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2023-03-12 17:51:02] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1962 ms
[2023-03-12 17:51:03] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 38 ms.
[2023-03-12 17:51:04] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2023-03-12 17:51:04] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
[2023-03-12 17:51:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2023-03-12 17:51:04] [INFO ] Added : 313 causal constraints over 64 iterations in 1826 ms. Result :sat
Minimization took 102 ms.
[2023-03-12 17:51:05] [INFO ] [Real]Absence check using 53 positive place invariants in 19 ms returned sat
[2023-03-12 17:51:05] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2023-03-12 17:51:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:51:05] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-12 17:51:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:51:05] [INFO ] [Nat]Absence check using 53 positive place invariants in 16 ms returned sat
[2023-03-12 17:51:05] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2023-03-12 17:51:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:51:05] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-12 17:51:05] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2023-03-12 17:51:05] [INFO ] Deduced a trap composed of 112 places in 154 ms of which 0 ms to minimize.
[2023-03-12 17:51:06] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2023-03-12 17:51:06] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2023-03-12 17:51:06] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 1 ms to minimize.
[2023-03-12 17:51:06] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 0 ms to minimize.
[2023-03-12 17:51:06] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2023-03-12 17:51:06] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 0 ms to minimize.
[2023-03-12 17:51:06] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2023-03-12 17:51:07] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2023-03-12 17:51:07] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2023-03-12 17:51:07] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 0 ms to minimize.
[2023-03-12 17:51:07] [INFO ] Deduced a trap composed of 121 places in 125 ms of which 0 ms to minimize.
[2023-03-12 17:51:07] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2023-03-12 17:51:07] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2023-03-12 17:51:07] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 1 ms to minimize.
[2023-03-12 17:51:08] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 0 ms to minimize.
[2023-03-12 17:51:08] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 0 ms to minimize.
[2023-03-12 17:51:08] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 1 ms to minimize.
[2023-03-12 17:51:08] [INFO ] Deduced a trap composed of 107 places in 125 ms of which 1 ms to minimize.
[2023-03-12 17:51:08] [INFO ] Deduced a trap composed of 126 places in 121 ms of which 0 ms to minimize.
[2023-03-12 17:51:08] [INFO ] Deduced a trap composed of 121 places in 119 ms of which 0 ms to minimize.
[2023-03-12 17:51:08] [INFO ] Deduced a trap composed of 129 places in 124 ms of which 1 ms to minimize.
[2023-03-12 17:51:09] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 0 ms to minimize.
[2023-03-12 17:51:09] [INFO ] Deduced a trap composed of 113 places in 119 ms of which 1 ms to minimize.
[2023-03-12 17:51:09] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 0 ms to minimize.
[2023-03-12 17:51:09] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2023-03-12 17:51:09] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2023-03-12 17:51:09] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2023-03-12 17:51:09] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 0 ms to minimize.
[2023-03-12 17:51:09] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 0 ms to minimize.
[2023-03-12 17:51:10] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 0 ms to minimize.
[2023-03-12 17:51:10] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2023-03-12 17:51: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 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-12 17:51:10] [INFO ] [Real]Absence check using 53 positive place invariants in 15 ms returned sat
[2023-03-12 17:51:10] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2023-03-12 17:51:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:51:10] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-12 17:51:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:51:10] [INFO ] [Nat]Absence check using 53 positive place invariants in 16 ms returned sat
[2023-03-12 17:51:10] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2023-03-12 17:51:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:51:10] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2023-03-12 17:51:10] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 1 ms to minimize.
[2023-03-12 17:51:11] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2023-03-12 17:51:11] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 0 ms to minimize.
[2023-03-12 17:51:11] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2023-03-12 17:51:11] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2023-03-12 17:51:11] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 1 ms to minimize.
[2023-03-12 17:51:11] [INFO ] Deduced a trap composed of 109 places in 111 ms of which 1 ms to minimize.
[2023-03-12 17:51:11] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 0 ms to minimize.
[2023-03-12 17:51:11] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 1 ms to minimize.
[2023-03-12 17:51:12] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 1 ms to minimize.
[2023-03-12 17:51:12] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 1 ms to minimize.
[2023-03-12 17:51:12] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 1 ms to minimize.
[2023-03-12 17:51:12] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2023-03-12 17:51:12] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 0 ms to minimize.
[2023-03-12 17:51:12] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2023-03-12 17:51:12] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 0 ms to minimize.
[2023-03-12 17:51:12] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2023-03-12 17:51:13] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 0 ms to minimize.
[2023-03-12 17:51:13] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2023-03-12 17:51:13] [INFO ] Deduced a trap composed of 108 places in 106 ms of which 0 ms to minimize.
[2023-03-12 17:51:13] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 1 ms to minimize.
[2023-03-12 17:51:13] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2023-03-12 17:51:13] [INFO ] Deduced a trap composed of 141 places in 103 ms of which 1 ms to minimize.
[2023-03-12 17:51:13] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2023-03-12 17:51:13] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2023-03-12 17:51:14] [INFO ] Deduced a trap composed of 114 places in 103 ms of which 1 ms to minimize.
[2023-03-12 17:51:14] [INFO ] Deduced a trap composed of 126 places in 99 ms of which 1 ms to minimize.
[2023-03-12 17:51:14] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 0 ms to minimize.
[2023-03-12 17:51:14] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 0 ms to minimize.
[2023-03-12 17:51:14] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 0 ms to minimize.
[2023-03-12 17:51:14] [INFO ] Deduced a trap composed of 115 places in 100 ms of which 2 ms to minimize.
[2023-03-12 17:51:14] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 1 ms to minimize.
[2023-03-12 17:51:14] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2023-03-12 17:51:14] [INFO ] Deduced a trap composed of 114 places in 95 ms of which 1 ms to minimize.
[2023-03-12 17:51:15] [INFO ] Deduced a trap composed of 123 places in 99 ms of which 0 ms to minimize.
[2023-03-12 17:51:15] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 1 ms to minimize.
[2023-03-12 17:51:15] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 0 ms to minimize.
[2023-03-12 17:51:15] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2023-03-12 17:51:15] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 0 ms to minimize.
[2023-03-12 17:51:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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: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-12 17:51:15] [INFO ] [Real]Absence check using 53 positive place invariants in 15 ms returned sat
[2023-03-12 17:51:15] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2023-03-12 17:51:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:51:15] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-12 17:51:16] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2023-03-12 17:51:16] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2023-03-12 17:51:16] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2023-03-12 17:51:16] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 0 ms to minimize.
[2023-03-12 17:51:16] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 0 ms to minimize.
[2023-03-12 17:51:16] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2023-03-12 17:51:16] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 0 ms to minimize.
[2023-03-12 17:51:16] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2023-03-12 17:51:17] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2023-03-12 17:51:17] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2023-03-12 17:51:17] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2023-03-12 17:51:17] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2023-03-12 17:51:17] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2023-03-12 17:51:17] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2023-03-12 17:51:17] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2023-03-12 17:51:17] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2023-03-12 17:51:17] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2023-03-12 17:51:17] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1736 ms
[2023-03-12 17:51:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:51:17] [INFO ] [Nat]Absence check using 53 positive place invariants in 16 ms returned sat
[2023-03-12 17:51:17] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 8 ms returned sat
[2023-03-12 17:51:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:51:17] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-12 17:51:18] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2023-03-12 17:51:18] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 0 ms to minimize.
[2023-03-12 17:51:18] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 0 ms to minimize.
[2023-03-12 17:51:18] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 0 ms to minimize.
[2023-03-12 17:51:18] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2023-03-12 17:51:18] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 1 ms to minimize.
[2023-03-12 17:51:18] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 0 ms to minimize.
[2023-03-12 17:51:18] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2023-03-12 17:51:19] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2023-03-12 17:51:19] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2023-03-12 17:51:19] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 0 ms to minimize.
[2023-03-12 17:51:19] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 0 ms to minimize.
[2023-03-12 17:51:19] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 0 ms to minimize.
[2023-03-12 17:51:19] [INFO ] Deduced a trap composed of 132 places in 103 ms of which 1 ms to minimize.
[2023-03-12 17:51:19] [INFO ] Deduced a trap composed of 116 places in 102 ms of which 1 ms to minimize.
[2023-03-12 17:51:19] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2023-03-12 17:51:20] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2023-03-12 17:51:20] [INFO ] Deduced a trap composed of 122 places in 102 ms of which 1 ms to minimize.
[2023-03-12 17:51:20] [INFO ] Deduced a trap composed of 121 places in 101 ms of which 0 ms to minimize.
[2023-03-12 17:51:20] [INFO ] Deduced a trap composed of 131 places in 98 ms of which 0 ms to minimize.
[2023-03-12 17:51:20] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2023-03-12 17:51:20] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2023-03-12 17:51:20] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 0 ms to minimize.
[2023-03-12 17:51:20] [INFO ] Deduced a trap composed of 145 places in 103 ms of which 0 ms to minimize.
[2023-03-12 17:51:20] [INFO ] Deduced a trap composed of 140 places in 113 ms of which 0 ms to minimize.
[2023-03-12 17:51:21] [INFO ] Deduced a trap composed of 139 places in 101 ms of which 0 ms to minimize.
[2023-03-12 17:51:21] [INFO ] Deduced a trap composed of 42 places in 24 ms of which 0 ms to minimize.
[2023-03-12 17:51:21] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3188 ms
[2023-03-12 17:51:21] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 24 ms.
[2023-03-12 17:51:22] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2023-03-12 17:51:22] [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-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 309 edges and 560 vertex of which 7 / 560 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1132 edges and 554 vertex of which 549 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 549 transition count 375
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 432 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 238 place count 431 transition count 374
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 238 place count 431 transition count 283
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 199 rules applied. Total rules applied 437 place count 323 transition count 283
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 501 place count 259 transition count 219
Iterating global reduction 3 with 64 rules applied. Total rules applied 565 place count 259 transition count 219
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 565 place count 259 transition count 215
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 573 place count 255 transition count 215
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 177 rules applied. Total rules applied 750 place count 165 transition count 128
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 752 place count 164 transition count 132
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 754 place count 164 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 756 place count 162 transition count 130
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 757 place count 162 transition count 130
Applied a total of 757 rules in 138 ms. Remains 162 /560 variables (removed 398) and now considering 130/501 (removed 371) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 162/560 places, 130/501 transitions.
// Phase 1: matrix 130 rows 162 cols
[2023-03-12 17:51:23] [INFO ] Computed 71 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 54765 resets, run finished after 2987 ms. (steps per millisecond=334 ) properties (out of 6) seen :6
FORMULA BusinessProcesses-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 55660 ms.
ITS solved all properties within timeout

BK_STOP 1678643486332

--------------------
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-11"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-11, 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 r041-tajo-167813694800533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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