Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r042-smll-165252095200077.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r042-smll-165252095200077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 6.7K Apr 30 10:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 30 10:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 10:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 30 10:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 4.8M May 10 09:33 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 1652562726126

Running Version 202205111006
[2022-05-14 21:12:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 21:12:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 21:12:09] [INFO ] Load time of PNML (sax parser for PT used): 1046 ms
[2022-05-14 21:12:09] [INFO ] Transformed 1888 places.
[2022-05-14 21:12:09] [INFO ] Transformed 6804 transitions.
[2022-05-14 21:12:09] [INFO ] Found NUPN structural information;
[2022-05-14 21:12:09] [INFO ] Parsed PT model containing 1888 places and 6804 transitions in 1351 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 6804 rows 1888 cols
[2022-05-14 21:12:10] [INFO ] Computed 25 place invariants in 457 ms
Incomplete random walk after 10000 steps, including 52 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 16) seen :5
FORMULA CloudDeployment-PT-6b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-01 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 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 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 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 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 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 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 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 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
// Phase 1: matrix 6804 rows 1888 cols
[2022-05-14 21:12:10] [INFO ] Computed 25 place invariants in 113 ms
[2022-05-14 21:12:11] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 64 ms returned sat
[2022-05-14 21:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:12:15] [INFO ] [Real]Absence check using state equation in 4091 ms returned sat
[2022-05-14 21:12:16] [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 0
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1001)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-14 21:12:16] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 59 ms returned sat
[2022-05-14 21:12:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:12:21] [INFO ] [Real]Absence check using state equation in 4489 ms returned unknown
[2022-05-14 21:12:21] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 92 ms returned sat
[2022-05-14 21:12:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:12:24] [INFO ] [Real]Absence check using state equation in 2663 ms returned sat
[2022-05-14 21:12:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 21:12:25] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 63 ms returned sat
[2022-05-14 21:12:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 21:12:27] [INFO ] [Nat]Absence check using state equation in 2745 ms returned sat
[2022-05-14 21:12:32] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 4068 ms.
[2022-05-14 21:12:32] [INFO ] Added : 0 causal constraints over 0 iterations in 4070 ms. Result :unknown
[2022-05-14 21:12:32] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 93 ms returned sat
[2022-05-14 21:12:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:12:35] [INFO ] [Real]Absence check using state equation in 2770 ms returned sat
[2022-05-14 21:12:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 21:12:36] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 62 ms returned sat
[2022-05-14 21:12:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 21:12:39] [INFO ] [Nat]Absence check using state equation in 2747 ms returned sat
[2022-05-14 21:12:42] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 3241 ms.
[2022-05-14 21:12:42] [INFO ] Added : 0 causal constraints over 0 iterations in 3244 ms. Result :unknown
[2022-05-14 21:12:43] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 92 ms returned sat
[2022-05-14 21:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:12:46] [INFO ] [Real]Absence check using state equation in 3028 ms returned sat
[2022-05-14 21:12:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 21:12:46] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 65 ms returned sat
[2022-05-14 21:12:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 21:12:49] [INFO ] [Nat]Absence check using state equation in 3008 ms returned sat
[2022-05-14 21:12:52] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2478 ms.
[2022-05-14 21:12:52] [INFO ] Added : 0 causal constraints over 0 iterations in 2480 ms. Result :unknown
[2022-05-14 21:12:53] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 59 ms returned sat
[2022-05-14 21:12:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:12:55] [INFO ] [Real]Absence check using state equation in 2924 ms returned sat
[2022-05-14 21:12:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 21:12:56] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 60 ms returned sat
[2022-05-14 21:12:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 21:12:59] [INFO ] [Nat]Absence check using state equation in 2848 ms returned sat
[2022-05-14 21:13:02] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2405 ms.
[2022-05-14 21:13:02] [INFO ] Added : 0 causal constraints over 0 iterations in 2406 ms. Result :unknown
[2022-05-14 21:13:02] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 93 ms returned sat
[2022-05-14 21:13:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:13:05] [INFO ] [Real]Absence check using state equation in 2928 ms returned sat
[2022-05-14 21:13:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 21:13:06] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 99 ms returned sat
[2022-05-14 21:13:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 21:13:09] [INFO ] [Nat]Absence check using state equation in 2723 ms returned sat
[2022-05-14 21:13:11] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2506 ms.
[2022-05-14 21:13:11] [INFO ] Added : 0 causal constraints over 0 iterations in 2507 ms. Result :unknown
[2022-05-14 21:13:12] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 59 ms returned sat
[2022-05-14 21:13:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:13:15] [INFO ] [Real]Absence check using state equation in 3039 ms returned sat
[2022-05-14 21:13:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 21:13:15] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 60 ms returned sat
[2022-05-14 21:13:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 21:13:18] [INFO ] [Nat]Absence check using state equation in 2846 ms returned sat
[2022-05-14 21:13:21] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2345 ms.
[2022-05-14 21:13:21] [INFO ] Added : 0 causal constraints over 0 iterations in 2347 ms. Result :unknown
[2022-05-14 21:13:21] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 59 ms returned sat
[2022-05-14 21:13:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:13:25] [INFO ] [Real]Absence check using state equation in 3621 ms returned sat
[2022-05-14 21:13:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 21:13:26] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 62 ms returned sat
[2022-05-14 21:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 21:13:29] [INFO ] [Nat]Absence check using state equation in 3803 ms returned sat
[2022-05-14 21:13:32] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2572 ms.
[2022-05-14 21:13:32] [INFO ] Added : 0 causal constraints over 0 iterations in 2574 ms. Result :unknown
[2022-05-14 21:13:33] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 93 ms returned sat
[2022-05-14 21:13:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:13:36] [INFO ] [Real]Absence check using state equation in 3128 ms returned sat
[2022-05-14 21:13:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 21:13:37] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 63 ms returned sat
[2022-05-14 21:13:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 21:13:39] [INFO ] [Nat]Absence check using state equation in 2824 ms returned sat
[2022-05-14 21:13:42] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2288 ms.
[2022-05-14 21:13:42] [INFO ] Added : 0 causal constraints over 0 iterations in 2294 ms. Result :unknown
[2022-05-14 21:13:42] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 58 ms returned sat
[2022-05-14 21:13:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:13:45] [INFO ] [Real]Absence check using state equation in 2609 ms returned sat
[2022-05-14 21:13:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 21:13:46] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 62 ms returned sat
[2022-05-14 21:13:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 21:13:49] [INFO ] [Nat]Absence check using state equation in 2973 ms returned sat
[2022-05-14 21:13:51] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2245 ms.
[2022-05-14 21:13:51] [INFO ] Added : 0 causal constraints over 0 iterations in 2247 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudDeployment-PT-6b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 1888 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Graph (trivial) has 1900 edges and 1888 vertex of which 488 / 1888 are part of one of the 48 SCC in 16 ms
Free SCC test removed 440 places
Drop transitions removed 4634 transitions
Reduce isomorphic transitions removed 4634 transitions.
Graph (complete) has 4322 edges and 1448 vertex of which 1404 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.15 ms
Discarding 44 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 683 transitions
Trivial Post-agglo rules discarded 683 transitions
Performed 683 trivial Post agglomeration. Transition count delta: 683
Iterating post reduction 0 with 707 rules applied. Total rules applied 709 place count 1404 transition count 1457
Reduce places removed 683 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 685 rules applied. Total rules applied 1394 place count 721 transition count 1455
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 1397 place count 720 transition count 1453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1399 place count 718 transition count 1453
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 1399 place count 718 transition count 1429
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1447 place count 694 transition count 1429
Discarding 319 places :
Symmetric choice reduction at 4 with 319 rule applications. Total rules 1766 place count 375 transition count 1110
Iterating global reduction 4 with 319 rules applied. Total rules applied 2085 place count 375 transition count 1110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 2115 place count 375 transition count 1080
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 2115 place count 375 transition count 1051
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 2173 place count 346 transition count 1051
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2177 place count 342 transition count 1047
Iterating global reduction 5 with 4 rules applied. Total rules applied 2181 place count 342 transition count 1047
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2184 place count 339 transition count 1044
Iterating global reduction 5 with 3 rules applied. Total rules applied 2187 place count 339 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2189 place count 337 transition count 1042
Iterating global reduction 5 with 2 rules applied. Total rules applied 2191 place count 337 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2192 place count 336 transition count 1041
Iterating global reduction 5 with 1 rules applied. Total rules applied 2193 place count 336 transition count 1041
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 5 with 174 rules applied. Total rules applied 2367 place count 249 transition count 954
Performed 38 Post agglomeration using F-continuation condition with reduction of 31 identical transitions.
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 2443 place count 211 transition count 1181
Drop transitions removed 19 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 2468 place count 211 transition count 1156
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 6 with 12 rules applied. Total rules applied 2480 place count 205 transition count 1216
Drop transitions removed 224 transitions
Redundant transition composition rules discarded 224 transitions
Iterating global reduction 6 with 224 rules applied. Total rules applied 2704 place count 205 transition count 992
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2764 place count 205 transition count 902
Reduce places removed 60 places and 0 transitions.
Drop transitions removed 135 transitions
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 195 transitions.
Graph (complete) has 1241 edges and 145 vertex of which 144 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 256 rules applied. Total rules applied 3020 place count 144 transition count 707
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3021 place count 144 transition count 706
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 3025 place count 140 transition count 678
Iterating global reduction 8 with 4 rules applied. Total rules applied 3029 place count 140 transition count 678
Drop transitions removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 8 with 108 rules applied. Total rules applied 3137 place count 140 transition count 570
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 3138 place count 139 transition count 569
Applied a total of 3138 rules in 618 ms. Remains 139 /1888 variables (removed 1749) and now considering 569/6804 (removed 6235) transitions.
Finished structural reductions, in 1 iterations. Remains : 139/1888 places, 569/6804 transitions.
Normalized transition count is 280 out of 569 initially.
// Phase 1: matrix 280 rows 139 cols
[2022-05-14 21:13:53] [INFO ] Computed 23 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2955 ms. (steps per millisecond=338 ) properties (out of 5) seen :3
FORMULA CloudDeployment-PT-6b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2579 ms. (steps per millisecond=387 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2589 ms. (steps per millisecond=386 ) properties (out of 2) seen :0
[2022-05-14 21:14:01] [INFO ] Flow matrix only has 280 transitions (discarded 289 similar events)
// Phase 1: matrix 280 rows 139 cols
[2022-05-14 21:14:01] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-14 21:14:01] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-14 21:14:01] [INFO ] [Real]Absence check using 6 positive and 17 generalized place invariants in 8 ms returned sat
[2022-05-14 21:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:14:01] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2022-05-14 21:14:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 21:14:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-14 21:14:01] [INFO ] [Nat]Absence check using 6 positive and 17 generalized place invariants in 7 ms returned sat
[2022-05-14 21:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 21:14:01] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-05-14 21:14:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-14 21:14:01] [INFO ] [Nat]Added 7 Read/Feed constraints in 16 ms returned sat
[2022-05-14 21:14:01] [INFO ] Computed and/alt/rep : 177/489/177 causal constraints (skipped 66 transitions) in 24 ms.
[2022-05-14 21:14:01] [INFO ] Added : 24 causal constraints over 6 iterations in 171 ms. Result :sat
Minimization took 35 ms.
[2022-05-14 21:14:01] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-14 21:14:01] [INFO ] [Real]Absence check using 6 positive and 17 generalized place invariants in 5 ms returned sat
[2022-05-14 21:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 21:14:02] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2022-05-14 21:14:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 21:14:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-14 21:14:02] [INFO ] [Nat]Absence check using 6 positive and 17 generalized place invariants in 7 ms returned sat
[2022-05-14 21:14:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 21:14:02] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-14 21:14:02] [INFO ] [Nat]Added 7 Read/Feed constraints in 12 ms returned sat
[2022-05-14 21:14:02] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 4 ms to minimize.
[2022-05-14 21:14:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2022-05-14 21:14:02] [INFO ] Computed and/alt/rep : 177/489/177 causal constraints (skipped 66 transitions) in 30 ms.
[2022-05-14 21:14:02] [INFO ] Added : 13 causal constraints over 3 iterations in 124 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA CloudDeployment-PT-6b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 139/139 places, 569/569 transitions.
Graph (trivial) has 52 edges and 139 vertex of which 4 / 139 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 place count 137 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 136 transition count 564
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 134 transition count 562
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 15 place count 134 transition count 554
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 133 transition count 547
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 133 transition count 547
Applied a total of 17 rules in 47 ms. Remains 133 /139 variables (removed 6) and now considering 547/569 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/139 places, 547/569 transitions.
Normalized transition count is 265 out of 547 initially.
// Phase 1: matrix 265 rows 133 cols
[2022-05-14 21:14:02] [INFO ] Computed 23 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 12585 resets, run finished after 2626 ms. (steps per millisecond=380 ) properties (out of 1) seen :1
FORMULA CloudDeployment-PT-6b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 117226 ms.

BK_STOP 1652562845300

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="itstools"
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-4028"
echo " Executing tool itstools"
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 r042-smll-165252095200077"
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 ;