Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918800659.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 CSRepetitions-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918800659
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.1M
-rw-r--r-- 1 mcc users 267K Apr 30 06:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 871K Apr 30 06:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 324K Apr 30 06:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 30 06:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 278K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 695K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 296K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 893K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 32K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.2M May 10 09:33 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 CSRepetitions-PT-10-LTLCardinality-00
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-01
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-02
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-03
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-04
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-05
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-06
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-07
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-08
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-09
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-10
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-11
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-12
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-13
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-14
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652675282366

Running Version 202205111006
[2022-05-16 04:28:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 04:28:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 04:28:03] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2022-05-16 04:28:03] [INFO ] Transformed 1311 places.
[2022-05-16 04:28:03] [INFO ] Transformed 2300 transitions.
[2022-05-16 04:28:03] [INFO ] Parsed PT model containing 1311 places and 2300 transitions in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 96 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CSRepetitions-PT-10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 48 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:04] [INFO ] Computed 110 place invariants in 61 ms
[2022-05-16 04:28:04] [INFO ] Implicit Places using invariants in 360 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:04] [INFO ] Computed 110 place invariants in 18 ms
[2022-05-16 04:28:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:28:05] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:05] [INFO ] Computed 110 place invariants in 20 ms
[2022-05-16 04:28:06] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Support contains 1211 out of 1311 places after structural reductions.
[2022-05-16 04:28:09] [INFO ] Flatten gal took : 194 ms
[2022-05-16 04:28:09] [INFO ] Flatten gal took : 133 ms
[2022-05-16 04:28:09] [INFO ] Input system was already deterministic with 2300 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 21) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:10] [INFO ] Computed 110 place invariants in 22 ms
[2022-05-16 04:28:10] [INFO ] [Real]Absence check using 110 positive place invariants in 37 ms returned sat
[2022-05-16 04:28:10] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-16 04:28:10] [INFO ] [Nat]Absence check using 110 positive place invariants in 31 ms returned sat
[2022-05-16 04:28:11] [INFO ] After 612ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2022-05-16 04:28:11] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:28:11] [INFO ] After 82ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2022-05-16 04:28:11] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2022-05-16 04:28:11] [INFO ] After 1125ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 8 ms.
FORMULA CSRepetitions-PT-10-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CSRepetitions-PT-10-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-PT-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(p0))'
Support contains 100 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 242 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:12] [INFO ] Computed 110 place invariants in 22 ms
[2022-05-16 04:28:12] [INFO ] Implicit Places using invariants in 614 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:12] [INFO ] Computed 110 place invariants in 20 ms
[2022-05-16 04:28:13] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:28:15] [INFO ] Implicit Places using invariants and state equation in 2140 ms returned []
Implicit Place search using SMT with State Equation took 2765 ms to find 0 implicit places.
[2022-05-16 04:28:15] [INFO ] Redundant transitions in 177 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:15] [INFO ] Computed 110 place invariants in 17 ms
[2022-05-16 04:28:16] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s3 s6 s8 s35 s38 s41 s45 s51 s63 s65 s79 s98 s106 s148 s156 s167 s168 s203 s209 s210 s222 s259 s273 s284 s286 s316 s317 s327 s340 s347 s349...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 1296 ms.
Product exploration explored 100000 steps with 50000 reset in 1218 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 : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-PT-10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-10-LTLCardinality-00 finished in 6945 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||X((X(p1) U p2))))'
Support contains 1101 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 32 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:19] [INFO ] Computed 110 place invariants in 20 ms
[2022-05-16 04:28:19] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:19] [INFO ] Computed 110 place invariants in 16 ms
[2022-05-16 04:28:20] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:28:20] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1608 ms to find 0 implicit places.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:20] [INFO ] Computed 110 place invariants in 18 ms
[2022-05-16 04:28:21] [INFO ] Dead Transitions using invariants and state equation in 927 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 2 (ADD s1 s2 s4 s5 s7 s9 s10 s11 s12 s13 s14 s15 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s36 s37 s39 s40 s42 s43 s4...], 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 50000 reset in 974 ms.
Product exploration explored 100000 steps with 50000 reset in 996 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 : [(AND p0 p2 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p0))))
Knowledge based reduction with 4 factoid took 68 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-PT-10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-10-LTLCardinality-03 finished in 5002 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G((!(p0 U (p1 U G(p2)))||p3))))))'
Support contains 110 out of 1311 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 65 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:24] [INFO ] Computed 110 place invariants in 19 ms
[2022-05-16 04:28:24] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:24] [INFO ] Computed 110 place invariants in 33 ms
[2022-05-16 04:28:24] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:28:25] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
[2022-05-16 04:28:25] [INFO ] Redundant transitions in 154 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:25] [INFO ] Computed 110 place invariants in 19 ms
[2022-05-16 04:28:26] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p3) p2), (AND (NOT p3) p2)]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p3 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(GT 3 (ADD s3 s6 s8 s35 s38 s41 s45 s51 s63 s65 s79 s98 s106 s148 s156 s167 s168 s203 s209 s210 s222 s259 s273 s284 s286 s316 s317 s327 s340 s347 s349 ...], 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 228 steps with 0 reset in 6 ms.
FORMULA CSRepetitions-PT-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLCardinality-05 finished in 2223 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(G(X(p0)) U !X(!p1))||p2)))'
Support contains 200 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 38 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:26] [INFO ] Computed 110 place invariants in 20 ms
[2022-05-16 04:28:26] [INFO ] Implicit Places using invariants in 548 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:26] [INFO ] Computed 110 place invariants in 14 ms
[2022-05-16 04:28:27] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:28:28] [INFO ] Implicit Places using invariants and state equation in 2220 ms returned []
Implicit Place search using SMT with State Equation took 2771 ms to find 0 implicit places.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:29] [INFO ] Computed 110 place invariants in 16 ms
[2022-05-16 04:28:29] [INFO ] Dead Transitions using invariants and state equation in 935 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1 p0)]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GT 3 (ADD s44 s70 s73 s88 s115 s124 s130 s147 s159 s161 s174 s185 s189 s226 s232 s249 s255 s264 s268 s274 s279 s281 s343 s348 s390 s397 s407 s408 s433...], nbAcceptance=1, 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 1152 reset in 3607 ms.
Product exploration explored 100000 steps with 1147 reset in 3626 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 : [(AND (NOT p2) p1 p0), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (AND (NOT p2) p1))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 183 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 104 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (AND (NOT p2) p1))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 541 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 109 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 107 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:28:38] [INFO ] Computed 110 place invariants in 20 ms
[2022-05-16 04:28:45] [INFO ] [Real]Absence check using 110 positive place invariants in 217 ms returned sat
[2022-05-16 04:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:28:51] [INFO ] [Real]Absence check using state equation in 6103 ms returned sat
[2022-05-16 04:28:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:28:56] [INFO ] [Nat]Absence check using 110 positive place invariants in 120 ms returned sat
[2022-05-16 04:28:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:29:01] [INFO ] [Nat]Absence check using state equation in 5192 ms returned sat
[2022-05-16 04:29:01] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:29:01] [INFO ] [Nat]Added 100 Read/Feed constraints in 146 ms returned sat
[2022-05-16 04:29:01] [INFO ] Computed and/alt/rep : 2200/3200/2200 causal constraints (skipped 0 transitions) in 126 ms.
[2022-05-16 04:29:02] [INFO ] Added : 29 causal constraints over 6 iterations in 951 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Support contains 200 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 33 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:29:02] [INFO ] Computed 110 place invariants in 20 ms
[2022-05-16 04:29:03] [INFO ] Implicit Places using invariants in 512 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:29:03] [INFO ] Computed 110 place invariants in 14 ms
[2022-05-16 04:29:03] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:29:05] [INFO ] Implicit Places using invariants and state equation in 2078 ms returned []
Implicit Place search using SMT with State Equation took 2591 ms to find 0 implicit places.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:29:05] [INFO ] Computed 110 place invariants in 24 ms
[2022-05-16 04:29:05] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 694 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 109 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 280 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 105 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 92 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:29:07] [INFO ] Computed 110 place invariants in 24 ms
[2022-05-16 04:29:13] [INFO ] [Real]Absence check using 110 positive place invariants in 209 ms returned sat
[2022-05-16 04:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:29:19] [INFO ] [Real]Absence check using state equation in 6161 ms returned sat
[2022-05-16 04:29:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:29:25] [INFO ] [Nat]Absence check using 110 positive place invariants in 128 ms returned sat
[2022-05-16 04:29:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:29:30] [INFO ] [Nat]Absence check using state equation in 5379 ms returned sat
[2022-05-16 04:29:30] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:29:30] [INFO ] [Nat]Added 100 Read/Feed constraints in 159 ms returned sat
[2022-05-16 04:29:30] [INFO ] Computed and/alt/rep : 2200/3200/2200 causal constraints (skipped 0 transitions) in 164 ms.
[2022-05-16 04:29:31] [INFO ] Added : 29 causal constraints over 6 iterations in 954 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 122 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Product exploration explored 100000 steps with 1157 reset in 3406 ms.
Product exploration explored 100000 steps with 1147 reset in 3482 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 121 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Support contains 200 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 160 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2022-05-16 04:29:39] [INFO ] Redundant transitions in 92 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:29:39] [INFO ] Computed 110 place invariants in 19 ms
[2022-05-16 04:29:40] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Product exploration explored 100000 steps with 1146 reset in 3360 ms.
Product exploration explored 100000 steps with 1160 reset in 3349 ms.
Built C files in :
/tmp/ltsmin7006172292128472599
[2022-05-16 04:29:46] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7006172292128472599
Running compilation step : cd /tmp/ltsmin7006172292128472599;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7006172292128472599;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7006172292128472599;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 200 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 40 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:29:50] [INFO ] Computed 110 place invariants in 14 ms
[2022-05-16 04:29:51] [INFO ] Implicit Places using invariants in 554 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:29:51] [INFO ] Computed 110 place invariants in 22 ms
[2022-05-16 04:29:52] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:29:53] [INFO ] Implicit Places using invariants and state equation in 2070 ms returned []
Implicit Place search using SMT with State Equation took 2627 ms to find 0 implicit places.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:29:53] [INFO ] Computed 110 place invariants in 18 ms
[2022-05-16 04:29:54] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Built C files in :
/tmp/ltsmin14172526874838439768
[2022-05-16 04:29:54] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14172526874838439768
Running compilation step : cd /tmp/ltsmin14172526874838439768;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14172526874838439768;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14172526874838439768;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 04:29:57] [INFO ] Flatten gal took : 105 ms
[2022-05-16 04:29:57] [INFO ] Flatten gal took : 89 ms
[2022-05-16 04:29:57] [INFO ] Time to serialize gal into /tmp/LTL271037981404078373.gal : 24 ms
[2022-05-16 04:29:57] [INFO ] Time to serialize properties into /tmp/LTL6474335637910932338.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL271037981404078373.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6474335637910932338.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2710379...265
Read 1 LTL properties
Checking formula 0 : !((F((!((G(X("((((((((Client_Sending_55+Client_Sending_63)+(Client_Sending_97+Client_Sending_78))+((Client_Sending_50+Client_Sending_2...8030
Formula 0 simplified : !F("((((((((Client_Waiting_76+Client_Waiting_74)+(Client_Waiting_67+Client_Waiting_81))+((Client_Waiting_36+Client_Waiting_25)+(Clie...8015
Detected timeout of ITS tools.
[2022-05-16 04:30:12] [INFO ] Flatten gal took : 82 ms
[2022-05-16 04:30:12] [INFO ] Applying decomposition
[2022-05-16 04:30:12] [INFO ] Flatten gal took : 85 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3864327316275486913.txt' '-o' '/tmp/graph3864327316275486913.bin' '-w' '/tmp/graph3864327316275486913.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3864327316275486913.bin' '-l' '-1' '-v' '-w' '/tmp/graph3864327316275486913.weights' '-q' '0' '-e' '0.001'
[2022-05-16 04:30:13] [INFO ] Decomposing Gal with order
[2022-05-16 04:30:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 04:30:15] [INFO ] Removed a total of 2100 redundant transitions.
[2022-05-16 04:30:15] [INFO ] Flatten gal took : 1358 ms
[2022-05-16 04:30:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 1600 labels/synchronizations in 126 ms.
[2022-05-16 04:30:16] [INFO ] Time to serialize gal into /tmp/LTL12318054400791153612.gal : 27 ms
[2022-05-16 04:30:16] [INFO ] Time to serialize properties into /tmp/LTL10539964918508444551.ltl : 864 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12318054400791153612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10539964918508444551.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1231805...268
Read 1 LTL properties
Checking formula 0 : !((F((!((G(X("((((((((gu0.Client_Sending_55+gu0.Client_Sending_63)+(gu0.Client_Sending_97+gu0.Client_Sending_78))+((gu0.Client_Sending...9630
Formula 0 simplified : !F("((((((((gu1.Client_Waiting_76+gu1.Client_Waiting_74)+(gu1.Client_Waiting_67+gu1.Client_Waiting_81))+((gu1.Client_Waiting_36+gu1....9615
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin112905891424456127
[2022-05-16 04:30:31] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin112905891424456127
Running compilation step : cd /tmp/ltsmin112905891424456127;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin112905891424456127;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin112905891424456127;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CSRepetitions-PT-10-LTLCardinality-06 finished in 128785 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)&&p0))))'
Support contains 110 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 35 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:30:35] [INFO ] Computed 110 place invariants in 22 ms
[2022-05-16 04:30:35] [INFO ] Implicit Places using invariants in 569 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:30:35] [INFO ] Computed 110 place invariants in 23 ms
[2022-05-16 04:30:36] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:30:37] [INFO ] Implicit Places using invariants and state equation in 2290 ms returned []
Implicit Place search using SMT with State Equation took 2861 ms to find 0 implicit places.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:30:37] [INFO ] Computed 110 place invariants in 19 ms
[2022-05-16 04:30:38] [INFO ] Dead Transitions using invariants and state equation in 927 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s44 s70 s73 s88 s115 s124 s130 s147 s159 s161 s174 s185 s189 s226 s232 s249 s255 s264 s268 s274 s279 s281 s343 s348 s390 s397 s407 s408 s433 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLCardinality-07 finished in 4035 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0) U false))||!(!p0 U G(p0))))'
Support contains 1 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 297 rules applied. Total rules applied 297 place count 1113 transition count 2201
Discarding 980 places :
Symmetric choice reduction at 0 with 980 rule applications. Total rules 1277 place count 133 transition count 1221
Iterating global reduction 0 with 980 rules applied. Total rules applied 2257 place count 133 transition count 1221
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 2347 place count 43 transition count 231
Iterating global reduction 0 with 90 rules applied. Total rules applied 2437 place count 43 transition count 231
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 2527 place count 43 transition count 141
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 2547 place count 33 transition count 131
Applied a total of 2547 rules in 199 ms. Remains 33 /1311 variables (removed 1278) and now considering 131/2300 (removed 2169) transitions.
[2022-05-16 04:30:39] [INFO ] Flow matrix only has 50 transitions (discarded 81 similar events)
// Phase 1: matrix 50 rows 33 cols
[2022-05-16 04:30:39] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 04:30:39] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-16 04:30:39] [INFO ] Flow matrix only has 50 transitions (discarded 81 similar events)
// Phase 1: matrix 50 rows 33 cols
[2022-05-16 04:30:39] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 04:30:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 04:30:39] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-05-16 04:30:39] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-16 04:30:39] [INFO ] Flow matrix only has 50 transitions (discarded 81 similar events)
// Phase 1: matrix 50 rows 33 cols
[2022-05-16 04:30:39] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 04:30:39] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/1311 places, 131/2300 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/1311 places, 131/2300 transitions.
Stuttering acceptance computed with spot in 58 ms :[p0, p0]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, 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 1 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7247 reset in 183 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA CSRepetitions-PT-10-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-10-LTLCardinality-08 finished in 617 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0&&(G(p1)||p2)) U X(p3)))))'
Support contains 7 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 49 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:30:39] [INFO ] Computed 110 place invariants in 16 ms
[2022-05-16 04:30:40] [INFO ] Implicit Places using invariants in 568 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:30:40] [INFO ] Computed 110 place invariants in 19 ms
[2022-05-16 04:30:40] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:30:42] [INFO ] Implicit Places using invariants and state equation in 2452 ms returned []
Implicit Place search using SMT with State Equation took 3020 ms to find 0 implicit places.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:30:42] [INFO ] Computed 110 place invariants in 16 ms
[2022-05-16 04:30:43] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 673 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={1} source=1 dest: 2}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p3))), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1) (NOT p3)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2 p1 (NOT p3)), acceptance={1} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={1} source=3 dest: 2}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={1} source=4 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 p1), acceptance={1} source=4 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1} source=5 dest: 1}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p3))), acceptance={1} source=5 dest: 2}, { cond=(AND p0 p2 (NOT p1) (NOT p3)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p2 p1 (NOT p3)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s180 s917), p2:(LEQ s342 s323), p1:(OR (LEQ s342 s542) (LEQ s342 s452)), p3:(LEQ s947 s342)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33245 reset in 1084 ms.
Product exploration explored 100000 steps with 33330 reset in 1110 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 : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X (NOT (AND p0 (NOT p2) p1 (NOT p3)))), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p3))))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))))), (X (NOT (AND p0 p2 (NOT p1) (NOT p3)))), (X p3), (X (NOT (AND p1 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3)))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X p3)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p2) p1))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1 (NOT p3))))), true, (X (X (NOT (AND p0 p2 p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p3)))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (OR (NOT p0) (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 2775 ms. Reduced automaton from 6 states, 27 edges and 4 AP to 6 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 377 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 55 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:30:50] [INFO ] Computed 110 place invariants in 19 ms
[2022-05-16 04:30:50] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 04:30:50] [INFO ] [Nat]Absence check using 110 positive place invariants in 26 ms returned sat
[2022-05-16 04:30:50] [INFO ] After 302ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X (NOT (AND p0 (NOT p2) p1 (NOT p3)))), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p3))))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))))), (X (NOT (AND p0 p2 (NOT p1) (NOT p3)))), (X p3), (X (NOT (AND p1 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3)))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X p3)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p2) p1))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1 (NOT p3))))), true, (X (X (NOT (AND p0 p2 p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p3)))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (G (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p3))))), (G (NOT (AND (NOT p1) (NOT p3)))), (G (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (G (NOT (AND (NOT p1) p2 p0 (NOT p3))))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p0) (NOT p3)))), (F (OR (AND p1 (NOT p2)) (AND p1 (NOT p0)))), (F (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))))), (F (NOT p3)), (F p1), (F (OR (AND p1 p0 (NOT p3)) (AND p2 p0 (NOT p3)))), (F (AND p1 p2 p0 (NOT p3))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (F (AND p1 p2 p0)), (F (OR (AND p1 p0) (AND p2 p0))), (F (AND (NOT p1) p2 p0)), (F (AND p1 (NOT p2) p0)), (F (AND p1 (NOT p3)))]
Knowledge based reduction with 34 factoid took 2393 ms. Reduced automaton from 6 states, 27 edges and 4 AP to 6 states, 20 edges and 4 AP.
Stuttering acceptance computed with spot in 298 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 817 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 7 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 70 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:30:54] [INFO ] Computed 110 place invariants in 24 ms
[2022-05-16 04:30:55] [INFO ] Implicit Places using invariants in 608 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:30:55] [INFO ] Computed 110 place invariants in 19 ms
[2022-05-16 04:30:55] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:30:57] [INFO ] Implicit Places using invariants and state equation in 2574 ms returned []
Implicit Place search using SMT with State Equation took 3184 ms to find 0 implicit places.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:30:57] [INFO ] Computed 110 place invariants in 18 ms
[2022-05-16 04:30:58] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (OR (AND p1 p0) (AND p0 p2)))), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X (OR (NOT p0) p2 p3)), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (OR (NOT p0) p2 p3))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 (NOT p2)))))), (X (X (NOT (OR p1 (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (OR (AND p1 p0) (AND p0 p2))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1694 ms. Reduced automaton from 6 states, 20 edges and 4 AP to 6 states, 20 edges and 4 AP.
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 52 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:31:00] [INFO ] Computed 110 place invariants in 21 ms
[2022-05-16 04:31:01] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 04:31:01] [INFO ] [Nat]Absence check using 110 positive place invariants in 24 ms returned sat
[2022-05-16 04:31:01] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (OR (AND p1 p0) (AND p0 p2)))), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X (OR (NOT p0) p2 p3)), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (OR (NOT p0) p2 p3))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 (NOT p2)))))), (X (X (NOT (OR p1 (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (OR (AND p1 p0) (AND p0 p2))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (G (OR (NOT p0) p2 p3))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (F p1), (F (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))), (F (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))), (F (OR (AND p0 p1) (AND p0 p2))), (F (AND p0 p2 (NOT p3))), (F (AND p0 p1 p2)), (F (AND (NOT p0) (NOT p3))), (F (AND p0 p1 (NOT p2))), (F (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (F (OR (AND (NOT p0) (NOT p3)) p1 (AND p2 (NOT p3)))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 22 factoid took 1653 ms. Reduced automaton from 6 states, 20 edges and 4 AP to 6 states, 20 edges and 4 AP.
Stuttering acceptance computed with spot in 238 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 262 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 253 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 33375 reset in 1035 ms.
Product exploration explored 100000 steps with 33327 reset in 1097 ms.
Built C files in :
/tmp/ltsmin5393980818876925331
[2022-05-16 04:31:05] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5393980818876925331
Running compilation step : cd /tmp/ltsmin5393980818876925331;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5393980818876925331;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5393980818876925331;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 7 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 53 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:31:09] [INFO ] Computed 110 place invariants in 21 ms
[2022-05-16 04:31:09] [INFO ] Implicit Places using invariants in 613 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:31:09] [INFO ] Computed 110 place invariants in 14 ms
[2022-05-16 04:31:10] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:31:12] [INFO ] Implicit Places using invariants and state equation in 2508 ms returned []
Implicit Place search using SMT with State Equation took 3123 ms to find 0 implicit places.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:31:12] [INFO ] Computed 110 place invariants in 22 ms
[2022-05-16 04:31:12] [INFO ] Dead Transitions using invariants and state equation in 850 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Built C files in :
/tmp/ltsmin5646160987299315232
[2022-05-16 04:31:13] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5646160987299315232
Running compilation step : cd /tmp/ltsmin5646160987299315232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5646160987299315232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5646160987299315232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 04:31:16] [INFO ] Flatten gal took : 86 ms
[2022-05-16 04:31:16] [INFO ] Flatten gal took : 83 ms
[2022-05-16 04:31:16] [INFO ] Time to serialize gal into /tmp/LTL2978789673768499815.gal : 59 ms
[2022-05-16 04:31:16] [INFO ] Time to serialize properties into /tmp/LTL35534141871335403.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2978789673768499815.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL35534141871335403.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2978789...264
Read 1 LTL properties
Checking formula 0 : !((F(G((("(Server_Waiting_1<=Server_Anwering_39_10)")&&((G("((RequestBufferSlots<=Server_Waiting_6)||(RequestBufferSlots<=Server_Anwer...265
Formula 0 simplified : !FG(("(Server_Waiting_1<=Server_Anwering_39_10)" & ("(RequestBufferSlots<=Server_Waiting_9)" | G"((RequestBufferSlots<=Server_Waitin...253
Detected timeout of ITS tools.
[2022-05-16 04:31:31] [INFO ] Flatten gal took : 75 ms
[2022-05-16 04:31:31] [INFO ] Applying decomposition
[2022-05-16 04:31:31] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1101495684270433296.txt' '-o' '/tmp/graph1101495684270433296.bin' '-w' '/tmp/graph1101495684270433296.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1101495684270433296.bin' '-l' '-1' '-v' '-w' '/tmp/graph1101495684270433296.weights' '-q' '0' '-e' '0.001'
[2022-05-16 04:31:31] [INFO ] Decomposing Gal with order
[2022-05-16 04:31:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 04:31:31] [INFO ] Removed a total of 2872 redundant transitions.
[2022-05-16 04:31:32] [INFO ] Flatten gal took : 167 ms
[2022-05-16 04:31:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1293 labels/synchronizations in 57 ms.
[2022-05-16 04:31:32] [INFO ] Time to serialize gal into /tmp/LTL3749299972092388087.gal : 9 ms
[2022-05-16 04:31:32] [INFO ] Time to serialize properties into /tmp/LTL9666112949196036764.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3749299972092388087.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9666112949196036764.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3749299...266
Read 1 LTL properties
Checking formula 0 : !((F(G((("(gu20.Server_Waiting_1<=gu20.Server_Anwering_39_10)")&&((G("((gu46.RequestBufferSlots<=gu46.Server_Waiting_6)||(gu46.Request...315
Formula 0 simplified : !FG(("(gu20.Server_Waiting_1<=gu20.Server_Anwering_39_10)" & ("(gu46.RequestBufferSlots<=gu46.Server_Waiting_9)" | G"((gu46.RequestB...303
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3838600202903861513
[2022-05-16 04:31:47] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3838600202903861513
Running compilation step : cd /tmp/ltsmin3838600202903861513;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3838600202903861513;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3838600202903861513;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CSRepetitions-PT-10-LTLCardinality-14 finished in 70733 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(G(X(p0)) U !X(!p1))||p2)))'
Found a CL insensitive property : CSRepetitions-PT-10-LTLCardinality-06
Stuttering acceptance computed with spot in 119 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1 p0)]
Support contains 200 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 70 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:31:50] [INFO ] Computed 110 place invariants in 14 ms
[2022-05-16 04:31:51] [INFO ] Implicit Places using invariants in 505 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:31:51] [INFO ] Computed 110 place invariants in 18 ms
[2022-05-16 04:31:51] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:31:53] [INFO ] Implicit Places using invariants and state equation in 2144 ms returned []
Implicit Place search using SMT with State Equation took 2658 ms to find 0 implicit places.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:31:53] [INFO ] Computed 110 place invariants in 25 ms
[2022-05-16 04:31:54] [INFO ] Dead Transitions using invariants and state equation in 919 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GT 3 (ADD s44 s70 s73 s88 s115 s124 s130 s147 s159 s161 s174 s185 s189 s226 s232 s249 s255 s264 s268 s274 s279 s281 s343 s348 s390 s397 s407 s408 s433...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1152 reset in 3820 ms.
Product exploration explored 100000 steps with 1154 reset in 3879 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 : [(AND (NOT p2) p1 p0), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (AND (NOT p2) p1))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 239 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 138 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (AND (NOT p2) p1))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 315 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 133 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 107 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:32:03] [INFO ] Computed 110 place invariants in 20 ms
[2022-05-16 04:32:09] [INFO ] [Real]Absence check using 110 positive place invariants in 210 ms returned sat
[2022-05-16 04:32:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:32:15] [INFO ] [Real]Absence check using state equation in 6186 ms returned sat
[2022-05-16 04:32:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:32:21] [INFO ] [Nat]Absence check using 110 positive place invariants in 114 ms returned sat
[2022-05-16 04:32:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:32:26] [INFO ] [Nat]Absence check using state equation in 5220 ms returned sat
[2022-05-16 04:32:26] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:32:26] [INFO ] [Nat]Added 100 Read/Feed constraints in 152 ms returned sat
[2022-05-16 04:32:26] [INFO ] Computed and/alt/rep : 2200/3200/2200 causal constraints (skipped 0 transitions) in 139 ms.
[2022-05-16 04:32:27] [INFO ] Added : 29 causal constraints over 6 iterations in 897 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Support contains 200 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 31 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:32:27] [INFO ] Computed 110 place invariants in 22 ms
[2022-05-16 04:32:27] [INFO ] Implicit Places using invariants in 517 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:32:27] [INFO ] Computed 110 place invariants in 14 ms
[2022-05-16 04:32:28] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:32:30] [INFO ] Implicit Places using invariants and state equation in 2173 ms returned []
Implicit Place search using SMT with State Equation took 2692 ms to find 0 implicit places.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:32:30] [INFO ] Computed 110 place invariants in 21 ms
[2022-05-16 04:32:31] [INFO ] Dead Transitions using invariants and state equation in 928 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 291 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 120 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 149 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 120 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:32:32] [INFO ] Computed 110 place invariants in 20 ms
[2022-05-16 04:32:38] [INFO ] [Real]Absence check using 110 positive place invariants in 212 ms returned sat
[2022-05-16 04:32:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:32:44] [INFO ] [Real]Absence check using state equation in 6188 ms returned sat
[2022-05-16 04:32:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:32:50] [INFO ] [Nat]Absence check using 110 positive place invariants in 112 ms returned sat
[2022-05-16 04:32:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:32:55] [INFO ] [Nat]Absence check using state equation in 5324 ms returned sat
[2022-05-16 04:32:55] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:32:55] [INFO ] [Nat]Added 100 Read/Feed constraints in 155 ms returned sat
[2022-05-16 04:32:55] [INFO ] Computed and/alt/rep : 2200/3200/2200 causal constraints (skipped 0 transitions) in 126 ms.
[2022-05-16 04:32:56] [INFO ] Added : 29 causal constraints over 6 iterations in 938 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 120 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Product exploration explored 100000 steps with 1153 reset in 3607 ms.
Product exploration explored 100000 steps with 1158 reset in 3663 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 90 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Support contains 200 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 73 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2022-05-16 04:33:04] [INFO ] Redundant transitions in 127 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:33:04] [INFO ] Computed 110 place invariants in 15 ms
[2022-05-16 04:33:05] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Product exploration explored 100000 steps with 1152 reset in 3454 ms.
Product exploration explored 100000 steps with 1154 reset in 3484 ms.
Built C files in :
/tmp/ltsmin9743592986906816616
[2022-05-16 04:33:12] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9743592986906816616
Running compilation step : cd /tmp/ltsmin9743592986906816616;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9743592986906816616;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9743592986906816616;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 200 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 43 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:33:15] [INFO ] Computed 110 place invariants in 19 ms
[2022-05-16 04:33:15] [INFO ] Implicit Places using invariants in 565 ms returned []
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:33:15] [INFO ] Computed 110 place invariants in 27 ms
[2022-05-16 04:33:16] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 04:33:18] [INFO ] Implicit Places using invariants and state equation in 2121 ms returned []
Implicit Place search using SMT with State Equation took 2696 ms to find 0 implicit places.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-16 04:33:18] [INFO ] Computed 110 place invariants in 14 ms
[2022-05-16 04:33:18] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1311/1311 places, 2300/2300 transitions.
Built C files in :
/tmp/ltsmin12071857138308254714
[2022-05-16 04:33:19] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12071857138308254714
Running compilation step : cd /tmp/ltsmin12071857138308254714;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12071857138308254714;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12071857138308254714;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 04:33:22] [INFO ] Flatten gal took : 91 ms
[2022-05-16 04:33:22] [INFO ] Flatten gal took : 110 ms
[2022-05-16 04:33:22] [INFO ] Time to serialize gal into /tmp/LTL8887763114350686406.gal : 9 ms
[2022-05-16 04:33:22] [INFO ] Time to serialize properties into /tmp/LTL18410464704927114718.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8887763114350686406.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18410464704927114718.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8887763...267
Read 1 LTL properties
Checking formula 0 : !((F((!((G(X("((((((((Client_Sending_55+Client_Sending_63)+(Client_Sending_97+Client_Sending_78))+((Client_Sending_50+Client_Sending_2...8030
Formula 0 simplified : !F("((((((((Client_Waiting_76+Client_Waiting_74)+(Client_Waiting_67+Client_Waiting_81))+((Client_Waiting_36+Client_Waiting_25)+(Clie...8015
Detected timeout of ITS tools.
[2022-05-16 04:33:37] [INFO ] Flatten gal took : 82 ms
[2022-05-16 04:33:37] [INFO ] Applying decomposition
[2022-05-16 04:33:37] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17180046756064561755.txt' '-o' '/tmp/graph17180046756064561755.bin' '-w' '/tmp/graph17180046756064561755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17180046756064561755.bin' '-l' '-1' '-v' '-w' '/tmp/graph17180046756064561755.weights' '-q' '0' '-e' '0.001'
[2022-05-16 04:33:37] [INFO ] Decomposing Gal with order
[2022-05-16 04:33:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 04:33:38] [INFO ] Removed a total of 2400 redundant transitions.
[2022-05-16 04:33:38] [INFO ] Flatten gal took : 693 ms
[2022-05-16 04:33:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 1300 labels/synchronizations in 78 ms.
[2022-05-16 04:33:38] [INFO ] Time to serialize gal into /tmp/LTL2697792723266139741.gal : 21 ms
[2022-05-16 04:33:38] [INFO ] Time to serialize properties into /tmp/LTL379284912075034367.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2697792723266139741.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL379284912075034367.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2697792...265
Read 1 LTL properties
Checking formula 0 : !((F((!((G(X("((((((((gu0.Client_Sending_55+gu0.Client_Sending_63)+(gu0.Client_Sending_97+gu0.Client_Sending_78))+((gu0.Client_Sending...9630
Formula 0 simplified : !F("((((((((gu1.Client_Waiting_76+gu1.Client_Waiting_74)+(gu1.Client_Waiting_67+gu1.Client_Waiting_81))+((gu1.Client_Waiting_36+gu1....9615
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4156623181790106650
[2022-05-16 04:33:53] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4156623181790106650
Running compilation step : cd /tmp/ltsmin4156623181790106650;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4156623181790106650;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4156623181790106650;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CSRepetitions-PT-10-LTLCardinality-06 finished in 126489 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0&&(G(p1)||p2)) U X(p3)))))'
Found a SL insensitive property : CSRepetitions-PT-10-LTLCardinality-14
Stuttering acceptance computed with spot in 259 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 7 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 297 rules applied. Total rules applied 297 place count 1113 transition count 2201
Discarding 978 places :
Symmetric choice reduction at 0 with 978 rule applications. Total rules 1275 place count 135 transition count 1223
Iterating global reduction 0 with 978 rules applied. Total rules applied 2253 place count 135 transition count 1223
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 2341 place count 47 transition count 255
Iterating global reduction 0 with 88 rules applied. Total rules applied 2429 place count 47 transition count 255
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 2517 place count 47 transition count 167
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 2531 place count 40 transition count 160
Applied a total of 2531 rules in 106 ms. Remains 40 /1311 variables (removed 1271) and now considering 160/2300 (removed 2140) transitions.
[2022-05-16 04:33:57] [INFO ] Flow matrix only has 96 transitions (discarded 64 similar events)
// Phase 1: matrix 96 rows 40 cols
[2022-05-16 04:33:57] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 04:33:57] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-16 04:33:57] [INFO ] Flow matrix only has 96 transitions (discarded 64 similar events)
// Phase 1: matrix 96 rows 40 cols
[2022-05-16 04:33:57] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 04:33:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 04:33:57] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-05-16 04:33:57] [INFO ] Flow matrix only has 96 transitions (discarded 64 similar events)
// Phase 1: matrix 96 rows 40 cols
[2022-05-16 04:33:57] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 04:33:57] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 40/1311 places, 160/2300 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/1311 places, 160/2300 transitions.
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={1} source=1 dest: 2}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p3))), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1) (NOT p3)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2 p1 (NOT p3)), acceptance={1} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={1} source=3 dest: 2}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={1} source=4 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 p1), acceptance={1} source=4 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1} source=5 dest: 1}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p3))), acceptance={1} source=5 dest: 2}, { cond=(AND p0 p2 (NOT p1) (NOT p3)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p2 p1 (NOT p3)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s6 s28), p2:(LEQ s15 s13), p1:(OR (LEQ s15 s20) (LEQ s15 s18)), p3:(LEQ s29 s15)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33301 reset in 264 ms.
Product exploration explored 100000 steps with 33311 reset in 223 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 : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X (NOT (AND p0 (NOT p2) p1 (NOT p3)))), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p3))))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))))), (X (NOT (AND p0 p2 (NOT p1) (NOT p3)))), (X p3), (X (NOT (AND p1 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3)))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X p3)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p2) p1))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1 (NOT p3))))), true, (X (X (NOT (AND p0 p2 p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p3)))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (OR (NOT p0) (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 2023 ms. Reduced automaton from 6 states, 27 edges and 4 AP to 6 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 298 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 158 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-16 04:34:00] [INFO ] Flow matrix only has 96 transitions (discarded 64 similar events)
// Phase 1: matrix 96 rows 40 cols
[2022-05-16 04:34:00] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 04:34:00] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 04:34:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 04:34:00] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X (NOT (AND p0 (NOT p2) p1 (NOT p3)))), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p3))))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))))), (X (NOT (AND p0 p2 (NOT p1) (NOT p3)))), (X p3), (X (NOT (AND p1 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3)))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X p3)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p2) p1))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1 (NOT p3))))), true, (X (X (NOT (AND p0 p2 p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p3)))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (G (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p3))))), (G (NOT (AND (NOT p1) (NOT p3)))), (G (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (G (NOT (AND (NOT p1) p2 p0 (NOT p3))))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p0) (NOT p3)))), (F (OR (AND p1 (NOT p2)) (AND p1 (NOT p0)))), (F (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))))), (F (NOT p3)), (F p1), (F (OR (AND p1 p0 (NOT p3)) (AND p2 p0 (NOT p3)))), (F (AND p1 p2 p0 (NOT p3))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (F (AND p1 p2 p0)), (F (OR (AND p1 p0) (AND p2 p0))), (F (AND (NOT p1) p2 p0)), (F (AND p1 (NOT p2) p0)), (F (AND p1 (NOT p3)))]
Knowledge based reduction with 34 factoid took 3166 ms. Reduced automaton from 6 states, 27 edges and 4 AP to 6 states, 20 edges and 4 AP.
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 269 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 7 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 160/160 transitions.
Applied a total of 0 rules in 0 ms. Remains 40 /40 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-16 04:34:04] [INFO ] Flow matrix only has 96 transitions (discarded 64 similar events)
// Phase 1: matrix 96 rows 40 cols
[2022-05-16 04:34:04] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 04:34:04] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-16 04:34:04] [INFO ] Flow matrix only has 96 transitions (discarded 64 similar events)
// Phase 1: matrix 96 rows 40 cols
[2022-05-16 04:34:04] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 04:34:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 04:34:04] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-05-16 04:34:04] [INFO ] Flow matrix only has 96 transitions (discarded 64 similar events)
// Phase 1: matrix 96 rows 40 cols
[2022-05-16 04:34:04] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 04:34:04] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 160/160 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (OR (AND p1 p0) (AND p0 p2)))), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X (OR (NOT p0) p2 p3)), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (OR (NOT p0) p2 p3))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 (NOT p2)))))), (X (X (NOT (OR p1 (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (OR (AND p1 p0) (AND p0 p2))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1394 ms. Reduced automaton from 6 states, 20 edges and 4 AP to 6 states, 20 edges and 4 AP.
Stuttering acceptance computed with spot in 339 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10002 steps, including 171 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-16 04:34:06] [INFO ] Flow matrix only has 96 transitions (discarded 64 similar events)
// Phase 1: matrix 96 rows 40 cols
[2022-05-16 04:34:06] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 04:34:06] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 04:34:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2022-05-16 04:34:06] [INFO ] After 17ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (OR (AND p1 p0) (AND p0 p2)))), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X (OR (NOT p0) p2 p3)), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (OR (NOT p0) p2 p3))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 (NOT p2)))))), (X (X (NOT (OR p1 (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (OR (AND p1 p0) (AND p0 p2))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (G (OR (NOT p0) p2 p3))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (F p1), (F (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))), (F (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))), (F (OR (AND p0 p1) (AND p0 p2))), (F (AND p0 p2 (NOT p3))), (F (AND p0 p1 p2)), (F (AND (NOT p0) (NOT p3))), (F (AND p0 p1 (NOT p2))), (F (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (F (OR (AND (NOT p0) (NOT p3)) p1 (AND p2 (NOT p3)))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 22 factoid took 1577 ms. Reduced automaton from 6 states, 20 edges and 4 AP to 6 states, 20 edges and 4 AP.
Stuttering acceptance computed with spot in 895 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 267 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 265 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 33351 reset in 164 ms.
Product exploration explored 100000 steps with 33356 reset in 167 ms.
Built C files in :
/tmp/ltsmin10322678399147766217
[2022-05-16 04:34:09] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10322678399147766217
Running compilation step : cd /tmp/ltsmin10322678399147766217;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 287 ms.
Running link step : cd /tmp/ltsmin10322678399147766217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin10322678399147766217;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4489366678397634663.hoa' '--buchi-type=spotba'
LTSmin run took 140 ms.
Treatment of property CSRepetitions-PT-10-LTLCardinality-14 finished in 13463 ms.
FORMULA CSRepetitions-PT-10-LTLCardinality-14 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-16 04:34:10] [INFO ] Flatten gal took : 71 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7097843338820608396
[2022-05-16 04:34:10] [INFO ] Too many transitions (2300) to apply POR reductions. Disabling POR matrices.
[2022-05-16 04:34:10] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7097843338820608396
Running compilation step : cd /tmp/ltsmin7097843338820608396;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 04:34:10] [INFO ] Applying decomposition
[2022-05-16 04:34:10] [INFO ] Flatten gal took : 88 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8573824584973715716.txt' '-o' '/tmp/graph8573824584973715716.bin' '-w' '/tmp/graph8573824584973715716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8573824584973715716.bin' '-l' '-1' '-v' '-w' '/tmp/graph8573824584973715716.weights' '-q' '0' '-e' '0.001'
[2022-05-16 04:34:10] [INFO ] Decomposing Gal with order
[2022-05-16 04:34:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 04:34:11] [INFO ] Removed a total of 1900 redundant transitions.
[2022-05-16 04:34:11] [INFO ] Flatten gal took : 1021 ms
[2022-05-16 04:34:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 1800 labels/synchronizations in 58 ms.
[2022-05-16 04:34:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality8948656023420929625.gal : 9 ms
[2022-05-16 04:34:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality13570954751194317319.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8948656023420929625.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13570954751194317319.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((F((!((G(X("((((((((gu0.Client_Sending_55+gu0.Client_Sending_63)+(gu0.Client_Sending_97+gu0.Client_Sending_78))+((gu0.Client_Sending...9630
Formula 0 simplified : !F("((((((((gu1.Client_Waiting_76+gu1.Client_Waiting_74)+(gu1.Client_Waiting_67+gu1.Client_Waiting_81))+((gu1.Client_Waiting_36+gu1....9615
Compilation finished in 4836 ms.
Running link step : cd /tmp/ltsmin7097843338820608396;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7097843338820608396;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((!([](X((LTLAPp0==true))) U !X(!(LTLAPp1==true)))||(LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 04:56:15] [INFO ] Flatten gal took : 201 ms
[2022-05-16 04:56:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality13355309909755416853.gal : 28 ms
[2022-05-16 04:56:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality2790002473393169921.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13355309909755416853.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2790002473393169921.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((F((!((G(X("((((((((Client_Sending_55+Client_Sending_63)+(Client_Sending_97+Client_Sending_78))+((Client_Sending_50+Client_Sending_2...8030
Formula 0 simplified : !F("((((((((Client_Waiting_76+Client_Waiting_74)+(Client_Waiting_67+Client_Waiting_81))+((Client_Waiting_36+Client_Waiting_25)+(Clie...8015
Detected timeout of ITS tools.
[2022-05-16 05:18:18] [INFO ] Flatten gal took : 255 ms
[2022-05-16 05:18:18] [INFO ] Input system was already deterministic with 2300 transitions.
[2022-05-16 05:18:18] [INFO ] Transformed 1311 places.
[2022-05-16 05:18:18] [INFO ] Transformed 2300 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 05:18:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality2335469119463503871.gal : 7 ms
[2022-05-16 05:18:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality16239193936617370050.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2335469119463503871.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16239193936617370050.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((!((G(X("((((((((Client_Sending_55+Client_Sending_63)+(Client_Sending_97+Client_Sending_78))+((Client_Sending_50+Client_Sending_2...8030
Formula 0 simplified : !F("((((((((Client_Waiting_76+Client_Waiting_74)+(Client_Waiting_67+Client_Waiting_81))+((Client_Waiting_36+Client_Waiting_25)+(Clie...8015

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-PT-10"
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 CSRepetitions-PT-10, 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 r024-tall-165251918800659"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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