fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r105-tall-167814480600021
Last Updated
May 14, 2023

About the Execution of LTSMin+red for CloudReconfiguration-PT-303

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
675.760 81061.00 98860.00 593.50 1 1 1 1 1 0 1 1 1 1 0 1 1 1 1 0 normal

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.r105-tall-167814480600021.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 ltsminxred
Input is CloudReconfiguration-PT-303, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814480600021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 11:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 25 11:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 25 11:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:46 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-303-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678256842021

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-303
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 06:27:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 06:27:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 06:27:23] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-08 06:27:23] [INFO ] Transformed 2584 places.
[2023-03-08 06:27:24] [INFO ] Transformed 3094 transitions.
[2023-03-08 06:27:24] [INFO ] Found NUPN structural information;
[2023-03-08 06:27:24] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 3094 rows 2584 cols
[2023-03-08 06:27:24] [INFO ] Computed 4 place invariants in 62 ms
Incomplete random walk after 10000 steps, including 108 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :3
FORMULA CloudReconfiguration-PT-303-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :1
FORMULA CloudReconfiguration-PT-303-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :1
FORMULA CloudReconfiguration-PT-303-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
[2023-03-08 06:27:24] [INFO ] Invariant cache hit.
[2023-03-08 06:27:25] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 06:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:27:26] [INFO ] [Real]Absence check using state equation in 1157 ms returned sat
[2023-03-08 06:27:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:27:27] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 06:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:27:28] [INFO ] [Nat]Absence check using state equation in 1179 ms returned sat
[2023-03-08 06:27:28] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 174 ms.
[2023-03-08 06:27:31] [INFO ] Added : 115 causal constraints over 23 iterations in 3296 ms. Result :unknown
[2023-03-08 06:27:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 50 ms returned sat
[2023-03-08 06:27:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:27:33] [INFO ] [Real]Absence check using state equation in 1246 ms returned sat
[2023-03-08 06:27:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:27:33] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2023-03-08 06:27:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:27:35] [INFO ] [Nat]Absence check using state equation in 1291 ms returned sat
[2023-03-08 06:27:35] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 178 ms.
[2023-03-08 06:27:38] [INFO ] Added : 125 causal constraints over 25 iterations in 3321 ms. Result :unknown
[2023-03-08 06:27:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:27:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:27:40] [INFO ] [Real]Absence check using state equation in 1233 ms returned sat
[2023-03-08 06:27:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:27:40] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 06:27:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:27:42] [INFO ] [Nat]Absence check using state equation in 1241 ms returned sat
[2023-03-08 06:27:42] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 148 ms.
[2023-03-08 06:27:45] [INFO ] Added : 120 causal constraints over 24 iterations in 3341 ms. Result :unknown
[2023-03-08 06:27:45] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:27:47] [INFO ] [Real]Absence check using state equation in 1182 ms returned sat
[2023-03-08 06:27:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:27:47] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:27:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:27:48] [INFO ] [Nat]Absence check using state equation in 1163 ms returned sat
[2023-03-08 06:27:48] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 132 ms.
[2023-03-08 06:27:52] [INFO ] Added : 130 causal constraints over 26 iterations in 3425 ms. Result :unknown
[2023-03-08 06:27:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:27:53] [INFO ] [Real]Absence check using state equation in 1235 ms returned sat
[2023-03-08 06:27:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:27:54] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:27:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:27:55] [INFO ] [Nat]Absence check using state equation in 1217 ms returned sat
[2023-03-08 06:27:55] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 160 ms.
[2023-03-08 06:27:59] [INFO ] Added : 120 causal constraints over 24 iterations in 3304 ms. Result :unknown
[2023-03-08 06:27:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 06:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:00] [INFO ] [Real]Absence check using state equation in 1202 ms returned sat
[2023-03-08 06:28:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:28:01] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 06:28:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:02] [INFO ] [Nat]Absence check using state equation in 1174 ms returned sat
[2023-03-08 06:28:02] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 166 ms.
[2023-03-08 06:28:05] [INFO ] Added : 125 causal constraints over 25 iterations in 3361 ms. Result :unknown
[2023-03-08 06:28:06] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 06:28:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:07] [INFO ] [Real]Absence check using state equation in 1188 ms returned sat
[2023-03-08 06:28:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:28:07] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 06:28:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:09] [INFO ] [Nat]Absence check using state equation in 1213 ms returned sat
[2023-03-08 06:28:09] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 160 ms.
[2023-03-08 06:28:12] [INFO ] Added : 120 causal constraints over 24 iterations in 3344 ms. Result :unknown
[2023-03-08 06:28:13] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 06:28:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:14] [INFO ] [Real]Absence check using state equation in 1146 ms returned sat
[2023-03-08 06:28:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:28:14] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 06:28:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:15] [INFO ] [Nat]Absence check using state equation in 1200 ms returned sat
[2023-03-08 06:28:16] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 144 ms.
[2023-03-08 06:28:19] [INFO ] Added : 130 causal constraints over 26 iterations in 3366 ms. Result :unknown
[2023-03-08 06:28:19] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:20] [INFO ] [Real]Absence check using state equation in 1222 ms returned sat
[2023-03-08 06:28:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:28:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:28:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:22] [INFO ] [Nat]Absence check using state equation in 1234 ms returned sat
[2023-03-08 06:28:22] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 150 ms.
[2023-03-08 06:28:26] [INFO ] Added : 115 causal constraints over 23 iterations in 3328 ms. Result :unknown
[2023-03-08 06:28:26] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:27] [INFO ] [Real]Absence check using state equation in 1183 ms returned sat
[2023-03-08 06:28:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:28:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:29] [INFO ] [Nat]Absence check using state equation in 1136 ms returned sat
[2023-03-08 06:28:29] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 152 ms.
[2023-03-08 06:28:32] [INFO ] Added : 130 causal constraints over 26 iterations in 3406 ms. Result :unknown
[2023-03-08 06:28:33] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:34] [INFO ] [Real]Absence check using state equation in 1233 ms returned sat
[2023-03-08 06:28:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:28:35] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:28:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:36] [INFO ] [Nat]Absence check using state equation in 1222 ms returned sat
[2023-03-08 06:28:36] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 150 ms.
[2023-03-08 06:28:39] [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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 11 out of 2584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Graph (trivial) has 2935 edges and 2584 vertex of which 875 / 2584 are part of one of the 63 SCC in 12 ms
Free SCC test removed 812 places
Drop transitions removed 992 transitions
Reduce isomorphic transitions removed 992 transitions.
Graph (complete) has 2380 edges and 1772 vertex of which 1758 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 1181 transitions
Trivial Post-agglo rules discarded 1181 transitions
Performed 1181 trivial Post agglomeration. Transition count delta: 1181
Iterating post reduction 0 with 1190 rules applied. Total rules applied 1192 place count 1758 transition count 903
Reduce places removed 1181 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 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 1319 rules applied. Total rules applied 2511 place count 577 transition count 765
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 2582 place count 515 transition count 756
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 2591 place count 512 transition count 750
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 2599 place count 508 transition count 746
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 7 rules applied. Total rules applied 2606 place count 506 transition count 741
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2611 place count 501 transition count 741
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 24 Pre rules applied. Total rules applied 2611 place count 501 transition count 717
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 2659 place count 477 transition count 717
Discarding 75 places :
Symmetric choice reduction at 7 with 75 rule applications. Total rules 2734 place count 402 transition count 642
Iterating global reduction 7 with 75 rules applied. Total rules applied 2809 place count 402 transition count 642
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 2809 place count 402 transition count 636
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 2821 place count 396 transition count 636
Discarding 58 places :
Symmetric choice reduction at 7 with 58 rule applications. Total rules 2879 place count 338 transition count 578
Iterating global reduction 7 with 58 rules applied. Total rules applied 2937 place count 338 transition count 578
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 7 with 34 rules applied. Total rules applied 2971 place count 338 transition count 544
Reduce places removed 17 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 27 rules applied. Total rules applied 2998 place count 321 transition count 534
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 3003 place count 316 transition count 534
Discarding 20 places :
Symmetric choice reduction at 10 with 20 rule applications. Total rules 3023 place count 296 transition count 503
Iterating global reduction 10 with 20 rules applied. Total rules applied 3043 place count 296 transition count 503
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3051 place count 296 transition count 495
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 3060 place count 287 transition count 477
Iterating global reduction 11 with 9 rules applied. Total rules applied 3069 place count 287 transition count 477
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3072 place count 284 transition count 471
Iterating global reduction 11 with 3 rules applied. Total rules applied 3075 place count 284 transition count 471
Performed 149 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 11 with 298 rules applied. Total rules applied 3373 place count 135 transition count 243
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 3376 place count 135 transition count 240
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 3382 place count 132 transition count 237
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3388 place count 132 transition count 231
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 3394 place count 129 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3400 place count 129 transition count 222
Performed 34 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 14 with 68 rules applied. Total rules applied 3468 place count 95 transition count 245
Drop transitions removed 19 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 14 with 43 rules applied. Total rules applied 3511 place count 95 transition count 202
Discarding 23 places :
Symmetric choice reduction at 15 with 23 rule applications. Total rules 3534 place count 72 transition count 168
Iterating global reduction 15 with 23 rules applied. Total rules applied 3557 place count 72 transition count 168
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 3569 place count 72 transition count 156
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 3573 place count 68 transition count 148
Iterating global reduction 16 with 4 rules applied. Total rules applied 3577 place count 68 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 3581 place count 68 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 3583 place count 67 transition count 156
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 3585 place count 67 transition count 154
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 18 with 34 rules applied. Total rules applied 3619 place count 67 transition count 120
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3620 place count 66 transition count 117
Iterating global reduction 18 with 1 rules applied. Total rules applied 3621 place count 66 transition count 117
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3622 place count 65 transition count 116
Iterating global reduction 18 with 1 rules applied. Total rules applied 3623 place count 65 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 3624 place count 65 transition count 115
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3625 place count 65 transition count 114
Free-agglomeration rule applied 4 times.
Iterating global reduction 19 with 4 rules applied. Total rules applied 3629 place count 65 transition count 110
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 5 rules applied. Total rules applied 3634 place count 61 transition count 109
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3635 place count 61 transition count 108
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 3637 place count 61 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 3638 place count 60 transition count 107
Applied a total of 3638 rules in 281 ms. Remains 60 /2584 variables (removed 2524) and now considering 107/3094 (removed 2987) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 60/2584 places, 107/3094 transitions.
Normalized transition count is 104 out of 107 initially.
// Phase 1: matrix 104 rows 60 cols
[2023-03-08 06:28:39] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 22332 resets, run finished after 918 ms. (steps per millisecond=1089 ) properties (out of 11) seen :8
FORMULA CloudReconfiguration-PT-303-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 5808 resets, run finished after 271 ms. (steps per millisecond=3690 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5754 resets, run finished after 269 ms. (steps per millisecond=3717 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5894 resets, run finished after 279 ms. (steps per millisecond=3584 ) properties (out of 3) seen :0
[2023-03-08 06:28:41] [INFO ] Flow matrix only has 104 transitions (discarded 3 similar events)
// Phase 1: matrix 104 rows 60 cols
[2023-03-08 06:28:41] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 06:28:41] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 06:28:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:41] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-08 06:28:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:28:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 06:28:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:41] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-08 06:28:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 06:28:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 06:28:41] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 3 ms to minimize.
[2023-03-08 06:28:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2023-03-08 06:28:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 06:28:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:41] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-08 06:28:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:28:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 06:28:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:41] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-08 06:28:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 06:28:42] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2023-03-08 06:28:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-08 06:28:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 06:28:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:42] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-08 06:28:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:28:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 06:28:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:42] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-08 06:28:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2023-03-08 06:28:42] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2023-03-08 06:28:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
Current structural bounds on expressions (after SMT) : [0, 0, 0] Max seen :[0, 0, 0]
FORMULA CloudReconfiguration-PT-303-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 78584 ms.
ITS solved all properties within timeout

BK_STOP 1678256923082

--------------------
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-303"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CloudReconfiguration-PT-303, 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 r105-tall-167814480600021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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