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.r073-smll-167814399500405.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 CloudDeployment-PT-4b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399500405
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 956K
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 14:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 14:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 14:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 14:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 14:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 14:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 14:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 591K 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 CloudDeployment-PT-4b-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678468742303

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=CloudDeployment-PT-4b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 17:19:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 17:19:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 17:19:05] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2023-03-10 17:19:05] [INFO ] Transformed 1182 places.
[2023-03-10 17:19:05] [INFO ] Transformed 1824 transitions.
[2023-03-10 17:19:05] [INFO ] Found NUPN structural information;
[2023-03-10 17:19:05] [INFO ] Parsed PT model containing 1182 places and 1824 transitions and 8741 arcs in 367 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
FORMULA CloudDeployment-PT-4b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1824 rows 1182 cols
[2023-03-10 17:19:05] [INFO ] Computed 17 place invariants in 68 ms
Incomplete random walk after 10000 steps, including 77 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 15) seen :7
FORMULA CloudDeployment-PT-4b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :1
FORMULA CloudDeployment-PT-4b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-10 17:19:06] [INFO ] Invariant cache hit.
[2023-03-10 17:19:06] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 42 ms returned sat
[2023-03-10 17:19:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:07] [INFO ] [Real]Absence check using state equation in 1030 ms returned sat
[2023-03-10 17:19:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:19:08] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 38 ms returned sat
[2023-03-10 17:19:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:09] [INFO ] [Nat]Absence check using state equation in 928 ms returned sat
[2023-03-10 17:19:09] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 256 ms.
[2023-03-10 17:19:13] [INFO ] Added : 115 causal constraints over 23 iterations in 3346 ms. Result :unknown
[2023-03-10 17:19:13] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 36 ms returned sat
[2023-03-10 17:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:14] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2023-03-10 17:19:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:19:14] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 40 ms returned sat
[2023-03-10 17:19:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:15] [INFO ] [Nat]Absence check using state equation in 862 ms returned sat
[2023-03-10 17:19:15] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 184 ms.
[2023-03-10 17:19:19] [INFO ] Added : 180 causal constraints over 36 iterations in 3753 ms. Result :unknown
[2023-03-10 17:19:19] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 35 ms returned sat
[2023-03-10 17:19:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:20] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2023-03-10 17:19:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:19:20] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 34 ms returned sat
[2023-03-10 17:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:21] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2023-03-10 17:19:21] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 177 ms.
[2023-03-10 17:19:25] [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: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-10 17:19:25] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 35 ms returned sat
[2023-03-10 17:19:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:26] [INFO ] [Real]Absence check using state equation in 830 ms returned sat
[2023-03-10 17:19:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:19:27] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 37 ms returned sat
[2023-03-10 17:19:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:27] [INFO ] [Nat]Absence check using state equation in 817 ms returned sat
[2023-03-10 17:19:28] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 152 ms.
[2023-03-10 17:19:31] [INFO ] Added : 165 causal constraints over 33 iterations in 3829 ms. Result :unknown
[2023-03-10 17:19:32] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 36 ms returned sat
[2023-03-10 17:19:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:33] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2023-03-10 17:19:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:19:33] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 37 ms returned sat
[2023-03-10 17:19:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:34] [INFO ] [Nat]Absence check using state equation in 882 ms returned sat
[2023-03-10 17:19:34] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 147 ms.
[2023-03-10 17:19:38] [INFO ] Added : 180 causal constraints over 36 iterations in 3832 ms. Result :unknown
[2023-03-10 17:19:38] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 37 ms returned sat
[2023-03-10 17:19:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:39] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2023-03-10 17:19:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:19:39] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 37 ms returned sat
[2023-03-10 17:19:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:40] [INFO ] [Nat]Absence check using state equation in 801 ms returned sat
[2023-03-10 17:19:40] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 142 ms.
[2023-03-10 17:19:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-10 17:19:44] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 34 ms returned sat
[2023-03-10 17:19:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:45] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2023-03-10 17:19:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:19:45] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 36 ms returned sat
[2023-03-10 17:19:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:46] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2023-03-10 17:19:46] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 155 ms.
[2023-03-10 17:19:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1824/1824 transitions.
Graph (trivial) has 1188 edges and 1182 vertex of which 306 / 1182 are part of one of the 32 SCC in 14 ms
Free SCC test removed 274 places
Drop transitions removed 591 transitions
Reduce isomorphic transitions removed 591 transitions.
Graph (complete) has 2389 edges and 908 vertex of which 878 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.23 ms
Discarding 30 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 438 transitions
Trivial Post-agglo rules discarded 438 transitions
Performed 438 trivial Post agglomeration. Transition count delta: 438
Iterating post reduction 0 with 454 rules applied. Total rules applied 456 place count 878 transition count 775
Reduce places removed 438 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 440 rules applied. Total rules applied 896 place count 440 transition count 773
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 901 place count 439 transition count 769
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 906 place count 435 transition count 768
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 906 place count 435 transition count 751
Deduced a syphon composed of 17 places in 17 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 940 place count 418 transition count 751
Discarding 164 places :
Symmetric choice reduction at 4 with 164 rule applications. Total rules 1104 place count 254 transition count 587
Iterating global reduction 4 with 164 rules applied. Total rules applied 1268 place count 254 transition count 587
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1280 place count 254 transition count 575
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 1280 place count 254 transition count 556
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1318 place count 235 transition count 556
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1320 place count 233 transition count 554
Iterating global reduction 5 with 2 rules applied. Total rules applied 1322 place count 233 transition count 554
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1323 place count 232 transition count 553
Iterating global reduction 5 with 1 rules applied. Total rules applied 1324 place count 232 transition count 553
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 118 rules applied. Total rules applied 1442 place count 173 transition count 494
Performed 33 Post agglomeration using F-continuation condition with reduction of 53 identical transitions.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 1508 place count 140 transition count 635
Drop transitions removed 14 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1524 place count 140 transition count 619
Drop transitions removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 6 with 128 rules applied. Total rules applied 1652 place count 140 transition count 491
Free-agglomeration rule applied 38 times with reduction of 12 identical transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 1690 place count 140 transition count 441
Reduce places removed 38 places and 0 transitions.
Drop transitions removed 56 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (complete) has 668 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 119 rules applied. Total rules applied 1809 place count 101 transition count 361
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1810 place count 101 transition count 360
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1812 place count 99 transition count 350
Iterating global reduction 8 with 2 rules applied. Total rules applied 1814 place count 99 transition count 350
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 8 with 48 rules applied. Total rules applied 1862 place count 99 transition count 302
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1863 place count 99 transition count 302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1864 place count 98 transition count 301
Applied a total of 1864 rules in 599 ms. Remains 98 /1182 variables (removed 1084) and now considering 301/1824 (removed 1523) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 599 ms. Remains : 98/1182 places, 301/1824 transitions.
Normalized transition count is 172 out of 301 initially.
// Phase 1: matrix 172 rows 98 cols
[2023-03-10 17:19:51] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1927 ms. (steps per millisecond=518 ) properties (out of 7) seen :2
FORMULA CloudDeployment-PT-4b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 966 ms. (steps per millisecond=1035 ) properties (out of 5) seen :4
FORMULA CloudDeployment-PT-4b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-10 17:19:54] [INFO ] Flow matrix only has 172 transitions (discarded 129 similar events)
// Phase 1: matrix 172 rows 98 cols
[2023-03-10 17:19:54] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 17:19:54] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 17:19:54] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-10 17:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:54] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-10 17:19:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:19:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 17:19:54] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-10 17:19:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:19:54] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-10 17:19:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-10 17:19:54] [INFO ] [Nat]Added 5 Read/Feed constraints in 8 ms returned sat
[2023-03-10 17:19:54] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 5 ms to minimize.
[2023-03-10 17:19:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-10 17:19:54] [INFO ] Computed and/alt/rep : 145/511/145 causal constraints (skipped 10 transitions) in 53 ms.
[2023-03-10 17:19:54] [INFO ] Added : 9 causal constraints over 2 iterations in 105 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA CloudDeployment-PT-4b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 49410 ms.
ITS solved all properties within timeout

BK_STOP 1678468795718

--------------------
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="CloudDeployment-PT-4b"
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 CloudDeployment-PT-4b, 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 r073-smll-167814399500405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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