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.r458-smll-167912650500629.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 marciexred
Input is StigmergyElection-PT-06b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650500629
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.8K Feb 26 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 16:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 16:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 16:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 16:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 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 1.2M 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 StigmergyElection-PT-06b-UpperBounds-00
FORMULA_NAME StigmergyElection-PT-06b-UpperBounds-01
FORMULA_NAME StigmergyElection-PT-06b-UpperBounds-02
FORMULA_NAME StigmergyElection-PT-06b-UpperBounds-03
FORMULA_NAME StigmergyElection-PT-06b-UpperBounds-04
FORMULA_NAME StigmergyElection-PT-06b-UpperBounds-05
FORMULA_NAME StigmergyElection-PT-06b-UpperBounds-06
FORMULA_NAME StigmergyElection-PT-06b-UpperBounds-07
FORMULA_NAME StigmergyElection-PT-06b-UpperBounds-08
FORMULA_NAME StigmergyElection-PT-06b-UpperBounds-09
FORMULA_NAME StigmergyElection-PT-06b-UpperBounds-10
FORMULA_NAME StigmergyElection-PT-06b-UpperBounds-11
FORMULA_NAME StigmergyElection-PT-06b-UpperBounds-12
FORMULA_NAME StigmergyElection-PT-06b-UpperBounds-13
FORMULA_NAME StigmergyElection-PT-06b-UpperBounds-14
FORMULA_NAME StigmergyElection-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679564941484

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-06b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 09:49:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 09:49:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 09:49:05] [INFO ] Load time of PNML (sax parser for PT used): 481 ms
[2023-03-23 09:49:05] [INFO ] Transformed 835 places.
[2023-03-23 09:49:05] [INFO ] Transformed 2416 transitions.
[2023-03-23 09:49:05] [INFO ] Found NUPN structural information;
[2023-03-23 09:49:05] [INFO ] Parsed PT model containing 835 places and 2416 transitions and 20130 arcs in 691 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 2416 rows 835 cols
[2023-03-23 09:49:05] [INFO ] Computed 7 place invariants in 109 ms
Incomplete random walk after 10000 steps, including 96 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 16) seen :9
FORMULA StigmergyElection-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
[2023-03-23 09:49:06] [INFO ] Invariant cache hit.
[2023-03-23 09:49:06] [INFO ] [Real]Absence check using 7 positive place invariants in 26 ms returned sat
[2023-03-23 09:49:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:49:07] [INFO ] [Real]Absence check using state equation in 1083 ms returned sat
[2023-03-23 09:49:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:49:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 38 ms returned sat
[2023-03-23 09:49:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:49:09] [INFO ] [Nat]Absence check using state equation in 1123 ms returned sat
[2023-03-23 09:49:11] [INFO ] Deduced a trap composed of 194 places in 1824 ms of which 9 ms to minimize.
[2023-03-23 09:49:13] [INFO ] Deduced a trap composed of 193 places in 1573 ms of which 2 ms to minimize.
[2023-03-23 09:49:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 09:49:13] [INFO ] [Real]Absence check using 7 positive place invariants in 27 ms returned sat
[2023-03-23 09:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:49:14] [INFO ] [Real]Absence check using state equation in 1084 ms returned sat
[2023-03-23 09:49:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:49:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 29 ms returned sat
[2023-03-23 09:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:49:15] [INFO ] [Nat]Absence check using state equation in 952 ms returned sat
[2023-03-23 09:49:17] [INFO ] Deduced a trap composed of 247 places in 1775 ms of which 3 ms to minimize.
[2023-03-23 09:49:19] [INFO ] Deduced a trap composed of 191 places in 1786 ms of which 3 ms to minimize.
[2023-03-23 09:49:19] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 3785 ms
[2023-03-23 09:49:20] [INFO ] [Real]Absence check using 7 positive place invariants in 31 ms returned sat
[2023-03-23 09:49:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:49:21] [INFO ] [Real]Absence check using state equation in 1240 ms returned sat
[2023-03-23 09:49:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:49:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 21 ms returned sat
[2023-03-23 09:49:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:49:22] [INFO ] [Nat]Absence check using state equation in 996 ms returned sat
[2023-03-23 09:49:24] [INFO ] Deduced a trap composed of 195 places in 1819 ms of which 2 ms to minimize.
[2023-03-23 09:49:26] [INFO ] Deduced a trap composed of 247 places in 1598 ms of which 1 ms to minimize.
[2023-03-23 09:49:27] [INFO ] Deduced a trap composed of 192 places in 1462 ms of which 2 ms to minimize.
[2023-03-23 09:49:27] [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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 09:49:28] [INFO ] [Real]Absence check using 7 positive place invariants in 27 ms returned sat
[2023-03-23 09:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:49:29] [INFO ] [Real]Absence check using state equation in 1190 ms returned sat
[2023-03-23 09:49:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:49:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 25 ms returned sat
[2023-03-23 09:49:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:49:30] [INFO ] [Nat]Absence check using state equation in 957 ms returned sat
[2023-03-23 09:49:32] [INFO ] Deduced a trap composed of 280 places in 1686 ms of which 2 ms to minimize.
[2023-03-23 09:49:34] [INFO ] Deduced a trap composed of 245 places in 1593 ms of which 1 ms to minimize.
[2023-03-23 09:49:35] [INFO ] Deduced a trap composed of 190 places in 1452 ms of which 1 ms to minimize.
[2023-03-23 09:49:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 09:49:35] [INFO ] [Real]Absence check using 7 positive place invariants in 26 ms returned sat
[2023-03-23 09:49:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:49:36] [INFO ] [Real]Absence check using state equation in 988 ms returned sat
[2023-03-23 09:49:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:49:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 21 ms returned sat
[2023-03-23 09:49:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:49:38] [INFO ] [Nat]Absence check using state equation in 864 ms returned sat
[2023-03-23 09:49:39] [INFO ] Deduced a trap composed of 197 places in 1609 ms of which 1 ms to minimize.
[2023-03-23 09:49:41] [INFO ] Deduced a trap composed of 194 places in 1630 ms of which 1 ms to minimize.
[2023-03-23 09:49:42] [INFO ] Deduced a trap composed of 193 places in 1391 ms of which 1 ms to minimize.
[2023-03-23 09:49:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 09:49:43] [INFO ] [Real]Absence check using 7 positive place invariants in 33 ms returned sat
[2023-03-23 09:49:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:49:44] [INFO ] [Real]Absence check using state equation in 1046 ms returned sat
[2023-03-23 09:49:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:49:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 20 ms returned sat
[2023-03-23 09:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:49:45] [INFO ] [Nat]Absence check using state equation in 971 ms returned sat
[2023-03-23 09:49:46] [INFO ] Deduced a trap composed of 193 places in 1337 ms of which 1 ms to minimize.
[2023-03-23 09:49:48] [INFO ] Deduced a trap composed of 193 places in 1392 ms of which 4 ms to minimize.
[2023-03-23 09:49:49] [INFO ] Deduced a trap composed of 193 places in 1263 ms of which 1 ms to minimize.
[2023-03-23 09:49:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 09:49:50] [INFO ] [Real]Absence check using 7 positive place invariants in 26 ms returned sat
[2023-03-23 09:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:49:51] [INFO ] [Real]Absence check using state equation in 941 ms returned sat
[2023-03-23 09:49:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:49:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 34 ms returned sat
[2023-03-23 09:49:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:49:52] [INFO ] [Nat]Absence check using state equation in 1130 ms returned sat
[2023-03-23 09:49:54] [INFO ] Deduced a trap composed of 193 places in 1595 ms of which 2 ms to minimize.
[2023-03-23 09:49:55] [INFO ] Deduced a trap composed of 197 places in 1596 ms of which 1 ms to minimize.
[2023-03-23 09:49:57] [INFO ] Deduced a trap composed of 189 places in 1542 ms of which 1 ms to minimize.
[2023-03-23 09:49:57] [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 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 835 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 835/835 places, 2416/2416 transitions.
Graph (trivial) has 838 edges and 835 vertex of which 114 / 835 are part of one of the 17 SCC in 12 ms
Free SCC test removed 97 places
Drop transitions removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Graph (complete) has 1547 edges and 738 vertex of which 726 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.46 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 526 transitions
Trivial Post-agglo rules discarded 526 transitions
Performed 526 trivial Post agglomeration. Transition count delta: 526
Iterating post reduction 0 with 532 rules applied. Total rules applied 534 place count 726 transition count 1754
Reduce places removed 526 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 558 rules applied. Total rules applied 1092 place count 200 transition count 1722
Reduce places removed 16 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 22 rules applied. Total rules applied 1114 place count 184 transition count 1716
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1120 place count 178 transition count 1716
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 1120 place count 178 transition count 1701
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 1150 place count 163 transition count 1701
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 1198 place count 115 transition count 1653
Iterating global reduction 4 with 48 rules applied. Total rules applied 1246 place count 115 transition count 1653
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1246 place count 115 transition count 1650
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1252 place count 112 transition count 1650
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1267 place count 97 transition count 337
Iterating global reduction 4 with 15 rules applied. Total rules applied 1282 place count 97 transition count 337
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1294 place count 97 transition count 325
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1332 place count 78 transition count 306
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1333 place count 78 transition count 305
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1339 place count 72 transition count 299
Iterating global reduction 6 with 6 rules applied. Total rules applied 1345 place count 72 transition count 299
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1351 place count 69 transition count 307
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1359 place count 69 transition count 299
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1361 place count 68 transition count 305
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1369 place count 68 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1371 place count 67 transition count 303
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1379 place count 67 transition count 295
Free-agglomeration rule applied 33 times.
Iterating global reduction 6 with 33 rules applied. Total rules applied 1412 place count 67 transition count 262
Reduce places removed 33 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 1454 place count 34 transition count 253
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1460 place count 28 transition count 247
Iterating global reduction 7 with 6 rules applied. Total rules applied 1466 place count 28 transition count 247
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 1485 place count 28 transition count 228
Applied a total of 1485 rules in 658 ms. Remains 28 /835 variables (removed 807) and now considering 228/2416 (removed 2188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 659 ms. Remains : 28/835 places, 228/2416 transitions.
// Phase 1: matrix 228 rows 28 cols
[2023-03-23 09:49:58] [INFO ] Computed 7 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10983 ms. (steps per millisecond=91 ) properties (out of 7) seen :7
FORMULA StigmergyElection-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 64393 ms.
ITS solved all properties within timeout

BK_STOP 1679565010273

--------------------
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="StigmergyElection-PT-06b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is StigmergyElection-PT-06b, 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 r458-smll-167912650500629"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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