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.r101-tall-167814474900085.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 itstools
Input is CloudReconfiguration-PT-311, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814474900085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.2K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 11:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 660K Mar 5 18:22 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 CloudReconfiguration-PT-311-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678227933815

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-311
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-07 22:25:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-07 22:25:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 22:25:35] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-07 22:25:35] [INFO ] Transformed 2585 places.
[2023-03-07 22:25:35] [INFO ] Transformed 3095 transitions.
[2023-03-07 22:25:35] [INFO ] Found NUPN structural information;
[2023-03-07 22:25:35] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-07 22:25:36] [INFO ] Computed 4 place invariants in 77 ms
Incomplete random walk after 10000 steps, including 103 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :1
FORMULA CloudReconfiguration-PT-311-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :0
[2023-03-07 22:25:36] [INFO ] Invariant cache hit.
[2023-03-07 22:25:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2023-03-07 22:25:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:25:39] [INFO ] [Real]Absence check using state equation in 1245 ms returned sat
[2023-03-07 22:25:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:25:39] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:25:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:25:41] [INFO ] [Nat]Absence check using state equation in 1195 ms returned sat
[2023-03-07 22:25:41] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 179 ms.
[2023-03-07 22:25:44] [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-07 22:25:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:25:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:25:46] [INFO ] [Real]Absence check using state equation in 1190 ms returned sat
[2023-03-07 22:25:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:25:46] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:25:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:25:47] [INFO ] [Nat]Absence check using state equation in 1141 ms returned sat
[2023-03-07 22:25:48] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 133 ms.
[2023-03-07 22:25:51] [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.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-07 22:25:51] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:25:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:25:52] [INFO ] [Real]Absence check using state equation in 1285 ms returned sat
[2023-03-07 22:25:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:25:53] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:25:54] [INFO ] [Nat]Absence check using state equation in 1455 ms returned sat
[2023-03-07 22:25:55] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 134 ms.
[2023-03-07 22:25:58] [INFO ] Added : 125 causal constraints over 25 iterations in 3132 ms. Result :unknown
[2023-03-07 22:25:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 22:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:25:59] [INFO ] [Real]Absence check using state equation in 1208 ms returned sat
[2023-03-07 22:25:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:26:00] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:01] [INFO ] [Nat]Absence check using state equation in 1148 ms returned sat
[2023-03-07 22:26:01] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 131 ms.
[2023-03-07 22:26: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 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.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-07 22:26:05] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:26:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:06] [INFO ] [Real]Absence check using state equation in 1240 ms returned sat
[2023-03-07 22:26:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:26:06] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:08] [INFO ] [Nat]Absence check using state equation in 1785 ms returned sat
[2023-03-07 22:26:08] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 134 ms.
[2023-03-07 22:26:11] [INFO ] Added : 110 causal constraints over 22 iterations in 2798 ms. Result :unknown
[2023-03-07 22:26:11] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 22:26:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:13] [INFO ] [Real]Absence check using state equation in 1186 ms returned sat
[2023-03-07 22:26:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:26:13] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:14] [INFO ] [Nat]Absence check using state equation in 1110 ms returned sat
[2023-03-07 22:26:14] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 129 ms.
[2023-03-07 22:26:18] [INFO ] Added : 140 causal constraints over 28 iterations in 3495 ms. Result :unknown
[2023-03-07 22:26:18] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 22:26:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:19] [INFO ] [Real]Absence check using state equation in 1073 ms returned sat
[2023-03-07 22:26:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:26:20] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:26:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:21] [INFO ] [Nat]Absence check using state equation in 1048 ms returned sat
[2023-03-07 22:26:21] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 127 ms.
[2023-03-07 22:26:24] [INFO ] Added : 141 causal constraints over 29 iterations in 3548 ms. Result :unknown
[2023-03-07 22:26:25] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 22:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:26] [INFO ] [Real]Absence check using state equation in 1082 ms returned sat
[2023-03-07 22:26:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:26:26] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:27] [INFO ] [Nat]Absence check using state equation in 1080 ms returned sat
[2023-03-07 22:26:28] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 128 ms.
[2023-03-07 22:26:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-07 22:26:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 22:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:33] [INFO ] [Real]Absence check using state equation in 1186 ms returned sat
[2023-03-07 22:26:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:26:33] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:26:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:34] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2023-03-07 22:26:34] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 134 ms.
[2023-03-07 22:26:38] [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.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-07 22:26:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:26:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:39] [INFO ] [Real]Absence check using state equation in 1154 ms returned sat
[2023-03-07 22:26:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:26:40] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:26:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:41] [INFO ] [Nat]Absence check using state equation in 1144 ms returned sat
[2023-03-07 22:26:41] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 128 ms.
[2023-03-07 22:26:44] [INFO ] Added : 135 causal constraints over 27 iterations in 3432 ms. Result :unknown
[2023-03-07 22:26:45] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 22:26:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:46] [INFO ] [Real]Absence check using state equation in 1257 ms returned sat
[2023-03-07 22:26:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:26:46] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 22:26:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:48] [INFO ] [Nat]Absence check using state equation in 1178 ms returned sat
[2023-03-07 22:26:48] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 132 ms.
[2023-03-07 22:26:51] [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 10
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-07 22:26:51] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:53] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2023-03-07 22:26:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:26:53] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 22:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:55] [INFO ] [Nat]Absence check using state equation in 1505 ms returned sat
[2023-03-07 22:26:55] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 131 ms.
[2023-03-07 22:26:58] [INFO ] Added : 125 causal constraints over 25 iterations in 3053 ms. Result :unknown
[2023-03-07 22:26:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 52 ms returned sat
[2023-03-07 22:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:26:59] [INFO ] [Real]Absence check using state equation in 1089 ms returned sat
[2023-03-07 22:26:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:27:00] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:27:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:01] [INFO ] [Nat]Absence check using state equation in 1522 ms returned sat
[2023-03-07 22:27:02] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 129 ms.
[2023-03-07 22:27:05] [INFO ] Added : 125 causal constraints over 25 iterations in 3058 ms. Result :unknown
[2023-03-07 22:27:05] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 22:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:06] [INFO ] [Real]Absence check using state equation in 1132 ms returned sat
[2023-03-07 22:27:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:27:07] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:08] [INFO ] [Nat]Absence check using state equation in 1203 ms returned sat
[2023-03-07 22:27:08] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 128 ms.
[2023-03-07 22:27:11] [INFO ] Added : 140 causal constraints over 28 iterations in 3391 ms. Result :unknown
[2023-03-07 22:27:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:13] [INFO ] [Real]Absence check using state equation in 1225 ms returned sat
[2023-03-07 22:27:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:27:13] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:27:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:15] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2023-03-07 22:27:15] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 152 ms.
[2023-03-07 22:27: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 14
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudReconfiguration-PT-311-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 13 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2931 edges and 2585 vertex of which 860 / 2585 are part of one of the 63 SCC in 11 ms
Free SCC test removed 797 places
Drop transitions removed 974 transitions
Reduce isomorphic transitions removed 974 transitions.
Graph (complete) has 2401 edges and 1788 vertex of which 1774 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1185 transitions
Trivial Post-agglo rules discarded 1185 transitions
Performed 1185 trivial Post agglomeration. Transition count delta: 1185
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1196 place count 1774 transition count 918
Reduce places removed 1185 places and 0 transitions.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 1 with 1322 rules applied. Total rules applied 2518 place count 589 transition count 781
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 71 rules applied. Total rules applied 2589 place count 527 transition count 772
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 9 rules applied. Total rules applied 2598 place count 524 transition count 766
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 2606 place count 520 transition count 762
Reduce places removed 2 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 5 with 11 rules applied. Total rules applied 2617 place count 518 transition count 753
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2626 place count 509 transition count 753
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2626 place count 509 transition count 731
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2670 place count 487 transition count 731
Discarding 78 places :
Symmetric choice reduction at 7 with 78 rule applications. Total rules 2748 place count 409 transition count 653
Iterating global reduction 7 with 78 rules applied. Total rules applied 2826 place count 409 transition count 653
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 2826 place count 409 transition count 645
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 2842 place count 401 transition count 645
Discarding 59 places :
Symmetric choice reduction at 7 with 59 rule applications. Total rules 2901 place count 342 transition count 586
Iterating global reduction 7 with 59 rules applied. Total rules applied 2960 place count 342 transition count 586
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 7 with 36 rules applied. Total rules applied 2996 place count 342 transition count 550
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 28 rules applied. Total rules applied 3024 place count 324 transition count 540
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 3029 place count 319 transition count 540
Discarding 20 places :
Symmetric choice reduction at 10 with 20 rule applications. Total rules 3049 place count 299 transition count 508
Iterating global reduction 10 with 20 rules applied. Total rules applied 3069 place count 299 transition count 508
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3077 place count 299 transition count 500
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 3086 place count 290 transition count 482
Iterating global reduction 11 with 9 rules applied. Total rules applied 3095 place count 290 transition count 482
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3098 place count 287 transition count 476
Iterating global reduction 11 with 3 rules applied. Total rules applied 3101 place count 287 transition count 476
Performed 146 Post agglomeration using F-continuation condition with reduction of 77 identical transitions.
Deduced a syphon composed of 146 places in 1 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 11 with 292 rules applied. Total rules applied 3393 place count 141 transition count 253
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 3396 place count 141 transition count 250
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 3402 place count 138 transition count 247
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3408 place count 138 transition count 241
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3414 place count 135 transition count 238
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3420 place count 135 transition count 232
Performed 36 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 14 with 72 rules applied. Total rules applied 3492 place count 99 transition count 273
Drop transitions removed 18 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 14 with 45 rules applied. Total rules applied 3537 place count 99 transition count 228
Discarding 21 places :
Symmetric choice reduction at 15 with 21 rule applications. Total rules 3558 place count 78 transition count 199
Iterating global reduction 15 with 21 rules applied. Total rules applied 3579 place count 78 transition count 199
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 3591 place count 78 transition count 187
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 3595 place count 74 transition count 179
Iterating global reduction 16 with 4 rules applied. Total rules applied 3599 place count 74 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 3603 place count 74 transition count 175
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 17 with 16 rules applied. Total rules applied 3619 place count 74 transition count 159
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 3621 place count 72 transition count 152
Iterating global reduction 17 with 2 rules applied. Total rules applied 3623 place count 72 transition count 152
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3624 place count 71 transition count 151
Iterating global reduction 17 with 1 rules applied. Total rules applied 3625 place count 71 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 3626 place count 71 transition count 150
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 3628 place count 71 transition count 148
Free-agglomeration rule applied 4 times.
Iterating global reduction 18 with 4 rules applied. Total rules applied 3632 place count 71 transition count 144
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 3638 place count 67 transition count 142
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3639 place count 67 transition count 141
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3640 place count 67 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3641 place count 66 transition count 140
Applied a total of 3641 rules in 340 ms. Remains 66 /2585 variables (removed 2519) and now considering 140/3095 (removed 2955) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 66/2585 places, 140/3095 transitions.
Normalized transition count is 135 out of 140 initially.
// Phase 1: matrix 135 rows 66 cols
[2023-03-07 22:27:18] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 15982 resets, run finished after 931 ms. (steps per millisecond=1074 ) properties (out of 13) seen :12
FORMULA CloudReconfiguration-PT-311-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3894 resets, run finished after 273 ms. (steps per millisecond=3663 ) properties (out of 1) seen :0
[2023-03-07 22:27:20] [INFO ] Flow matrix only has 135 transitions (discarded 5 similar events)
// Phase 1: matrix 135 rows 66 cols
[2023-03-07 22:27:20] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-07 22:27:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-07 22:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:20] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-07 22:27:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:27:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-07 22:27:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:27:20] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-07 22:27:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 22:27:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2023-03-07 22:27:20] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 4 ms to minimize.
[2023-03-07 22:27:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
Current structural bounds on expressions (after SMT) : [0] Max seen :[0]
FORMULA CloudReconfiguration-PT-311-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 104600 ms.

BK_STOP 1678228044145

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="CloudReconfiguration-PT-311"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is CloudReconfiguration-PT-311, 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 r101-tall-167814474900085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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