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.r107-tall-167814483800133.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is CloudReconfiguration-PT-317, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814483800133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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 3.6K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 10K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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 661K 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-317-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678333506206

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-317
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 03:45:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 03:45:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 03:45:07] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2023-03-09 03:45:07] [INFO ] Transformed 2587 places.
[2023-03-09 03:45:07] [INFO ] Transformed 3099 transitions.
[2023-03-09 03:45:07] [INFO ] Found NUPN structural information;
[2023-03-09 03:45:07] [INFO ] Parsed PT model containing 2587 places and 3099 transitions and 6479 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3099 rows 2587 cols
[2023-03-09 03:45:08] [INFO ] Computed 4 place invariants in 57 ms
Incomplete random walk after 10000 steps, including 112 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :1
FORMULA CloudReconfiguration-PT-317-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 41 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 39 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 38 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=769 ) 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
Incomplete Best-First random walk after 10001 steps, including 39 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 40 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 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 42 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 42 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 38 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 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 41 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 43 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 35 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :0
[2023-03-09 03:45:08] [INFO ] Invariant cache hit.
[2023-03-09 03:45:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-09 03:45:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:10] [INFO ] [Real]Absence check using state equation in 1134 ms returned sat
[2023-03-09 03:45:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:45:10] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 03:45:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:11] [INFO ] [Nat]Absence check using state equation in 1135 ms returned sat
[2023-03-09 03:45:12] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 176 ms.
[2023-03-09 03:45:15] [INFO ] Added : 130 causal constraints over 26 iterations in 3356 ms. Result :unknown
[2023-03-09 03:45:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:45:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:17] [INFO ] [Real]Absence check using state equation in 1284 ms returned sat
[2023-03-09 03:45:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:45:17] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 03:45:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:18] [INFO ] [Nat]Absence check using state equation in 1158 ms returned sat
[2023-03-09 03:45:18] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 150 ms.
[2023-03-09 03:45:22] [INFO ] Added : 135 causal constraints over 27 iterations in 3443 ms. Result :unknown
[2023-03-09 03:45:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 03:45:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:23] [INFO ] [Real]Absence check using state equation in 1149 ms returned sat
[2023-03-09 03:45:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:45:24] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 03:45:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:25] [INFO ] [Nat]Absence check using state equation in 1103 ms returned sat
[2023-03-09 03:45:25] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 157 ms.
[2023-03-09 03:45:28] [INFO ] Added : 109 causal constraints over 23 iterations in 3425 ms. Result :unknown
[2023-03-09 03:45:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 03:45:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:30] [INFO ] [Real]Absence check using state equation in 1108 ms returned sat
[2023-03-09 03:45:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:45:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 03:45:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:32] [INFO ] [Nat]Absence check using state equation in 1131 ms returned sat
[2023-03-09 03:45:32] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 152 ms.
[2023-03-09 03:45:35] [INFO ] Added : 125 causal constraints over 25 iterations in 3407 ms. Result :unknown
[2023-03-09 03:45:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 03:45:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:37] [INFO ] [Real]Absence check using state equation in 1132 ms returned sat
[2023-03-09 03:45:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:45:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-09 03:45:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:38] [INFO ] [Nat]Absence check using state equation in 1135 ms returned sat
[2023-03-09 03:45:38] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 141 ms.
[2023-03-09 03:45:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-09 03:45:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 03:45:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:43] [INFO ] [Real]Absence check using state equation in 1211 ms returned sat
[2023-03-09 03:45:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:45:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 03:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:45] [INFO ] [Nat]Absence check using state equation in 1212 ms returned sat
[2023-03-09 03:45:45] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 117 ms.
[2023-03-09 03:45:48] [INFO ] Added : 135 causal constraints over 27 iterations in 3354 ms. Result :unknown
[2023-03-09 03:45:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 03:45:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:50] [INFO ] [Real]Absence check using state equation in 1249 ms returned sat
[2023-03-09 03:45:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:45:51] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:45:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:52] [INFO ] [Nat]Absence check using state equation in 1431 ms returned sat
[2023-03-09 03:45:52] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 149 ms.
[2023-03-09 03:45:55] [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.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-09 03:45:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 03:45:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:57] [INFO ] [Real]Absence check using state equation in 1242 ms returned sat
[2023-03-09 03:45:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:45:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 03:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:45:59] [INFO ] [Nat]Absence check using state equation in 1690 ms returned sat
[2023-03-09 03:45:59] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 146 ms.
[2023-03-09 03:46:02] [INFO ] Added : 110 causal constraints over 22 iterations in 2846 ms. Result :unknown
[2023-03-09 03:46:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 03:46:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:04] [INFO ] [Real]Absence check using state equation in 1148 ms returned sat
[2023-03-09 03:46:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:46:04] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 03:46:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:05] [INFO ] [Nat]Absence check using state equation in 1204 ms returned sat
[2023-03-09 03:46:05] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 154 ms.
[2023-03-09 03:46:09] [INFO ] Added : 130 causal constraints over 26 iterations in 3384 ms. Result :unknown
[2023-03-09 03:46:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 03:46:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:10] [INFO ] [Real]Absence check using state equation in 1334 ms returned sat
[2023-03-09 03:46:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:46:11] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:46:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:12] [INFO ] [Nat]Absence check using state equation in 1338 ms returned sat
[2023-03-09 03:46:12] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 130 ms.
[2023-03-09 03:46:16] [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 9
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-09 03:46:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 03:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:17] [INFO ] [Real]Absence check using state equation in 1082 ms returned sat
[2023-03-09 03:46:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:46:17] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:46:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:19] [INFO ] [Nat]Absence check using state equation in 1085 ms returned sat
[2023-03-09 03:46:19] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 142 ms.
[2023-03-09 03:46: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: Broken pipe ... 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: 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-09 03:46:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 03:46:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:24] [INFO ] [Real]Absence check using state equation in 1274 ms returned sat
[2023-03-09 03:46:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:46:24] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2023-03-09 03:46:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:25] [INFO ] [Nat]Absence check using state equation in 1286 ms returned sat
[2023-03-09 03:46:26] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 135 ms.
[2023-03-09 03:46:29] [INFO ] Added : 125 causal constraints over 25 iterations in 3308 ms. Result :unknown
[2023-03-09 03:46:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 03:46:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:30] [INFO ] [Real]Absence check using state equation in 1134 ms returned sat
[2023-03-09 03:46:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:46:31] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:46:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:32] [INFO ] [Nat]Absence check using state equation in 1124 ms returned sat
[2023-03-09 03:46:32] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 132 ms.
[2023-03-09 03:46:36] [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 12
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-09 03:46:36] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 03:46:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:37] [INFO ] [Real]Absence check using state equation in 1211 ms returned sat
[2023-03-09 03:46:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:46:38] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:46:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:39] [INFO ] [Nat]Absence check using state equation in 1579 ms returned sat
[2023-03-09 03:46:39] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 127 ms.
[2023-03-09 03:46:42] [INFO ] Added : 125 causal constraints over 25 iterations in 3025 ms. Result :unknown
[2023-03-09 03:46:43] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2023-03-09 03:46:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:44] [INFO ] [Real]Absence check using state equation in 1038 ms returned sat
[2023-03-09 03:46:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:46:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 03:46:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:45] [INFO ] [Nat]Absence check using state equation in 1057 ms returned sat
[2023-03-09 03:46:45] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 131 ms.
[2023-03-09 03:46:49] [INFO ] Added : 132 causal constraints over 27 iterations in 3567 ms. Result :unknown
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]
Support contains 15 out of 2587 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2587/2587 places, 3099/3099 transitions.
Graph (trivial) has 2926 edges and 2587 vertex of which 812 / 2587 are part of one of the 61 SCC in 11 ms
Free SCC test removed 751 places
Drop transitions removed 913 transitions
Reduce isomorphic transitions removed 913 transitions.
Graph (complete) has 2472 edges and 1836 vertex of which 1822 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 1215 transitions
Trivial Post-agglo rules discarded 1215 transitions
Performed 1215 trivial Post agglomeration. Transition count delta: 1215
Iterating post reduction 0 with 1224 rules applied. Total rules applied 1226 place count 1822 transition count 953
Reduce places removed 1215 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 1353 rules applied. Total rules applied 2579 place count 607 transition count 815
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 2 with 65 rules applied. Total rules applied 2644 place count 549 transition count 808
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 2649 place count 547 transition count 805
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 rules applied. Total rules applied 2653 place count 546 transition count 802
Reduce places removed 2 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 5 with 12 rules applied. Total rules applied 2665 place count 544 transition count 792
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2675 place count 534 transition count 792
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 26 Pre rules applied. Total rules applied 2675 place count 534 transition count 766
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 2727 place count 508 transition count 766
Discarding 79 places :
Symmetric choice reduction at 7 with 79 rule applications. Total rules 2806 place count 429 transition count 687
Iterating global reduction 7 with 79 rules applied. Total rules applied 2885 place count 429 transition count 687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2886 place count 429 transition count 686
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 2886 place count 429 transition count 677
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 2904 place count 420 transition count 677
Discarding 61 places :
Symmetric choice reduction at 8 with 61 rule applications. Total rules 2965 place count 359 transition count 616
Iterating global reduction 8 with 61 rules applied. Total rules applied 3026 place count 359 transition count 616
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 34 rules applied. Total rules applied 3060 place count 359 transition count 582
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 9 with 29 rules applied. Total rules applied 3089 place count 342 transition count 570
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3095 place count 336 transition count 570
Discarding 21 places :
Symmetric choice reduction at 11 with 21 rule applications. Total rules 3116 place count 315 transition count 537
Iterating global reduction 11 with 21 rules applied. Total rules applied 3137 place count 315 transition count 537
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 3146 place count 315 transition count 528
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 3154 place count 307 transition count 512
Iterating global reduction 12 with 8 rules applied. Total rules applied 3162 place count 307 transition count 512
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 3165 place count 304 transition count 506
Iterating global reduction 12 with 3 rules applied. Total rules applied 3168 place count 304 transition count 506
Performed 152 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 152 places in 0 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 12 with 304 rules applied. Total rules applied 3472 place count 152 transition count 274
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 3475 place count 152 transition count 271
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 3481 place count 149 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3487 place count 149 transition count 262
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 3491 place count 147 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 3495 place count 147 transition count 256
Performed 39 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 15 with 78 rules applied. Total rules applied 3573 place count 108 transition count 297
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 15 with 30 rules applied. Total rules applied 3603 place count 108 transition count 267
Discarding 21 places :
Symmetric choice reduction at 16 with 21 rule applications. Total rules 3624 place count 87 transition count 222
Iterating global reduction 16 with 21 rules applied. Total rules applied 3645 place count 87 transition count 222
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 16 with 11 rules applied. Total rules applied 3656 place count 87 transition count 211
Discarding 3 places :
Symmetric choice reduction at 17 with 3 rule applications. Total rules 3659 place count 84 transition count 205
Iterating global reduction 17 with 3 rules applied. Total rules applied 3662 place count 84 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 3665 place count 84 transition count 202
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 18 with 13 rules applied. Total rules applied 3678 place count 84 transition count 189
Free-agglomeration rule applied 6 times.
Iterating global reduction 18 with 6 rules applied. Total rules applied 3684 place count 84 transition count 183
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 3691 place count 78 transition count 182
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 3694 place count 78 transition count 182
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3695 place count 78 transition count 181
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3696 place count 77 transition count 180
Iterating global reduction 19 with 1 rules applied. Total rules applied 3697 place count 77 transition count 180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3698 place count 76 transition count 179
Applied a total of 3698 rules in 257 ms. Remains 76 /2587 variables (removed 2511) and now considering 179/3099 (removed 2920) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 76/2587 places, 179/3099 transitions.
Normalized transition count is 166 out of 179 initially.
// Phase 1: matrix 166 rows 76 cols
[2023-03-09 03:46:49] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 8452 resets, run finished after 1084 ms. (steps per millisecond=922 ) properties (out of 15) seen :14
FORMULA CloudReconfiguration-PT-317-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2745 resets, run finished after 336 ms. (steps per millisecond=2976 ) properties (out of 1) seen :0
[2023-03-09 03:46:50] [INFO ] Flow matrix only has 166 transitions (discarded 13 similar events)
// Phase 1: matrix 166 rows 76 cols
[2023-03-09 03:46:50] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-09 03:46:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 03:46:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:51] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 03:46:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:46:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 03:46:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:46:51] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-09 03:46:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 03:46:51] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2023-03-09 03:46:51] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 9 ms to minimize.
[2023-03-09 03:46:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
Current structural bounds on expressions (after SMT) : [0] Max seen :[0]
FORMULA CloudReconfiguration-PT-317-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 103538 ms.
ITS solved all properties within timeout

BK_STOP 1678333611982

--------------------
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="CloudReconfiguration-PT-317"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is CloudReconfiguration-PT-317, 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 r107-tall-167814483800133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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