Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 146K May 5 16:51 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-12-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620545385029

Running Version 0
[2021-05-09 07:29:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 07:29:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:29:46] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2021-05-09 07:29:46] [INFO ] Transformed 586 places.
[2021-05-09 07:29:46] [INFO ] Transformed 525 transitions.
[2021-05-09 07:29:46] [INFO ] Found NUPN structural information;
[2021-05-09 07:29:46] [INFO ] Parsed PT model containing 586 places and 525 transitions in 119 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
// Phase 1: matrix 521 rows 582 cols
[2021-05-09 07:29:46] [INFO ] Computed 98 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 74 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :5
FORMULA BusinessProcesses-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :1
FORMULA BusinessProcesses-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 521 rows 582 cols
[2021-05-09 07:29:47] [INFO ] Computed 98 place invariants in 13 ms
[2021-05-09 07:29:47] [INFO ] [Real]Absence check using 55 positive place invariants in 24 ms returned sat
[2021-05-09 07:29:47] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 15 ms returned sat
[2021-05-09 07:29:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:29:47] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-09 07:29:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:29:47] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2021-05-09 07:29:47] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 10 ms returned sat
[2021-05-09 07:29:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:29:47] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2021-05-09 07:29:48] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 28 ms to minimize.
[2021-05-09 07:29:48] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 1 ms to minimize.
[2021-05-09 07:29:48] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:29:48] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 2 ms to minimize.
[2021-05-09 07:29:48] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 0 ms to minimize.
[2021-05-09 07:29:48] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2021-05-09 07:29:49] [INFO ] Deduced a trap composed of 111 places in 150 ms of which 1 ms to minimize.
[2021-05-09 07:29:49] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 2 ms to minimize.
[2021-05-09 07:29:49] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 1 ms to minimize.
[2021-05-09 07:29:49] [INFO ] Deduced a trap composed of 129 places in 155 ms of which 1 ms to minimize.
[2021-05-09 07:29:49] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:29:50] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:29:50] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 0 ms to minimize.
[2021-05-09 07:29:50] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 0 ms to minimize.
[2021-05-09 07:29:50] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:29:50] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 1 ms to minimize.
[2021-05-09 07:29:50] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:29:51] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:29:51] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:29:51] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:29:51] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 0 ms to minimize.
[2021-05-09 07:29:51] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2021-05-09 07:29:51] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2021-05-09 07:29:52] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:29:52] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:29:52] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 1 ms to minimize.
[2021-05-09 07:29:52] [INFO ] Deduced a trap composed of 116 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:29:52] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:29:52] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 07:29:52] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned sat
[2021-05-09 07:29:52] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 14 ms returned sat
[2021-05-09 07:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:29:52] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-09 07:29:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:29:53] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2021-05-09 07:29:53] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 27 ms returned sat
[2021-05-09 07:29:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:29:53] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2021-05-09 07:29:53] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 0 ms to minimize.
[2021-05-09 07:29:53] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2021-05-09 07:29:53] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:29:53] [INFO ] Deduced a trap composed of 109 places in 184 ms of which 1 ms to minimize.
[2021-05-09 07:29:54] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 0 ms to minimize.
[2021-05-09 07:29:54] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:29:54] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 5 ms to minimize.
[2021-05-09 07:29:54] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2021-05-09 07:29:54] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:29:54] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 1 ms to minimize.
[2021-05-09 07:29:55] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:29:55] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 0 ms to minimize.
[2021-05-09 07:29:55] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:29:55] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 0 ms to minimize.
[2021-05-09 07:29:55] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:29:55] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:29:55] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:29:56] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 0 ms to minimize.
[2021-05-09 07:29:56] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:29:56] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3047 ms
[2021-05-09 07:29:56] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 30 ms.
[2021-05-09 07:29:58] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 1 ms to minimize.
[2021-05-09 07:29:58] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 07:29:58] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2021-05-09 07:29:58] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 10 ms returned sat
[2021-05-09 07:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:29:58] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-09 07:29:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:29:58] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2021-05-09 07:29:58] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-09 07:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:29:58] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2021-05-09 07:29:58] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2021-05-09 07:29:59] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 1 ms to minimize.
[2021-05-09 07:29:59] [INFO ] Deduced a trap composed of 130 places in 143 ms of which 1 ms to minimize.
[2021-05-09 07:29:59] [INFO ] Deduced a trap composed of 123 places in 162 ms of which 0 ms to minimize.
[2021-05-09 07:29:59] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2021-05-09 07:29:59] [INFO ] Deduced a trap composed of 127 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:29:59] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 0 ms to minimize.
[2021-05-09 07:30:00] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2021-05-09 07:30:00] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 10 ms to minimize.
[2021-05-09 07:30:00] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:30:00] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:30:00] [INFO ] Deduced a trap composed of 133 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:30:00] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 1 ms to minimize.
[2021-05-09 07:30:00] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 1 ms to minimize.
[2021-05-09 07:30:01] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 0 ms to minimize.
[2021-05-09 07:30:01] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 0 ms to minimize.
[2021-05-09 07:30:01] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:30:01] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:30:01] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:30:01] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:30:01] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:30:02] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2021-05-09 07:30:02] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:30:02] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:30:02] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:30:02] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 1 ms to minimize.
[2021-05-09 07:30:02] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:30:02] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3972 ms
[2021-05-09 07:30:02] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 34 ms.
[2021-05-09 07:30:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 07:30:03] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned sat
[2021-05-09 07:30:03] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-09 07:30:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:03] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2021-05-09 07:30:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:03] [INFO ] [Nat]Absence check using 55 positive place invariants in 28 ms returned sat
[2021-05-09 07:30:03] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2021-05-09 07:30:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:04] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2021-05-09 07:30:04] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:30:04] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2021-05-09 07:30:04] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 1 ms to minimize.
[2021-05-09 07:30:04] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 1 ms to minimize.
[2021-05-09 07:30:04] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 0 ms to minimize.
[2021-05-09 07:30:04] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 1 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 0 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 1 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 0 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2529 ms
[2021-05-09 07:30:06] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 28 ms.
[2021-05-09 07:30:08] [INFO ] Added : 272 causal constraints over 55 iterations in 2040 ms. Result :sat
Minimization took 129 ms.
[2021-05-09 07:30:08] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned sat
[2021-05-09 07:30:08] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2021-05-09 07:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:09] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2021-05-09 07:30:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:09] [INFO ] [Nat]Absence check using 55 positive place invariants in 18 ms returned sat
[2021-05-09 07:30:09] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 9 ms returned sat
[2021-05-09 07:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:09] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-09 07:30:09] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:30:09] [INFO ] Deduced a trap composed of 126 places in 171 ms of which 1 ms to minimize.
[2021-05-09 07:30:09] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:30:09] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:30:10] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2021-05-09 07:30:10] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:30:10] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:30:10] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:30:10] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:30:10] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:30:10] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:30:10] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:30:10] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:30:10] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:30:10] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:30:10] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:30:11] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:30:11] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:30:11] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:30:11] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2021-05-09 07:30:11] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:30:11] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2021-05-09 07:30:11] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2039 ms
[2021-05-09 07:30:11] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 28 ms.
[2021-05-09 07:30:13] [INFO ] Deduced a trap composed of 133 places in 158 ms of which 0 ms to minimize.
[2021-05-09 07:30:13] [INFO ] Deduced a trap composed of 127 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:30:13] [INFO ] Deduced a trap composed of 144 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:30:13] [INFO ] Deduced a trap composed of 132 places in 131 ms of which 0 ms to minimize.
[2021-05-09 07:30:14] [INFO ] Deduced a trap composed of 127 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:30:14] [INFO ] Deduced a trap composed of 140 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:30:14] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 07:30:14] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2021-05-09 07:30:14] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2021-05-09 07:30:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:14] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2021-05-09 07:30:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:14] [INFO ] [Nat]Absence check using 55 positive place invariants in 22 ms returned sat
[2021-05-09 07:30:14] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-09 07:30:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:14] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2021-05-09 07:30:15] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 1 ms to minimize.
[2021-05-09 07:30:15] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 0 ms to minimize.
[2021-05-09 07:30:15] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 1 ms to minimize.
[2021-05-09 07:30:15] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:30:15] [INFO ] Deduced a trap composed of 118 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:30:15] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:30:15] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:30:16] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:30:16] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2021-05-09 07:30:16] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2021-05-09 07:30:16] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:30:16] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:30:16] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:30:16] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:30:16] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2021-05-09 07:30:16] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:30:17] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2021-05-09 07:30:17] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:30:17] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:30:17] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:30:17] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:30:17] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:30:17] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:30:17] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2021-05-09 07:30:17] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:30:17] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2021-05-09 07:30:17] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2857 ms
[2021-05-09 07:30:17] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 27 ms.
[2021-05-09 07:30:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 07:30:19] [INFO ] [Real]Absence check using 55 positive place invariants in 25 ms returned sat
[2021-05-09 07:30:19] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 14 ms returned sat
[2021-05-09 07:30:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:19] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2021-05-09 07:30:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:20] [INFO ] [Nat]Absence check using 55 positive place invariants in 22 ms returned sat
[2021-05-09 07:30:20] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-09 07:30:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:20] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2021-05-09 07:30:20] [INFO ] Deduced a trap composed of 112 places in 154 ms of which 0 ms to minimize.
[2021-05-09 07:30:20] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:30:20] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2021-05-09 07:30:20] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:30:20] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:30:20] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:30:20] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:30:21] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:30:21] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:30:21] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:30:21] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:30:21] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:30:21] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:30:21] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:30:21] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:30:21] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:30:21] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:30:21] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:30:21] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2021-05-09 07:30:21] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2021-05-09 07:30:21] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:30:21] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:30:22] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:30:22] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1758 ms
[2021-05-09 07:30:22] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 30 ms.
[2021-05-09 07:30:24] [INFO ] Added : 316 causal constraints over 64 iterations in 2313 ms. Result :sat
Minimization took 118 ms.
[2021-05-09 07:30:24] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2021-05-09 07:30:24] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2021-05-09 07:30:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:24] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2021-05-09 07:30:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:24] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2021-05-09 07:30:24] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2021-05-09 07:30:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:25] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2021-05-09 07:30:25] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 1 ms to minimize.
[2021-05-09 07:30:25] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 1 ms to minimize.
[2021-05-09 07:30:25] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 1 ms to minimize.
[2021-05-09 07:30:25] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:30:26] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 0 ms to minimize.
[2021-05-09 07:30:26] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 1 ms to minimize.
[2021-05-09 07:30:26] [INFO ] Deduced a trap composed of 117 places in 115 ms of which 1 ms to minimize.
[2021-05-09 07:30:26] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 0 ms to minimize.
[2021-05-09 07:30:26] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:30:26] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 124 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 116 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:30:29] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:30:29] [INFO ] Deduced a trap composed of 126 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:30:29] [INFO ] Deduced a trap composed of 129 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:30:29] [INFO ] Deduced a trap composed of 127 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:30:29] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:30:29] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:30:29] [INFO ] Deduced a trap composed of 139 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:30:29] [INFO ] Deduced a trap composed of 124 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:30:29] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:30:29] [INFO ] Deduced a trap composed of 129 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:30:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 07:30:30] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-09 07:30:30] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 8 ms returned sat
[2021-05-09 07:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:30] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-09 07:30:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:30] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2021-05-09 07:30:30] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2021-05-09 07:30:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:30] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2021-05-09 07:30:30] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:30:30] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:30:30] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:30:31] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:30:31] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2021-05-09 07:30:31] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:30:31] [INFO ] Deduced a trap composed of 113 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:30:31] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:30:31] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:30:31] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 136 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 138 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:30:33] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
[2021-05-09 07:30:33] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:30:33] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:30:33] [INFO ] Deduced a trap composed of 141 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:30:33] [INFO ] Deduced a trap composed of 129 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:30:33] [INFO ] Deduced a trap composed of 124 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:30:33] [INFO ] Deduced a trap composed of 128 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:30:33] [INFO ] Deduced a trap composed of 153 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:30:34] [INFO ] Deduced a trap composed of 154 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:30:34] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:30:34] [INFO ] Deduced a trap composed of 134 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:30:34] [INFO ] Deduced a trap composed of 134 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:30:34] [INFO ] Deduced a trap composed of 133 places in 109 ms of which 1 ms to minimize.
[2021-05-09 07:30:34] [INFO ] Deduced a trap composed of 156 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:30:34] [INFO ] Deduced a trap composed of 137 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:30:34] [INFO ] Deduced a trap composed of 129 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:30:35] [INFO ] Deduced a trap composed of 141 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:30:35] [INFO ] Deduced a trap composed of 142 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:30:35] [INFO ] Deduced a trap composed of 127 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:30:35] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 07:30:35] [INFO ] [Real]Absence check using 55 positive place invariants in 15 ms returned sat
[2021-05-09 07:30:35] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 9 ms returned sat
[2021-05-09 07:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:35] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2021-05-09 07:30:35] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:30:35] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 0 ms to minimize.
[2021-05-09 07:30:35] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:30:36] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:30:36] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:30:36] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2021-05-09 07:30:36] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:30:36] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2021-05-09 07:30:36] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:30:36] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:30:36] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:30:36] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:30:37] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:30:37] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:30:37] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:30:37] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:30:37] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:30:37] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:30:37] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:30:37] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:30:37] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2021-05-09 07:30:37] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:30:37] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2021-05-09 07:30:37] [INFO ] Deduced a trap composed of 42 places in 25 ms of which 0 ms to minimize.
[2021-05-09 07:30:37] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2021-05-09 07:30:37] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2021-05-09 07:30:37] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2358 ms
[2021-05-09 07:30:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:37] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2021-05-09 07:30:37] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 9 ms returned sat
[2021-05-09 07:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:38] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2021-05-09 07:30:38] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 0 ms to minimize.
[2021-05-09 07:30:38] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 0 ms to minimize.
[2021-05-09 07:30:38] [INFO ] Deduced a trap composed of 115 places in 127 ms of which 0 ms to minimize.
[2021-05-09 07:30:38] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:30:38] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:30:38] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:30:39] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:30:39] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:30:39] [INFO ] Deduced a trap composed of 115 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:30:39] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:30:39] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:30:39] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:30:39] [INFO ] Deduced a trap composed of 145 places in 91 ms of which 1 ms to minimize.
[2021-05-09 07:30:39] [INFO ] Deduced a trap composed of 138 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:30:39] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:30:40] [INFO ] Deduced a trap composed of 117 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:30:40] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:30:40] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:30:40] [INFO ] Deduced a trap composed of 128 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:30:40] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:30:40] [INFO ] Deduced a trap composed of 128 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:30:40] [INFO ] Deduced a trap composed of 135 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:30:40] [INFO ] Deduced a trap composed of 136 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:30:40] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:30:41] [INFO ] Deduced a trap composed of 141 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:30:41] [INFO ] Deduced a trap composed of 149 places in 83 ms of which 0 ms to minimize.
[2021-05-09 07:30:41] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:30:41] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:30:41] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:30:41] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:30:41] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2021-05-09 07:30:41] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:30:41] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:30:42] [INFO ] Deduced a trap composed of 122 places in 83 ms of which 0 ms to minimize.
[2021-05-09 07:30:42] [INFO ] Deduced a trap composed of 122 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:30:42] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2021-05-09 07:30:42] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2021-05-09 07:30:42] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2021-05-09 07:30:42] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 0 ms to minimize.
[2021-05-09 07:30:42] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:30:42] [INFO ] Deduced a trap composed of 128 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:30:42] [INFO ] Deduced a trap composed of 113 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:30:42] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
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]
Incomplete Parikh walk after 30800 steps, including 257 resets, run finished after 74 ms. (steps per millisecond=416 ) properties (out of 10) seen :0 could not realise parikh vector
Support contains 10 out of 582 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 318 edges and 582 vertex of which 7 / 582 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1178 edges and 576 vertex of which 572 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 572 transition count 391
Reduce places removed 121 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 124 rules applied. Total rules applied 247 place count 451 transition count 388
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 250 place count 448 transition count 388
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 250 place count 448 transition count 302
Deduced a syphon composed of 86 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 187 rules applied. Total rules applied 437 place count 347 transition count 302
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 505 place count 279 transition count 234
Iterating global reduction 3 with 68 rules applied. Total rules applied 573 place count 279 transition count 234
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 573 place count 279 transition count 228
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 586 place count 272 transition count 228
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 187 rules applied. Total rules applied 773 place count 177 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 775 place count 176 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 777 place count 176 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 779 place count 174 transition count 138
Applied a total of 779 rules in 150 ms. Remains 174 /582 variables (removed 408) and now considering 138/521 (removed 383) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/582 places, 138/521 transitions.
// Phase 1: matrix 138 rows 174 cols
[2021-05-09 07:30:43] [INFO ] Computed 76 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 31620 resets, run finished after 2343 ms. (steps per millisecond=426 ) properties (out of 10) seen :10
FORMULA BusinessProcesses-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620545445715

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-12"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-12, 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 r026-tajo-162038143800411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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