fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r185-tajo-162089425900503
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ResAllocation-PT-R020C002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
248.792 5425.00 10327.00 276.50 F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r185-tajo-162089425900503.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R020C002, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r185-tajo-162089425900503
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 14:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 85K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1621336930348

Running Version 0
[2021-05-18 11:22:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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, 1800]
[2021-05-18 11:22:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 11:22:12] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-18 11:22:12] [INFO ] Transformed 80 places.
[2021-05-18 11:22:12] [INFO ] Transformed 42 transitions.
[2021-05-18 11:22:12] [INFO ] Parsed PT model containing 80 places and 42 transitions in 85 ms.
Structural test allowed to assert that 2 places are NOT stable. Took 7 ms.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 78) seen :63
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 42 rows 80 cols
[2021-05-18 11:22:12] [INFO ] Computed 40 place invariants in 8 ms
[2021-05-18 11:22:12] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-18 11:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:12] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-18 11:22:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:22:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 8 ms returned sat
[2021-05-18 11:22:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:12] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-18 11:22:12] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-18 11:22:12] [INFO ] Added : 33 causal constraints over 7 iterations in 47 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-18 11:22:12] [INFO ] [Real]Absence check using 40 positive place invariants in 6 ms returned sat
[2021-05-18 11:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:12] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-18 11:22:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:22:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-18 11:22:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:12] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-18 11:22:12] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-18 11:22:12] [INFO ] Added : 34 causal constraints over 7 iterations in 39 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-18 11:22:12] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-18 11:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-18 11:22:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:22:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-18 11:22:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:12] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-18 11:22:12] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-18 11:22:12] [INFO ] Added : 35 causal constraints over 7 iterations in 37 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-18 11:22:12] [INFO ] [Real]Absence check using 40 positive place invariants in 9 ms returned sat
[2021-05-18 11:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:12] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-18 11:22:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:22:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-18 11:22:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:12] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-18 11:22:12] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-18 11:22:12] [INFO ] Added : 36 causal constraints over 8 iterations in 44 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-18 11:22:12] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-18 11:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-18 11:22:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:22:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 4 ms returned sat
[2021-05-18 11:22:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:13] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-18 11:22:13] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-18 11:22:13] [INFO ] Added : 36 causal constraints over 8 iterations in 33 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-18 11:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-18 11:22:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:22:13] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-18 11:22:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:13] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-18 11:22:13] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-18 11:22:13] [INFO ] Added : 19 causal constraints over 4 iterations in 21 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-18 11:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-18 11:22:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:22:13] [INFO ] [Nat]Absence check using 40 positive place invariants in 4 ms returned sat
[2021-05-18 11:22:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:13] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-18 11:22:13] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-18 11:22:13] [INFO ] Added : 19 causal constraints over 4 iterations in 19 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned sat
[2021-05-18 11:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-18 11:22:13] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-18 11:22:13] [INFO ] Added : 18 causal constraints over 4 iterations in 25 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using 40 positive place invariants in 9 ms returned sat
[2021-05-18 11:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-18 11:22:13] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-18 11:22:13] [INFO ] Added : 18 causal constraints over 4 iterations in 37 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-18 11:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-18 11:22:13] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-18 11:22:13] [INFO ] Added : 18 causal constraints over 4 iterations in 29 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-18 11:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-18 11:22:13] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-18 11:22:13] [INFO ] Added : 18 causal constraints over 4 iterations in 25 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned sat
[2021-05-18 11:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-18 11:22:13] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-18 11:22:13] [INFO ] Added : 18 causal constraints over 4 iterations in 20 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2021-05-18 11:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-18 11:22:13] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-18 11:22:13] [INFO ] Added : 18 causal constraints over 4 iterations in 28 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned sat
[2021-05-18 11:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-18 11:22:13] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-18 11:22:13] [INFO ] Added : 18 causal constraints over 4 iterations in 29 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using 40 positive place invariants in 7 ms returned sat
[2021-05-18 11:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:13] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-18 11:22:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:22:13] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-18 11:22:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:13] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-18 11:22:13] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-18 11:22:13] [INFO ] Added : 18 causal constraints over 4 iterations in 22 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
Fused 15 Parikh solutions to 9 different solutions.
Incomplete Parikh walk after 11100 steps, including 175 resets, run finished after 31 ms. (steps per millisecond=358 ) properties (out of 15) seen :10 could not realise parikh vector
Incomplete Parikh walk after 9500 steps, including 175 resets, run finished after 23 ms. (steps per millisecond=413 ) properties (out of 5) seen :2 could not realise parikh vector
Incomplete Parikh walk after 9300 steps, including 179 resets, run finished after 20 ms. (steps per millisecond=465 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 10200 steps, including 183 resets, run finished after 23 ms. (steps per millisecond=443 ) properties (out of 3) seen :2 could not realise parikh vector
Incomplete Parikh walk after 10900 steps, including 187 resets, run finished after 16 ms. (steps per millisecond=681 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12400 steps, including 99 resets, run finished after 22 ms. (steps per millisecond=563 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 9900 steps, including 98 resets, run finished after 19 ms. (steps per millisecond=521 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 10900 steps, including 99 resets, run finished after 24 ms. (steps per millisecond=454 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 10400 steps, including 99 resets, run finished after 19 ms. (steps per millisecond=547 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 42/42 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 78 transition count 41
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 78 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 76 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 74 transition count 39
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 74 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 72 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 70 transition count 37
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 70 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 68 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 21 place count 66 transition count 35
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 66 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 64 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 27 place count 62 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 62 transition count 32
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 30 place count 60 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 33 place count 58 transition count 31
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 34 place count 58 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 36 place count 56 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 39 place count 54 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 40 place count 54 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 42 place count 52 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 45 place count 50 transition count 27
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 46 place count 50 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 48 place count 48 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 51 place count 46 transition count 25
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 52 place count 46 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 54 place count 44 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 57 place count 42 transition count 23
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 58 place count 42 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 60 place count 40 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 63 place count 38 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 64 place count 38 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 66 place count 36 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 3 rules applied. Total rules applied 69 place count 34 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 70 place count 34 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 72 place count 32 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 75 place count 30 transition count 17
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 76 place count 30 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 78 place count 28 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 81 place count 26 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 82 place count 26 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 84 place count 24 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 3 rules applied. Total rules applied 87 place count 22 transition count 13
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 88 place count 22 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 90 place count 20 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 3 rules applied. Total rules applied 93 place count 18 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 94 place count 18 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 96 place count 16 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 99 place count 14 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 100 place count 14 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 102 place count 12 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 3 rules applied. Total rules applied 105 place count 10 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 106 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 108 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 3 rules applied. Total rules applied 111 place count 6 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 112 place count 6 transition count 4
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t_1_19.t_1_18.t_1_17.t_1_16.t_1_15.t_1_14.t_1_13.t_1_12.t_1_11.t_1_10.t_1_9.t_1_8.t_1_7.t_1_6.t_1_5.t_1_4.t_1_3.t_1_2.t_1_1.t_1_0 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 114 place count 2 transition count 2
Applied a total of 114 rules in 67 ms. Remains 2 /80 variables (removed 78) and now considering 2/42 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/80 places, 2/42 transitions.
[2021-05-18 11:22:14] [INFO ] Flatten gal took : 15 ms
[2021-05-18 11:22:14] [INFO ] Flatten gal took : 1 ms
[2021-05-18 11:22:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9599885283229201045.gal : 3 ms
[2021-05-18 11:22:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7048063205862792230.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality9599885283229201045.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7048063205862792230.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality9599885283229201045.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7048063205862792230.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7048063205862792230.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.010525,3632,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property smplace_38 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_38,1,0.01085,4004,2,3,6,12,7,0,16,6,0
Able to resolve query StableMarking after proving 79 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL

BK_STOP 1621336935773

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -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 1800 -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="ResAllocation-PT-R020C002"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ResAllocation-PT-R020C002, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r185-tajo-162089425900503"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R020C002.tgz
mv ResAllocation-PT-R020C002 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;