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

About the Execution of ITS-Tools for CloudDeployment-PT-4b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
424.752 58857.00 77992.00 523.30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r069-smll-167814396400405.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 itstools
Input is CloudDeployment-PT-4b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-167814396400405
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 956K
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 14:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 14:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 14:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 14:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 14:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 14:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 14:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 591K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678445277785

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-4b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-10 10:48:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 10:48:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 10:48:00] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2023-03-10 10:48:00] [INFO ] Transformed 1182 places.
[2023-03-10 10:48:00] [INFO ] Transformed 1824 transitions.
[2023-03-10 10:48:00] [INFO ] Found NUPN structural information;
[2023-03-10 10:48:00] [INFO ] Parsed PT model containing 1182 places and 1824 transitions and 8741 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
FORMULA CloudDeployment-PT-4b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1824 rows 1182 cols
[2023-03-10 10:48:00] [INFO ] Computed 17 place invariants in 61 ms
Incomplete random walk after 10000 steps, including 78 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 15) seen :6
FORMULA CloudDeployment-PT-4b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :1
FORMULA CloudDeployment-PT-4b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
[2023-03-10 10:48:01] [INFO ] Invariant cache hit.
[2023-03-10 10:48:01] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 36 ms returned sat
[2023-03-10 10:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:02] [INFO ] [Real]Absence check using state equation in 896 ms returned sat
[2023-03-10 10:48:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:48:03] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 38 ms returned sat
[2023-03-10 10:48:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:04] [INFO ] [Nat]Absence check using state equation in 909 ms returned sat
[2023-03-10 10:48:04] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 281 ms.
[2023-03-10 10:48:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 10:48:08] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 35 ms returned sat
[2023-03-10 10:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:08] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2023-03-10 10:48:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:48:09] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 37 ms returned sat
[2023-03-10 10:48:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:10] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2023-03-10 10:48:10] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 352 ms.
[2023-03-10 10:48:14] [INFO ] Added : 160 causal constraints over 32 iterations in 3847 ms. Result :unknown
[2023-03-10 10:48:14] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 37 ms returned sat
[2023-03-10 10:48:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:15] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2023-03-10 10:48:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:48:15] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 37 ms returned sat
[2023-03-10 10:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:16] [INFO ] [Nat]Absence check using state equation in 815 ms returned sat
[2023-03-10 10:48:16] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 142 ms.
[2023-03-10 10:48:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 10:48:20] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 35 ms returned sat
[2023-03-10 10:48:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:21] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2023-03-10 10:48:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:48:21] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 37 ms returned sat
[2023-03-10 10:48:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:22] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2023-03-10 10:48:22] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 153 ms.
[2023-03-10 10:48:26] [INFO ] Added : 185 causal constraints over 37 iterations in 3910 ms. Result :unknown
[2023-03-10 10:48:26] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 34 ms returned sat
[2023-03-10 10:48:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:27] [INFO ] [Real]Absence check using state equation in 781 ms returned sat
[2023-03-10 10:48:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:48:28] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 36 ms returned sat
[2023-03-10 10:48:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:28] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2023-03-10 10:48:29] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 164 ms.
[2023-03-10 10:48:32] [INFO ] Added : 180 causal constraints over 36 iterations in 3897 ms. Result :unknown
[2023-03-10 10:48:33] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 37 ms returned sat
[2023-03-10 10:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:33] [INFO ] [Real]Absence check using state equation in 893 ms returned sat
[2023-03-10 10:48:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:48:34] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 36 ms returned sat
[2023-03-10 10:48:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:35] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2023-03-10 10:48:35] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 171 ms.
[2023-03-10 10:48:39] [INFO ] Added : 180 causal constraints over 36 iterations in 3775 ms. Result :unknown
[2023-03-10 10:48:39] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 34 ms returned sat
[2023-03-10 10:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:40] [INFO ] [Real]Absence check using state equation in 746 ms returned sat
[2023-03-10 10:48:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:48:40] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 36 ms returned sat
[2023-03-10 10:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:41] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2023-03-10 10:48:41] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 141 ms.
[2023-03-10 10:48:45] [INFO ] Added : 180 causal constraints over 36 iterations in 3887 ms. Result :unknown
[2023-03-10 10:48:45] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 35 ms returned sat
[2023-03-10 10:48:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:46] [INFO ] [Real]Absence check using state equation in 762 ms returned sat
[2023-03-10 10:48:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:48:46] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 36 ms returned sat
[2023-03-10 10:48:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:47] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2023-03-10 10:48:47] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 149 ms.
[2023-03-10 10:48:51] [INFO ] Added : 190 causal constraints over 38 iterations in 3895 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudDeployment-PT-4b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1824/1824 transitions.
Graph (trivial) has 1193 edges and 1182 vertex of which 310 / 1182 are part of one of the 32 SCC in 10 ms
Free SCC test removed 278 places
Drop transitions removed 596 transitions
Reduce isomorphic transitions removed 596 transitions.
Graph (complete) has 2384 edges and 904 vertex of which 874 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.6 ms
Discarding 30 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 456 rules applied. Total rules applied 458 place count 874 transition count 768
Reduce places removed 440 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 442 rules applied. Total rules applied 900 place count 434 transition count 766
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 903 place count 433 transition count 764
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 906 place count 431 transition count 763
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 906 place count 431 transition count 747
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 938 place count 415 transition count 747
Discarding 164 places :
Symmetric choice reduction at 4 with 164 rule applications. Total rules 1102 place count 251 transition count 583
Iterating global reduction 4 with 164 rules applied. Total rules applied 1266 place count 251 transition count 583
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1278 place count 251 transition count 571
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 1278 place count 251 transition count 552
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1316 place count 232 transition count 552
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1318 place count 230 transition count 550
Iterating global reduction 5 with 2 rules applied. Total rules applied 1320 place count 230 transition count 550
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1321 place count 229 transition count 549
Iterating global reduction 5 with 1 rules applied. Total rules applied 1322 place count 229 transition count 549
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 1442 place count 169 transition count 489
Performed 32 Post agglomeration using F-continuation condition with reduction of 53 identical transitions.
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1506 place count 137 transition count 629
Drop transitions removed 14 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1521 place count 137 transition count 614
Drop transitions removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 6 with 128 rules applied. Total rules applied 1649 place count 137 transition count 486
Free-agglomeration rule applied 38 times with reduction of 12 identical transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 1687 place count 137 transition count 436
Reduce places removed 38 places and 0 transitions.
Drop transitions removed 56 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (complete) has 658 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 119 rules applied. Total rules applied 1806 place count 98 transition count 356
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1807 place count 98 transition count 355
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1809 place count 96 transition count 345
Iterating global reduction 8 with 2 rules applied. Total rules applied 1811 place count 96 transition count 345
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 8 with 48 rules applied. Total rules applied 1859 place count 96 transition count 297
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1861 place count 96 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1862 place count 95 transition count 296
Applied a total of 1862 rules in 380 ms. Remains 95 /1182 variables (removed 1087) and now considering 296/1824 (removed 1528) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 381 ms. Remains : 95/1182 places, 296/1824 transitions.
Normalized transition count is 163 out of 296 initially.
// Phase 1: matrix 163 rows 95 cols
[2023-03-10 10:48:52] [INFO ] Computed 15 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1844 ms. (steps per millisecond=542 ) properties (out of 5) seen :4
FORMULA CloudDeployment-PT-4b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1439 ms. (steps per millisecond=694 ) properties (out of 1) seen :0
[2023-03-10 10:48:55] [INFO ] Flow matrix only has 163 transitions (discarded 133 similar events)
// Phase 1: matrix 163 rows 95 cols
[2023-03-10 10:48:55] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-10 10:48:55] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 10:48:55] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-10 10:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:55] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-10 10:48:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:48:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 10:48:55] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-10 10:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:48:55] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-10 10:48:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-10 10:48:55] [INFO ] [Nat]Added 5 Read/Feed constraints in 5 ms returned sat
[2023-03-10 10:48:55] [INFO ] Computed and/alt/rep : 140/496/140 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-10 10:48:55] [INFO ] Added : 9 causal constraints over 2 iterations in 52 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA CloudDeployment-PT-4b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 55366 ms.

BK_STOP 1678445336642

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-4b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="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-5348"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-4b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-smll-167814396400405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-4b.tgz
mv CloudDeployment-PT-4b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;