fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r480-tall-171624188600125
Last Updated
July 7, 2024

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
680.428 76178.00 91014.00 328.00 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r480-tall-171624188600125.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CloudReconfiguration-PT-302, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624188600125
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 19:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 19:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 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-302-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717178788703

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-302
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:06:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 18:06:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:06:30] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-05-31 18:06:30] [INFO ] Transformed 2585 places.
[2024-05-31 18:06:30] [INFO ] Transformed 3095 transitions.
[2024-05-31 18:06:30] [INFO ] Found NUPN structural information;
[2024-05-31 18:06:30] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 3095 rows 2585 cols
[2024-05-31 18:06:30] [INFO ] Computed 4 invariants in 74 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (71 resets) in 74 ms. (133 steps per ms)
FORMULA CloudReconfiguration-PT-302-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (175 resets) in 160 ms. (559 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-31 18:06:30] [INFO ] Invariant cache hit.
[2024-05-31 18:06:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 55 ms returned sat
[2024-05-31 18:06:32] [INFO ] [Real]Absence check using state equation in 1382 ms returned sat
[2024-05-31 18:06:33] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 201 ms.
[2024-05-31 18:06:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:06:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 53 ms returned sat
[2024-05-31 18:06:35] [INFO ] [Nat]Absence check using state equation in 1095 ms returned sat
[2024-05-31 18:06:36] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 162 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-31 18:06:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 53 ms returned sat
[2024-05-31 18:06:41] [INFO ] [Real]Absence check using state equation in 1217 ms returned sat
[2024-05-31 18:06:41] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 175 ms.
[2024-05-31 18:06:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:06:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 50 ms returned sat
[2024-05-31 18:06:44] [INFO ] [Nat]Absence check using state equation in 1297 ms returned sat
[2024-05-31 18:06:44] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 209 ms.
[2024-05-31 18:06:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 18:06:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 50 ms returned sat
[2024-05-31 18:06:48] [INFO ] [Real]Absence check using state equation in 997 ms returned sat
[2024-05-31 18:06:49] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 164 ms.
[2024-05-31 18:06:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:06:50] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2024-05-31 18:06:51] [INFO ] [Nat]Absence check using state equation in 1024 ms returned sat
[2024-05-31 18:06:51] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 177 ms.
[2024-05-31 18:06:54] [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 2
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 18:06:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2024-05-31 18:06:56] [INFO ] [Real]Absence check using state equation in 1254 ms returned sat
[2024-05-31 18:06:56] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 161 ms.
[2024-05-31 18:06:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:06:58] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2024-05-31 18:06:59] [INFO ] [Nat]Absence check using state equation in 1279 ms returned sat
[2024-05-31 18:06:59] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 128 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-31 18:07:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2024-05-31 18:07:04] [INFO ] [Real]Absence check using state equation in 1131 ms returned sat
[2024-05-31 18:07:04] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 165 ms.
[2024-05-31 18:07:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:07:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2024-05-31 18:07:07] [INFO ] [Nat]Absence check using state equation in 1151 ms returned sat
[2024-05-31 18:07:07] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 160 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-31 18:07:11] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2024-05-31 18:07:12] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2024-05-31 18:07:12] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 170 ms.
[2024-05-31 18:07:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:07:13] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2024-05-31 18:07:14] [INFO ] [Nat]Absence check using state equation in 1021 ms returned sat
[2024-05-31 18:07:14] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 181 ms.
[2024-05-31 18:07:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 18:07:18] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2024-05-31 18:07:19] [INFO ] [Real]Absence check using state equation in 1164 ms returned sat
[2024-05-31 18:07:20] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 165 ms.
[2024-05-31 18:07:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:07:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2024-05-31 18:07:22] [INFO ] [Nat]Absence check using state equation in 1226 ms returned sat
[2024-05-31 18:07:22] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 167 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-31 18:07:26] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 53 ms returned sat
[2024-05-31 18:07:27] [INFO ] [Real]Absence check using state equation in 1132 ms returned sat
[2024-05-31 18:07:28] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 174 ms.
[2024-05-31 18:07:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:07:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2024-05-31 18:07:30] [INFO ] [Nat]Absence check using state equation in 1147 ms returned sat
[2024-05-31 18:07:30] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 184 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-31 18:07:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 51 ms returned sat
[2024-05-31 18:07:35] [INFO ] [Real]Absence check using state equation in 1189 ms returned sat
[2024-05-31 18:07:35] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 187 ms.
[2024-05-31 18:07:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:07:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 52 ms returned sat
[2024-05-31 18:07:38] [INFO ] [Nat]Absence check using state equation in 1194 ms returned sat
[2024-05-31 18:07:38] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 183 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2940 edges and 2585 vertex of which 867 / 2585 are part of one of the 63 SCC in 10 ms
Free SCC test removed 804 places
Drop transitions (Empty/Sink Transition effects.) removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Graph (complete) has 2395 edges and 1781 vertex of which 1767 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1188 transitions
Trivial Post-agglo rules discarded 1188 transitions
Performed 1188 trivial Post agglomeration. Transition count delta: 1188
Iterating post reduction 0 with 1197 rules applied. Total rules applied 1199 place count 1767 transition count 909
Reduce places removed 1188 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 1 with 1326 rules applied. Total rules applied 2525 place count 579 transition count 771
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 2596 place count 517 transition count 762
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 2605 place count 514 transition count 756
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 2613 place count 510 transition count 752
Reduce places removed 2 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 5 with 11 rules applied. Total rules applied 2624 place count 508 transition count 743
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 2635 place count 499 transition count 741
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 2635 place count 499 transition count 721
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 2675 place count 479 transition count 721
Discarding 77 places :
Symmetric choice reduction at 7 with 77 rule applications. Total rules 2752 place count 402 transition count 644
Iterating global reduction 7 with 77 rules applied. Total rules applied 2829 place count 402 transition count 644
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2829 place count 402 transition count 635
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2847 place count 393 transition count 635
Discarding 59 places :
Symmetric choice reduction at 7 with 59 rule applications. Total rules 2906 place count 334 transition count 576
Iterating global reduction 7 with 59 rules applied. Total rules applied 2965 place count 334 transition count 576
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 7 with 32 rules applied. Total rules applied 2997 place count 334 transition count 544
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 8 with 28 rules applied. Total rules applied 3025 place count 318 transition count 532
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 3031 place count 312 transition count 532
Discarding 19 places :
Symmetric choice reduction at 10 with 19 rule applications. Total rules 3050 place count 293 transition count 503
Iterating global reduction 10 with 19 rules applied. Total rules applied 3069 place count 293 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 3077 place count 293 transition count 495
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 3085 place count 285 transition count 479
Iterating global reduction 11 with 8 rules applied. Total rules applied 3093 place count 285 transition count 479
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3096 place count 282 transition count 473
Iterating global reduction 11 with 3 rules applied. Total rules applied 3099 place count 282 transition count 473
Performed 153 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 11 with 306 rules applied. Total rules applied 3405 place count 129 transition count 238
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 3408 place count 129 transition count 235
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 3414 place count 126 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3420 place count 126 transition count 226
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3426 place count 123 transition count 223
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3432 place count 123 transition count 217
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 14 with 66 rules applied. Total rules applied 3498 place count 90 transition count 248
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 14 with 46 rules applied. Total rules applied 3544 place count 90 transition count 202
Discarding 22 places :
Symmetric choice reduction at 15 with 22 rule applications. Total rules 3566 place count 68 transition count 173
Iterating global reduction 15 with 22 rules applied. Total rules applied 3588 place count 68 transition count 173
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 15 with 13 rules applied. Total rules applied 3601 place count 68 transition count 160
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 3605 place count 64 transition count 152
Iterating global reduction 16 with 4 rules applied. Total rules applied 3609 place count 64 transition count 152
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 3613 place count 64 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 17 with 24 rules applied. Total rules applied 3637 place count 64 transition count 124
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 3639 place count 62 transition count 118
Iterating global reduction 17 with 2 rules applied. Total rules applied 3641 place count 62 transition count 118
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 3643 place count 60 transition count 116
Iterating global reduction 17 with 2 rules applied. Total rules applied 3645 place count 60 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 3647 place count 60 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 3649 place count 59 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 3651 place count 59 transition count 111
Free-agglomeration rule applied 4 times.
Iterating global reduction 18 with 4 rules applied. Total rules applied 3655 place count 59 transition count 107
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 5 rules applied. Total rules applied 3660 place count 55 transition count 106
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3661 place count 55 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3662 place count 54 transition count 105
Applied a total of 3662 rules in 300 ms. Remains 54 /2585 variables (removed 2531) and now considering 105/3095 (removed 2990) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 54/2585 places, 105/3095 transitions.
[2024-05-31 18:07:42] [INFO ] Flow matrix only has 100 transitions (discarded 5 similar events)
// Phase 1: matrix 100 rows 54 cols
[2024-05-31 18:07:42] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (13353 resets) in 1871 ms. (534 steps per ms)
FORMULA CloudReconfiguration-PT-302-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (3 resets) in 840 ms. (1189 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 74772 ms.
ITS solved all properties within timeout

BK_STOP 1717178864881

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-302"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is CloudReconfiguration-PT-302, 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 r480-tall-171624188600125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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