Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599400555.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SharedMemory-COL-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599400555
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 7.1K Apr 30 10:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 30 10:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 09:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 09:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 12K May 10 09:34 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 SharedMemory-COL-000010-LTLCardinality-00
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-01
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-02
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-03
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-04
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-05
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-06
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-07
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-08
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-09
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-10
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-11
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-12
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-13
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-14
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652977798871

Running Version 202205111006
[2022-05-19 16:30:00] [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]
[2022-05-19 16:30:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 16:30:00] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 16:30:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 16:30:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 508 ms
[2022-05-19 16:30:00] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 141 PT places and 320.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 16:30:00] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 6 ms.
[2022-05-19 16:30:00] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA SharedMemory-COL-000010-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 20) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 5 rows 6 cols
[2022-05-19 16:30:01] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-19 16:30:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 16:30:01] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2022-05-19 16:30:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 16:30:01] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA SharedMemory-COL-000010-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 16:30:02] [INFO ] Flatten gal took : 11 ms
[2022-05-19 16:30:02] [INFO ] Flatten gal took : 1 ms
Domain [P(10), P(10)] of place Ext_Mem_Acc breaks symmetries in sort P
[2022-05-19 16:30:02] [INFO ] Unfolded HLPN to a Petri net with 141 places and 220 transitions 840 arcs in 11 ms.
[2022-05-19 16:30:02] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 10 transitions.
Support contains 131 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:02] [INFO ] Computed 21 place invariants in 6 ms
[2022-05-19 16:30:02] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:02] [INFO ] Computed 21 place invariants in 8 ms
[2022-05-19 16:30:02] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:02] [INFO ] Computed 21 place invariants in 8 ms
[2022-05-19 16:30:02] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Support contains 131 out of 131 places after structural reductions.
[2022-05-19 16:30:02] [INFO ] Flatten gal took : 18 ms
[2022-05-19 16:30:02] [INFO ] Flatten gal took : 15 ms
[2022-05-19 16:30:02] [INFO ] Input system was already deterministic with 210 transitions.
Support contains 130 out of 131 places (down from 131) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:02] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:02] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2022-05-19 16:30:02] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-19 16:30:02] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2022-05-19 16:30:02] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((true U X(p0)))'
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:02] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:02] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:02] [INFO ] Computed 21 place invariants in 10 ms
[2022-05-19 16:30:03] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:03] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:03] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 7462 reset in 320 ms.
Stack based approach found an accepted trace after 15 steps with 1 reset with depth 12 and stack size 12 in 1 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-00 finished in 778 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(X(p0)))||G(p1))))'
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 131 transition count 120
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (trivial) has 20 edges and 30 vertex of which 20 / 30 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 places
Iterating post reduction 1 with 182 rules applied. Total rules applied 272 place count 20 transition count 40
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 282 place count 20 transition count 30
Applied a total of 282 rules in 16 ms. Remains 20 /131 variables (removed 111) and now considering 30/210 (removed 180) transitions.
[2022-05-19 16:30:03] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
// Phase 1: matrix 21 rows 20 cols
[2022-05-19 16:30:03] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 16:30:03] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-19 16:30:03] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
// Phase 1: matrix 21 rows 20 cols
[2022-05-19 16:30:03] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 16:30:03] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-19 16:30:03] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 16:30:03] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
// Phase 1: matrix 21 rows 20 cols
[2022-05-19 16:30:03] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 16:30:03] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/131 places, 30/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/131 places, 30/210 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SharedMemory-COL-000010-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9)), p0:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9))], 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 0 reset in 172 ms.
Product exploration explored 100000 steps with 0 reset in 147 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 16:30:04] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
// Phase 1: matrix 21 rows 20 cols
[2022-05-19 16:30:04] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 16:30:04] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 171 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SharedMemory-COL-000010-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-COL-000010-LTLCardinality-05 finished in 1018 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Support contains 20 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 131 transition count 120
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 181 rules applied. Total rules applied 271 place count 30 transition count 40
Applied a total of 271 rules in 11 ms. Remains 30 /131 variables (removed 101) and now considering 40/210 (removed 170) transitions.
// Phase 1: matrix 40 rows 30 cols
[2022-05-19 16:30:04] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 16:30:04] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 40 rows 30 cols
[2022-05-19 16:30:04] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 16:30:04] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2022-05-19 16:30:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 40 rows 30 cols
[2022-05-19 16:30:04] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 16:30:04] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/131 places, 40/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/131 places, 40/210 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLCardinality-06 automaton TGBA Formula[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:(AND (GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9)) (GT 1 (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s19)))], 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 86 reset in 150 ms.
Stack based approach found an accepted trace after 19 steps with 2 reset with depth 11 and stack size 11 in 0 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-06 finished in 338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F((G(X(p1))&&F(p2))))))'
Support contains 20 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:05] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:05] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:05] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:05] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:05] [INFO ] Computed 21 place invariants in 8 ms
[2022-05-19 16:30:05] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
Running random walk in product with property : SharedMemory-COL-000010-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s19)), p2:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9)), p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 612 ms.
Stack based approach found an accepted trace after 659 steps with 0 reset with depth 660 and stack size 578 in 4 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-07 finished in 1078 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U G(G(!(X(p0)||p1)))))))'
Support contains 110 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:06] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:06] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:06] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:06] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:06] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:06] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR p0 p1), (OR p0 p1), true, (OR p0 p1)]
Running random walk in product with property : SharedMemory-COL-000010-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 2 (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39)), p0:(LEQ (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-09 finished in 356 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(p0)||G(!p0)||p0))))'
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:06] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:06] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:06] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:06] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:06] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:06] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, p0, false, false, false]
Running random walk in product with property : SharedMemory-COL-000010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(GT 2 (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-13 finished in 390 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 7 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:06] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:06] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:06] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:06] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:06] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-19 16:30:07] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 1 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-14 finished in 276 ms.
All properties solved by simple procedures.
Total runtime 7016 ms.

BK_STOP 1652977807189

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SharedMemory-COL-000010"
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 SharedMemory-COL-000010, 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 r204-oct2-165281599400555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-COL-000010.tgz
mv SharedMemory-COL-000010 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 ;