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.r037-tajo-167813690600589.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 itstools
Input is BusinessProcesses-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690600589
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:47 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 177K 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-18-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678364452743

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 12:20:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 12:20:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:20:54] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-09 12:20:54] [INFO ] Transformed 717 places.
[2023-03-09 12:20:54] [INFO ] Transformed 642 transitions.
[2023-03-09 12:20:54] [INFO ] Found NUPN structural information;
[2023-03-09 12:20:54] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 15 transitions.
// Phase 1: matrix 627 rows 702 cols
[2023-03-09 12:20:54] [INFO ] Computed 114 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 53 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :10
FORMULA BusinessProcesses-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :1
FORMULA BusinessProcesses-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
[2023-03-09 12:20:55] [INFO ] Invariant cache hit.
[2023-03-09 12:20:55] [INFO ] [Real]Absence check using 73 positive place invariants in 38 ms returned sat
[2023-03-09 12:20:56] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 310 ms returned sat
[2023-03-09 12:20:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:20:57] [INFO ] [Real]Absence check using state equation in 1121 ms returned sat
[2023-03-09 12:20:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:20:57] [INFO ] [Nat]Absence check using 73 positive place invariants in 56 ms returned sat
[2023-03-09 12:20:57] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 18 ms returned sat
[2023-03-09 12:20:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:20:57] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2023-03-09 12:20:58] [INFO ] Deduced a trap composed of 14 places in 313 ms of which 6 ms to minimize.
[2023-03-09 12:20:58] [INFO ] Deduced a trap composed of 45 places in 245 ms of which 2 ms to minimize.
[2023-03-09 12:20:58] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 1 ms to minimize.
[2023-03-09 12:20:59] [INFO ] Deduced a trap composed of 150 places in 222 ms of which 2 ms to minimize.
[2023-03-09 12:20:59] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 1 ms to minimize.
[2023-03-09 12:20:59] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 1 ms to minimize.
[2023-03-09 12:20:59] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 1 ms to minimize.
[2023-03-09 12:21:00] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 1 ms to minimize.
[2023-03-09 12:21:00] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 1 ms to minimize.
[2023-03-09 12:21:00] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 1 ms to minimize.
[2023-03-09 12:21:00] [INFO ] Deduced a trap composed of 159 places in 253 ms of which 0 ms to minimize.
[2023-03-09 12:21:01] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 1 ms to minimize.
[2023-03-09 12:21:01] [INFO ] Deduced a trap composed of 151 places in 195 ms of which 1 ms to minimize.
[2023-03-09 12:21:01] [INFO ] Deduced a trap composed of 155 places in 212 ms of which 1 ms to minimize.
[2023-03-09 12:21:01] [INFO ] Deduced a trap composed of 159 places in 220 ms of which 1 ms to minimize.
[2023-03-09 12:21:02] [INFO ] Deduced a trap composed of 157 places in 189 ms of which 1 ms to minimize.
[2023-03-09 12:21:02] [INFO ] Deduced a trap composed of 165 places in 189 ms of which 0 ms to minimize.
[2023-03-09 12:21:02] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 0 ms to minimize.
[2023-03-09 12:21:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-09 12:21:02] [INFO ] [Real]Absence check using 73 positive place invariants in 26 ms returned sat
[2023-03-09 12:21:02] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2023-03-09 12:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:21:03] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2023-03-09 12:21:03] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 0 ms to minimize.
[2023-03-09 12:21:03] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 1 ms to minimize.
[2023-03-09 12:21:03] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 0 ms to minimize.
[2023-03-09 12:21:03] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2023-03-09 12:21:04] [INFO ] Deduced a trap composed of 164 places in 168 ms of which 0 ms to minimize.
[2023-03-09 12:21:04] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 1 ms to minimize.
[2023-03-09 12:21:04] [INFO ] Deduced a trap composed of 153 places in 192 ms of which 0 ms to minimize.
[2023-03-09 12:21:04] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 1 ms to minimize.
[2023-03-09 12:21:05] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 1 ms to minimize.
[2023-03-09 12:21:05] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 1 ms to minimize.
[2023-03-09 12:21:05] [INFO ] Deduced a trap composed of 67 places in 215 ms of which 1 ms to minimize.
[2023-03-09 12:21:06] [INFO ] Deduced a trap composed of 150 places in 256 ms of which 1 ms to minimize.
[2023-03-09 12:21:06] [INFO ] Deduced a trap composed of 146 places in 231 ms of which 1 ms to minimize.
[2023-03-09 12:21:06] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 0 ms to minimize.
[2023-03-09 12:21:06] [INFO ] Deduced a trap composed of 69 places in 185 ms of which 0 ms to minimize.
[2023-03-09 12:21:06] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 1 ms to minimize.
[2023-03-09 12:21:07] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 17 ms to minimize.
[2023-03-09 12:21:07] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 1 ms to minimize.
[2023-03-09 12:21:07] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 1 ms to minimize.
[2023-03-09 12:21:07] [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:2618)
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-09 12:21:07] [INFO ] [Real]Absence check using 73 positive place invariants in 34 ms returned sat
[2023-03-09 12:21:07] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 12 ms returned sat
[2023-03-09 12:21:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:21:08] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2023-03-09 12:21:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:21:08] [INFO ] [Nat]Absence check using 73 positive place invariants in 36 ms returned sat
[2023-03-09 12:21:08] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2023-03-09 12:21:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:21:08] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2023-03-09 12:21:08] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-09 12:21:08] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 0 ms to minimize.
[2023-03-09 12:21:09] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-09 12:21:09] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 1 ms to minimize.
[2023-03-09 12:21:09] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2023-03-09 12:21:09] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 0 ms to minimize.
[2023-03-09 12:21:09] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2023-03-09 12:21:09] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 0 ms to minimize.
[2023-03-09 12:21:10] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2023-03-09 12:21:10] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2023-03-09 12:21:10] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2023-03-09 12:21:10] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2023-03-09 12:21:10] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2023-03-09 12:21:10] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1739 ms
[2023-03-09 12:21:10] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 62 ms.
[2023-03-09 12:21:13] [INFO ] Added : 305 causal constraints over 61 iterations in 2781 ms. Result :unknown
[2023-03-09 12:21:13] [INFO ] [Real]Absence check using 73 positive place invariants in 29 ms returned sat
[2023-03-09 12:21:13] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2023-03-09 12:21:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:21:13] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2023-03-09 12:21:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:21:14] [INFO ] [Nat]Absence check using 73 positive place invariants in 502 ms returned sat
[2023-03-09 12:21:14] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 293 ms returned sat
[2023-03-09 12:21:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:21:15] [INFO ] [Nat]Absence check using state equation in 1153 ms returned sat
[2023-03-09 12:21:16] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2023-03-09 12:21:20] [INFO ] Deduced a trap composed of 11 places in 4061 ms of which 27 ms to minimize.
[2023-03-09 12:21:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-09 12:21:20] [INFO ] [Real]Absence check using 73 positive place invariants in 28 ms returned sat
[2023-03-09 12:21:20] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2023-03-09 12:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:21:20] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2023-03-09 12:21:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:21:20] [INFO ] [Nat]Absence check using 73 positive place invariants in 29 ms returned sat
[2023-03-09 12:21:20] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2023-03-09 12:21:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:21:21] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2023-03-09 12:21:21] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2023-03-09 12:21:21] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2023-03-09 12:21:21] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2023-03-09 12:21:21] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2023-03-09 12:21:21] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2023-03-09 12:21:21] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2023-03-09 12:21:22] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2023-03-09 12:21:22] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 1 ms to minimize.
[2023-03-09 12:21:22] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 1 ms to minimize.
[2023-03-09 12:21:22] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2023-03-09 12:21:22] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 1 ms to minimize.
[2023-03-09 12:21:22] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2023-03-09 12:21:22] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 1 ms to minimize.
[2023-03-09 12:21:23] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2023-03-09 12:21:23] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 0 ms to minimize.
[2023-03-09 12:21:23] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2023-03-09 12:21:23] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2023-03-09 12:21:23] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2371 ms
[2023-03-09 12:21:23] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 65 ms.
[2023-03-09 12:21:25] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
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] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 627/627 transitions.
Graph (trivial) has 409 edges and 702 vertex of which 8 / 702 are part of one of the 1 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1408 edges and 695 vertex of which 686 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 163 place count 686 transition count 455
Reduce places removed 161 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 163 rules applied. Total rules applied 326 place count 525 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 328 place count 523 transition count 453
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 328 place count 523 transition count 349
Deduced a syphon composed of 104 places in 2 ms
Ensure Unique test removed 25 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 233 rules applied. Total rules applied 561 place count 394 transition count 349
Discarding 91 places :
Symmetric choice reduction at 3 with 91 rule applications. Total rules 652 place count 303 transition count 258
Iterating global reduction 3 with 91 rules applied. Total rules applied 743 place count 303 transition count 258
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 743 place count 303 transition count 248
Deduced a syphon composed of 10 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 766 place count 290 transition count 248
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 767 place count 289 transition count 247
Iterating global reduction 3 with 1 rules applied. Total rules applied 768 place count 289 transition count 247
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 984 place count 181 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 986 place count 180 transition count 142
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 987 place count 180 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 988 place count 179 transition count 141
Applied a total of 988 rules in 228 ms. Remains 179 /702 variables (removed 523) and now considering 141/627 (removed 486) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 179/702 places, 141/627 transitions.
// Phase 1: matrix 141 rows 179 cols
[2023-03-09 12:21:26] [INFO ] Computed 78 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 53978 resets, run finished after 3138 ms. (steps per millisecond=318 ) properties (out of 5) seen :5
FORMULA BusinessProcesses-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 34549 ms.

BK_STOP 1678364489498

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-18"
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-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-18, 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 r037-tajo-167813690600589"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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