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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 202K Apr 29 15:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 976K Apr 29 15:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 117K Apr 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 872K 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 85K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 278K May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 37K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 197K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 38K 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 228K 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-0200-LTLFireability-00
FORMULA_NAME Referendum-PT-0200-LTLFireability-01
FORMULA_NAME Referendum-PT-0200-LTLFireability-02
FORMULA_NAME Referendum-PT-0200-LTLFireability-03
FORMULA_NAME Referendum-PT-0200-LTLFireability-04
FORMULA_NAME Referendum-PT-0200-LTLFireability-05
FORMULA_NAME Referendum-PT-0200-LTLFireability-06
FORMULA_NAME Referendum-PT-0200-LTLFireability-07
FORMULA_NAME Referendum-PT-0200-LTLFireability-08
FORMULA_NAME Referendum-PT-0200-LTLFireability-09
FORMULA_NAME Referendum-PT-0200-LTLFireability-10
FORMULA_NAME Referendum-PT-0200-LTLFireability-11
FORMULA_NAME Referendum-PT-0200-LTLFireability-12
FORMULA_NAME Referendum-PT-0200-LTLFireability-13
FORMULA_NAME Referendum-PT-0200-LTLFireability-14
FORMULA_NAME Referendum-PT-0200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653083694710

Running Version 202205111006
[2022-05-20 21:54:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:54:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:54:56] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2022-05-20 21:54:56] [INFO ] Transformed 601 places.
[2022-05-20 21:54:56] [INFO ] Transformed 401 transitions.
[2022-05-20 21:54:56] [INFO ] Found NUPN structural information;
[2022-05-20 21:54:56] [INFO ] Parsed PT model containing 601 places and 401 transitions in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Referendum-PT-0200-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 201 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 400 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 600 rules applied. Total rules applied 600 place count 201 transition count 201
Applied a total of 600 rules in 11 ms. Remains 201 /601 variables (removed 400) and now considering 201/401 (removed 200) transitions.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:56] [INFO ] Computed 0 place invariants in 8 ms
[2022-05-20 21:54:56] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:56] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:54:56] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:56] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-20 21:54:56] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 201/601 places, 201/401 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/601 places, 201/401 transitions.
Support contains 201 out of 201 places after structural reductions.
[2022-05-20 21:54:56] [INFO ] Flatten gal took : 50 ms
[2022-05-20 21:54:57] [INFO ] Flatten gal took : 24 ms
[2022-05-20 21:54:57] [INFO ] Input system was already deterministic with 201 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:57] [INFO ] Computed 0 place invariants in 9 ms
[2022-05-20 21:54:57] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-20 21:54:58] [INFO ] After 283ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA Referendum-PT-0200-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 201 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 201 transition count 201
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Referendum-PT-0200-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 200 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 201 /201 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:58] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:58] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:58] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:58] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:58] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 21:54:58] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 201/201 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s1 1) (NEQ s131 1) (NEQ s66 1) (NEQ s196 1) (NEQ s9 1) (NEQ s139 1) (NEQ s74 1) (NEQ s17 1) (NEQ s147 1) (NEQ s82 1) (NEQ s25 1) (NEQ s155 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][false, false]]
Product exploration explored 100000 steps with 495 reset in 801 ms.
Product exploration explored 100000 steps with 495 reset in 692 ms.
Computed a total of 201 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 201 transition count 201
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 : [p0, (X (NOT p0)), (X (X (NOT 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 113 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0200-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLFireability-01 finished in 2225 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(F(p1)))||p0)))'
Support contains 201 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:55:00] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:55:00] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:55:00] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 21:55:00] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:55:00] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:55:00] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 201/201 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s131 1) (EQ s66 1) (EQ s196 1) (EQ s9 1) (EQ s139 1) (EQ s74 1) (EQ s17 1) (EQ s147 1) (EQ s82 1) (EQ s25 1) (EQ s155 1) (EQ s90 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]]
Product exploration explored 100000 steps with 50000 reset in 633 ms.
Product exploration explored 100000 steps with 50000 reset in 662 ms.
Computed a total of 201 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 201 transition count 201
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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 196 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0200-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLFireability-03 finished in 2097 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Graph (complete) has 200 edges and 201 vertex of which 1 are kept as prefixes of interest. Removing 200 places using SCC suffix rule.1 ms
Discarding 200 places :
Also discarding 200 output transitions
Drop transitions removed 200 transitions
Applied a total of 1 rules in 7 ms. Remains 1 /201 variables (removed 200) and now considering 1/201 (removed 200) transitions.
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:55:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:02] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:55:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:02] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-20 21:55:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:55:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:02] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/201 places, 1/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/201 places, 1/201 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0200-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLFireability-04 finished in 139 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(F(X((!p0 U !F(G(F(p1)))))))&&G(!p0)))))'
Support contains 201 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Applied a total of 0 rules in 5 ms. Remains 201 /201 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:55:02] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:55:02] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:55:02] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:55:03] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2022-05-20 21:55:03] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:55:03] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:55:03] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 201/201 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR p0 p1), p1]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s1 1) (NEQ s131 1) (NEQ s66 1) (NEQ s196 1) (NEQ s9 1) (NEQ s139 1) (NEQ s74 1) (NEQ s17 1) (NEQ s147 1) (NEQ s82 1) (NEQ s25 1) (NEQ s155 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 4 ms.
FORMULA Referendum-PT-0200-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLFireability-05 finished in 446 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(X(p0)))&&(G((X(p2)&&G(p2)))||p1))))'
Support contains 200 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Applied a total of 0 rules in 1 ms. Remains 201 /201 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:55:03] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:55:03] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:55:03] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 21:55:03] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:55:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:03] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 201/201 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(OR p1 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s1 1) (EQ s131 1) (EQ s66 1) (EQ s196 1) (EQ s9 1) (EQ s139 1) (EQ s74 1) (EQ s17 1) (EQ s147 1) (EQ s82 1) (EQ s25 1) (EQ s155 1) (EQ s90 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0200-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLFireability-07 finished in 521 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0) U X(p1))||p0)))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 198 place count 3 transition count 3
Iterating global reduction 0 with 198 rules applied. Total rules applied 396 place count 3 transition count 3
Applied a total of 396 rules in 5 ms. Remains 3 /201 variables (removed 198) and now considering 3/201 (removed 198) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:55:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:03] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:55:03] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:55:03] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:55:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:03] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/201 places, 3/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/201 places, 3/201 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s2 1), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0200-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLFireability-08 finished in 173 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(p0 U p1))))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Graph (complete) has 200 edges and 201 vertex of which 2 are kept as prefixes of interest. Removing 199 places using SCC suffix rule.0 ms
Discarding 199 places :
Also discarding 199 output transitions
Drop transitions removed 199 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /201 variables (removed 199) and now considering 2/201 (removed 199) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:55:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:04] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:55:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:04] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-20 21:55:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:55:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:04] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/201 places, 2/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/201 places, 2/201 transitions.
Stuttering acceptance computed with spot in 85 ms :[p1, p1]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s0 1), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 33333 reset in 58 ms.
Product exploration explored 100000 steps with 33333 reset in 82 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
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 p1 (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 7 factoid took 170 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0200-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLFireability-09 finished in 522 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)||X((p2 U ((p2&&G(!p3))||G(p2))))))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 196 places :
Symmetric choice reduction at 0 with 196 rule applications. Total rules 196 place count 5 transition count 5
Iterating global reduction 0 with 196 rules applied. Total rules applied 392 place count 5 transition count 5
Applied a total of 392 rules in 3 ms. Remains 5 /201 variables (removed 196) and now considering 5/201 (removed 196) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:55:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:04] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:55:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:04] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:55:04] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:55:04] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/201 places, 5/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/201 places, 5/201 transitions.
Stuttering acceptance computed with spot in 920 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2) p3), (NOT p1), (AND (NOT p1) (NOT p2) p3), (AND (NOT p0) p3), (AND (NOT p1) p3)]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p3 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p3 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p3 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p3 p2), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) p3), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(EQ s4 1), p0:(NEQ s3 1), p3:(EQ s0 1), p2:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
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 p1) p0 p3 p2), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) p3 p2))), (X (NOT (AND (NOT p1) p3 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) p3 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p3 p2)))), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 22 factoid took 1052 ms. Reduced automaton from 9 states, 32 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0200-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLFireability-10 finished in 2318 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(((X(p0) U G(p1))||p1)))||G((F(p0) U p0))))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 198 place count 3 transition count 3
Iterating global reduction 0 with 198 rules applied. Total rules applied 396 place count 3 transition count 3
Applied a total of 396 rules in 6 ms. Remains 3 /201 variables (removed 198) and now considering 3/201 (removed 198) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:55:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:06] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:55:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:06] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:55:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:07] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/201 places, 3/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/201 places, 3/201 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s2 1), p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 68 ms.
Product exploration explored 100000 steps with 50000 reset in 65 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 : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 282 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0200-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLFireability-12 finished in 814 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||p0)))'
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 199 place count 2 transition count 2
Iterating global reduction 0 with 199 rules applied. Total rules applied 398 place count 2 transition count 2
Applied a total of 398 rules in 5 ms. Remains 2 /201 variables (removed 199) and now considering 2/201 (removed 199) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:55:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:07] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:55:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:07] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:55:07] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:55:07] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/201 places, 2/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/201 places, 2/201 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 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][false, false]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0200-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLFireability-14 finished in 198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U G(p1)) U G((p2 U p3))))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Graph (complete) has 200 edges and 201 vertex of which 4 are kept as prefixes of interest. Removing 197 places using SCC suffix rule.1 ms
Discarding 197 places :
Also discarding 197 output transitions
Drop transitions removed 197 transitions
Applied a total of 1 rules in 4 ms. Remains 4 /201 variables (removed 197) and now considering 4/201 (removed 197) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:55:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:07] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:55:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:07] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-20 21:55:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:55:07] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 21:55:07] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/201 places, 4/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/201 places, 4/201 transitions.
Stuttering acceptance computed with spot in 553 ms :[(NOT p3), true, (AND p1 (NOT p0)), (NOT p1), (NOT p1), (NOT p3), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p1) (AND p3 p0) (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(OR (AND p3 (NOT p1) (NOT p0)) (AND p2 (NOT p1) (NOT p0))), acceptance={} source=0 dest: 6}, { cond=(OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)), acceptance={0} source=0 dest: 8}, { cond=(OR (AND p3 (NOT p1) p0) (AND p2 (NOT p1) p0)), acceptance={} source=0 dest: 9}, { cond=(OR (AND p3 p1 (NOT p0)) (AND p2 p1 (NOT p0))), acceptance={} source=0 dest: 11}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 5}, { cond=(OR p3 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2 p1 p0), acceptance={} source=7 dest: 7}], [{ cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=8 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=8 dest: 7}, { cond=(OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(OR (AND p3 p1 (NOT p0)) (AND p2 p1 (NOT p0))), acceptance={} source=9 dest: 6}, { cond=(OR (AND p3 p1 p0) (AND p2 p1 p0)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p3) p2 p1 p0), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=11 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=11 dest: 5}, { cond=(OR (AND p3 (NOT p1) p0) (AND p2 (NOT p1) p0)), acceptance={} source=11 dest: 6}, { cond=(OR (AND p3 p1 p0) (AND p2 p1 p0)), acceptance={} source=11 dest: 11}]], initial=0, aps=[p3:(EQ s2 1), p1:(EQ s0 1), p0:(EQ s1 1), p2:(AND (EQ s3 1) (NEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLFireability-15 finished in 672 ms.
All properties solved by simple procedures.
Total runtime 12582 ms.

BK_STOP 1653083708966

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-0200"
export BK_EXAMINATION="LTLFireability"
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-0200, examination is LTLFireability"
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-165281572300436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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