Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599300476.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ServersAndClients-PT-100080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599300476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 8.1K Apr 29 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 17:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 17:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 4.9M 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 ServersAndClients-PT-100080-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652973477776

Running Version 202205111006
[2022-05-19 15:17:58] [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-19 15:17:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:17:59] [INFO ] Load time of PNML (sax parser for PT used): 361 ms
[2022-05-19 15:17:59] [INFO ] Transformed 8481 places.
[2022-05-19 15:17:59] [INFO ] Transformed 16200 transitions.
[2022-05-19 15:17:59] [INFO ] Parsed PT model containing 8481 places and 16200 transitions in 514 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ServersAndClients-PT-100080-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1908 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:18:01] [INFO ] Computed 281 place invariants in 234 ms
[2022-05-19 15:18:02] [INFO ] Implicit Places using invariants in 1103 ms returned []
Implicit Place search using SMT only with invariants took 1129 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:18:02] [INFO ] Computed 281 place invariants in 159 ms
[2022-05-19 15:18:14] [INFO ] Dead Transitions using invariants and state equation in 11312 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Support contains 51 out of 8481 places after structural reductions.
[2022-05-19 15:18:15] [INFO ] Flatten gal took : 1033 ms
[2022-05-19 15:18:16] [INFO ] Flatten gal took : 698 ms
[2022-05-19 15:18:17] [INFO ] Input system was already deterministic with 16200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 939 ms. (steps per millisecond=10 ) properties (out of 32) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:18:18] [INFO ] Computed 281 place invariants in 71 ms
[2022-05-19 15:18:20] [INFO ] [Real]Absence check using 181 positive place invariants in 497 ms returned sat
[2022-05-19 15:18:20] [INFO ] [Real]Absence check using 181 positive and 100 generalized place invariants in 147 ms returned sat
[2022-05-19 15:18:33] [INFO ] After 12271ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2022-05-19 15:18:35] [INFO ] After 14285ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1123 ms.
[2022-05-19 15:18:36] [INFO ] After 17845ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3
Finished Parikh walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 3 properties in 31 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7999 transitions
Trivial Post-agglo rules discarded 7999 transitions
Performed 7999 trivial Post agglomeration. Transition count delta: 7999
Iterating post reduction 0 with 7999 rules applied. Total rules applied 7999 place count 8481 transition count 8201
Reduce places removed 8078 places and 0 transitions.
Ensure Unique test removed 7800 transitions
Reduce isomorphic transitions removed 7800 transitions.
Iterating post reduction 1 with 15878 rules applied. Total rules applied 23877 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 23976 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 24273 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 24668 place count 7 transition count 6
Applied a total of 24668 rules in 203 ms. Remains 7 /8481 variables (removed 8474) and now considering 6/16200 (removed 16194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-19 15:18:37] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 15:18:37] [INFO ] Implicit Places using invariants in 83 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 85 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/8481 places, 6/16200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 4 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:18:37] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:18:37] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:18:37] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:18:37] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/8481 places, 3/16200 transitions.
Finished structural reductions, in 2 iterations. Remains : 2/8481 places, 3/16200 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-00 finished in 781 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 2 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7998 transitions
Trivial Post-agglo rules discarded 7998 transitions
Performed 7998 trivial Post agglomeration. Transition count delta: 7998
Iterating post reduction 0 with 7998 rules applied. Total rules applied 7998 place count 8481 transition count 8202
Reduce places removed 8076 places and 0 transitions.
Ensure Unique test removed 7700 transitions
Reduce isomorphic transitions removed 7700 transitions.
Iterating post reduction 1 with 15776 rules applied. Total rules applied 23774 place count 405 transition count 502
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 2 with 198 rules applied. Total rules applied 23972 place count 405 transition count 304
Discarding 98 places :
Implicit places reduction removed 98 places
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 2 with 294 rules applied. Total rules applied 24266 place count 307 transition count 108
Reduce places removed 294 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 3 with 391 rules applied. Total rules applied 24657 place count 13 transition count 11
Applied a total of 24657 rules in 209 ms. Remains 13 /8481 variables (removed 8468) and now considering 11/16200 (removed 16189) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 15:18:38] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-19 15:18:38] [INFO ] Implicit Places using invariants in 55 ms returned [0, 1, 2, 3, 9, 11]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 55 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8481 places, 11/16200 transitions.
Graph (trivial) has 7 edges and 7 vertex of which 5 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Applied a total of 1 rules in 1 ms. Remains 3 /7 variables (removed 4) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:18:38] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:18:38] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:18:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:18:38] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/8481 places, 5/16200 transitions.
Finished structural reductions, in 2 iterations. Remains : 3/8481 places, 5/16200 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-01 finished in 518 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((G(p0) U (X(p0)&&p1))))))'
Support contains 3 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1759 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:18:40] [INFO ] Computed 281 place invariants in 145 ms
[2022-05-19 15:18:41] [INFO ] Implicit Places using invariants in 1102 ms returned []
Implicit Place search using SMT only with invariants took 1116 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:18:41] [INFO ] Computed 281 place invariants in 92 ms
[2022-05-19 15:18:42] [INFO ] Dead Transitions using invariants and state equation in 1226 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 390 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=p1, acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s2315 1), p0:(AND (GEQ s267 1) (GEQ s502 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-02 finished in 4567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(X(G(p0)) U X(!X(p1))))||G(G(!p1))))'
Support contains 4 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1912 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:18:45] [INFO ] Computed 281 place invariants in 82 ms
[2022-05-19 15:18:46] [INFO ] Implicit Places using invariants in 1792 ms returned []
Implicit Place search using SMT only with invariants took 1793 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:18:47] [INFO ] Computed 281 place invariants in 103 ms
[2022-05-19 15:18:59] [INFO ] Dead Transitions using invariants and state equation in 12328 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 606 ms :[true, p0, (NOT p1), false, (NOT p1), false, false, (NOT p1), (AND p0 (NOT p1)), false, (NOT p1), false, p1]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}], [{ cond=(NOT p1), acceptance={} source=3 dest: 12}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 6}, { cond=(AND p1 p0), acceptance={} source=5 dest: 7}], [{ cond=(AND p1 p0), acceptance={} source=6 dest: 8}, { cond=(NOT p1), acceptance={} source=6 dest: 12}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=(AND p1 p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 1}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}], [{ cond=p1, acceptance={} source=9 dest: 10}, { cond=(NOT p1), acceptance={} source=9 dest: 11}], [{ cond=true, acceptance={} source=10 dest: 4}], [{ cond=p1, acceptance={} source=11 dest: 4}, { cond=(NOT p1), acceptance={} source=11 dest: 5}], [{ cond=p1, acceptance={} source=12 dest: 0}, { cond=(NOT p1), acceptance={} source=12 dest: 12}]], initial=9, aps=[p0:(AND (GEQ s377 1) (GEQ s7370 1)), p1:(AND (GEQ s375 1) (GEQ s1512 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 53 steps with 0 reset in 2 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-03 finished in 16730 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1)))'
Support contains 2 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1885 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:19:01] [INFO ] Computed 281 place invariants in 130 ms
[2022-05-19 15:19:03] [INFO ] Implicit Places using invariants in 1698 ms returned []
Implicit Place search using SMT only with invariants took 1721 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:19:03] [INFO ] Computed 281 place invariants in 90 ms
[2022-05-19 15:19:16] [INFO ] Dead Transitions using invariants and state equation in 12626 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(LT s5018 1), p1:(LT s7544 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2562 ms.
Entered a terminal (fully accepting) state of product in 10058 steps with 0 reset in 260 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-06 finished in 19279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(p0) U p0)) U X(p1))))'
Support contains 7 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1933 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:19:21] [INFO ] Computed 281 place invariants in 99 ms
[2022-05-19 15:19:22] [INFO ] Implicit Places using invariants in 1003 ms returned []
Implicit Place search using SMT only with invariants took 1024 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:19:22] [INFO ] Computed 281 place invariants in 91 ms
[2022-05-19 15:19:33] [INFO ] Dead Transitions using invariants and state equation in 11008 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s992 1), p1:(OR (AND (GEQ s151 1) (GEQ s352 1)) (AND (GEQ s393 1) (GEQ s7067 1) (GEQ s223 1) (GEQ s6966 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, 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 ServersAndClients-PT-100080-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-07 finished in 14330 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(p0)))))'
Support contains 1 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1832 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:19:35] [INFO ] Computed 281 place invariants in 95 ms
[2022-05-19 15:19:37] [INFO ] Implicit Places using invariants in 1694 ms returned []
Implicit Place search using SMT only with invariants took 1698 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:19:37] [INFO ] Computed 281 place invariants in 119 ms
[2022-05-19 15:19:38] [INFO ] Dead Transitions using invariants and state equation in 1321 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s2128 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-08 finished in 5086 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(F(p2)&&p1))))'
Support contains 4 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1843 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:19:40] [INFO ] Computed 281 place invariants in 90 ms
[2022-05-19 15:19:42] [INFO ] Implicit Places using invariants in 1692 ms returned []
Implicit Place search using SMT only with invariants took 1719 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:19:42] [INFO ] Computed 281 place invariants in 102 ms
[2022-05-19 15:19:54] [INFO ] Dead Transitions using invariants and state equation in 12410 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s269 1) (GEQ s2118 1)), p2:(OR (LT s269 1) (LT s2118 1)), p0:(AND (GEQ s325 1) (GEQ s6158 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 238 reset in 2690 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-09 finished in 18890 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 5 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1787 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:19:59] [INFO ] Computed 281 place invariants in 91 ms
[2022-05-19 15:20:01] [INFO ] Implicit Places using invariants in 2525 ms returned []
Implicit Place search using SMT only with invariants took 2526 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:20:01] [INFO ] Computed 281 place invariants in 82 ms
[2022-05-19 15:20:03] [INFO ] Dead Transitions using invariants and state equation in 1649 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (NOT (AND (GEQ s385 1) (GEQ s2320 1))) (GEQ s2343 1)), p0:(AND (GEQ s325 1) (GEQ s2421 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 611 steps with 305 reset in 38 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-10 finished in 6186 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1763 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:20:05] [INFO ] Computed 281 place invariants in 67 ms
[2022-05-19 15:20:07] [INFO ] Implicit Places using invariants in 1540 ms returned []
Implicit Place search using SMT only with invariants took 1553 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:20:07] [INFO ] Computed 281 place invariants in 70 ms
[2022-05-19 15:20:18] [INFO ] Dead Transitions using invariants and state equation in 11279 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s343 1) (LT s8077 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 49725 reset in 5919 ms.
Product exploration explored 100000 steps with 49752 reset in 6486 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ServersAndClients-PT-100080-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100080-LTLFireability-11 finished in 27386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U p1))&&F(G(p2)))))'
Support contains 6 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1685 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:20:32] [INFO ] Computed 281 place invariants in 101 ms
[2022-05-19 15:20:34] [INFO ] Implicit Places using invariants in 1669 ms returned []
Implicit Place search using SMT only with invariants took 1683 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:20:34] [INFO ] Computed 281 place invariants in 92 ms
[2022-05-19 15:20:46] [INFO ] Dead Transitions using invariants and state equation in 12208 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s275 1) (GEQ s2825 1)), p0:(AND (GEQ s17 1) (GEQ s218 1)), p2:(AND (GEQ s217 1) (GEQ s401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-12 finished in 15874 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((X((X(F(!p0)) U G(p2)))&&p1))))'
Support contains 5 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7643 transitions
Trivial Post-agglo rules discarded 7643 transitions
Performed 7643 trivial Post agglomeration. Transition count delta: 7643
Iterating post reduction 0 with 7643 rules applied. Total rules applied 7643 place count 8481 transition count 8557
Reduce places removed 7643 places and 0 transitions.
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Iterating post reduction 1 with 7799 rules applied. Total rules applied 15442 place count 838 transition count 8401
Reduce places removed 233 places and 0 transitions.
Ensure Unique test removed 7600 transitions
Reduce isomorphic transitions removed 7600 transitions.
Iterating post reduction 2 with 7833 rules applied. Total rules applied 23275 place count 605 transition count 801
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 23374 place count 605 transition count 702
Applied a total of 23374 rules in 233 ms. Remains 605 /8481 variables (removed 7876) and now considering 702/16200 (removed 15498) transitions.
// Phase 1: matrix 702 rows 605 cols
[2022-05-19 15:20:47] [INFO ] Computed 204 place invariants in 3 ms
[2022-05-19 15:20:47] [INFO ] Implicit Places using invariants in 322 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 401]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 329 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/8481 places, 702/16200 transitions.
Graph (trivial) has 296 edges and 404 vertex of which 197 / 404 are part of one of the 1 SCC in 2 ms
Free SCC test removed 196 places
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Discarding 195 places :
Symmetric choice reduction at 0 with 195 rule applications. Total rules 196 place count 13 transition count 214
Iterating global reduction 0 with 195 rules applied. Total rules applied 391 place count 13 transition count 214
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 585 place count 13 transition count 20
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 587 place count 11 transition count 18
Iterating global reduction 1 with 2 rules applied. Total rules applied 589 place count 11 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 591 place count 10 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 593 place count 8 transition count 15
Iterating global reduction 1 with 2 rules applied. Total rules applied 595 place count 8 transition count 15
Applied a total of 595 rules in 19 ms. Remains 8 /404 variables (removed 396) and now considering 15/702 (removed 687) transitions.
// Phase 1: matrix 15 rows 8 cols
[2022-05-19 15:20:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 15:20:47] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 15 rows 8 cols
[2022-05-19 15:20:47] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 15:20:47] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/8481 places, 15/16200 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/8481 places, 15/16200 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s4 1)), p0:(LT s3 1), p2:(AND (GEQ s0 1) (GEQ s6 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 81 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 6 in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-13 finished in 906 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(X(G(!p0)) U X(p1))||G(p2))))'
Support contains 6 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 3467 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:20:51] [INFO ] Computed 281 place invariants in 73 ms
[2022-05-19 15:20:53] [INFO ] Implicit Places using invariants in 2352 ms returned []
Implicit Place search using SMT only with invariants took 2361 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:20:53] [INFO ] Computed 281 place invariants in 121 ms
[2022-05-19 15:21:04] [INFO ] Dead Transitions using invariants and state equation in 11069 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(OR (LT s211 1) (LT s2724 1)), p1:(AND (GEQ s315 1) (GEQ s4138 1)), p0:(AND (GEQ s275 1) (GEQ s7875 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 243 reset in 2691 ms.
Stack based approach found an accepted trace after 1195 steps with 2 reset with depth 656 and stack size 313 in 35 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-14 finished in 19836 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((X((F(p0)&&p1))||p2))||X(G(p1))))))'
Support contains 4 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2573 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:21:10] [INFO ] Computed 281 place invariants in 106 ms
[2022-05-19 15:21:11] [INFO ] Implicit Places using invariants in 1556 ms returned []
Implicit Place search using SMT only with invariants took 1557 ms to find 0 implicit places.
// Phase 1: matrix 16200 rows 8481 cols
[2022-05-19 15:21:11] [INFO ] Computed 281 place invariants in 83 ms
[2022-05-19 15:21:12] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 392 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 7}]], initial=8, aps=[p0:(LT s763 1), p1:(GEQ s1958 1), p2:(AND (GEQ s265 1) (GEQ s2926 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-15 finished in 5496 ms.
All properties solved by simple procedures.
Total runtime 194288 ms.

BK_STOP 1652973673301

--------------------
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="ServersAndClients-PT-100080"
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 ServersAndClients-PT-100080, 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 r204-oct2-165281599300476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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