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.r459-smll-167912651200405.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 smartxred
Input is StigmergyCommit-PT-02b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r459-smll-167912651200405
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 10:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 10:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 10:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 10:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 10:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 231K Mar 5 18:23 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 StigmergyCommit-PT-02b-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679345925595

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-02b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-20 20:58:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 20:58:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 20:58:49] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2023-03-20 20:58:49] [INFO ] Transformed 928 places.
[2023-03-20 20:58:49] [INFO ] Transformed 1040 transitions.
[2023-03-20 20:58:49] [INFO ] Found NUPN structural information;
[2023-03-20 20:58:49] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 406 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
FORMULA StigmergyCommit-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1040 rows 928 cols
[2023-03-20 20:58:49] [INFO ] Computed 4 place invariants in 61 ms
Incomplete random walk after 10000 steps, including 165 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 15) seen :9
FORMULA StigmergyCommit-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :1
FORMULA StigmergyCommit-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
[2023-03-20 20:58:50] [INFO ] Invariant cache hit.
[2023-03-20 20:58:50] [INFO ] [Real]Absence check using 4 positive place invariants in 37 ms returned sat
[2023-03-20 20:58:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 20:58:51] [INFO ] [Real]Absence check using state equation in 844 ms returned sat
[2023-03-20 20:58:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 20:58:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 39 ms returned sat
[2023-03-20 20:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 20:58:53] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2023-03-20 20:58:53] [INFO ] Deduced a trap composed of 397 places in 629 ms of which 6 ms to minimize.
[2023-03-20 20:58:54] [INFO ] Deduced a trap composed of 397 places in 387 ms of which 2 ms to minimize.
[2023-03-20 20:58:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1212 ms
[2023-03-20 20:58:54] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 90 ms.
[2023-03-20 20:58:56] [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-20 20:58:57] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2023-03-20 20:58:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 20:58:57] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2023-03-20 20:58:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 20:58:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 21 ms returned sat
[2023-03-20 20:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 20:58:58] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2023-03-20 20:58:59] [INFO ] Deduced a trap composed of 397 places in 682 ms of which 3 ms to minimize.
[2023-03-20 20:58:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 814 ms
[2023-03-20 20:58:59] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 130 ms.
[2023-03-20 20:59:03] [INFO ] Deduced a trap composed of 20 places in 851 ms of which 4 ms to minimize.
[2023-03-20 20:59:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-20 20:59:04] [INFO ] [Real]Absence check using 4 positive place invariants in 33 ms returned sat
[2023-03-20 20:59:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 20:59:04] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2023-03-20 20:59:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 20:59:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 32 ms returned sat
[2023-03-20 20:59:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 20:59:05] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2023-03-20 20:59:06] [INFO ] Deduced a trap composed of 396 places in 513 ms of which 2 ms to minimize.
[2023-03-20 20:59:06] [INFO ] Deduced a trap composed of 396 places in 583 ms of which 2 ms to minimize.
[2023-03-20 20:59:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1314 ms
[2023-03-20 20:59:07] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 131 ms.
[2023-03-20 20:59:10] [INFO ] Deduced a trap composed of 20 places in 633 ms of which 1 ms to minimize.
[2023-03-20 20:59:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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: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-20 20:59:10] [INFO ] [Real]Absence check using 4 positive place invariants in 33 ms returned sat
[2023-03-20 20:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 20:59:11] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2023-03-20 20:59:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 20:59:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 35 ms returned sat
[2023-03-20 20:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 20:59:12] [INFO ] [Nat]Absence check using state equation in 736 ms returned sat
[2023-03-20 20:59:13] [INFO ] Deduced a trap composed of 397 places in 671 ms of which 2 ms to minimize.
[2023-03-20 20:59:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 809 ms
[2023-03-20 20:59:13] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 108 ms.
[2023-03-20 20:59:17] [INFO ] Deduced a trap composed of 20 places in 774 ms of which 2 ms to minimize.
[2023-03-20 20:59: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-20 20:59:17] [INFO ] [Real]Absence check using 4 positive place invariants in 20 ms returned sat
[2023-03-20 20:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 20:59:18] [INFO ] [Real]Absence check using state equation in 695 ms returned sat
[2023-03-20 20:59:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 20:59:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 21 ms returned sat
[2023-03-20 20:59:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 20:59:19] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2023-03-20 20:59:20] [INFO ] Deduced a trap composed of 398 places in 796 ms of which 2 ms to minimize.
[2023-03-20 20:59:21] [INFO ] Deduced a trap composed of 396 places in 796 ms of which 1 ms to minimize.
[2023-03-20 20:59:21] [INFO ] Deduced a trap composed of 397 places in 378 ms of which 1 ms to minimize.
[2023-03-20 20:59:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2253 ms
[2023-03-20 20:59:21] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 74 ms.
[2023-03-20 20:59:24] [INFO ] Deduced a trap composed of 20 places in 759 ms of which 1 ms to minimize.
[2023-03-20 20:59:24] [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, 0, 0, 0, 0]
Support contains 5 out of 928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Graph (trivial) has 913 edges and 928 vertex of which 63 / 928 are part of one of the 9 SCC in 12 ms
Free SCC test removed 54 places
Drop transitions removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Graph (complete) has 1173 edges and 874 vertex of which 868 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 693 transitions
Trivial Post-agglo rules discarded 693 transitions
Performed 693 trivial Post agglomeration. Transition count delta: 693
Iterating post reduction 0 with 696 rules applied. Total rules applied 698 place count 868 transition count 272
Reduce places removed 693 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 717 rules applied. Total rules applied 1415 place count 175 transition count 248
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 12 rules applied. Total rules applied 1427 place count 166 transition count 245
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1430 place count 163 transition count 245
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 1430 place count 163 transition count 217
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1486 place count 135 transition count 217
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 1522 place count 99 transition count 181
Iterating global reduction 4 with 36 rules applied. Total rules applied 1558 place count 99 transition count 181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1558 place count 99 transition count 180
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1560 place count 98 transition count 180
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1579 place count 79 transition count 132
Iterating global reduction 4 with 19 rules applied. Total rules applied 1598 place count 79 transition count 132
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1606 place count 79 transition count 124
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1611 place count 74 transition count 119
Iterating global reduction 5 with 5 rules applied. Total rules applied 1616 place count 74 transition count 119
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1619 place count 71 transition count 116
Iterating global reduction 5 with 3 rules applied. Total rules applied 1622 place count 71 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1625 place count 71 transition count 113
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1643 place count 62 transition count 104
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1644 place count 62 transition count 103
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1647 place count 59 transition count 100
Iterating global reduction 7 with 3 rules applied. Total rules applied 1650 place count 59 transition count 100
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1653 place count 56 transition count 97
Iterating global reduction 7 with 3 rules applied. Total rules applied 1656 place count 56 transition count 97
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1659 place count 53 transition count 94
Iterating global reduction 7 with 3 rules applied. Total rules applied 1662 place count 53 transition count 94
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1670 place count 49 transition count 122
Free-agglomeration rule applied 19 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 19 rules applied. Total rules applied 1689 place count 49 transition count 96
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 1724 place count 30 transition count 80
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1727 place count 27 transition count 77
Iterating global reduction 8 with 3 rules applied. Total rules applied 1730 place count 27 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1733 place count 27 transition count 74
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 1745 place count 27 transition count 62
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1747 place count 27 transition count 62
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1748 place count 27 transition count 61
Applied a total of 1748 rules in 199 ms. Remains 27 /928 variables (removed 901) and now considering 61/1040 (removed 979) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 27/928 places, 61/1040 transitions.
// Phase 1: matrix 61 rows 27 cols
[2023-03-20 20:59:24] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1519 ms. (steps per millisecond=658 ) properties (out of 5) seen :5
FORMULA StigmergyCommit-PT-02b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 36727 ms.
ITS solved all properties within timeout

BK_STOP 1679345966912

--------------------
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="StigmergyCommit-PT-02b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is StigmergyCommit-PT-02b, 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 r459-smll-167912651200405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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