fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r071-tall-165254780600274
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for Diffusion2D-PT-D10N150

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
402.855 59662.00 73184.00 292.10 150 150 150 150 150 150 150 150 150 150 150 150 150 150 150 150 normal

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.r071-tall-165254780600274.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 gold2021
Input is Diffusion2D-PT-D10N150, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-tall-165254780600274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.4K Apr 30 05:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 30 05:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 05:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 05:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K May 9 07:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 255K 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 Diffusion2D-PT-D10N150-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652592063945

Running Version 0
[2022-05-15 05:21:05] [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-15 05:21:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 05:21:05] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2022-05-15 05:21:05] [INFO ] Transformed 100 places.
[2022-05-15 05:21:05] [INFO ] Transformed 684 transitions.
[2022-05-15 05:21:05] [INFO ] Parsed PT model containing 100 places and 684 transitions in 113 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 684 rows 100 cols
[2022-05-15 05:21:05] [INFO ] Computed 1 place invariants in 25 ms
Incomplete random walk after 10122 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1012 ) properties (out of 16) seen :900
FORMULA Diffusion2D-PT-D10N150-UpperBounds-14 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-13 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-12 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-11 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-08 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-07 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :6
// Phase 1: matrix 684 rows 100 cols
[2022-05-15 05:21:05] [INFO ] Computed 1 place invariants in 8 ms
[2022-05-15 05:21:05] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 05:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:06] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2022-05-15 05:21:06] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 55 ms.
[2022-05-15 05:21:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:21:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 05:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:06] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2022-05-15 05:21:06] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 65 ms.
[2022-05-15 05:21:11] [INFO ] Added : 370 causal constraints over 74 iterations in 4717 ms. Result :unknown
[2022-05-15 05:21:11] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 05:21:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:11] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2022-05-15 05:21:11] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 48 ms.
[2022-05-15 05:21:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:21:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 05:21:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:11] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-15 05:21:11] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 45 ms.
[2022-05-15 05:21:16] [INFO ] Added : 370 causal constraints over 74 iterations in 4891 ms. Result :unknown
[2022-05-15 05:21:16] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 05:21:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:16] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2022-05-15 05:21:16] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-15 05:21:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:21:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 05:21:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:16] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-15 05:21:16] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 35 ms.
[2022-05-15 05:21:21] [INFO ] Added : 380 causal constraints over 76 iterations in 4891 ms. Result :unknown
[2022-05-15 05:21:21] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 05:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:21] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2022-05-15 05:21:21] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 35 ms.
[2022-05-15 05:21:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:21:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 05:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:22] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-15 05:21:22] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 37 ms.
[2022-05-15 05:21:27] [INFO ] Added : 370 causal constraints over 74 iterations in 4891 ms. Result :unknown
[2022-05-15 05:21:27] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 05:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:27] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2022-05-15 05:21:27] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 36 ms.
[2022-05-15 05:21:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:21:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 05:21:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:27] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-15 05:21:27] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 37 ms.
[2022-05-15 05:21:32] [INFO ] Added : 375 causal constraints over 75 iterations in 4879 ms. Result :unknown
[2022-05-15 05:21:32] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 05:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:32] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2022-05-15 05:21:32] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 69 ms.
[2022-05-15 05:21:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:21:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 05:21:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:32] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2022-05-15 05:21:32] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 36 ms.
[2022-05-15 05:21:37] [INFO ] Added : 375 causal constraints over 75 iterations in 4894 ms. Result :unknown
[2022-05-15 05:21:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 05:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:37] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2022-05-15 05:21:37] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 33 ms.
[2022-05-15 05:21:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:21:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 05:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:37] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2022-05-15 05:21:38] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 40 ms.
[2022-05-15 05:21:42] [INFO ] Added : 397 causal constraints over 80 iterations in 4886 ms. Result :unknown
[2022-05-15 05:21:42] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 05:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:42] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-15 05:21:43] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 34 ms.
[2022-05-15 05:21:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:21:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 05:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:43] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2022-05-15 05:21:43] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-15 05:21:48] [INFO ] Added : 375 causal constraints over 75 iterations in 4900 ms. Result :unknown
[2022-05-15 05:21:48] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 05:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:48] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2022-05-15 05:21:48] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 33 ms.
[2022-05-15 05:21:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:21:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 05:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:48] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-15 05:21:48] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 56 ms.
[2022-05-15 05:21:53] [INFO ] Added : 375 causal constraints over 75 iterations in 4888 ms. Result :unknown
[2022-05-15 05:21:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 05:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:53] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2022-05-15 05:21:53] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 38 ms.
[2022-05-15 05:21:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:21:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 05:21:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:21:53] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2022-05-15 05:21:53] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 50 ms.
[2022-05-15 05:21:58] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 4 ms to minimize.
[2022-05-15 05:21:58] [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 9
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [150, 150, 150, 150, 150, 150, 150, 150, 150, 150] Max seen :[2, 1, 1, 1, 2, 1, 6, 2, 1, 1]
Incomplete Parikh walk after 258200 steps, including 111 resets, run finished after 653 ms. (steps per millisecond=395 ) properties (out of 10) seen :169 could not realise parikh vector
Incomplete Parikh walk after 166700 steps, including 123 resets, run finished after 364 ms. (steps per millisecond=457 ) properties (out of 10) seen :162 could not realise parikh vector
Incomplete Parikh walk after 140800 steps, including 127 resets, run finished after 322 ms. (steps per millisecond=437 ) properties (out of 10) seen :173 could not realise parikh vector
Incomplete Parikh walk after 175300 steps, including 119 resets, run finished after 311 ms. (steps per millisecond=563 ) properties (out of 10) seen :27 could not realise parikh vector
Incomplete Parikh walk after 147800 steps, including 128 resets, run finished after 309 ms. (steps per millisecond=478 ) properties (out of 10) seen :174 could not realise parikh vector
Incomplete Parikh walk after 194800 steps, including 115 resets, run finished after 390 ms. (steps per millisecond=499 ) properties (out of 10) seen :166 could not realise parikh vector
Incomplete Parikh walk after 173000 steps, including 135 resets, run finished after 365 ms. (steps per millisecond=473 ) properties (out of 10) seen :188 could not realise parikh vector
FORMULA Diffusion2D-PT-D10N150-UpperBounds-06 150 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 132800 steps, including 123 resets, run finished after 302 ms. (steps per millisecond=439 ) properties (out of 9) seen :24 could not realise parikh vector
Incomplete Parikh walk after 221500 steps, including 124 resets, run finished after 434 ms. (steps per millisecond=510 ) properties (out of 9) seen :52 could not realise parikh vector
Support contains 9 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 684/684 transitions.
Graph (trivial) has 582 edges and 100 vertex of which 91 / 100 are part of one of the 1 SCC in 17 ms
Free SCC test removed 90 places
Drop transitions removed 582 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 664 transitions.
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 10 transition count 17
Applied a total of 4 rules in 67 ms. Remains 10 /100 variables (removed 90) and now considering 17/684 (removed 667) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/100 places, 17/684 transitions.
// Phase 1: matrix 17 rows 10 cols
[2022-05-15 05:22:02] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000034 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=10417 ) properties (out of 9) seen :1350
FORMULA Diffusion2D-PT-D10N150-UpperBounds-15 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-10 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-09 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-05 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-04 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-03 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-02 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-01 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-00 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652592123607

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Diffusion2D-PT-D10N150"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is Diffusion2D-PT-D10N150, 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 r071-tall-165254780600274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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