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-165251918700587.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-COL-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918700587
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 7.4K Apr 30 05:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 30 05:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 05:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 05:45 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 4.6K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 14K 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-COL-04-LTLCardinality-00
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-01
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-02
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-03
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-04
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-05
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-06
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-07
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-08
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-09
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-10
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-11
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-12
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-13
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-14
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652664002729

Running Version 202205111006
[2022-05-16 01:20: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 01:20:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:20:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 01:20:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 01:20:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 542 ms
[2022-05-16 01:20:04] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 117 PT places and 176.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 01:20:04] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 9 ms.
[2022-05-16 01:20:04] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CSRepetitions-COL-04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-04-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 2379 steps, including 58 resets, run visited all 15 properties in 47 ms. (steps per millisecond=50 )
[2022-05-16 01:20:04] [INFO ] Flatten gal took : 15 ms
[2022-05-16 01:20:04] [INFO ] Flatten gal took : 2 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 4
[2022-05-16 01:20:04] [INFO ] Unfolded HLPN to a Petri net with 66 places and 80 transitions 240 arcs in 7 ms.
[2022-05-16 01:20:04] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 50 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:04] [INFO ] Computed 17 place invariants in 11 ms
[2022-05-16 01:20:05] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:05] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-16 01:20:05] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:20:05] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:05] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-16 01:20:05] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Support contains 50 out of 66 places after structural reductions.
[2022-05-16 01:20:05] [INFO ] Flatten gal took : 23 ms
[2022-05-16 01:20:05] [INFO ] Flatten gal took : 15 ms
[2022-05-16 01:20:05] [INFO ] Input system was already deterministic with 80 transitions.
Incomplete random walk after 10003 steps, including 266 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 15) seen :14
Finished Best-First random walk after 261 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=261 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:05] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:20:05] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:05] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-16 01:20:05] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:20:05] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2022-05-16 01:20:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:05] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:20:05] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16) (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 3 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-00 finished in 403 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(X((p0 U !F(!p0))))))))'
Support contains 16 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:05] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 01:20:06] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:06] [INFO ] Computed 17 place invariants in 9 ms
[2022-05-16 01:20:06] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:20:06] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:06] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 01:20:06] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-01 finished in 383 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G((p0 U (G(F(p1)) U p0))))))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:06] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:20:06] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:06] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:20:06] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:20:06] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:06] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:20:06] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 (ADD s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65)), p1:(LEQ 3 s33)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 47769 steps with 1518 reset in 211 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-02 finished in 592 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((X(p0)||p1)))||X(p1))))'
Support contains 18 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:06] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:20:07] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:07] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 01:20:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:20:07] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:07] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 01:20:07] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s33), p0:(LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3914 reset in 248 ms.
Product exploration explored 100000 steps with 3916 reset in 347 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 230 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 479 steps, including 12 resets, run visited all 3 properties in 6 ms. (steps per millisecond=79 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F p0)]
Knowledge based reduction with 7 factoid took 308 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 18 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:08] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 01:20:08] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:08] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:20:08] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:20:08] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:08] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:20:08] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 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 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 288 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 468 steps, including 13 resets, run visited all 3 properties in 5 ms. (steps per millisecond=93 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F p0)]
Knowledge based reduction with 7 factoid took 290 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3909 reset in 213 ms.
Product exploration explored 100000 steps with 3921 reset in 205 ms.
Built C files in :
/tmp/ltsmin10286604470653327539
[2022-05-16 01:20:10] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10286604470653327539
Running compilation step : cd /tmp/ltsmin10286604470653327539;'/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 242 ms.
Running link step : cd /tmp/ltsmin10286604470653327539;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10286604470653327539;'/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/stateBased1133752478755927622.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 18 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:25] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:20:25] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:25] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:20:25] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:20:25] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:20:25] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:20:25] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Built C files in :
/tmp/ltsmin13212935968596982607
[2022-05-16 01:20:25] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13212935968596982607
Running compilation step : cd /tmp/ltsmin13212935968596982607;'/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 146 ms.
Running link step : cd /tmp/ltsmin13212935968596982607;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13212935968596982607;'/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/stateBased13936087681688876407.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:20:40] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:20:40] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:20:40] [INFO ] Time to serialize gal into /tmp/LTL11977096345699941069.gal : 2 ms
[2022-05-16 01:20:40] [INFO ] Time to serialize properties into /tmp/LTL14357384713406365775.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/LTL11977096345699941069.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14357384713406365775.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/LTL1197709...268
Read 1 LTL properties
Checking formula 0 : !((G((F(G((X("(RequestBufferSlots_0<=((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2+Client_Sending_3))+((Client_Sending_4+Cl...432
Formula 0 simplified : !G(FG("(Server_Waiting_0>=3)" | X"(RequestBufferSlots_0<=((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2+Client_Sending_3))...418
Reverse transition relation is NOT exact ! Due to transitions t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50...400
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2022-05-16 01:20:55] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:20:55] [INFO ] Applying decomposition
[2022-05-16 01:20:55] [INFO ] Flatten gal took : 14 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/graph1619559190074576463.txt' '-o' '/tmp/graph1619559190074576463.bin' '-w' '/tmp/graph1619559190074576463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1619559190074576463.bin' '-l' '-1' '-v' '-w' '/tmp/graph1619559190074576463.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:20:55] [INFO ] Decomposing Gal with order
[2022-05-16 01:20:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:20:55] [INFO ] Removed a total of 15 redundant transitions.
[2022-05-16 01:20:55] [INFO ] Flatten gal took : 34 ms
[2022-05-16 01:20:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 5 ms.
[2022-05-16 01:20:55] [INFO ] Time to serialize gal into /tmp/LTL12912827770012502786.gal : 2 ms
[2022-05-16 01:20:55] [INFO ] Time to serialize properties into /tmp/LTL13136108319837884089.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/LTL12912827770012502786.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13136108319837884089.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/LTL1291282...268
Read 1 LTL properties
Checking formula 0 : !((G((F(G((X("(gu0.RequestBufferSlots_0<=((((gu0.Client_Sending_0+gu0.Client_Sending_1)+(gu0.Client_Sending_2+gu0.Client_Sending_3))+(...516
Formula 0 simplified : !G(FG("(gi1.gu1.Server_Waiting_0>=3)" | X"(gu0.RequestBufferSlots_0<=((((gu0.Client_Sending_0+gu0.Client_Sending_1)+(gu0.Client_Send...502
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin626083952086084736
[2022-05-16 01:21:10] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin626083952086084736
Running compilation step : cd /tmp/ltsmin626083952086084736;'/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 147 ms.
Running link step : cd /tmp/ltsmin626083952086084736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin626083952086084736;'/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))||(LTLAPp1==true))))||X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CSRepetitions-COL-04-LTLCardinality-03 finished in 79012 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0)&&!p0))||G(p1)))'
Support contains 33 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:25] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:21:26] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:26] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:21:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:21:26] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-16 01:21:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:26] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:21:26] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GT 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16)), p1:(GT (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49) s33)], 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, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-04 finished in 333 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 16 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:26] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:21:26] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:26] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:21:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:21:26] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:26] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:21:26] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 2 (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 140 ms.
Product exploration explored 100000 steps with 33333 reset in 142 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 43 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-04-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-04-LTLCardinality-06 finished in 581 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 16 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:26] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:21:26] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:26] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 01:21:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:21:26] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:26] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 01:21:27] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-07 finished in 293 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:27] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:21:27] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:27] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:21:27] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:21:27] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-05-16 01:21:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:27] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:21:27] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2493 reset in 292 ms.
Product exploration explored 100000 steps with 2480 reset in 309 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 710 steps, including 19 resets, run visited all 1 properties in 5 ms. (steps per millisecond=142 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:28] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:21:28] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:28] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-16 01:21:28] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:21:28] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-05-16 01:21:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:28] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:21:28] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Finished random walk after 958 steps, including 25 resets, run visited all 1 properties in 5 ms. (steps per millisecond=191 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2480 reset in 264 ms.
Product exploration explored 100000 steps with 2484 reset in 288 ms.
Built C files in :
/tmp/ltsmin8255863314061522422
[2022-05-16 01:21:29] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2022-05-16 01:21:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:21:29] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2022-05-16 01:21:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:21:29] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2022-05-16 01:21:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:21:29] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8255863314061522422
Running compilation step : cd /tmp/ltsmin8255863314061522422;'/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 188 ms.
Running link step : cd /tmp/ltsmin8255863314061522422;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin8255863314061522422;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16175475187513041063.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:44] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:21:44] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:44] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-16 01:21:44] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:21:44] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2022-05-16 01:21:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:21:44] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:21:44] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Built C files in :
/tmp/ltsmin17797641679559049710
[2022-05-16 01:21:44] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2022-05-16 01:21:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:21:44] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2022-05-16 01:21:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:21:44] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2022-05-16 01:21:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:21:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17797641679559049710
Running compilation step : cd /tmp/ltsmin17797641679559049710;'/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 168 ms.
Running link step : cd /tmp/ltsmin17797641679559049710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17797641679559049710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17861021107109641068.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:21:59] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:21:59] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:21:59] [INFO ] Time to serialize gal into /tmp/LTL2110022694676435560.gal : 1 ms
[2022-05-16 01:21:59] [INFO ] Time to serialize properties into /tmp/LTL7110629733035591668.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/LTL2110022694676435560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7110629733035591668.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/LTL2110022...266
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((Server_Anwering_0+Server_Anwering_1)+(Server_Anwering_2+Server_Anwering_3))+((Server_Anwering_4+Server_Anwering_5)+(Serve...668
Formula 0 simplified : !FG"(((((Server_Anwering_0+Server_Anwering_1)+(Server_Anwering_2+Server_Anwering_3))+((Server_Anwering_4+Server_Anwering_5)+(Server_...662
Reverse transition relation is NOT exact ! Due to transitions t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50...400
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2022-05-16 01:22:14] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:22:14] [INFO ] Applying decomposition
[2022-05-16 01:22:14] [INFO ] Flatten gal took : 4 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/graph5722072806234716569.txt' '-o' '/tmp/graph5722072806234716569.bin' '-w' '/tmp/graph5722072806234716569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5722072806234716569.bin' '-l' '-1' '-v' '-w' '/tmp/graph5722072806234716569.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:22:14] [INFO ] Decomposing Gal with order
[2022-05-16 01:22:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:22:14] [INFO ] Removed a total of 15 redundant transitions.
[2022-05-16 01:22:14] [INFO ] Flatten gal took : 11 ms
[2022-05-16 01:22:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 1 ms.
[2022-05-16 01:22:14] [INFO ] Time to serialize gal into /tmp/LTL16965663681497202490.gal : 3 ms
[2022-05-16 01:22:14] [INFO ] Time to serialize properties into /tmp/LTL9016108882530715021.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/LTL16965663681497202490.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9016108882530715021.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/LTL1696566...267
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((gu10.Server_Anwering_0+gu10.Server_Anwering_1)+(gu10.Server_Anwering_2+gu10.Server_Anwering_3))+((gu10.Server_Anwering_4+...828
Formula 0 simplified : !FG"(((((gu10.Server_Anwering_0+gu10.Server_Anwering_1)+(gu10.Server_Anwering_2+gu10.Server_Anwering_3))+((gu10.Server_Anwering_4+gu...822
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7486767471590221279
[2022-05-16 01:22:29] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7486767471590221279
Running compilation step : cd /tmp/ltsmin7486767471590221279;'/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 155 ms.
Running link step : cd /tmp/ltsmin7486767471590221279;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7486767471590221279;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CSRepetitions-COL-04-LTLCardinality-08 finished in 77750 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:44] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:22:44] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:44] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:22:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:22:45] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2022-05-16 01:22:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:45] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:22:45] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16)), p0:(LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16))], 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 23526 reset in 175 ms.
Stack based approach found an accepted trace after 34710 steps with 8191 reset with depth 5 and stack size 5 in 64 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-10 finished in 474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(G(X(G(p0))))&&G(F(p1))))))'
Support contains 33 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:45] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:22:45] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:45] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:22:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:22:45] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-05-16 01:22:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:45] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:22:45] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16) s0), p1:(GT (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49) s0)...], 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 36 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-11 finished in 243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:45] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-16 01:22:45] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:45] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 01:22:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:22:45] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:45] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:22:45] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT s0 (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49))], 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]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-14 finished in 286 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U !p1))))'
Support contains 49 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:45] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:22:45] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:45] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:22:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:22:46] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-05-16 01:22:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:46] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:22:46] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 71 ms :[p1, p1]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LEQ 1 s33) (LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16))), p0:(LEQ (ADD s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62...], 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 32 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-15 finished in 222 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((X(p0)||p1)))||X(p1))))'
Found a SL insensitive property : CSRepetitions-COL-04-LTLCardinality-03
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 18 out of 66 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:46] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:22:46] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:46] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 01:22:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:22:46] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:46] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:22:46] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s33), p0:(LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3911 reset in 198 ms.
Product exploration explored 100000 steps with 3917 reset in 203 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 302 steps, including 8 resets, run visited all 3 properties in 4 ms. (steps per millisecond=75 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F p0)]
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 18 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:47] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:22:47] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:47] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:22:47] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:22:47] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:22:47] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:22:47] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 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 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 217 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 632 steps, including 15 resets, run visited all 3 properties in 8 ms. (steps per millisecond=79 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F p0)]
Knowledge based reduction with 7 factoid took 247 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3911 reset in 186 ms.
Product exploration explored 100000 steps with 3920 reset in 212 ms.
Built C files in :
/tmp/ltsmin3042833927737591942
[2022-05-16 01:22:48] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3042833927737591942
Running compilation step : cd /tmp/ltsmin3042833927737591942;'/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 158 ms.
Running link step : cd /tmp/ltsmin3042833927737591942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin3042833927737591942;'/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/stateBased6203598281889785458.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 18 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:23:04] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:23:04] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:23:04] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:23:04] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:23:04] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:23:04] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:23:04] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Built C files in :
/tmp/ltsmin18355381390234004378
[2022-05-16 01:23:04] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18355381390234004378
Running compilation step : cd /tmp/ltsmin18355381390234004378;'/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 148 ms.
Running link step : cd /tmp/ltsmin18355381390234004378;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin18355381390234004378;'/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/stateBased12389319171955966965.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:23:19] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:23:19] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:23:19] [INFO ] Time to serialize gal into /tmp/LTL4921341026374915250.gal : 1 ms
[2022-05-16 01:23:19] [INFO ] Time to serialize properties into /tmp/LTL8794680710654651065.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/LTL4921341026374915250.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8794680710654651065.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/LTL4921341...266
Read 1 LTL properties
Checking formula 0 : !((G((F(G((X("(RequestBufferSlots_0<=((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2+Client_Sending_3))+((Client_Sending_4+Cl...432
Formula 0 simplified : !G(FG("(Server_Waiting_0>=3)" | X"(RequestBufferSlots_0<=((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2+Client_Sending_3))...418
Reverse transition relation is NOT exact ! Due to transitions t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50...400
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2022-05-16 01:23:34] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:23:34] [INFO ] Applying decomposition
[2022-05-16 01:23:34] [INFO ] Flatten gal took : 3 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/graph18158081906572613711.txt' '-o' '/tmp/graph18158081906572613711.bin' '-w' '/tmp/graph18158081906572613711.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18158081906572613711.bin' '-l' '-1' '-v' '-w' '/tmp/graph18158081906572613711.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:23:34] [INFO ] Decomposing Gal with order
[2022-05-16 01:23:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:23:34] [INFO ] Removed a total of 19 redundant transitions.
[2022-05-16 01:23:34] [INFO ] Flatten gal took : 16 ms
[2022-05-16 01:23:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 2 ms.
[2022-05-16 01:23:34] [INFO ] Time to serialize gal into /tmp/LTL16216736589898713203.gal : 1 ms
[2022-05-16 01:23:34] [INFO ] Time to serialize properties into /tmp/LTL18269453086638404844.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/LTL16216736589898713203.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18269453086638404844.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/LTL1621673...268
Read 1 LTL properties
Checking formula 0 : !((G((F(G((X("(gu0.RequestBufferSlots_0<=((((gu0.Client_Sending_0+gu0.Client_Sending_1)+(gu0.Client_Sending_2+gu0.Client_Sending_3))+(...516
Formula 0 simplified : !G(FG("(gi1.gu3.Server_Waiting_0>=3)" | X"(gu0.RequestBufferSlots_0<=((((gu0.Client_Sending_0+gu0.Client_Sending_1)+(gu0.Client_Send...502
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13829390394865146327
[2022-05-16 01:23:49] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13829390394865146327
Running compilation step : cd /tmp/ltsmin13829390394865146327;'/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 152 ms.
Running link step : cd /tmp/ltsmin13829390394865146327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13829390394865146327;'/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))||(LTLAPp1==true))))||X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CSRepetitions-COL-04-LTLCardinality-03 finished in 78425 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2022-05-16 01:24:04] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8241960603155254849
[2022-05-16 01:24:04] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2022-05-16 01:24:04] [INFO ] Applying decomposition
[2022-05-16 01:24:04] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:24:04] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2022-05-16 01:24:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:24:04] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:24:04] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2022-05-16 01:24:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:24:04] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8241960603155254849
Running compilation step : cd /tmp/ltsmin8241960603155254849;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
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/graph15128634041439519895.txt' '-o' '/tmp/graph15128634041439519895.bin' '-w' '/tmp/graph15128634041439519895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15128634041439519895.bin' '-l' '-1' '-v' '-w' '/tmp/graph15128634041439519895.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:24:04] [INFO ] Decomposing Gal with order
[2022-05-16 01:24:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:24:04] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:24:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 01:24:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality13940815701505805159.gal : 1 ms
[2022-05-16 01:24:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality8058105849468938475.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/LTLCardinality13940815701505805159.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8058105849468938475.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 2 LTL properties
Checking formula 0 : !((G((F(G((X("(gu0.RequestBufferSlots_0<=((((gu0.Client_Sending_0+gu0.Client_Sending_1)+(gu0.Client_Sending_2+gu0.Client_Sending_3))+(...508
Formula 0 simplified : !G(FG("(gu1.Server_Waiting_0>=3)" | X"(gu0.RequestBufferSlots_0<=((((gu0.Client_Sending_0+gu0.Client_Sending_1)+(gu0.Client_Sending_...494
Compilation finished in 165 ms.
Running link step : cd /tmp/ltsmin8241960603155254849;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8241960603155254849;'/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))||(LTLAPp1==true))))||X((LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gu0.t32, gu0.t33, gu0.t34, gu0.t35, gu0.t36, gu0.t37, gu0.t38, gu0.t39, gu0.t40, gu0.t41, gu0...528
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
3 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
6635 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,66.3528,1190448,1,0,228,4.94206e+06,192,92,4829,8.07648e+06,201
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-COL-04-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G("(((((gu1.Server_Anwering_0+gu1.Server_Anwering_1)+(gu1.Server_Anwering_2+gu1.Server_Anwering_3))+((gu1.Server_Anwering_4+gu1.S...796
Formula 1 simplified : !FG"(((((gu1.Server_Anwering_0+gu1.Server_Anwering_1)+(gu1.Server_Anwering_2+gu1.Server_Anwering_3))+((gu1.Server_Anwering_4+gu1.Ser...790
Computing Next relation with stutter on 1 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.480: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.480: LTL layer: formula: []((<>([]((X((LTLAPp0==true))||(LTLAPp1==true))))||X((LTLAPp1==true))))
pins2lts-mc-linux64( 7/ 8), 0.480: "[]((<>([]((X((LTLAPp0==true))||(LTLAPp1==true))))||X((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.480: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.487: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.528: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.528: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.528: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.531: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.531: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.532: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.539: There are 84 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.539: State length is 67, there are 84 groups
pins2lts-mc-linux64( 0/ 8), 0.539: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.539: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.539: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.539: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.593: [Blue] ~25 levels ~960 states ~4808 transitions
pins2lts-mc-linux64( 5/ 8), 0.615: [Blue] ~25 levels ~1920 states ~8960 transitions
pins2lts-mc-linux64( 5/ 8), 0.656: [Blue] ~25 levels ~3840 states ~18432 transitions
pins2lts-mc-linux64( 5/ 8), 0.765: [Blue] ~25 levels ~7680 states ~41280 transitions
pins2lts-mc-linux64( 5/ 8), 0.953: [Blue] ~39 levels ~15360 states ~88496 transitions
pins2lts-mc-linux64( 5/ 8), 1.208: [Blue] ~55 levels ~30720 states ~157136 transitions
pins2lts-mc-linux64( 5/ 8), 1.434: [Blue] ~55 levels ~61440 states ~313600 transitions
pins2lts-mc-linux64( 5/ 8), 1.864: [Blue] ~55 levels ~122880 states ~674560 transitions
pins2lts-mc-linux64( 5/ 8), 2.696: [Blue] ~3611 levels ~245760 states ~1502624 transitions
pins2lts-mc-linux64( 5/ 8), 3.573: [Blue] ~14945 levels ~491520 states ~3471432 transitions
pins2lts-mc-linux64( 5/ 8), 5.023: [Blue] ~35707 levels ~983040 states ~7485008 transitions
pins2lts-mc-linux64( 5/ 8), 7.989: [Blue] ~77221 levels ~1966080 states ~15672296 transitions
pins2lts-mc-linux64( 7/ 8), 14.094: [Blue] ~177054 levels ~3932160 states ~33518464 transitions
pins2lts-mc-linux64( 7/ 8), 26.566: [Blue] ~340939 levels ~7864320 states ~68183776 transitions
pins2lts-mc-linux64( 7/ 8), 52.160: [Blue] ~671486 levels ~15728640 states ~138936544 transitions
pins2lts-mc-linux64( 7/ 8), 105.640: [Blue] ~1335210 levels ~31457280 states ~285122736 transitions
pins2lts-mc-linux64( 0/ 8), 175.756: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 175.945:
pins2lts-mc-linux64( 0/ 8), 175.945: Explored 47350291 states 441125829 transitions, fanout: 9.316
pins2lts-mc-linux64( 0/ 8), 175.945: Total exploration time 175.370 sec (175.200 sec minimum, 175.289 sec on average)
pins2lts-mc-linux64( 0/ 8), 175.945: States per second: 270002, Transitions per second: 2515401
pins2lts-mc-linux64( 0/ 8), 175.945:
pins2lts-mc-linux64( 0/ 8), 175.945: State space has 134217423 states, 22346834 are accepting
pins2lts-mc-linux64( 0/ 8), 175.945: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 175.945: blue states: 47350291 (35.28%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 175.945: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 175.945: all-red states: 22346834 (16.65%), bogus 1 (0.00%)
pins2lts-mc-linux64( 0/ 8), 175.945:
pins2lts-mc-linux64( 0/ 8), 175.945: Total memory used for local state coloring: 236.4MB
pins2lts-mc-linux64( 0/ 8), 175.945:
pins2lts-mc-linux64( 0/ 8), 175.945: Queue width: 8B, total height: 15495942, memory: 118.22MB
pins2lts-mc-linux64( 0/ 8), 175.945: Tree memory: 1201.4MB, 9.4 B/state, compr.: 3.5%
pins2lts-mc-linux64( 0/ 8), 175.945: Tree fill ratio (roots/leafs): 99.0%/69.0%
pins2lts-mc-linux64( 0/ 8), 175.945: Stored 80 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 175.945: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 175.945: Est. total memory use: 1319.6MB (~1142.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8241960603155254849;'/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))||(LTLAPp1==true))))||X((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8241960603155254849;'/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))||(LTLAPp1==true))))||X((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
70880 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,775.165,3790096,1,0,266,1.52461e+07,20,132,14821,2.77551e+07,168
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CSRepetitions-COL-04-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1130847 ms.

BK_STOP 1652665134882

--------------------
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-COL-04"
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-COL-04, 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-165251918700587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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