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-165281572200395.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-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572200395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 12K Apr 29 14:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 29 14:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 29 14:47 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.4K May 9 08:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 9 08:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K 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 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 Referendum-PT-0010-LTLCardinality-00
FORMULA_NAME Referendum-PT-0010-LTLCardinality-01
FORMULA_NAME Referendum-PT-0010-LTLCardinality-02
FORMULA_NAME Referendum-PT-0010-LTLCardinality-03
FORMULA_NAME Referendum-PT-0010-LTLCardinality-04
FORMULA_NAME Referendum-PT-0010-LTLCardinality-05
FORMULA_NAME Referendum-PT-0010-LTLCardinality-06
FORMULA_NAME Referendum-PT-0010-LTLCardinality-07
FORMULA_NAME Referendum-PT-0010-LTLCardinality-08
FORMULA_NAME Referendum-PT-0010-LTLCardinality-09
FORMULA_NAME Referendum-PT-0010-LTLCardinality-10
FORMULA_NAME Referendum-PT-0010-LTLCardinality-11
FORMULA_NAME Referendum-PT-0010-LTLCardinality-12
FORMULA_NAME Referendum-PT-0010-LTLCardinality-13
FORMULA_NAME Referendum-PT-0010-LTLCardinality-14
FORMULA_NAME Referendum-PT-0010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653083416829

Running Version 202205111006
[2022-05-20 21:50:18] [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:50:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:50:18] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2022-05-20 21:50:18] [INFO ] Transformed 31 places.
[2022-05-20 21:50:18] [INFO ] Transformed 21 transitions.
[2022-05-20 21:50:18] [INFO ] Found NUPN structural information;
[2022-05-20 21:50:18] [INFO ] Parsed PT model containing 31 places and 21 transitions in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Referendum-PT-0010-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 11 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2022-05-20 21:50:18] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-20 21:50:18] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2022-05-20 21:50:18] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-20 21:50:18] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 31 cols
[2022-05-20 21:50:18] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-20 21:50:18] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 21/21 transitions.
Support contains 31 out of 31 places after structural reductions.
[2022-05-20 21:50:18] [INFO ] Flatten gal took : 15 ms
[2022-05-20 21:50:18] [INFO ] Flatten gal took : 5 ms
[2022-05-20 21:50:18] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10000 steps, including 833 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 21 rows 31 cols
[2022-05-20 21:50:18] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-20 21:50:18] [INFO ] After 25ms 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.
FORMULA Referendum-PT-0010-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Referendum-PT-0010-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA Referendum-PT-0010-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 31 stabilizing places and 21 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 21
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' '!((G(F(X((X(p0)&&p0)))) U F(p1)))'
Support contains 21 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2022-05-20 21:50:19] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-20 21:50:19] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2022-05-20 21:50:19] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 21:50:19] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-20 21:50:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2022-05-20 21:50:19] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-20 21:50:19] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1)]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (LEQ 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)) (LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) s0) (LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD...], 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][true]]
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 1 ms.
FORMULA Referendum-PT-0010-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLCardinality-03 finished in 271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 21 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2022-05-20 21:50:19] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 21:50:19] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2022-05-20 21:50:19] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-20 21:50:19] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2022-05-20 21:50:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2022-05-20 21:50:19] [INFO ] Computed 10 place invariants in 8 ms
[2022-05-20 21:50:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLCardinality-06 finished in 261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(F(p0) U p1))||X(F(p2))))'
Support contains 31 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2022-05-20 21:50:19] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 21:50:19] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2022-05-20 21:50:19] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-20 21:50:19] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 31 cols
[2022-05-20 21:50:19] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-20 21:50:19] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1 p0), (AND (NOT p2) p0)]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(LEQ s0 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30)), p0:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s...], 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, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 696 steps with 117 reset in 10 ms.
FORMULA Referendum-PT-0010-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLCardinality-07 finished in 272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&G(F(G(p1)))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 14 transition count 14
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 8 transition count 8
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 8 transition count 8
Applied a total of 36 rules in 4 ms. Remains 8 /31 variables (removed 23) and now considering 8/21 (removed 13) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 21:50:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:19] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 21:50:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:19] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 21:50:19] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:19] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/31 places, 8/21 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/31 places, 8/21 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s0 0) (EQ s1 1)), p1:(AND (EQ s3 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], 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-0010-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLCardinality-10 finished in 182 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 12 transition count 12
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 5 transition count 5
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 5 transition count 5
Applied a total of 42 rules in 2 ms. Remains 5 /31 variables (removed 26) and now considering 5/21 (removed 16) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:50:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:20] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:50:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:20] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:50:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:20] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/31 places, 5/21 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/31 places, 5/21 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(EQ s0 1), p1:(OR (EQ s1 0) (EQ s3 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 2 reset in 1 ms.
FORMULA Referendum-PT-0010-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLCardinality-12 finished in 288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 3 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Applied a total of 2 rules in 10 ms. Remains 3 /31 variables (removed 28) and now considering 3/21 (removed 18) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:50:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:20] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:50:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:50:20] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-20 21:50:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:50:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:50:20] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/31 places, 3/21 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/31 places, 3/21 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 40007 reset in 153 ms.
Product exploration explored 100000 steps with 40000 reset in 120 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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 : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0010-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0010-LTLCardinality-15 finished in 550 ms.
All properties solved by simple procedures.
Total runtime 2805 ms.

BK_STOP 1653083421235

--------------------
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="Referendum-PT-0010"
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-0010, 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-165281572200395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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