fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r233-tall-167856419000517
Last Updated
May 14, 2023

About the Execution of LTSMin+red for LeafsetExtension-PT-S32C4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
520.451 68619.00 86665.00 247.50 1 1 1 1 1 4 1 1 1 1 1 1 1 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 '/data/fkordon/mcc2023-input.r233-tall-167856419000517.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is LeafsetExtension-PT-S32C4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419000517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 11K Feb 25 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.4M 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 LeafsetExtension-PT-S32C4-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679544751906

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C4
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 04:12:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 04:12:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 04:12:33] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2023-03-23 04:12:33] [INFO ] Transformed 5622 places.
[2023-03-23 04:12:33] [INFO ] Transformed 5449 transitions.
[2023-03-23 04:12:33] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2023-03-23 04:12:34] [INFO ] Computed 173 place invariants in 385 ms
Incomplete random walk after 10000 steps, including 300 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 16) seen :12
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :1
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :1
[2023-03-23 04:12:34] [INFO ] Invariant cache hit.
[2023-03-23 04:12:35] [INFO ] [Real]Absence check using 35 positive place invariants in 87 ms returned sat
[2023-03-23 04:12:35] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 166 ms returned sat
[2023-03-23 04:12:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:12:38] [INFO ] [Real]Absence check using state equation in 3289 ms returned sat
[2023-03-23 04:12:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:12:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 66 ms returned sat
[2023-03-23 04:12:39] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 145 ms returned sat
[2023-03-23 04:12:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:12:43] [INFO ] [Nat]Absence check using state equation in 3529 ms returned sat
[2023-03-23 04:12:43] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 279 ms.
[2023-03-23 04:12:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.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)
[2023-03-23 04:12:44] [INFO ] [Real]Absence check using 35 positive place invariants in 59 ms returned sat
[2023-03-23 04:12:44] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 154 ms returned sat
[2023-03-23 04:12:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:12:48] [INFO ] [Real]Absence check using state equation in 3431 ms returned sat
[2023-03-23 04:12:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:12:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 70 ms returned sat
[2023-03-23 04:12:49] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 154 ms returned sat
[2023-03-23 04:12:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:12:52] [INFO ] [Nat]Absence check using state equation in 3542 ms returned sat
[2023-03-23 04:12:53] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 230 ms.
[2023-03-23 04:13:00] [INFO ] Deduced a trap composed of 2 places in 7118 ms of which 14 ms to minimize.
[2023-03-23 04:13:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 04:13:01] [INFO ] [Real]Absence check using 35 positive place invariants in 61 ms returned sat
[2023-03-23 04:13:01] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 137 ms returned unsat
[2023-03-23 04:13:01] [INFO ] [Real]Absence check using 35 positive place invariants in 55 ms returned sat
[2023-03-23 04:13:02] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 141 ms returned sat
[2023-03-23 04:13:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:13:05] [INFO ] [Real]Absence check using state equation in 3315 ms returned sat
[2023-03-23 04:13:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:13:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 58 ms returned sat
[2023-03-23 04:13:06] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 147 ms returned sat
[2023-03-23 04:13:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:13:09] [INFO ] [Nat]Absence check using state equation in 3654 ms returned sat
[2023-03-23 04:13:10] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 256 ms.
[2023-03-23 04:13:17] [INFO ] Deduced a trap composed of 2 places in 7197 ms of which 8 ms to minimize.
[2023-03-23 04:13:17] [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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 04:13:18] [INFO ] [Real]Absence check using 35 positive place invariants in 53 ms returned sat
[2023-03-23 04:13:18] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 145 ms returned sat
[2023-03-23 04:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:13:21] [INFO ] [Real]Absence check using state equation in 3408 ms returned sat
[2023-03-23 04:13:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:13:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 57 ms returned sat
[2023-03-23 04:13:22] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 142 ms returned sat
[2023-03-23 04:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:13:26] [INFO ] [Nat]Absence check using state equation in 3362 ms returned sat
[2023-03-23 04:13:26] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 248 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-23 04:13:34] [INFO ] Deduced a trap composed of 2 places in 7099 ms of which 7 ms to minimize.
[2023-03-23 04:13:34] [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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, -1, 1, 1, 1] Max seen :[0, 2, 1, 0, 0]
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 226 are kept as prefixes of interest. Removing 5396 places using SCC suffix rule.11 ms
Discarding 5396 places :
Also discarding 3167 output transitions
Drop transitions removed 3167 transitions
Drop transitions removed 1135 transitions
Reduce isomorphic transitions removed 1135 transitions.
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1199 place count 210 transition count 1100
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 1250 place count 161 transition count 1098
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1252 place count 159 transition count 1098
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1252 place count 159 transition count 1093
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1262 place count 154 transition count 1093
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1291 place count 125 transition count 1064
Iterating global reduction 3 with 29 rules applied. Total rules applied 1320 place count 125 transition count 1064
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1322 place count 124 transition count 1063
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1338 place count 124 transition count 1047
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 1354 place count 108 transition count 1047
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 1369 place count 108 transition count 1047
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 1370 place count 107 transition count 1047
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1371 place count 107 transition count 1046
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1372 place count 106 transition count 1046
Applied a total of 1372 rules in 194 ms. Remains 106 /5622 variables (removed 5516) and now considering 1046/5449 (removed 4403) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 106/5622 places, 1046/5449 transitions.
Successfully produced net in file /tmp/petri1000_1189848533487823985.dot
Successfully produced net in file /tmp/petri1001_6521346744630536587.dot
Successfully produced net in file /tmp/petri1002_5806825799808318427.dot
Successfully produced net in file /tmp/petri1003_11466497964649455080.dot
Successfully produced net in file /tmp/petri1004_8797905049044479804.dot
Successfully produced net in file /tmp/petri1005_15122943148064590802.dot
Successfully produced net in file /tmp/petri1006_3195380972266822430.dot
Successfully produced net in file /tmp/petri1007_1211199334155963502.dot
Successfully produced net in file /tmp/petri1008_6349905184089862890.dot
Successfully produced net in file /tmp/petri1009_4794140210885433954.dot
Successfully produced net in file /tmp/petri1010_13270398390507062414.dot
Successfully produced net in file /tmp/petri1011_10689079509189434269.dot
Successfully produced net in file /tmp/petri1012_1707716337923374297.dot
Successfully produced net in file /tmp/petri1013_788519761866263079.dot
Successfully produced net in file /tmp/petri1014_9996613757392954558.dot
Successfully produced net in file /tmp/petri1015_7205673824568261671.dot
Successfully produced net in file /tmp/petri1016_575732740249061067.dot
Successfully produced net in file /tmp/petri1017_15644414634382894870.dot
Successfully produced net in file /tmp/petri1018_2120808797309355805.dot
Successfully produced net in file /tmp/petri1019_11024603624693947281.dot
Successfully produced net in file /tmp/petri1020_2408997757379802163.dot
Successfully produced net in file /tmp/petri1021_14441000599706587183.dot
Successfully produced net in file /tmp/petri1022_12540434330326994192.dot
Successfully produced net in file /tmp/petri1023_9951477892367644630.dot
Successfully produced net in file /tmp/petri1024_9134293264765046634.dot
Successfully produced net in file /tmp/petri1025_13246610221877452097.dot
Successfully produced net in file /tmp/petri1026_128932899176202931.dot
Successfully produced net in file /tmp/petri1027_7370434416464799976.dot
Successfully produced net in file /tmp/petri1028_1625410454476948273.dot
Successfully produced net in file /tmp/petri1029_11852753482545321897.dot
Successfully produced net in file /tmp/petri1030_17051806483824472321.dot
Successfully produced net in file /tmp/petri1031_2622720987468587992.dot
Successfully produced net in file /tmp/petri1032_9870518906959097286.dot
Successfully produced net in file /tmp/petri1033_9479390261865035527.dot
Successfully produced net in file /tmp/petri1034_11603718564142974763.dot
Successfully produced net in file /tmp/petri1035_8209887254482694868.dot
Successfully produced net in file /tmp/petri1036_15854939417834164335.dot
Successfully produced net in file /tmp/petri1037_1827767131069179447.dot
Successfully produced net in file /tmp/petri1038_4185075358337123499.dot
Successfully produced net in file /tmp/petri1039_10147079452355085553.dot
Successfully produced net in file /tmp/petri1040_7584051877045686551.dot
Successfully produced net in file /tmp/petri1041_18272429429632202320.dot
Successfully produced net in file /tmp/petri1042_16264463337142259194.dot
Successfully produced net in file /tmp/petri1043_2046483997322240926.dot
Successfully produced net in file /tmp/petri1044_1028701817477514371.dot
Successfully produced net in file /tmp/petri1045_18125206057884738824.dot
Successfully produced net in file /tmp/petri1046_7564527780919693820.dot
Successfully produced net in file /tmp/petri1047_2386406288908473568.dot
Successfully produced net in file /tmp/petri1048_3147084328993193538.dot
Successfully produced net in file /tmp/petri1049_17927590841325174809.dot
Successfully produced net in file /tmp/petri1050_13608193868185762883.dot
Successfully produced net in file /tmp/petri1051_3161295381069032486.dot
Successfully produced net in file /tmp/petri1052_3756296747523050468.dot
Successfully produced net in file /tmp/petri1053_1081747359791835469.dot
Successfully produced net in file /tmp/petri1054_10544712191492910434.dot
Successfully produced net in file /tmp/petri1055_6421185740375617059.dot
Successfully produced net in file /tmp/petri1056_851988925948071936.dot
Successfully produced net in file /tmp/petri1057_4371205947992090712.dot
Successfully produced net in file /tmp/petri1058_6309087778269041291.dot
Successfully produced net in file /tmp/petri1059_5984163002183596151.dot
Successfully produced net in file /tmp/petri1060_9556998383228616385.dot
Successfully produced net in file /tmp/petri1061_320617772705042134.dot
Successfully produced net in file /tmp/petri1062_825761854782867318.dot
Successfully produced net in file /tmp/petri1063_15831280472632911819.dot
Successfully produced net in file /tmp/petri1064_6733936187213046468.dot
Successfully produced net in file /tmp/petri1065_15155977178637165402.dot
Successfully produced net in file /tmp/petri1066_16746624164395664084.dot
Successfully produced net in file /tmp/petri1067_10476613697261377650.dot
Successfully produced net in file /tmp/petri1068_8426854969435173575.dot
Successfully produced net in file /tmp/petri1069_16818025706891206446.dot
Successfully produced net in file /tmp/petri1070_2932041426174274556.dot
Successfully produced net in file /tmp/petri1071_16482656665354113448.dot
Successfully produced net in file /tmp/petri1072_9520688061088543736.dot
Successfully produced net in file /tmp/petri1073_14988410398515473360.dot
Successfully produced net in file /tmp/petri1074_17789176354507848423.dot
Successfully produced net in file /tmp/petri1075_4111719026938514429.dot
Successfully produced net in file /tmp/petri1076_9985212340997029247.dot
Successfully produced net in file /tmp/petri1077_5299837689357243641.dot
Successfully produced net in file /tmp/petri1078_8123079123486498953.dot
Successfully produced net in file /tmp/petri1079_12276291316600298887.dot
Successfully produced net in file /tmp/petri1080_15158782902757610490.dot
Successfully produced net in file /tmp/petri1081_16262223233843173287.dot
Successfully produced net in file /tmp/petri1082_12364590643318320791.dot
Successfully produced net in file /tmp/petri1083_206978829509951242.dot
Successfully produced net in file /tmp/petri1084_7020893973182673049.dot
Successfully produced net in file /tmp/petri1085_10207879500478494180.dot
Successfully produced net in file /tmp/petri1086_3630649866746846497.dot
Successfully produced net in file /tmp/petri1087_17449869891472038988.dot
Successfully produced net in file /tmp/petri1088_2308760100829765357.dot
Successfully produced net in file /tmp/petri1089_9680251948981874529.dot
Successfully produced net in file /tmp/petri1090_15945641314781124754.dot
Successfully produced net in file /tmp/petri1091_2376893846799764075.dot
Successfully produced net in file /tmp/petri1092_12796027366717090345.dot
Successfully produced net in file /tmp/petri1093_12996188304830773165.dot
Successfully produced net in file /tmp/petri1094_5678921187377414104.dot
Successfully produced net in file /tmp/petri1095_727274285097194465.dot
Successfully produced net in file /tmp/petri1096_15834331935804424794.dot
Successfully produced net in file /tmp/petri1097_8551736829109766167.dot
Successfully produced net in file /tmp/petri1098_15242092116586957820.dot
Successfully produced net in file /tmp/petri1099_16882212246694507416.dot
Successfully produced net in file /tmp/petri1100_2400972316596831791.dot
Successfully produced net in file /tmp/petri1101_10455137731766265800.dot
Successfully produced net in file /tmp/petri1102_10170134267782107142.dot
Successfully produced net in file /tmp/petri1103_15612471713454160322.dot
Successfully produced net in file /tmp/petri1104_14947252540532224783.dot
Successfully produced net in file /tmp/petri1105_16424939074093736773.dot
Successfully produced net in file /tmp/petri1106_1775681568519472769.dot
Successfully produced net in file /tmp/petri1107_6534021857110937471.dot
Successfully produced net in file /tmp/petri1108_12612934326803174275.dot
Successfully produced net in file /tmp/petri1109_15413143799660731093.dot
Successfully produced net in file /tmp/petri1110_14313856350645755779.dot
Successfully produced net in file /tmp/petri1111_10890994732073553371.dot
Successfully produced net in file /tmp/petri1112_12204689460888344507.dot
Successfully produced net in file /tmp/petri1113_9858197108153889109.dot
Successfully produced net in file /tmp/petri1114_11497231011706832063.dot
Successfully produced net in file /tmp/petri1115_17675432145976998674.dot
Successfully produced net in file /tmp/petri1116_510274518320703570.dot
Successfully produced net in file /tmp/petri1117_18377803519566804901.dot
Successfully produced net in file /tmp/petri1118_10139648155765913881.dot
Successfully produced net in file /tmp/petri1119_12020707021009548372.dot
Successfully produced net in file /tmp/petri1120_4087793156289274190.dot
Successfully produced net in file /tmp/petri1121_1685680535623915026.dot
Successfully produced net in file /tmp/petri1122_17624973055656780208.dot
Successfully produced net in file /tmp/petri1123_10558720023224455211.dot
Successfully produced net in file /tmp/petri1124_5000537236817609962.dot
Successfully produced net in file /tmp/petri1125_11060573785427589491.dot
Successfully produced net in file /tmp/petri1126_4401254636663946897.dot
Successfully produced net in file /tmp/petri1127_9001945477629652173.dot
Successfully produced net in file /tmp/petri1128_3142107299972695200.dot
Successfully produced net in file /tmp/petri1129_7602726449846385719.dot
Successfully produced net in file /tmp/petri1130_1920586830637821474.dot
Successfully produced net in file /tmp/petri1131_702511564774821449.dot
Successfully produced net in file /tmp/petri1132_2133634378051193066.dot
Successfully produced net in file /tmp/petri1133_12540357744234953780.dot
Successfully produced net in file /tmp/petri1134_13785505230394114853.dot
Drop transitions removed 135 transitions
Dominated transitions for bounds rules discarded 135 transitions
Normalized transition count is 120 out of 911 initially.
// Phase 1: matrix 120 rows 106 cols
[2023-03-23 04:13:34] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 125791 resets, run finished after 4132 ms. (steps per millisecond=242 ) properties (out of 4) seen :7
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4839 resets, run finished after 727 ms. (steps per millisecond=1375 ) properties (out of 1) seen :3
[2023-03-23 04:13:39] [INFO ] Flow matrix only has 120 transitions (discarded 791 similar events)
// Phase 1: matrix 120 rows 106 cols
[2023-03-23 04:13:39] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 04:13:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 04:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:13:39] [INFO ] [Real]Absence check using state equation in 24 ms returned unsat
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 66355 ms.
ITS solved all properties within timeout

BK_STOP 1679544820525

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is LeafsetExtension-PT-S32C4, 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 r233-tall-167856419000517"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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