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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 8.0K Feb 25 14:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 14:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 14:48 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 18K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 14:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:49 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 4.8M 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-6b-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678350583244

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 08:29:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 08:29:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:29:47] [INFO ] Load time of PNML (sax parser for PT used): 898 ms
[2023-03-09 08:29:47] [INFO ] Transformed 1888 places.
[2023-03-09 08:29:47] [INFO ] Transformed 6804 transitions.
[2023-03-09 08:29:47] [INFO ] Found NUPN structural information;
[2023-03-09 08:29:47] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 1108 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 6804 rows 1888 cols
[2023-03-09 08:29:48] [INFO ] Computed 25 place invariants in 293 ms
Incomplete random walk after 10000 steps, including 52 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 16) seen :5
FORMULA CloudDeployment-PT-6b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 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 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :1
FORMULA CloudDeployment-PT-6b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :1
FORMULA CloudDeployment-PT-6b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-09 08:29:48] [INFO ] Invariant cache hit.
[2023-03-09 08:29:49] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 78 ms returned sat
[2023-03-09 08:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:29:53] [INFO ] [Real]Absence check using state equation in 4028 ms returned unknown
[2023-03-09 08:29:54] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 91 ms returned sat
[2023-03-09 08:29:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:29:58] [INFO ] [Real]Absence check using state equation in 3657 ms returned sat
[2023-03-09 08:29:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:29:59] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 92 ms returned sat
[2023-03-09 08:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:30:02] [INFO ] [Nat]Absence check using state equation in 3087 ms returned sat
[2023-03-09 08:30:06] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 3195 ms.
[2023-03-09 08:30:06] [INFO ] Added : 0 causal constraints over 0 iterations in 3197 ms. Result :unknown
[2023-03-09 08:30:06] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 88 ms returned sat
[2023-03-09 08:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:30:11] [INFO ] [Real]Absence check using state equation in 4324 ms returned sat
[2023-03-09 08:30:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:999)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 08:30:11] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 61 ms returned sat
[2023-03-09 08:30:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:30:15] [INFO ] [Real]Absence check using state equation in 3850 ms returned sat
[2023-03-09 08:30:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:30:16] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 102 ms returned sat
[2023-03-09 08:30:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:30:19] [INFO ] [Nat]Absence check using state equation in 3079 ms returned sat
[2023-03-09 08:30:22] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2941 ms.
[2023-03-09 08:30:22] [INFO ] Added : 0 causal constraints over 0 iterations in 2944 ms. Result :unknown
[2023-03-09 08:30:23] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-09 08:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:30:26] [INFO ] [Real]Absence check using state equation in 2970 ms returned sat
[2023-03-09 08:30:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:30:26] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 61 ms returned sat
[2023-03-09 08:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:30:29] [INFO ] [Nat]Absence check using state equation in 2637 ms returned sat
[2023-03-09 08:30:32] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2899 ms.
[2023-03-09 08:30:32] [INFO ] Added : 0 causal constraints over 0 iterations in 2900 ms. Result :unknown
[2023-03-09 08:30:33] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 90 ms returned sat
[2023-03-09 08:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:30:36] [INFO ] [Real]Absence check using state equation in 3729 ms returned sat
[2023-03-09 08:30:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:30:37] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 101 ms returned sat
[2023-03-09 08:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:30:40] [INFO ] [Nat]Absence check using state equation in 3370 ms returned sat
[2023-03-09 08:30:44] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2902 ms.
[2023-03-09 08:30:44] [INFO ] Added : 0 causal constraints over 0 iterations in 2903 ms. Result :unknown
[2023-03-09 08:30:44] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 58 ms returned sat
[2023-03-09 08:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:30:48] [INFO ] [Real]Absence check using state equation in 4177 ms returned sat
[2023-03-09 08:30:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:30:49] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-09 08:30:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:30:53] [INFO ] [Nat]Absence check using state equation in 3716 ms returned sat
[2023-03-09 08:30:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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:999)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 08:30:54] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-09 08:30:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:30:57] [INFO ] [Real]Absence check using state equation in 3237 ms returned sat
[2023-03-09 08:30:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:30:58] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 93 ms returned sat
[2023-03-09 08:30:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:02] [INFO ] [Nat]Absence check using state equation in 3263 ms returned sat
[2023-03-09 08:31:05] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2832 ms.
[2023-03-09 08:31:05] [INFO ] Added : 0 causal constraints over 0 iterations in 2833 ms. Result :unknown
[2023-03-09 08:31:05] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 59 ms returned sat
[2023-03-09 08:31:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:09] [INFO ] [Real]Absence check using state equation in 3857 ms returned sat
[2023-03-09 08:31:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:31:10] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 61 ms returned sat
[2023-03-09 08:31:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:13] [INFO ] [Nat]Absence check using state equation in 3320 ms returned sat
[2023-03-09 08:31:16] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2500 ms.
[2023-03-09 08:31:16] [INFO ] Added : 0 causal constraints over 0 iterations in 2501 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudDeployment-PT-6b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 1888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Graph (trivial) has 1898 edges and 1888 vertex of which 499 / 1888 are part of one of the 48 SCC in 19 ms
Free SCC test removed 451 places
Drop transitions removed 2600 transitions
Reduce isomorphic transitions removed 2600 transitions.
Graph (complete) has 4308 edges and 1437 vertex of which 1424 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.36 ms
Discarding 13 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Ensure Unique test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 672 transitions
Trivial Post-agglo rules discarded 672 transitions
Performed 672 trivial Post agglomeration. Transition count delta: 672
Iterating post reduction 0 with 681 rules applied. Total rules applied 683 place count 1422 transition count 3519
Reduce places removed 672 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 674 rules applied. Total rules applied 1357 place count 750 transition count 3517
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1359 place count 748 transition count 3517
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 1359 place count 748 transition count 3494
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 1405 place count 725 transition count 3494
Discarding 325 places :
Symmetric choice reduction at 3 with 325 rule applications. Total rules 1730 place count 400 transition count 1133
Iterating global reduction 3 with 325 rules applied. Total rules applied 2055 place count 400 transition count 1133
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 2085 place count 400 transition count 1103
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 2085 place count 400 transition count 1080
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 2131 place count 377 transition count 1080
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 2135 place count 373 transition count 1076
Iterating global reduction 4 with 4 rules applied. Total rules applied 2139 place count 373 transition count 1076
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2142 place count 370 transition count 1073
Iterating global reduction 4 with 3 rules applied. Total rules applied 2145 place count 370 transition count 1073
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2147 place count 368 transition count 1071
Iterating global reduction 4 with 2 rules applied. Total rules applied 2149 place count 368 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2150 place count 367 transition count 1070
Iterating global reduction 4 with 1 rules applied. Total rules applied 2151 place count 367 transition count 1070
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 2335 place count 275 transition count 978
Performed 38 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 2411 place count 237 transition count 1148
Drop transitions removed 13 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2431 place count 237 transition count 1128
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 2443 place count 231 transition count 1188
Drop transitions removed 168 transitions
Redundant transition composition rules discarded 168 transitions
Iterating global reduction 5 with 168 rules applied. Total rules applied 2611 place count 231 transition count 1020
Free-agglomeration rule applied 65 times with reduction of 30 identical transitions.
Iterating global reduction 5 with 65 rules applied. Total rules applied 2676 place count 231 transition count 925
Reduce places removed 65 places and 0 transitions.
Drop transitions removed 143 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 215 transitions.
Iterating post reduction 5 with 280 rules applied. Total rules applied 2956 place count 166 transition count 710
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2961 place count 161 transition count 675
Iterating global reduction 6 with 5 rules applied. Total rules applied 2966 place count 161 transition count 675
Drop transitions removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 6 with 108 rules applied. Total rules applied 3074 place count 161 transition count 567
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 3079 place count 161 transition count 588
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 3084 place count 156 transition count 588
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 3086 place count 156 transition count 588
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3087 place count 155 transition count 587
Applied a total of 3087 rules in 1105 ms. Remains 155 /1888 variables (removed 1733) and now considering 587/6804 (removed 6217) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1107 ms. Remains : 155/1888 places, 587/6804 transitions.
Normalized transition count is 305 out of 587 initially.
// Phase 1: matrix 305 rows 155 cols
[2023-03-09 08:31:18] [INFO ] Computed 24 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 34276 resets, run finished after 2689 ms. (steps per millisecond=371 ) properties (out of 6) seen :4
FORMULA CloudDeployment-PT-6b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2775 resets, run finished after 895 ms. (steps per millisecond=1117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2786 resets, run finished after 1081 ms. (steps per millisecond=925 ) properties (out of 2) seen :0
[2023-03-09 08:31:22] [INFO ] Flow matrix only has 305 transitions (discarded 282 similar events)
// Phase 1: matrix 305 rows 155 cols
[2023-03-09 08:31:22] [INFO ] Computed 24 place invariants in 3 ms
[2023-03-09 08:31:22] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-09 08:31:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:23] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-09 08:31:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:31:23] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 08:31:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:23] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-09 08:31:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 08:31:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2023-03-09 08:31:23] [INFO ] Computed and/alt/rep : 190/626/190 causal constraints (skipped 68 transitions) in 37 ms.
[2023-03-09 08:31:23] [INFO ] Added : 39 causal constraints over 8 iterations in 361 ms. Result :sat
Minimization took 91 ms.
[2023-03-09 08:31:23] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-09 08:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:24] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-09 08:31:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:31:24] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 08:31:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:24] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-09 08:31:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2023-03-09 08:31:24] [INFO ] Computed and/alt/rep : 190/626/190 causal constraints (skipped 68 transitions) in 43 ms.
[2023-03-09 08:31:24] [INFO ] Added : 38 causal constraints over 8 iterations in 311 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 587/587 transitions.
Graph (trivial) has 68 edges and 155 vertex of which 2 / 155 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions 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 0 with 2 rules applied. Total rules applied 3 place count 154 transition count 583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 152 transition count 583
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 152 transition count 581
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 150 transition count 581
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 149 transition count 574
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 149 transition count 574
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 147 transition count 572
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 146 transition count 586
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 35 place count 146 transition count 568
Applied a total of 35 rules in 60 ms. Remains 146 /155 variables (removed 9) and now considering 568/587 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 146/155 places, 568/587 transitions.
Normalized transition count is 286 out of 568 initially.
// Phase 1: matrix 286 rows 146 cols
[2023-03-09 08:31:24] [INFO ] Computed 24 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 34314 resets, run finished after 2542 ms. (steps per millisecond=393 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2780 resets, run finished after 640 ms. (steps per millisecond=1562 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2790 resets, run finished after 633 ms. (steps per millisecond=1579 ) properties (out of 2) seen :0
[2023-03-09 08:31:28] [INFO ] Flow matrix only has 286 transitions (discarded 282 similar events)
// Phase 1: matrix 286 rows 146 cols
[2023-03-09 08:31:28] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-09 08:31:28] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 08:31:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:28] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-09 08:31:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:31:28] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-09 08:31:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:29] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-09 08:31:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 08:31:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2023-03-09 08:31:29] [INFO ] Computed and/alt/rep : 175/605/175 causal constraints (skipped 64 transitions) in 39 ms.
[2023-03-09 08:31:29] [INFO ] Added : 48 causal constraints over 10 iterations in 354 ms. Result :sat
Minimization took 84 ms.
[2023-03-09 08:31:29] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-09 08:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:29] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-03-09 08:31:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:31:29] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-09 08:31:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:29] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-09 08:31:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-09 08:31:29] [INFO ] Computed and/alt/rep : 175/605/175 causal constraints (skipped 64 transitions) in 24 ms.
[2023-03-09 08:31:30] [INFO ] Added : 48 causal constraints over 10 iterations in 216 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 568/568 transitions.
Applied a total of 0 rules in 25 ms. Remains 146 /146 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 146/146 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 568/568 transitions.
Applied a total of 0 rules in 23 ms. Remains 146 /146 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-09 08:31:30] [INFO ] Flow matrix only has 286 transitions (discarded 282 similar events)
[2023-03-09 08:31:30] [INFO ] Invariant cache hit.
[2023-03-09 08:31:30] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-09 08:31:30] [INFO ] Flow matrix only has 286 transitions (discarded 282 similar events)
[2023-03-09 08:31:30] [INFO ] Invariant cache hit.
[2023-03-09 08:31:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 08:31:31] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned [1, 3, 18, 20, 36, 38, 53, 55, 72, 86, 89]
Discarding 11 places :
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Implicit Place search using SMT with State Equation took 1590 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 135/146 places, 557/568 transitions.
Applied a total of 0 rules in 19 ms. Remains 135 /135 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1636 ms. Remains : 135/146 places, 557/568 transitions.
Normalized transition count is 275 out of 557 initially.
// Phase 1: matrix 275 rows 135 cols
[2023-03-09 08:31:31] [INFO ] Computed 24 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 12785 resets, run finished after 2607 ms. (steps per millisecond=383 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1709 resets, run finished after 709 ms. (steps per millisecond=1410 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1691 resets, run finished after 680 ms. (steps per millisecond=1470 ) properties (out of 2) seen :0
[2023-03-09 08:31:35] [INFO ] Flow matrix only has 275 transitions (discarded 282 similar events)
// Phase 1: matrix 275 rows 135 cols
[2023-03-09 08:31:35] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-09 08:31:35] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 08:31:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:36] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-09 08:31:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:31:36] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-09 08:31:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:36] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-09 08:31:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 08:31:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2023-03-09 08:31:36] [INFO ] Computed and/alt/rep : 175/605/175 causal constraints (skipped 64 transitions) in 27 ms.
[2023-03-09 08:31:36] [INFO ] Added : 46 causal constraints over 10 iterations in 276 ms. Result :sat
Minimization took 72 ms.
[2023-03-09 08:31:36] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 08:31:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:36] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-09 08:31:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:31:36] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 08:31:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:37] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-09 08:31:37] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2023-03-09 08:31:37] [INFO ] Computed and/alt/rep : 175/605/175 causal constraints (skipped 64 transitions) in 27 ms.
[2023-03-09 08:31:37] [INFO ] Added : 46 causal constraints over 10 iterations in 282 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 557/557 transitions.
Applied a total of 0 rules in 11 ms. Remains 135 /135 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 135/135 places, 557/557 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 557/557 transitions.
Applied a total of 0 rules in 12 ms. Remains 135 /135 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2023-03-09 08:31:37] [INFO ] Flow matrix only has 275 transitions (discarded 282 similar events)
[2023-03-09 08:31:37] [INFO ] Invariant cache hit.
[2023-03-09 08:31:37] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-09 08:31:37] [INFO ] Flow matrix only has 275 transitions (discarded 282 similar events)
[2023-03-09 08:31:37] [INFO ] Invariant cache hit.
[2023-03-09 08:31:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 08:31:38] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2023-03-09 08:31:38] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-09 08:31:38] [INFO ] Flow matrix only has 275 transitions (discarded 282 similar events)
[2023-03-09 08:31:38] [INFO ] Invariant cache hit.
[2023-03-09 08:31:38] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1245 ms. Remains : 135/135 places, 557/557 transitions.
Starting property specific reduction for CloudDeployment-PT-6b-UpperBounds-08
Normalized transition count is 275 out of 557 initially.
// Phase 1: matrix 275 rows 135 cols
[2023-03-09 08:31:38] [INFO ] Computed 24 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 127 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-09 08:31:38] [INFO ] Flow matrix only has 275 transitions (discarded 282 similar events)
// Phase 1: matrix 275 rows 135 cols
[2023-03-09 08:31:38] [INFO ] Computed 24 place invariants in 5 ms
[2023-03-09 08:31:38] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 08:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:38] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-09 08:31:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:31:39] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 08:31:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:39] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-09 08:31:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 08:31:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2023-03-09 08:31:39] [INFO ] Computed and/alt/rep : 175/605/175 causal constraints (skipped 64 transitions) in 27 ms.
[2023-03-09 08:31:39] [INFO ] Added : 46 causal constraints over 10 iterations in 273 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 557/557 transitions.
Graph (complete) has 1063 edges and 135 vertex of which 133 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 133 transition count 523
Applied a total of 35 rules in 15 ms. Remains 133 /135 variables (removed 2) and now considering 523/557 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 133/135 places, 523/557 transitions.
Normalized transition count is 241 out of 523 initially.
// Phase 1: matrix 241 rows 133 cols
[2023-03-09 08:31:39] [INFO ] Computed 23 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 12273 resets, run finished after 2773 ms. (steps per millisecond=360 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1621 resets, run finished after 657 ms. (steps per millisecond=1522 ) properties (out of 1) seen :0
[2023-03-09 08:31:43] [INFO ] Flow matrix only has 241 transitions (discarded 282 similar events)
// Phase 1: matrix 241 rows 133 cols
[2023-03-09 08:31:43] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-09 08:31:43] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 08:31:43] [INFO ] [Real]Absence check using 5 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 08:31:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:43] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-09 08:31:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:31:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 08:31:43] [INFO ] [Nat]Absence check using 5 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 08:31:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:43] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-03-09 08:31:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 08:31:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2023-03-09 08:31:43] [INFO ] Computed and/alt/rep : 174/604/174 causal constraints (skipped 31 transitions) in 21 ms.
[2023-03-09 08:31:43] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 7 ms to minimize.
[2023-03-09 08:31:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-09 08:31:43] [INFO ] Added : 47 causal constraints over 11 iterations in 512 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 523/523 transitions.
Applied a total of 0 rules in 16 ms. Remains 133 /133 variables (removed 0) and now considering 523/523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 133/133 places, 523/523 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 523/523 transitions.
Applied a total of 0 rules in 16 ms. Remains 133 /133 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-09 08:31:44] [INFO ] Flow matrix only has 241 transitions (discarded 282 similar events)
[2023-03-09 08:31:44] [INFO ] Invariant cache hit.
[2023-03-09 08:31:44] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-09 08:31:44] [INFO ] Flow matrix only has 241 transitions (discarded 282 similar events)
[2023-03-09 08:31:44] [INFO ] Invariant cache hit.
[2023-03-09 08:31:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 08:31:44] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2023-03-09 08:31:44] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-09 08:31:44] [INFO ] Flow matrix only has 241 transitions (discarded 282 similar events)
[2023-03-09 08:31:44] [INFO ] Invariant cache hit.
[2023-03-09 08:31:45] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1242 ms. Remains : 133/133 places, 523/523 transitions.
Ending property specific reduction for CloudDeployment-PT-6b-UpperBounds-08 in 6476 ms.
Starting property specific reduction for CloudDeployment-PT-6b-UpperBounds-12
Normalized transition count is 275 out of 557 initially.
// Phase 1: matrix 275 rows 135 cols
[2023-03-09 08:31:45] [INFO ] Computed 24 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 122 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-09 08:31:45] [INFO ] Flow matrix only has 275 transitions (discarded 282 similar events)
// Phase 1: matrix 275 rows 135 cols
[2023-03-09 08:31:45] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-09 08:31:45] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 08:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:45] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-09 08:31:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:31:45] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 08:31:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:45] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-03-09 08:31:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 08:31:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-09 08:31:45] [INFO ] Computed and/alt/rep : 175/605/175 causal constraints (skipped 64 transitions) in 36 ms.
[2023-03-09 08:31:46] [INFO ] Added : 46 causal constraints over 10 iterations in 329 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 557/557 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 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 134 transition count 556
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 2 with 2 rules applied. Total rules applied 4 place count 133 transition count 555
Applied a total of 4 rules in 32 ms. Remains 133 /135 variables (removed 2) and now considering 555/557 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 133/135 places, 555/557 transitions.
Normalized transition count is 273 out of 555 initially.
// Phase 1: matrix 273 rows 133 cols
[2023-03-09 08:31:46] [INFO ] Computed 24 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 12764 resets, run finished after 2715 ms. (steps per millisecond=368 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1692 resets, run finished after 681 ms. (steps per millisecond=1468 ) properties (out of 1) seen :0
[2023-03-09 08:31:49] [INFO ] Flow matrix only has 273 transitions (discarded 282 similar events)
// Phase 1: matrix 273 rows 133 cols
[2023-03-09 08:31:49] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-09 08:31:49] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-09 08:31:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:49] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-09 08:31:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:31:49] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-09 08:31:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:31:49] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-09 08:31:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 08:31:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-09 08:31:49] [INFO ] Computed and/alt/rep : 177/638/177 causal constraints (skipped 60 transitions) in 22 ms.
[2023-03-09 08:31:50] [INFO ] Added : 54 causal constraints over 11 iterations in 216 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 555/555 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 133/133 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 555/555 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-09 08:31:50] [INFO ] Flow matrix only has 273 transitions (discarded 282 similar events)
[2023-03-09 08:31:50] [INFO ] Invariant cache hit.
[2023-03-09 08:31:50] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-09 08:31:50] [INFO ] Flow matrix only has 273 transitions (discarded 282 similar events)
[2023-03-09 08:31:50] [INFO ] Invariant cache hit.
[2023-03-09 08:31:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 08:31:50] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2023-03-09 08:31:50] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-09 08:31:50] [INFO ] Flow matrix only has 273 transitions (discarded 282 similar events)
[2023-03-09 08:31:50] [INFO ] Invariant cache hit.
[2023-03-09 08:31:51] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1261 ms. Remains : 133/133 places, 555/555 transitions.
Ending property specific reduction for CloudDeployment-PT-6b-UpperBounds-12 in 6195 ms.
[2023-03-09 08:31:51] [INFO ] Flatten gal took : 197 ms
[2023-03-09 08:31:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-09 08:31:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 557 transitions and 4513 arcs took 10 ms.
Total runtime 125246 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CloudDeployment (PT), instance 6b
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 135 places, 557 transitions, 4513 arcs.
Final Score: 3728.899
Took : 78 seconds
Bounds file is: UpperBounds.xml
FORMULA CloudDeployment-PT-6b-UpperBounds-08 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CloudDeployment-PT-6b-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678350799213

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is CloudDeployment-PT-6b, 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 r075-smll-167814401100437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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