Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 179K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 848K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 73K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 545K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 44K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 158K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 149K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Mar 27 10:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 27 10:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 30K Mar 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 159K Mar 25 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.3K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 113K May 5 16:51 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-0100-00
FORMULA_NAME Referendum-PT-0100-01
FORMULA_NAME Referendum-PT-0100-02
FORMULA_NAME Referendum-PT-0100-03
FORMULA_NAME Referendum-PT-0100-04
FORMULA_NAME Referendum-PT-0100-05
FORMULA_NAME Referendum-PT-0100-06
FORMULA_NAME Referendum-PT-0100-07
FORMULA_NAME Referendum-PT-0100-08
FORMULA_NAME Referendum-PT-0100-09
FORMULA_NAME Referendum-PT-0100-10
FORMULA_NAME Referendum-PT-0100-11
FORMULA_NAME Referendum-PT-0100-12
FORMULA_NAME Referendum-PT-0100-13
FORMULA_NAME Referendum-PT-0100-14
FORMULA_NAME Referendum-PT-0100-15

=== Now, execution of the tool begins

BK_START 1621260640360

Running Version 0
[2021-05-17 14:10:41] [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]
[2021-05-17 14:10:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:10:42] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2021-05-17 14:10:42] [INFO ] Transformed 301 places.
[2021-05-17 14:10:42] [INFO ] Transformed 201 transitions.
[2021-05-17 14:10:42] [INFO ] Found NUPN structural information;
[2021-05-17 14:10:42] [INFO ] Parsed PT model containing 301 places and 201 transitions in 101 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:10:42] [INFO ] Initial state test concluded for 4 properties.
FORMULA Referendum-PT-0100-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 301 out of 301 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 9 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 301 cols
[2021-05-17 14:10:42] [INFO ] Computed 100 place invariants in 13 ms
[2021-05-17 14:10:42] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 201 rows 301 cols
[2021-05-17 14:10:42] [INFO ] Computed 100 place invariants in 4 ms
[2021-05-17 14:10:42] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 301 cols
[2021-05-17 14:10:42] [INFO ] Computed 100 place invariants in 2 ms
[2021-05-17 14:10:42] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 201/201 transitions.
[2021-05-17 14:10:42] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 14:10:42] [INFO ] Flatten gal took : 45 ms
FORMULA Referendum-PT-0100-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:10:42] [INFO ] Flatten gal took : 19 ms
[2021-05-17 14:10:42] [INFO ] Input system was already deterministic with 201 transitions.
Incomplete random walk after 100000 steps, including 980 resets, run finished after 955 ms. (steps per millisecond=104 ) properties (out of 18) seen :16
Running SMT prover for 2 properties.
// Phase 1: matrix 201 rows 301 cols
[2021-05-17 14:10:43] [INFO ] Computed 100 place invariants in 6 ms
[2021-05-17 14:10:44] [INFO ] [Real]Absence check using 100 positive place invariants in 25 ms returned sat
[2021-05-17 14:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:10:44] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-17 14:10:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:10:44] [INFO ] [Real]Absence check using 100 positive place invariants in 14 ms returned sat
[2021-05-17 14:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:10:44] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-17 14:10:44] [INFO ] Solution in real domain found non-integer solution.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2021-05-17 14:10:44] [INFO ] Initial state test concluded for 1 properties.
FORMULA Referendum-PT-0100-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 300 out of 301 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 301 cols
[2021-05-17 14:10:44] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-17 14:10:44] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 201 rows 301 cols
[2021-05-17 14:10:44] [INFO ] Computed 100 place invariants in 4 ms
[2021-05-17 14:10:44] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 301 cols
[2021-05-17 14:10:44] [INFO ] Computed 100 place invariants in 2 ms
[2021-05-17 14:10:44] [INFO ] Dead Transitions using invariants and state equation in 119 ms returned []
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0100-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100)) (LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100))), p0:(GT (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200) (ADD s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s284 s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 218 steps with 13 reset in 20 ms.
FORMULA Referendum-PT-0100-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-00 finished in 555 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&X((p1&&X(X(G(p2)))))) U p3))], workingDir=/home/mcc/execution]
Support contains 201 out of 301 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 201 transition count 201
Applied a total of 100 rules in 4 ms. Remains 201 /301 variables (removed 100) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 201 cols
[2021-05-17 14:10:45] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:45] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 201 rows 201 cols
[2021-05-17 14:10:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:45] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 201 cols
[2021-05-17 14:10:45] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:45] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 201/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p3), true, (OR (AND (NOT p1) p3) (AND p1 (NOT p2)) (AND p0 (NOT p1))), (NOT p2), (NOT p2)]
Running random walk in product with property : Referendum-PT-0100-01 automaton TGBA [mat=[[{ cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p3 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ s0 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200)), p0:(GT 3 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200)), p1:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100)), p2:(LEQ 2 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 5 steps with 1 reset in 0 ms.
FORMULA Referendum-PT-0100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-01 finished in 448 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 100 out of 301 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 300 rules applied. Total rules applied 300 place count 101 transition count 101
Applied a total of 300 rules in 1 ms. Remains 101 /301 variables (removed 200) and now considering 101/201 (removed 100) transitions.
// Phase 1: matrix 101 rows 101 cols
[2021-05-17 14:10:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:45] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2021-05-17 14:10:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:45] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 101 cols
[2021-05-17 14:10:45] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:45] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 101/301 places, 101/201 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-02 automaton TGBA [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 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 100 steps with 0 reset in 2 ms.
FORMULA Referendum-PT-0100-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-02 finished in 154 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(!p0))], workingDir=/home/mcc/execution]
Support contains 100 out of 301 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 301/301 places, 201/201 transitions.
Graph (complete) has 300 edges and 301 vertex of which 101 are kept as prefixes of interest. Removing 200 places using SCC suffix rule.2 ms
Discarding 200 places :
Also discarding 0 output transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 101 transition count 101
Applied a total of 101 rules in 7 ms. Remains 101 /301 variables (removed 200) and now considering 101/201 (removed 100) transitions.
// Phase 1: matrix 101 rows 101 cols
[2021-05-17 14:10:45] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:45] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2021-05-17 14:10:45] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:45] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2021-05-17 14:10:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2021-05-17 14:10:45] [INFO ] Computed 0 place invariants in 5 ms
[2021-05-17 14:10:45] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 101/301 places, 101/201 transitions.
Stuttering acceptance computed with spot in 30 ms :[true, p0]
Running random walk in product with property : Referendum-PT-0100-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-03 finished in 192 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((X((p1 U (p2||G(p1))))&&p0))))], workingDir=/home/mcc/execution]
Support contains 300 out of 301 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 301 cols
[2021-05-17 14:10:45] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-17 14:10:45] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 201 rows 301 cols
[2021-05-17 14:10:45] [INFO ] Computed 100 place invariants in 0 ms
[2021-05-17 14:10:46] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 301 cols
[2021-05-17 14:10:46] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-17 14:10:46] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-PT-0100-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100) (ADD s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s284 s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300)) (GT 1 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200))), p2:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100) (ADD s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s284 s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300)), p1:(GT 1 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 3 ms.
FORMULA Referendum-PT-0100-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-04 finished in 557 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((G(p1)&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 201 out of 301 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 201 transition count 201
Applied a total of 100 rules in 7 ms. Remains 201 /301 variables (removed 100) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 201 cols
[2021-05-17 14:10:46] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:46] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 201 rows 201 cols
[2021-05-17 14:10:46] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:46] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 201 cols
[2021-05-17 14:10:46] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:46] [INFO ] Dead Transitions using invariants and state equation in 136 ms returned []
Finished structural reductions, in 1 iterations. Remains : 201/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Referendum-PT-0100-05 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 1}, { cond=(NOT p1), acceptance={0} source=5 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p1:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100) (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200)), p0:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100) s0), p2:(GT 1 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 72 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0100-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-05 finished in 481 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(X(X(F(!p0)))))&&(p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 201 out of 301 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 7 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 301 cols
[2021-05-17 14:10:46] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-17 14:10:46] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 201 rows 301 cols
[2021-05-17 14:10:46] [INFO ] Computed 100 place invariants in 2 ms
[2021-05-17 14:10:47] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 301 cols
[2021-05-17 14:10:47] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-17 14:10:47] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, p0, (AND (NOT p1) (NOT p0)), p0, p0, p0]
Running random walk in product with property : Referendum-PT-0100-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GT (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200) (ADD s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s284 s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300)) (LEQ s0 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200))), p0:(GT (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200) (ADD s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s284 s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, 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-0100-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-06 finished in 543 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 200 out of 301 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 201 transition count 201
Applied a total of 100 rules in 1 ms. Remains 201 /301 variables (removed 100) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 201 cols
[2021-05-17 14:10:47] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:47] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 201 rows 201 cols
[2021-05-17 14:10:47] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:47] [INFO ] Implicit Places using invariants and state equation in 87 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
[2021-05-17 14:10:47] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:47] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Finished structural reductions, in 1 iterations. Remains : 201/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 59 ms :[p0, p0]
Running random walk in product with property : Referendum-PT-0100-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100) (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1450 reset in 1275 ms.
Product exploration explored 100000 steps with 1452 reset in 1300 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA Referendum-PT-0100-07 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-PT-0100-07 finished in 3011 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 301 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 300 rules applied. Total rules applied 300 place count 101 transition count 101
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 398 place count 3 transition count 3
Iterating global reduction 1 with 98 rules applied. Total rules applied 496 place count 3 transition count 3
Applied a total of 496 rules in 6 ms. Remains 3 /301 variables (removed 298) and now considering 3/201 (removed 198) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:10:50] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:50] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:10:50] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:10:50] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:10:50] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:10:50] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/301 places, 3/201 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(AND (NEQ s0 0) (NEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0100-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-08 finished in 199 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621260651353

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-0100"
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-0100, 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 r178-tajo-162089416000548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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