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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 465M
-rw-r--r-- 1 mcc users 8.1K Feb 26 11:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 11:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 11:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 26 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 11:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Feb 26 11:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:13 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 464M 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-11a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-11a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-11a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-11a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-11a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-11a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-11a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-11a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-11a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-11a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-11a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-11a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-11a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-11a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-11a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-11a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679417837513

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-11a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 16:57:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 16:57:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 16:57:40] [INFO ] Load time of PNML (sax parser for PT used): 19090 ms
[2023-03-21 16:57:40] [INFO ] Transformed 436 places.
[2023-03-21 16:57:42] [INFO ] Transformed 373236 transitions.
[2023-03-21 16:57:42] [INFO ] Found NUPN structural information;
[2023-03-21 16:57:42] [INFO ] Parsed PT model containing 436 places and 373236 transitions and 8944506 arcs in 21208 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 364478 transitions
Reduce redundant transitions removed 364478 transitions.
Normalized transition count is 8722 out of 8758 initially.
// Phase 1: matrix 8722 rows 436 cols
[2023-03-21 16:57:45] [INFO ] Computed 13 place invariants in 150 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13487 ms. (steps per millisecond=0 ) properties (out of 16) seen :5
FORMULA StigmergyCommit-PT-11a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
[2023-03-21 16:57:59] [INFO ] Flow matrix only has 8722 transitions (discarded 36 similar events)
// Phase 1: matrix 8722 rows 436 cols
[2023-03-21 16:57:59] [INFO ] Computed 13 place invariants in 80 ms
[2023-03-21 16:58:00] [INFO ] [Real]Absence check using 13 positive place invariants in 30 ms returned sat
[2023-03-21 16:58:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:58:03] [INFO ] [Real]Absence check using state equation in 3348 ms returned sat
[2023-03-21 16:58:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:58:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2023-03-21 16:58:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:58:07] [INFO ] [Nat]Absence check using state equation in 3092 ms returned sat
[2023-03-21 16:58:09] [INFO ] State equation strengthened by 8357 read => feed constraints.
[2023-03-21 16:58:09] [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.verifyPossible(DeadlockTester.java:908)
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-21 16:58:09] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-21 16:58:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:58:12] [INFO ] [Real]Absence check using state equation in 2977 ms returned sat
[2023-03-21 16:58:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:58:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-21 16:58:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:58:16] [INFO ] [Nat]Absence check using state equation in 2971 ms returned sat
[2023-03-21 16:58:18] [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 1
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.verifyPossible(DeadlockTester.java:908)
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-21 16:58:18] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-21 16:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:58:21] [INFO ] [Real]Absence check using state equation in 3035 ms returned sat
[2023-03-21 16:58:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:58:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-21 16:58:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:58:24] [INFO ] [Nat]Absence check using state equation in 3141 ms returned sat
[2023-03-21 16:58:26] [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.verifyPossible(DeadlockTester.java:908)
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-21 16:58:26] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-21 16:58:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:58:29] [INFO ] [Real]Absence check using state equation in 3165 ms returned sat
[2023-03-21 16:58:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:58:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-21 16:58:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:58:33] [INFO ] [Nat]Absence check using state equation in 2736 ms returned sat
[2023-03-21 16:58:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 16:58:35] [INFO ] [Nat]Added 8357 Read/Feed constraints in 2124 ms returned unknown
[2023-03-21 16:58:35] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-21 16:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:58:38] [INFO ] [Real]Absence check using state equation in 3079 ms returned sat
[2023-03-21 16:58:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:58:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-21 16:58:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:58:42] [INFO ] [Nat]Absence check using state equation in 3244 ms returned sat
[2023-03-21 16:58:43] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 16:58:43] [INFO ] [Nat]Added 8357 Read/Feed constraints in 1625 ms returned unknown
[2023-03-21 16:58:43] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-21 16:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:58:46] [INFO ] [Real]Absence check using state equation in 2685 ms returned sat
[2023-03-21 16:58:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:58:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-21 16:58:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:58:50] [INFO ] [Nat]Absence check using state equation in 3049 ms returned sat
[2023-03-21 16:58:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 16:58:51] [INFO ] [Nat]Added 8357 Read/Feed constraints in 1796 ms returned unknown
[2023-03-21 16:58:52] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-21 16:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:58:54] [INFO ] [Real]Absence check using state equation in 2690 ms returned sat
[2023-03-21 16:58:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:58:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-21 16:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:58:58] [INFO ] [Nat]Absence check using state equation in 3020 ms returned sat
[2023-03-21 16:59:00] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 16:59:00] [INFO ] [Nat]Added 8357 Read/Feed constraints in 1837 ms returned unknown
[2023-03-21 16:59:00] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-21 16:59:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:59:02] [INFO ] [Real]Absence check using state equation in 2586 ms returned sat
[2023-03-21 16:59:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:59:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2023-03-21 16:59:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:59:06] [INFO ] [Nat]Absence check using state equation in 2940 ms returned sat
[2023-03-21 16:59:08] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 16:59:08] [INFO ] [Nat]Added 8357 Read/Feed constraints in 1898 ms returned unknown
[2023-03-21 16:59:08] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-21 16:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:59:11] [INFO ] [Real]Absence check using state equation in 2799 ms returned sat
[2023-03-21 16:59:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:59:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-21 16:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:59:14] [INFO ] [Nat]Absence check using state equation in 2638 ms returned sat
[2023-03-21 16:59:16] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 16:59:16] [INFO ] [Nat]Added 8357 Read/Feed constraints in 2231 ms returned unknown
[2023-03-21 16:59:16] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-21 16:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:59:19] [INFO ] [Real]Absence check using state equation in 2908 ms returned sat
[2023-03-21 16:59:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:59:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-21 16:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:59:22] [INFO ] [Nat]Absence check using state equation in 2711 ms returned sat
[2023-03-21 16:59:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 16:59:24] [INFO ] [Nat]Added 8357 Read/Feed constraints in 2162 ms returned unknown
[2023-03-21 16:59:24] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-21 16:59:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:59:27] [INFO ] [Real]Absence check using state equation in 2768 ms returned sat
[2023-03-21 16:59:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:59:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-21 16:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:59:30] [INFO ] [Nat]Absence check using state equation in 2764 ms returned sat
[2023-03-21 16:59:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 16:59:32] [INFO ] [Nat]Added 8357 Read/Feed constraints in 2106 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 11 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 8758/8758 transitions.
Graph (complete) has 1119 edges and 436 vertex of which 424 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.73 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 424 transition count 8639
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 128 rules applied. Total rules applied 236 place count 354 transition count 8581
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 248 place count 342 transition count 8581
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 248 place count 342 transition count 8503
Deduced a syphon composed of 78 places in 9 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 404 place count 264 transition count 8503
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 463 place count 205 transition count 8444
Iterating global reduction 3 with 59 rules applied. Total rules applied 522 place count 205 transition count 8444
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 579 place count 148 transition count 8387
Iterating global reduction 3 with 57 rules applied. Total rules applied 636 place count 148 transition count 8387
Ensure Unique test removed 4106 transitions
Reduce isomorphic transitions removed 4106 transitions.
Iterating post reduction 3 with 4106 rules applied. Total rules applied 4742 place count 148 transition count 4281
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 4749 place count 141 transition count 4274
Iterating global reduction 4 with 7 rules applied. Total rules applied 4756 place count 141 transition count 4274
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 4762 place count 135 transition count 4268
Iterating global reduction 4 with 6 rules applied. Total rules applied 4768 place count 135 transition count 4268
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 4773 place count 135 transition count 4263
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 7 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 4817 place count 113 transition count 4241
Drop transitions removed 10 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 4837 place count 113 transition count 4221
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 4848 place count 102 transition count 4210
Iterating global reduction 6 with 11 rules applied. Total rules applied 4859 place count 102 transition count 4210
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 4869 place count 92 transition count 4200
Iterating global reduction 6 with 10 rules applied. Total rules applied 4879 place count 92 transition count 4200
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 4889 place count 82 transition count 4190
Iterating global reduction 6 with 10 rules applied. Total rules applied 4899 place count 82 transition count 4190
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 4902 place count 82 transition count 4187
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 4906 place count 82 transition count 4187
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 4908 place count 82 transition count 4185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4909 place count 81 transition count 4184
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 6 with 14 rules applied. Total rules applied 4923 place count 80 transition count 4171
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 4936 place count 67 transition count 4171
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 7 Pre rules applied. Total rules applied 4936 place count 67 transition count 4164
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 4950 place count 60 transition count 4164
Performed 14 Post agglomeration using F-continuation condition with reduction of 4081 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 4978 place count 46 transition count 69
Drop transitions removed 12 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 4991 place count 46 transition count 56
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 5013 place count 33 transition count 47
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 5022 place count 33 transition count 38
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 5024 place count 33 transition count 36
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 5027 place count 30 transition count 33
Applied a total of 5027 rules in 14778 ms. Remains 30 /436 variables (removed 406) and now considering 33/8758 (removed 8725) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14779 ms. Remains : 30/436 places, 33/8758 transitions.
// Phase 1: matrix 33 rows 30 cols
[2023-03-21 16:59:47] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1659 ms. (steps per millisecond=602 ) properties (out of 11) seen :11
FORMULA StigmergyCommit-PT-11a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 148415 ms.
ITS solved all properties within timeout

BK_STOP 1679417990138

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

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