fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r064-tall-162038397600676
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for DatabaseWithMutex-COL-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
427.308 34876.00 20962.00 12206.30 FFTTFFTFFTFFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r064-tall-162038397600676.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 DatabaseWithMutex-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038397600676
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 17:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 17:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 19K 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

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

=== Now, execution of the tool begins

BK_START 1620555896069

Running Version 0
[2021-05-09 10:25:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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]
[2021-05-09 10:25:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 10:25:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-09 10:25:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-09 10:25:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 544 ms
[2021-05-09 10:25:08] [WARNING] Unknown color function,Subtract skipping symmetry detection on parameters for transition Release
[2021-05-09 10:25:08] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 38 PT places and 32.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA DatabaseWithMutex-COL-02-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 10:25:08] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions in 4 ms.
[2021-05-09 10:25:08] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_13446990648474615111.dot
[2021-05-09 10:25:11] [INFO ] Initial state test concluded for 3 properties.
Incomplete random walk after 100001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=507 ) properties (out of 32) seen :28
Running SMT prover for 4 properties.
// Phase 1: matrix 8 rows 11 cols
[2021-05-09 10:25:11] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-09 10:25:11] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-09 10:25:11] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned unsat
[2021-05-09 10:25:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-09 10:25:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned unsat
[2021-05-09 10:25:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
FORMULA DatabaseWithMutex-COL-02-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 10:25:11] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 10:25:11] [INFO ] Flatten gal took : 17 ms
FORMULA DatabaseWithMutex-COL-02-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 10:25:11] [INFO ] Flatten gal took : 3 ms
[2021-05-09 10:25:11] [INFO ] Unfolded HLPN to a Petri net with 38 places and 32 transitions in 2 ms.
[2021-05-09 10:25:11] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_7831618140767382643.dot
[2021-05-09 10:25:11] [INFO ] Initial state test concluded for 1 properties.
Support contains 38 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 6 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 10:25:12] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 10:25:12] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 10:25:12] [INFO ] Computed 10 place invariants in 11 ms
[2021-05-09 10:25:12] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 10:25:12] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-09 10:25:13] [INFO ] Dead Transitions using invariants and state equation in 1201 ms returned []
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 32/32 transitions.
[2021-05-09 10:25:13] [INFO ] Flatten gal took : 5 ms
[2021-05-09 10:25:13] [INFO ] Flatten gal took : 5 ms
[2021-05-09 10:25:13] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=361 ) properties (out of 29) seen :26
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 10:25:14] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-09 10:25:14] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-09 10:25:14] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-09 10:25:14] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned unsat
[2021-05-09 10:25:14] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 3 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 10:25:14] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-09 10:25:14] [INFO ] Implicit Places using invariants in 22 ms returned [24, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 10:25:14] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 10:25:14] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 5 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 10:25:14] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 10:25:14] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-02-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s6 s7) (ADD s4 s5)), p0:(LEQ (ADD s0 s1 s2 s3) (ADD s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9004 reset in 230 ms.
Stack based approach found an accepted trace after 35 steps with 1 reset with depth 25 and stack size 25 in 1 ms.
FORMULA DatabaseWithMutex-COL-02-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-00 finished in 587 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 6 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 2 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 10:25:14] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 10:25:14] [INFO ] Implicit Places using invariants in 23 ms returned [24, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 10:25:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 10:25:14] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 10:25:14] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 10:25:14] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DatabaseWithMutex-COL-02-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s6 s7) (ADD s24 s25 s26 s27))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-02-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-01 finished in 170 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||F((p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 16 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 34 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 12 place count 30 transition count 28
Applied a total of 12 rules in 6 ms. Remains 30 /38 variables (removed 8) and now considering 28/32 (removed 4) transitions.
// Phase 1: matrix 28 rows 30 cols
[2021-05-09 10:25:14] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 10:25:14] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 28 rows 30 cols
[2021-05-09 10:25:14] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 10:25:14] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-09 10:25:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 28 rows 30 cols
[2021-05-09 10:25:14] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 10:25:14] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/38 places, 28/32 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-02-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s20 s21)), p2:(AND (GT (ADD s26 s27 s28 s29) (ADD s0 s1 s2 s3)) (GT (ADD s8 s9 s10 s11) (ADD s4 s5))), p1:(GT (ADD s8 s9 s10 s11) (ADD s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10189 reset in 172 ms.
Stack based approach found an accepted trace after 56 steps with 3 reset with depth 28 and stack size 28 in 0 ms.
FORMULA DatabaseWithMutex-COL-02-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-04 finished in 312 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 28
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 10 rules applied. Total rules applied 14 place count 32 transition count 24
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 22 place count 28 transition count 20
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 26 place count 24 transition count 20
Applied a total of 26 rules in 5 ms. Remains 24 /38 variables (removed 14) and now considering 20/32 (removed 12) transitions.
// Phase 1: matrix 20 rows 24 cols
[2021-05-09 10:25:15] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 10:25:15] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 20 rows 24 cols
[2021-05-09 10:25:15] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 10:25:15] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2021-05-09 10:25:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 24 cols
[2021-05-09 10:25:15] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-09 10:25:15] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/38 places, 20/32 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-02-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s2 s3 s4 s5) (ADD s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8252 reset in 120 ms.
Stack based approach found an accepted trace after 507 steps with 40 reset with depth 18 and stack size 18 in 1 ms.
FORMULA DatabaseWithMutex-COL-02-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-05 finished in 252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 2 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 10:25:15] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 10:25:15] [INFO ] Implicit Places using invariants in 27 ms returned [24, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 10:25:15] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 10:25:15] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 10:25:15] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 10:25:15] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-02-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ (ADD s20 s21 s22 s23) (ADD s12 s13 s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 80 ms.
Product exploration explored 100000 steps with 25000 reset in 103 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 76 ms.
Product exploration explored 100000 steps with 25000 reset in 108 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 8 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 32/32 places, 32/32 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 8 place count 32 transition count 32
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 32 transition count 32
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 28 transition count 28
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 28 transition count 28
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 20 rules in 4 ms. Remains 28 /32 variables (removed 4) and now considering 28/32 (removed 4) transitions.
[2021-05-09 10:25:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 28 cols
[2021-05-09 10:25:16] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 10:25:16] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/32 places, 28/32 transitions.
Product exploration explored 100000 steps with 25000 reset in 176 ms.
Product exploration explored 100000 steps with 25000 reset in 170 ms.
[2021-05-09 10:25:16] [INFO ] Flatten gal took : 3 ms
[2021-05-09 10:25:16] [INFO ] Flatten gal took : 3 ms
[2021-05-09 10:25:16] [INFO ] Time to serialize gal into /tmp/LTL16643263219606953380.gal : 1 ms
[2021-05-09 10:25:16] [INFO ] Time to serialize properties into /tmp/LTL17665359662460471974.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16643263219606953380.gal, -t, CGAL, -LTL, /tmp/LTL17665359662460471974.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16643263219606953380.gal -t CGAL -LTL /tmp/LTL17665359662460471974.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((((Acknowledge_0+Acknowledge_1)+Acknowledge_2)+Acknowledge_3)<=(((Modify_0+Modify_1)+Modify_2)+Modify_3))"))))))
Formula 0 simplified : !XXXF"((((Acknowledge_0+Acknowledge_1)+Acknowledge_2)+Acknowledge_3)<=(((Modify_0+Modify_1)+Modify_2)+Modify_3))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.02695,16600,1,0,8,2597,20,0,698,815,15
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DatabaseWithMutex-COL-02-06 finished in 1344 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0)) U (p1&&X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 14 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 10:25:16] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 10:25:16] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 10:25:16] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 10:25:16] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 10:25:16] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 10:25:16] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 34/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : DatabaseWithMutex-COL-02-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(OR p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s20 s21 s22 s23) (ADD s16 s17 s18 s19)), p0:(LEQ (ADD s24 s25) (ADD s0 s1 s2 s3)), p2:(LEQ (ADD s0 s1 s2 s3) (ADD s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 37 reset in 109 ms.
Stack based approach found an accepted trace after 24 steps with 3 reset with depth 14 and stack size 14 in 0 ms.
FORMULA DatabaseWithMutex-COL-02-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-07 finished in 341 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G((p0||G(!p0)))||((p0||G(!p0))&&X(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 0 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 10:25:17] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 10:25:17] [INFO ] Implicit Places using invariants in 29 ms returned [24, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 10:25:17] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 10:25:17] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 10:25:17] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 10:25:17] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 200 ms :[false, (AND (NOT p1) p0), false, false, false, true, (NOT p1), p0]
Running random walk in product with property : DatabaseWithMutex-COL-02-08 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=4, aps=[p0:(GT (ADD s16 s17 s18 s19) (ADD s20 s21 s22 s23)), p1:(GT 1 (ADD s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-02-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-08 finished in 286 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F((p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 16 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 10:25:17] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 10:25:17] [INFO ] Implicit Places using invariants in 26 ms returned [24, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 10:25:17] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-09 10:25:17] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 10:25:17] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 10:25:17] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 9413 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-COL-02-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s24 s25 s26 s27) (ADD s8 s9 s10 s11)), p1:(LEQ (ADD s20 s21 s22 s23) (ADD s8 s9 s10 s11)), p2:(LEQ 1 (ADD s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Knowledge obtained : [p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 16 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 32/32 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2021-05-09 10:25:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 10:25:27] [INFO ] Computed 4 place invariants in 6 ms
[2021-05-09 10:25:27] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 32/32 transitions.
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Product exploration explored 100000 steps with 50000 reset in 201 ms.
[2021-05-09 10:25:27] [INFO ] Flatten gal took : 2 ms
[2021-05-09 10:25:27] [INFO ] Flatten gal took : 2 ms
[2021-05-09 10:25:27] [INFO ] Time to serialize gal into /tmp/LTL4030895445872732986.gal : 0 ms
[2021-05-09 10:25:27] [INFO ] Time to serialize properties into /tmp/LTL7699930536385109549.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4030895445872732986.gal, -t, CGAL, -LTL, /tmp/LTL7699930536385109549.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4030895445872732986.gal -t CGAL -LTL /tmp/LTL7699930536385109549.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((((updating_0+updating_1)+updating_2)+updating_3)<=(((Message_0+Message_1)+Message_2)+Message_3))")||(F(("((((Acknowledge_0+Acknowledge_1)+Acknowledge_2)+Acknowledge_3)<=(((Message_0+Message_1)+Message_2)+Message_3))")||(G("((((MesBuffReply_0+MesBuffReply_1)+MesBuffReply_2)+MesBuffReply_3)>=1)")))))))
Formula 0 simplified : !X("((((updating_0+updating_1)+updating_2)+updating_3)<=(((Message_0+Message_1)+Message_2)+Message_3))" | F("((((Acknowledge_0+Acknowledge_1)+Acknowledge_2)+Acknowledge_3)<=(((Message_0+Message_1)+Message_2)+Message_3))" | G"((((MesBuffReply_0+MesBuffReply_1)+MesBuffReply_2)+MesBuffReply_3)>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.020613,17156,1,0,6,2473,18,0,693,743,7
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DatabaseWithMutex-COL-02-09 finished in 10623 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 12 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 10:25:28] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 10:25:28] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 10:25:28] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 10:25:28] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 10:25:28] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 10:25:28] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 34/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-COL-02-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ (ADD s16 s17 s18 s19) (ADD s4 s5)), p0:(LEQ (ADD s24 s25) (ADD s20 s21 s22 s23))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-02-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-10 finished in 173 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 14 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 10:25:28] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 10:25:28] [INFO ] Implicit Places using invariants in 15 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 15 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 36 cols
[2021-05-09 10:25:28] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 10:25:28] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 36/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 36 /36 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 36 cols
[2021-05-09 10:25:28] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-09 10:25:28] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 36/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : DatabaseWithMutex-COL-02-11 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GT (ADD s6 s7 s8 s9) (ADD s0 s1 s2 s3)), p1:(GT (ADD s24 s25 s26 s27) (ADD s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-COL-02-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-11 finished in 169 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(X(p1)))))], workingDir=/home/mcc/execution]
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 10:25:28] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 10:25:28] [INFO ] Implicit Places using invariants in 15 ms returned [24, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 10:25:28] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 10:25:28] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 10:25:28] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 10:25:28] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-02-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(LEQ 1 (ADD s28 s29 s30 s31)), p1:(LEQ (ADD s16 s17 s18 s19) (ADD s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Applying partial POR strategy [false, true, false, true, false]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Support contains 10 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 32/32 places, 32/32 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 32 transition count 32
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 20 place count 24 transition count 24
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 24 transition count 24
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 28 rules in 3 ms. Remains 24 /32 variables (removed 8) and now considering 24/32 (removed 8) transitions.
[2021-05-09 10:25:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2021-05-09 10:25:29] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 10:25:29] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/32 places, 24/32 transitions.
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 79 ms.
[2021-05-09 10:25:29] [INFO ] Flatten gal took : 2 ms
[2021-05-09 10:25:29] [INFO ] Flatten gal took : 2 ms
[2021-05-09 10:25:29] [INFO ] Time to serialize gal into /tmp/LTL12997026134495721303.gal : 1 ms
[2021-05-09 10:25:29] [INFO ] Time to serialize properties into /tmp/LTL2988367765799054104.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12997026134495721303.gal, -t, CGAL, -LTL, /tmp/LTL2988367765799054104.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12997026134495721303.gal -t CGAL -LTL /tmp/LTL2988367765799054104.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((((WaitMutex_0+WaitMutex_1)+WaitMutex_2)+WaitMutex_3)>=1)")||(X(X("((((MesBuffReply_0+MesBuffReply_1)+MesBuffReply_2)+MesBuffReply_3)<=(Mutex_0+Mutex_1))"))))))
Formula 0 simplified : !X("((((WaitMutex_0+WaitMutex_1)+WaitMutex_2)+WaitMutex_3)>=1)" | XX"((((MesBuffReply_0+MesBuffReply_1)+MesBuffReply_2)+MesBuffReply_3)<=(Mutex_0+Mutex_1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.020039,16656,1,0,6,2473,14,0,688,743,7
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DatabaseWithMutex-COL-02-13 finished in 1060 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 10:25:29] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 10:25:29] [INFO ] Implicit Places using invariants in 18 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 19 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 36 cols
[2021-05-09 10:25:29] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 10:25:29] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 36/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 36 cols
[2021-05-09 10:25:29] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 10:25:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 36/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-02-14 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ (ADD s6 s7 s8 s9) (ADD s20 s21 s22 s23))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-02-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-14 finished in 255 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(F((p1 U (p2||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 10:25:29] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 10:25:29] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 10:25:29] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 10:25:29] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 10:25:29] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 10:25:29] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 34/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-02-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s24 s25) (ADD s4 s5)), p2:(AND (GT (ADD s24 s25) (ADD s4 s5)) (GT (ADD s4 s5) (ADD s20 s21 s22 s23))), p1:(GT (ADD s4 s5) (ADD s20 s21 s22 s23))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10507 reset in 134 ms.
Stack based approach found an accepted trace after 4545 steps with 490 reset with depth 18 and stack size 18 in 6 ms.
FORMULA DatabaseWithMutex-COL-02-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-15 finished in 274 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620555930945

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="DatabaseWithMutex-COL-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DatabaseWithMutex-COL-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r064-tall-162038397600676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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