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-165281599600659.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-PT-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599600659
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 20K Apr 30 09:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 30 09:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 30 09:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 142K Apr 30 09:41 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 11K May 9 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K May 9 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 9 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 9 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K May 9 08:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 83K 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-PT-000005-LTLCardinality-00
FORMULA_NAME SharedMemory-PT-000005-LTLCardinality-01
FORMULA_NAME SharedMemory-PT-000005-LTLCardinality-02
FORMULA_NAME SharedMemory-PT-000005-LTLCardinality-03
FORMULA_NAME SharedMemory-PT-000005-LTLCardinality-04
FORMULA_NAME SharedMemory-PT-000005-LTLCardinality-05
FORMULA_NAME SharedMemory-PT-000005-LTLCardinality-06
FORMULA_NAME SharedMemory-PT-000005-LTLCardinality-07
FORMULA_NAME SharedMemory-PT-000005-LTLCardinality-08
FORMULA_NAME SharedMemory-PT-000005-LTLCardinality-09
FORMULA_NAME SharedMemory-PT-000005-LTLCardinality-10
FORMULA_NAME SharedMemory-PT-000005-LTLCardinality-11
FORMULA_NAME SharedMemory-PT-000005-LTLCardinality-12
FORMULA_NAME SharedMemory-PT-000005-LTLCardinality-13
FORMULA_NAME SharedMemory-PT-000005-LTLCardinality-14
FORMULA_NAME SharedMemory-PT-000005-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652982212916

Running Version 202205111006
[2022-05-19 17:43:34] [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 17:43:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 17:43:34] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2022-05-19 17:43:34] [INFO ] Transformed 41 places.
[2022-05-19 17:43:34] [INFO ] Transformed 55 transitions.
[2022-05-19 17:43:34] [INFO ] Found NUPN structural information;
[2022-05-19 17:43:34] [INFO ] Parsed PT model containing 41 places and 55 transitions in 156 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA SharedMemory-PT-000005-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000005-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000005-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000005-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 5 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:34] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-19 17:43:34] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:34] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-19 17:43:34] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:34] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-19 17:43:34] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Support contains 41 out of 41 places after structural reductions.
[2022-05-19 17:43:34] [INFO ] Flatten gal took : 40 ms
[2022-05-19 17:43:34] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA SharedMemory-PT-000005-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 17:43:34] [INFO ] Flatten gal took : 21 ms
[2022-05-19 17:43:34] [INFO ] Input system was already deterministic with 55 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 21) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:35] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-19 17:43:35] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-19 17:43:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-19 17:43:35] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA SharedMemory-PT-000005-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000005-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000005-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(G(F(G(G((X(p0)||p1))))))'
Support contains 21 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:36] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-19 17:43:36] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:36] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:36] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:36] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-19 17:43:36] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SharedMemory-PT-000005-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s19 0) (LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s20))), p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 318 ms.
Stack based approach found an accepted trace after 74 steps with 0 reset with depth 75 and stack size 70 in 0 ms.
FORMULA SharedMemory-PT-000005-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000005-LTLCardinality-00 finished in 798 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F((p0 U p0)))||G(p1))))))'
Support contains 26 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:36] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:36] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:36] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:36] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:36] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:36] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000005-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s19 1), p0:(LEQ (ADD s25 s27 s28 s31 s32) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8907 reset in 287 ms.
Stack based approach found an accepted trace after 108 steps with 9 reset with depth 10 and stack size 10 in 1 ms.
FORMULA SharedMemory-PT-000005-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000005-LTLCardinality-03 finished in 656 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(!(false U false)))'
Support contains 0 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 35
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 20 edges and 15 vertex of which 15 / 15 are part of one of the 5 SCC in 2 ms
Free SCC test removed 10 places
Iterating post reduction 1 with 42 rules applied. Total rules applied 62 place count 5 transition count 20
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 86 place count 0 transition count 1
Applied a total of 86 rules in 19 ms. Remains 0 /41 variables (removed 41) and now considering 1/55 (removed 54) transitions.
[2022-05-19 17:43:37] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 17:43:37] [INFO ] Implicit Places using invariants in 7 ms returned []
[2022-05-19 17:43:37] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 17:43:37] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-19 17:43:37] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 17:43:37] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 17:43:37] [INFO ] Dead Transitions using invariants and state equation in 9 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 0/41 places, 1/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 0/41 places, 1/55 transitions.
Stuttering acceptance computed with spot in 9 ms :[false]
Running random walk in product with property : SharedMemory-PT-000005-LTLCardinality-06 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA SharedMemory-PT-000005-LTLCardinality-06 TRUE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000005-LTLCardinality-06 finished in 128 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(((G(p0)&&p1)||p2))||G(!p1))))'
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:37] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:37] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:37] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:37] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:37] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:37] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : SharedMemory-PT-000005-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ (ADD s34 s37 s38 s39 s40) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s20)), p1:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 16995 reset in 282 ms.
Product exploration explored 100000 steps with 17114 reset in 281 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 p2 (NOT p1) p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 443 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 55 rows 41 cols
[2022-05-19 17:43:39] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:39] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) p1 (NOT p2))))
Knowledge based reduction with 8 factoid took 370 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA SharedMemory-PT-000005-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-PT-000005-LTLCardinality-07 finished in 2196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(X(F(X(p1))))))'
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:39] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:39] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:39] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:39] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:39] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:39] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : SharedMemory-PT-000005-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s21 1), p0:(OR (EQ s35 0) (EQ s16 1) (EQ s19 1))], 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 31581 reset in 105 ms.
Stack based approach found an accepted trace after 195 steps with 61 reset with depth 7 and stack size 7 in 0 ms.
FORMULA SharedMemory-PT-000005-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000005-LTLCardinality-10 finished in 406 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:40] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:40] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:40] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-19 17:43:40] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:40] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:40] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000005-LTLCardinality-12 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:(OR (EQ s32 0) (EQ s19 1))], 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 5 steps with 0 reset in 0 ms.
FORMULA SharedMemory-PT-000005-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000005-LTLCardinality-12 finished in 283 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(F(p1))||p0)))'
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:40] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:40] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:40] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-19 17:43:40] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-19 17:43:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:40] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:40] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SharedMemory-PT-000005-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s32 0) (EQ s19 1)), p1:(OR (EQ s32 0) (EQ s19 1))], 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 5099 reset in 141 ms.
Stack based approach found an accepted trace after 553 steps with 30 reset with depth 9 and stack size 9 in 1 ms.
FORMULA SharedMemory-PT-000005-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000005-LTLCardinality-13 finished in 334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 41 transition count 46
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 20 place count 32 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 30 transition count 44
Applied a total of 22 rules in 4 ms. Remains 30 /41 variables (removed 11) and now considering 44/55 (removed 11) transitions.
[2022-05-19 17:43:40] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 30 cols
[2022-05-19 17:43:40] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-19 17:43:40] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 30 cols
[2022-05-19 17:43:40] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:40] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-19 17:43:40] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 17:43:40] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 30 cols
[2022-05-19 17:43:40] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-19 17:43:40] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/41 places, 44/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/41 places, 44/55 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p1)]
Running random walk in product with property : SharedMemory-PT-000005-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (NOT (OR (EQ s12 0) (EQ s24 1))) (OR (EQ s16 0) (EQ s6 1))), p0:(OR (EQ s2 0) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 170 steps with 17 reset in 2 ms.
FORMULA SharedMemory-PT-000005-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000005-LTLCardinality-14 finished in 166 ms.
All properties solved by simple procedures.
Total runtime 6921 ms.

BK_STOP 1652982220997

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-PT-000005"
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-PT-000005, 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-165281599600659"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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