Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r458-smll-167912650300421.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is StigmergyCommit-PT-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650300421
=====================================================================

--------------------
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 1679448072683

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 01:21:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 01:21:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:21:15] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2023-03-22 01:21:15] [INFO ] Transformed 1231 places.
[2023-03-22 01:21:15] [INFO ] Transformed 1476 transitions.
[2023-03-22 01:21:15] [INFO ] Found NUPN structural information;
[2023-03-22 01:21:15] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 325 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 1476 rows 1231 cols
[2023-03-22 01:21:15] [INFO ] Computed 5 place invariants in 50 ms
Incomplete random walk after 10000 steps, including 130 resets, run finished after 59 ms. (steps per millisecond=169 ) 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 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=666 ) 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 27 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
[2023-03-22 01:21:16] [INFO ] Invariant cache hit.
[2023-03-22 01:21:16] [INFO ] [Real]Absence check using 5 positive place invariants in 33 ms returned sat
[2023-03-22 01:21:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:21:17] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2023-03-22 01:21:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:21:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 32 ms returned sat
[2023-03-22 01:21:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:21:19] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2023-03-22 01:21:20] [INFO ] Deduced a trap composed of 397 places in 881 ms of which 9 ms to minimize.
[2023-03-22 01:21:21] [INFO ] Deduced a trap composed of 397 places in 849 ms of which 2 ms to minimize.
[2023-03-22 01:21:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2048 ms
[2023-03-22 01:21:21] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 125 ms.
[2023-03-22 01:21:22] [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-22 01:21:23] [INFO ] [Real]Absence check using 5 positive place invariants in 44 ms returned sat
[2023-03-22 01:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:21:24] [INFO ] [Real]Absence check using state equation in 921 ms returned sat
[2023-03-22 01:21:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:21:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 30 ms returned sat
[2023-03-22 01:21:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:21:25] [INFO ] [Nat]Absence check using state equation in 706 ms returned sat
[2023-03-22 01:21:26] [INFO ] Deduced a trap composed of 398 places in 915 ms of which 2 ms to minimize.
[2023-03-22 01:21:27] [INFO ] Deduced a trap composed of 396 places in 838 ms of which 5 ms to minimize.
[2023-03-22 01:21:27] [INFO ] Deduced a trap composed of 398 places in 658 ms of which 2 ms to minimize.
[2023-03-22 01:21:29] [INFO ] Deduced a trap composed of 398 places in 976 ms of which 2 ms to minimize.
[2023-03-22 01:21:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3873 ms
[2023-03-22 01:21:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:999)
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-22 01:21:29] [INFO ] [Real]Absence check using 5 positive place invariants in 29 ms returned sat
[2023-03-22 01:21:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:21:30] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2023-03-22 01:21:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:21:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 47 ms returned sat
[2023-03-22 01:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:21:32] [INFO ] [Nat]Absence check using state equation in 866 ms returned sat
[2023-03-22 01:21:32] [INFO ] Deduced a trap composed of 397 places in 871 ms of which 1 ms to minimize.
[2023-03-22 01:21:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1032 ms
[2023-03-22 01:21:33] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 119 ms.
[2023-03-22 01:21: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 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.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-22 01:21:36] [INFO ] [Real]Absence check using 5 positive place invariants in 29 ms returned sat
[2023-03-22 01:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:21:37] [INFO ] [Real]Absence check using state equation in 886 ms returned sat
[2023-03-22 01:21:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:21:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 48 ms returned sat
[2023-03-22 01:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:21:38] [INFO ] [Nat]Absence check using state equation in 954 ms returned sat
[2023-03-22 01:21:39] [INFO ] Deduced a trap composed of 398 places in 867 ms of which 2 ms to minimize.
[2023-03-22 01:21:40] [INFO ] Deduced a trap composed of 396 places in 716 ms of which 1 ms to minimize.
[2023-03-22 01:21:41] [INFO ] Deduced a trap composed of 489 places in 772 ms of which 2 ms to minimize.
[2023-03-22 01:21:41] [INFO ] Deduced a trap composed of 398 places in 556 ms of which 1 ms to minimize.
[2023-03-22 01:21:42] [INFO ] Deduced a trap composed of 396 places in 838 ms of which 1 ms to minimize.
[2023-03-22 01:21:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-22 01:21:43] [INFO ] [Real]Absence check using 5 positive place invariants in 29 ms returned sat
[2023-03-22 01:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:21:43] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2023-03-22 01:21:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:21:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 47 ms returned sat
[2023-03-22 01:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:21:45] [INFO ] [Nat]Absence check using state equation in 819 ms returned sat
[2023-03-22 01:21:46] [INFO ] Deduced a trap composed of 400 places in 941 ms of which 1 ms to minimize.
[2023-03-22 01:21:47] [INFO ] Deduced a trap composed of 396 places in 918 ms of which 2 ms to minimize.
[2023-03-22 01:21:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2150 ms
[2023-03-22 01:21:47] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 134 ms.
[2023-03-22 01:21:50] [INFO ] Deduced a trap composed of 20 places in 1171 ms of which 2 ms to minimize.
[2023-03-22 01:21:50] [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-22 01:21:50] [INFO ] [Real]Absence check using 5 positive place invariants in 28 ms returned sat
[2023-03-22 01:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:21:51] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2023-03-22 01:21:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:21:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 47 ms returned sat
[2023-03-22 01:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:21:52] [INFO ] [Nat]Absence check using state equation in 894 ms returned sat
[2023-03-22 01:21:53] [INFO ] Deduced a trap composed of 397 places in 947 ms of which 2 ms to minimize.
[2023-03-22 01:21:54] [INFO ] Deduced a trap composed of 418 places in 851 ms of which 2 ms to minimize.
[2023-03-22 01:21:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2069 ms
[2023-03-22 01:21:54] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 100 ms.
[2023-03-22 01:21:57] [INFO ] Deduced a trap composed of 20 places in 1077 ms of which 2 ms to minimize.
[2023-03-22 01:21:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-22 01:21:57] [INFO ] [Real]Absence check using 5 positive place invariants in 28 ms returned sat
[2023-03-22 01:21:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:21:58] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2023-03-22 01:21:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:21:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 41 ms returned sat
[2023-03-22 01:21:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:21:59] [INFO ] [Nat]Absence check using state equation in 857 ms returned sat
[2023-03-22 01:22:01] [INFO ] Deduced a trap composed of 399 places in 950 ms of which 1 ms to minimize.
[2023-03-22 01:22:01] [INFO ] Deduced a trap composed of 397 places in 581 ms of which 1 ms to minimize.
[2023-03-22 01:22:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1766 ms
[2023-03-22 01:22:01] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 116 ms.
[2023-03-22 01:22:04] [INFO ] Deduced a trap composed of 20 places in 839 ms of which 2 ms to minimize.
[2023-03-22 01:22:04] [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-22 01:22:05] [INFO ] [Real]Absence check using 5 positive place invariants in 45 ms returned sat
[2023-03-22 01:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:05] [INFO ] [Real]Absence check using state equation in 834 ms returned sat
[2023-03-22 01:22:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:22:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 48 ms returned sat
[2023-03-22 01:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:07] [INFO ] [Nat]Absence check using state equation in 744 ms returned sat
[2023-03-22 01:22:08] [INFO ] Deduced a trap composed of 297 places in 1051 ms of which 2 ms to minimize.
[2023-03-22 01:22:09] [INFO ] Deduced a trap composed of 398 places in 925 ms of which 1 ms to minimize.
[2023-03-22 01:22:09] [INFO ] Deduced a trap composed of 396 places in 753 ms of which 1 ms to minimize.
[2023-03-22 01:22:10] [INFO ] Deduced a trap composed of 207 places in 867 ms of which 2 ms to minimize.
[2023-03-22 01:22:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3971 ms
[2023-03-22 01:22:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:999)
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-22 01:22:11] [INFO ] [Real]Absence check using 5 positive place invariants in 27 ms returned sat
[2023-03-22 01:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:12] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2023-03-22 01:22:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:22:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 47 ms returned sat
[2023-03-22 01:22:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:13] [INFO ] [Nat]Absence check using state equation in 822 ms returned sat
[2023-03-22 01:22:14] [INFO ] Deduced a trap composed of 398 places in 940 ms of which 2 ms to minimize.
[2023-03-22 01:22:15] [INFO ] Deduced a trap composed of 401 places in 893 ms of which 2 ms to minimize.
[2023-03-22 01:22:16] [INFO ] Deduced a trap composed of 398 places in 1178 ms of which 2 ms to minimize.
[2023-03-22 01:22:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3429 ms
[2023-03-22 01:22:16] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 132 ms.
[2023-03-22 01:22:18] [INFO ] Deduced a trap composed of 20 places in 1161 ms of which 2 ms to minimize.
[2023-03-22 01:22: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: 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]
Support contains 9 out of 1231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Graph (trivial) has 1203 edges and 1231 vertex of which 84 / 1231 are part of one of the 12 SCC in 19 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.9 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 905 transitions
Trivial Post-agglo rules discarded 905 transitions
Performed 905 trivial Post agglomeration. Transition count delta: 905
Iterating post reduction 0 with 909 rules applied. Total rules applied 911 place count 1151 transition count 471
Reduce places removed 905 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 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 932 rules applied. Total rules applied 1843 place count 246 transition count 444
Reduce places removed 11 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 19 rules applied. Total rules applied 1862 place count 235 transition count 436
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1871 place count 227 transition count 435
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 1871 place count 227 transition count 394
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1953 place count 186 transition count 394
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 2001 place count 138 transition count 346
Iterating global reduction 4 with 48 rules applied. Total rules applied 2049 place count 138 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2049 place count 138 transition count 345
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 2051 place count 137 transition count 345
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 2077 place count 111 transition count 190
Iterating global reduction 4 with 26 rules applied. Total rules applied 2103 place count 111 transition count 190
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 2115 place count 111 transition count 178
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 2121 place count 105 transition count 172
Iterating global reduction 5 with 6 rules applied. Total rules applied 2127 place count 105 transition count 172
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 2133 place count 99 transition count 166
Iterating global reduction 5 with 6 rules applied. Total rules applied 2139 place count 99 transition count 166
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 2145 place count 99 transition count 160
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2169 place count 87 transition count 148
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2170 place count 87 transition count 147
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2174 place count 83 transition count 143
Iterating global reduction 7 with 4 rules applied. Total rules applied 2178 place count 83 transition count 143
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2182 place count 79 transition count 139
Iterating global reduction 7 with 4 rules applied. Total rules applied 2186 place count 79 transition count 139
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2189 place count 76 transition count 136
Iterating global reduction 7 with 3 rules applied. Total rules applied 2192 place count 76 transition count 136
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 2200 place count 72 transition count 164
Free-agglomeration rule applied 28 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 2228 place count 72 transition count 130
Reduce places removed 28 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 39 rules applied. Total rules applied 2267 place count 44 transition count 119
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2271 place count 40 transition count 115
Iterating global reduction 8 with 4 rules applied. Total rules applied 2275 place count 40 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2276 place count 40 transition count 114
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 2302 place count 40 transition count 88
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2306 place count 40 transition count 88
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 2308 place count 40 transition count 86
Applied a total of 2308 rules in 232 ms. Remains 40 /1231 variables (removed 1191) and now considering 86/1476 (removed 1390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 40/1231 places, 86/1476 transitions.
// Phase 1: matrix 86 rows 40 cols
[2023-03-22 01:22:18] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1803 ms. (steps per millisecond=554 ) properties (out of 9) seen :9
FORMULA StigmergyCommit-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-10 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 64896 ms.
ITS solved all properties within timeout

BK_STOP 1679448141502

--------------------
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="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is 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 r458-smll-167912650300421"
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 ;