Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572200403.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 Referendum-PT-0015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572200403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 24K Apr 29 14:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 166K Apr 29 14:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 29 14:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 29 14:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K May 9 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 18K 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 Referendum-PT-0015-LTLCardinality-00
FORMULA_NAME Referendum-PT-0015-LTLCardinality-01
FORMULA_NAME Referendum-PT-0015-LTLCardinality-02
FORMULA_NAME Referendum-PT-0015-LTLCardinality-03
FORMULA_NAME Referendum-PT-0015-LTLCardinality-04
FORMULA_NAME Referendum-PT-0015-LTLCardinality-05
FORMULA_NAME Referendum-PT-0015-LTLCardinality-06
FORMULA_NAME Referendum-PT-0015-LTLCardinality-07
FORMULA_NAME Referendum-PT-0015-LTLCardinality-08
FORMULA_NAME Referendum-PT-0015-LTLCardinality-09
FORMULA_NAME Referendum-PT-0015-LTLCardinality-10
FORMULA_NAME Referendum-PT-0015-LTLCardinality-11
FORMULA_NAME Referendum-PT-0015-LTLCardinality-12
FORMULA_NAME Referendum-PT-0015-LTLCardinality-13
FORMULA_NAME Referendum-PT-0015-LTLCardinality-14
FORMULA_NAME Referendum-PT-0015-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653083488410

Running Version 202205111006
[2022-05-20 21:51:29] [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-20 21:51:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:51:29] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2022-05-20 21:51:29] [INFO ] Transformed 46 places.
[2022-05-20 21:51:30] [INFO ] Transformed 31 transitions.
[2022-05-20 21:51:30] [INFO ] Found NUPN structural information;
[2022-05-20 21:51:30] [INFO ] Parsed PT model containing 46 places and 31 transitions in 216 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA Referendum-PT-0015-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 6 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 46 cols
[2022-05-20 21:51:30] [INFO ] Computed 15 place invariants in 6 ms
[2022-05-20 21:51:30] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 31 rows 46 cols
[2022-05-20 21:51:30] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 21:51:30] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 46 cols
[2022-05-20 21:51:30] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 21:51:30] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 31/31 transitions.
Support contains 46 out of 46 places after structural reductions.
[2022-05-20 21:51:30] [INFO ] Flatten gal took : 16 ms
[2022-05-20 21:51:30] [INFO ] Flatten gal took : 5 ms
[2022-05-20 21:51:30] [INFO ] Input system was already deterministic with 31 transitions.
Finished random walk after 70 steps, including 4 resets, run visited all 19 properties in 19 ms. (steps per millisecond=3 )
FORMULA Referendum-PT-0015-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 46 stabilizing places and 31 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 31
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(p0) U !(!(G(p1)||p1)&&p0))))'
Support contains 31 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 46 cols
[2022-05-20 21:51:31] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 21:51:31] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 31 rows 46 cols
[2022-05-20 21:51:31] [INFO ] Computed 15 place invariants in 10 ms
[2022-05-20 21:51:31] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 46 cols
[2022-05-20 21:51:31] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 21:51:31] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 338 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p0)]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30) (ADD s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45)), p0:(EQ s0 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 1 ms.
FORMULA Referendum-PT-0015-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-00 finished in 595 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(X(X(G(p1)))||X(p2)))))'
Support contains 46 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 46 cols
[2022-05-20 21:51:31] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 21:51:31] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 31 rows 46 cols
[2022-05-20 21:51:31] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 21:51:31] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 46 cols
[2022-05-20 21:51:31] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 21:51:31] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1), true]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 (ADD s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45)), p2:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15) s0), p1:(GT ...], 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]]
Stuttering criterion allowed to conclude after 284 steps with 59 reset in 7 ms.
FORMULA Referendum-PT-0015-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-02 finished in 471 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&G(p1))))'
Support contains 30 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /46 variables (removed 1) and now considering 30/31 (removed 1) transitions.
// Phase 1: matrix 30 rows 45 cols
[2022-05-20 21:51:32] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 21:51:32] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 30 rows 45 cols
[2022-05-20 21:51:32] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 21:51:32] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-05-20 21:51:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 45 cols
[2022-05-20 21:51:32] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 21:51:32] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/46 places, 30/31 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(GT (ADD s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29) (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44)), p0:(GT 1 (ADD...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0015-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-03 finished in 226 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(p0)))||X(F(p1))))'
Support contains 30 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 31 transition count 31
Applied a total of 15 rules in 1 ms. Remains 31 /46 variables (removed 15) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 31 cols
[2022-05-20 21:51:32] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:51:32] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 31 rows 31 cols
[2022-05-20 21:51:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:51:32] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 31 cols
[2022-05-20 21:51:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:51:32] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/46 places, 31/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15) (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30)), p1:(AND (LEQ 1 (ADD s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 314 ms.
Product exploration explored 100000 steps with 33333 reset in 235 ms.
Computed a total of 31 stabilizing places and 31 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 31
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1))
Knowledge based reduction with 7 factoid took 195 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0015-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0015-LTLCardinality-04 finished in 977 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 30 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 46 cols
[2022-05-20 21:51:33] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 21:51:33] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 31 rows 46 cols
[2022-05-20 21:51:33] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 21:51:33] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 46 cols
[2022-05-20 21:51:33] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 21:51:33] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-06 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 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30) (ADD s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45))], 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 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0015-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-06 finished in 149 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(G((p0 U p1)))))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 4 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 4 transition count 4
Applied a total of 3 rules in 4 ms. Remains 4 /46 variables (removed 42) and now considering 4/31 (removed 27) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:51:33] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:51:33] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:51:33] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:51:33] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-20 21:51:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:51:33] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:51:33] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/46 places, 4/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/46 places, 4/31 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s2 1) (OR (EQ s0 0) (EQ s3 1))), p0:(OR (EQ s0 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0015-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-10 finished in 140 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((F((G(p0)||p0))||p1)))))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 20 transition count 19
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 49 place count 9 transition count 8
Iterating global reduction 1 with 11 rules applied. Total rules applied 60 place count 9 transition count 8
Applied a total of 60 rules in 2 ms. Remains 9 /46 variables (removed 37) and now considering 8/31 (removed 23) transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 21:51:33] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:51:33] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 21:51:33] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:51:33] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 21:51:33] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:51:33] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9/46 places, 8/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/46 places, 8/31 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s8 0) (EQ s6 1) (EQ s5 0)), p0:(AND (EQ s7 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0015-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-11 finished in 201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(F(G(F(p0))))))&&X(p1)))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 19 transition count 19
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 9 transition count 9
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 9 transition count 9
Applied a total of 59 rules in 1 ms. Remains 9 /46 variables (removed 37) and now considering 9/31 (removed 22) transitions.
// Phase 1: matrix 9 rows 9 cols
[2022-05-20 21:51:33] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:51:33] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-20 21:51:33] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:51:33] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 9 rows 9 cols
[2022-05-20 21:51:33] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:51:33] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9/46 places, 9/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/46 places, 9/31 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s5 0) (EQ s0 1)), p0:(AND (OR (EQ s2 0) (EQ s8 1)) (OR (EQ s0 0) (EQ s6 1)) (OR (EQ s7 0) (EQ s0 1)))], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0015-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-12 finished in 239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((X((X(p2)||p1))&&X(G(p3)))||p0))))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 19 transition count 19
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 9 transition count 9
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 9 transition count 9
Applied a total of 59 rules in 1 ms. Remains 9 /46 variables (removed 37) and now considering 9/31 (removed 22) transitions.
// Phase 1: matrix 9 rows 9 cols
[2022-05-20 21:51:34] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:51:34] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-20 21:51:34] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:51:34] [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 9 rows 9 cols
[2022-05-20 21:51:34] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:51:34] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9/46 places, 9/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/46 places, 9/31 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p3 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s5 1)), p3:(OR (EQ s0 0) (EQ s7 1)), p1:(OR (EQ s0 0) (EQ s5 1)), p2:(OR (EQ s8 0) (EQ s6 1))], 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 50000 reset in 164 ms.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) p2), (X p0), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (G p0)), (F (G p3)), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 9 factoid took 132 ms. Reduced automaton from 5 states, 10 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0015-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0015-LTLCardinality-13 finished in 858 ms.
All properties solved by simple procedures.
Total runtime 5177 ms.

BK_STOP 1653083495358

--------------------
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="Referendum-PT-0015"
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 Referendum-PT-0015, 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 r186-tajo-165281572200403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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