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-167912651200421.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-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r459-smll-167912651200421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 10:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:52 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 359K 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-03b-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679346808664

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-03b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-20 21:13:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 21:13:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:13:32] [INFO ] Load time of PNML (sax parser for PT used): 252 ms
[2023-03-20 21:13:32] [INFO ] Transformed 1231 places.
[2023-03-20 21:13:32] [INFO ] Transformed 1476 transitions.
[2023-03-20 21:13:32] [INFO ] Found NUPN structural information;
[2023-03-20 21:13:32] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 1476 rows 1231 cols
[2023-03-20 21:13:32] [INFO ] Computed 5 place invariants in 77 ms
Incomplete random walk after 10000 steps, including 129 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 16) seen :7
FORMULA StigmergyCommit-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
[2023-03-20 21:13:33] [INFO ] Invariant cache hit.
[2023-03-20 21:13:34] [INFO ] [Real]Absence check using 5 positive place invariants in 48 ms returned sat
[2023-03-20 21:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:13:35] [INFO ] [Real]Absence check using state equation in 971 ms returned sat
[2023-03-20 21:13:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:13:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 48 ms returned sat
[2023-03-20 21:13:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:13:36] [INFO ] [Nat]Absence check using state equation in 850 ms returned sat
[2023-03-20 21:13:37] [INFO ] Deduced a trap composed of 397 places in 909 ms of which 6 ms to minimize.
[2023-03-20 21:13:38] [INFO ] Deduced a trap composed of 397 places in 724 ms of which 1 ms to minimize.
[2023-03-20 21:13:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1894 ms
[2023-03-20 21:13:38] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 127 ms.
[2023-03-20 21:13:40] [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 21:13:40] [INFO ] [Real]Absence check using 5 positive place invariants in 27 ms returned sat
[2023-03-20 21:13:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:13:41] [INFO ] [Real]Absence check using state equation in 717 ms returned sat
[2023-03-20 21:13:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:13:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 47 ms returned sat
[2023-03-20 21:13:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:13:42] [INFO ] [Nat]Absence check using state equation in 678 ms returned sat
[2023-03-20 21:13:44] [INFO ] Deduced a trap composed of 398 places in 1266 ms of which 6 ms to minimize.
[2023-03-20 21:13:45] [INFO ] Deduced a trap composed of 396 places in 1011 ms of which 3 ms to minimize.
[2023-03-20 21:13:46] [INFO ] Deduced a trap composed of 398 places in 764 ms of which 2 ms to minimize.
[2023-03-20 21:13:47] [INFO ] Deduced a trap composed of 398 places in 904 ms of which 2 ms to minimize.
[2023-03-20 21:13:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java: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 21:13:47] [INFO ] [Real]Absence check using 5 positive place invariants in 27 ms returned sat
[2023-03-20 21:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:13:48] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2023-03-20 21:13:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:13:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 31 ms returned sat
[2023-03-20 21:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:13:49] [INFO ] [Nat]Absence check using state equation in 826 ms returned sat
[2023-03-20 21:13:50] [INFO ] Deduced a trap composed of 397 places in 886 ms of which 1 ms to minimize.
[2023-03-20 21:13:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1043 ms
[2023-03-20 21:13:50] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 144 ms.
[2023-03-20 21:13:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 21:13:53] [INFO ] [Real]Absence check using 5 positive place invariants in 43 ms returned sat
[2023-03-20 21:13:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:13:54] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2023-03-20 21:13:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:13:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 31 ms returned sat
[2023-03-20 21:13:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:13:55] [INFO ] [Nat]Absence check using state equation in 881 ms returned sat
[2023-03-20 21:13:57] [INFO ] Deduced a trap composed of 398 places in 1152 ms of which 4 ms to minimize.
[2023-03-20 21:13:57] [INFO ] Deduced a trap composed of 396 places in 754 ms of which 2 ms to minimize.
[2023-03-20 21:13:58] [INFO ] Deduced a trap composed of 489 places in 910 ms of which 2 ms to minimize.
[2023-03-20 21:13:59] [INFO ] Deduced a trap composed of 398 places in 684 ms of which 1 ms to minimize.
[2023-03-20 21:13:59] [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-20 21:14:00] [INFO ] [Real]Absence check using 5 positive place invariants in 44 ms returned sat
[2023-03-20 21:14:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:14:01] [INFO ] [Real]Absence check using state equation in 948 ms returned sat
[2023-03-20 21:14:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:14:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 40 ms returned sat
[2023-03-20 21:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:14:02] [INFO ] [Nat]Absence check using state equation in 801 ms returned sat
[2023-03-20 21:14:03] [INFO ] Deduced a trap composed of 400 places in 956 ms of which 2 ms to minimize.
[2023-03-20 21:14:04] [INFO ] Deduced a trap composed of 396 places in 969 ms of which 1 ms to minimize.
[2023-03-20 21:14:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2190 ms
[2023-03-20 21:14:04] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 99 ms.
[2023-03-20 21:14:07] [INFO ] Deduced a trap composed of 20 places in 1055 ms of which 2 ms to minimize.
[2023-03-20 21:14:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
[2023-03-20 21:14:07] [INFO ] [Real]Absence check using 5 positive place invariants in 42 ms returned sat
[2023-03-20 21:14:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:14:08] [INFO ] [Real]Absence check using state equation in 963 ms returned sat
[2023-03-20 21:14:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:14:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 29 ms returned sat
[2023-03-20 21:14:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:14:09] [INFO ] [Nat]Absence check using state equation in 825 ms returned sat
[2023-03-20 21:14:10] [INFO ] Deduced a trap composed of 397 places in 672 ms of which 2 ms to minimize.
[2023-03-20 21:14:11] [INFO ] Deduced a trap composed of 418 places in 740 ms of which 2 ms to minimize.
[2023-03-20 21:14:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1646 ms
[2023-03-20 21:14:11] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 117 ms.
[2023-03-20 21:14:13] [INFO ] Added : 100 causal constraints over 20 iterations in 2263 ms. Result :unknown
[2023-03-20 21:14:14] [INFO ] [Real]Absence check using 5 positive place invariants in 44 ms returned sat
[2023-03-20 21:14:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:14:15] [INFO ] [Real]Absence check using state equation in 820 ms returned sat
[2023-03-20 21:14:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:14:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 46 ms returned sat
[2023-03-20 21:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:14:16] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2023-03-20 21:14:17] [INFO ] Deduced a trap composed of 399 places in 967 ms of which 2 ms to minimize.
[2023-03-20 21:14:18] [INFO ] Deduced a trap composed of 397 places in 768 ms of which 2 ms to minimize.
[2023-03-20 21:14:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1945 ms
[2023-03-20 21:14:18] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 102 ms.
[2023-03-20 21:14:21] [INFO ] Deduced a trap composed of 20 places in 1064 ms of which 3 ms to minimize.
[2023-03-20 21:14:21] [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.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 21:14:21] [INFO ] [Real]Absence check using 5 positive place invariants in 43 ms returned sat
[2023-03-20 21:14:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:14:22] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2023-03-20 21:14:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:14:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 28 ms returned sat
[2023-03-20 21:14:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:14:23] [INFO ] [Nat]Absence check using state equation in 812 ms returned sat
[2023-03-20 21:14:24] [INFO ] Deduced a trap composed of 297 places in 959 ms of which 2 ms to minimize.
[2023-03-20 21:14:25] [INFO ] Deduced a trap composed of 398 places in 1157 ms of which 2 ms to minimize.
[2023-03-20 21:14:26] [INFO ] Deduced a trap composed of 396 places in 715 ms of which 1 ms to minimize.
[2023-03-20 21:14:27] [INFO ] Deduced a trap composed of 207 places in 974 ms of which 2 ms to minimize.
[2023-03-20 21:14: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 7
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-20 21:14:28] [INFO ] [Real]Absence check using 5 positive place invariants in 44 ms returned sat
[2023-03-20 21:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:14:29] [INFO ] [Real]Absence check using state equation in 1031 ms returned sat
[2023-03-20 21:14:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:14:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 47 ms returned sat
[2023-03-20 21:14:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:14:30] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2023-03-20 21:14:31] [INFO ] Deduced a trap composed of 398 places in 645 ms of which 2 ms to minimize.
[2023-03-20 21:14:32] [INFO ] Deduced a trap composed of 401 places in 985 ms of which 2 ms to minimize.
[2023-03-20 21:14:33] [INFO ] Deduced a trap composed of 398 places in 927 ms of which 2 ms to minimize.
[2023-03-20 21:14:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2925 ms
[2023-03-20 21:14:33] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 97 ms.
[2023-03-20 21:14:35] [INFO ] Deduced a trap composed of 20 places in 863 ms of which 1 ms to minimize.
[2023-03-20 21:14: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 8
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, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA StigmergyCommit-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 1231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Graph (trivial) has 1209 edges and 1231 vertex of which 84 / 1231 are part of one of the 12 SCC in 11 ms
Free SCC test removed 72 places
Drop transitions removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Graph (complete) has 1645 edges and 1159 vertex of which 1151 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 911 transitions
Trivial Post-agglo rules discarded 911 transitions
Performed 911 trivial Post agglomeration. Transition count delta: 911
Iterating post reduction 0 with 915 rules applied. Total rules applied 917 place count 1151 transition count 465
Reduce places removed 911 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 939 rules applied. Total rules applied 1856 place count 240 transition count 437
Reduce places removed 11 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 18 rules applied. Total rules applied 1874 place count 229 transition count 430
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1882 place count 222 transition count 429
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 1882 place count 222 transition count 387
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1966 place count 180 transition count 387
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 2014 place count 132 transition count 339
Iterating global reduction 4 with 48 rules applied. Total rules applied 2062 place count 132 transition count 339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2062 place count 132 transition count 338
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2064 place count 131 transition count 338
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 2090 place count 105 transition count 183
Iterating global reduction 4 with 26 rules applied. Total rules applied 2116 place count 105 transition count 183
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 2128 place count 105 transition count 171
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 2134 place count 99 transition count 165
Iterating global reduction 5 with 6 rules applied. Total rules applied 2140 place count 99 transition count 165
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 2146 place count 93 transition count 159
Iterating global reduction 5 with 6 rules applied. Total rules applied 2152 place count 93 transition count 159
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 2158 place count 93 transition count 153
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2182 place count 81 transition count 141
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2183 place count 81 transition count 140
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2187 place count 77 transition count 136
Iterating global reduction 7 with 4 rules applied. Total rules applied 2191 place count 77 transition count 136
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2195 place count 73 transition count 132
Iterating global reduction 7 with 4 rules applied. Total rules applied 2199 place count 73 transition count 132
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2203 place count 69 transition count 128
Iterating global reduction 7 with 4 rules applied. Total rules applied 2207 place count 69 transition count 128
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 2215 place count 65 transition count 156
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 25 rules applied. Total rules applied 2240 place count 65 transition count 125
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 36 rules applied. Total rules applied 2276 place count 40 transition count 114
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2280 place count 36 transition count 110
Iterating global reduction 8 with 4 rules applied. Total rules applied 2284 place count 36 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2285 place count 36 transition count 109
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 9 with 28 rules applied. Total rules applied 2313 place count 36 transition count 81
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 2319 place count 36 transition count 81
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2322 place count 36 transition count 78
Applied a total of 2322 rules in 253 ms. Remains 36 /1231 variables (removed 1195) and now considering 78/1476 (removed 1398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 36/1231 places, 78/1476 transitions.
// Phase 1: matrix 78 rows 36 cols
[2023-03-20 21:14:35] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1527 ms. (steps per millisecond=654 ) properties (out of 6) seen :6
FORMULA StigmergyCommit-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 65236 ms.
ITS solved all properties within timeout

BK_STOP 1679346878128

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

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