fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r026-tajo-162038143900475
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for BusinessProcesses-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
354.539 28760.00 45487.00 139.00 1 1 1 1 0 1 0 0 1 1 1 1 0 1 1 1 normal

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-162038143900475.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-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K 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 27K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:15 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 192K 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-20-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620548783674

Running Version 0
[2021-05-09 08:26:25] [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 08:26:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:26:26] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2021-05-09 08:26:26] [INFO ] Transformed 782 places.
[2021-05-09 08:26:26] [INFO ] Transformed 697 transitions.
[2021-05-09 08:26:26] [INFO ] Found NUPN structural information;
[2021-05-09 08:26:26] [INFO ] Parsed PT model containing 782 places and 697 transitions in 136 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 63 places in 12 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 638 rows 719 cols
[2021-05-09 08:26:26] [INFO ] Computed 121 place invariants in 48 ms
Incomplete random walk after 10000 steps, including 52 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :5
FORMULA BusinessProcesses-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :2
FORMULA BusinessProcesses-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
// Phase 1: matrix 638 rows 719 cols
[2021-05-09 08:26:26] [INFO ] Computed 121 place invariants in 9 ms
[2021-05-09 08:26:26] [INFO ] [Real]Absence check using 78 positive place invariants in 76 ms returned sat
[2021-05-09 08:26:26] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 18 ms returned sat
[2021-05-09 08:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:26:27] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2021-05-09 08:26:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:26:27] [INFO ] [Nat]Absence check using 78 positive place invariants in 27 ms returned sat
[2021-05-09 08:26:27] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2021-05-09 08:26:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:26:27] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2021-05-09 08:26:27] [INFO ] Deduced a trap composed of 15 places in 358 ms of which 3 ms to minimize.
[2021-05-09 08:26:28] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 2 ms to minimize.
[2021-05-09 08:26:28] [INFO ] Deduced a trap composed of 8 places in 290 ms of which 1 ms to minimize.
[2021-05-09 08:26:28] [INFO ] Deduced a trap composed of 54 places in 213 ms of which 1 ms to minimize.
[2021-05-09 08:26:28] [INFO ] Deduced a trap composed of 78 places in 212 ms of which 0 ms to minimize.
[2021-05-09 08:26:29] [INFO ] Deduced a trap composed of 155 places in 193 ms of which 0 ms to minimize.
[2021-05-09 08:26:30] [INFO ] Deduced a trap composed of 32 places in 1597 ms of which 29 ms to minimize.
[2021-05-09 08:26:31] [INFO ] Deduced a trap composed of 20 places in 673 ms of which 1 ms to minimize.
[2021-05-09 08:26:31] [INFO ] Deduced a trap composed of 22 places in 265 ms of which 1 ms to minimize.
[2021-05-09 08:26:32] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 0 ms to minimize.
[2021-05-09 08:26:32] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:26:32] [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 08:26:32] [INFO ] [Real]Absence check using 78 positive place invariants in 62 ms returned sat
[2021-05-09 08:26:32] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 24 ms returned sat
[2021-05-09 08:26:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:26:32] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2021-05-09 08:26:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:26:32] [INFO ] [Nat]Absence check using 78 positive place invariants in 55 ms returned sat
[2021-05-09 08:26:32] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 29 ms returned sat
[2021-05-09 08:26:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:26:33] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2021-05-09 08:26:33] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 0 ms to minimize.
[2021-05-09 08:26:33] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 0 ms to minimize.
[2021-05-09 08:26:34] [INFO ] Deduced a trap composed of 147 places in 257 ms of which 1 ms to minimize.
[2021-05-09 08:26:34] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 2 ms to minimize.
[2021-05-09 08:26:34] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 0 ms to minimize.
[2021-05-09 08:26:34] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 1 ms to minimize.
[2021-05-09 08:26:35] [INFO ] Deduced a trap composed of 131 places in 273 ms of which 2 ms to minimize.
[2021-05-09 08:26:35] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 1 ms to minimize.
[2021-05-09 08:26:35] [INFO ] Deduced a trap composed of 19 places in 296 ms of which 0 ms to minimize.
[2021-05-09 08:26:36] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 1 ms to minimize.
[2021-05-09 08:26:36] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 0 ms to minimize.
[2021-05-09 08:26:36] [INFO ] Deduced a trap composed of 132 places in 159 ms of which 0 ms to minimize.
[2021-05-09 08:26:36] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 1 ms to minimize.
[2021-05-09 08:26:36] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3306 ms
[2021-05-09 08:26:36] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 52 ms.
[2021-05-09 08:26:37] [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.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 08:26:38] [INFO ] [Real]Absence check using 78 positive place invariants in 38 ms returned sat
[2021-05-09 08:26:38] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 18 ms returned sat
[2021-05-09 08:26:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:26:38] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2021-05-09 08:26:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:26:38] [INFO ] [Nat]Absence check using 78 positive place invariants in 31 ms returned sat
[2021-05-09 08:26:38] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-09 08:26:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:26:38] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2021-05-09 08:26:39] [INFO ] Deduced a trap composed of 8 places in 1107 ms of which 1 ms to minimize.
[2021-05-09 08:26:40] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 1 ms to minimize.
[2021-05-09 08:26:40] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 1 ms to minimize.
[2021-05-09 08:26:40] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 1 ms to minimize.
[2021-05-09 08:26:40] [INFO ] Deduced a trap composed of 153 places in 169 ms of which 1 ms to minimize.
[2021-05-09 08:26:41] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 1 ms to minimize.
[2021-05-09 08:26:41] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 1 ms to minimize.
[2021-05-09 08:26:41] [INFO ] Deduced a trap composed of 155 places in 182 ms of which 0 ms to minimize.
[2021-05-09 08:26:41] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 0 ms to minimize.
[2021-05-09 08:26:41] [INFO ] Deduced a trap composed of 51 places in 211 ms of which 1 ms to minimize.
[2021-05-09 08:26:42] [INFO ] Deduced a trap composed of 153 places in 171 ms of which 4 ms to minimize.
[2021-05-09 08:26:42] [INFO ] Deduced a trap composed of 147 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:26:42] [INFO ] Deduced a trap composed of 152 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:26:42] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 1 ms to minimize.
[2021-05-09 08:26:42] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 0 ms to minimize.
[2021-05-09 08:26:43] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:26:43] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2021-05-09 08:26:43] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2021-05-09 08:26:43] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:26:43] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 0 ms to minimize.
[2021-05-09 08:26:43] [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.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 08:26:43] [INFO ] [Real]Absence check using 78 positive place invariants in 29 ms returned sat
[2021-05-09 08:26:43] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 13 ms returned sat
[2021-05-09 08:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:26:43] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-09 08:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:26:43] [INFO ] [Nat]Absence check using 78 positive place invariants in 29 ms returned sat
[2021-05-09 08:26:43] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 13 ms returned sat
[2021-05-09 08:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:26:44] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2021-05-09 08:26:44] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:26:44] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:26:44] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:26:44] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 3 ms to minimize.
[2021-05-09 08:26:44] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:26:45] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:26:45] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 0 ms to minimize.
[2021-05-09 08:26:45] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:26:45] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:26:45] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:26:45] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:26:45] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 3 ms to minimize.
[2021-05-09 08:26:45] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:26:46] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:26:46] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2021-05-09 08:26:46] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2021-05-09 08:26:46] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2021-05-09 08:26:46] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2021-05-09 08:26:46] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:26:46] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2451 ms
[2021-05-09 08:26:46] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 35 ms.
[2021-05-09 08:26:48] [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: Broken pipe ... 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: Broken pipe ...
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 410 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 713 vertex of which 686 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.4 ms
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 0 with 166 rules applied. Total rules applied 168 place count 686 transition count 451
Reduce places removed 166 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 168 rules applied. Total rules applied 336 place count 520 transition count 449
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 338 place count 518 transition count 449
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 338 place count 518 transition count 347
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 562 place count 396 transition count 347
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 652 place count 306 transition count 257
Iterating global reduction 3 with 90 rules applied. Total rules applied 742 place count 306 transition count 257
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 742 place count 306 transition count 248
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 762 place count 295 transition count 248
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 974 place count 188 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 978 place count 186 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 980 place count 186 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 982 place count 184 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 983 place count 184 transition count 148
Applied a total of 983 rules in 174 ms. Remains 184 /719 variables (removed 535) and now considering 148/638 (removed 490) transitions.
Finished structural reductions, in 1 iterations. Remains : 184/719 places, 148/638 transitions.
Normalized transition count is 147 out of 148 initially.
// Phase 1: matrix 147 rows 184 cols
[2021-05-09 08:26:48] [INFO ] Computed 83 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 52351 resets, run finished after 3198 ms. (steps per millisecond=312 ) properties (out of 4) seen :4
FORMULA BusinessProcesses-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620548812434

--------------------
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-20"
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-20, 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-162038143900475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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