Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r045-oct2-162038291700245.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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 ClientsAndServers-PT-N1000P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291700245
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.1K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N1000P0-00
FORMULA_NAME ClientsAndServers-PT-N1000P0-01
FORMULA_NAME ClientsAndServers-PT-N1000P0-02
FORMULA_NAME ClientsAndServers-PT-N1000P0-03
FORMULA_NAME ClientsAndServers-PT-N1000P0-04
FORMULA_NAME ClientsAndServers-PT-N1000P0-05
FORMULA_NAME ClientsAndServers-PT-N1000P0-06
FORMULA_NAME ClientsAndServers-PT-N1000P0-07
FORMULA_NAME ClientsAndServers-PT-N1000P0-08
FORMULA_NAME ClientsAndServers-PT-N1000P0-09
FORMULA_NAME ClientsAndServers-PT-N1000P0-10
FORMULA_NAME ClientsAndServers-PT-N1000P0-11
FORMULA_NAME ClientsAndServers-PT-N1000P0-12
FORMULA_NAME ClientsAndServers-PT-N1000P0-13
FORMULA_NAME ClientsAndServers-PT-N1000P0-14
FORMULA_NAME ClientsAndServers-PT-N1000P0-15

=== Now, execution of the tool begins

BK_START 1620571171745

Running Version 0
[2021-05-09 14:39:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 14:39:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:39:34] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-09 14:39:34] [INFO ] Transformed 25 places.
[2021-05-09 14:39:34] [INFO ] Transformed 18 transitions.
[2021-05-09 14:39:34] [INFO ] Parsed PT model containing 25 places and 18 transitions in 80 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 14:39:34] [INFO ] Initial state test concluded for 1 properties.
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 23 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 14:39:34] [INFO ] Computed 8 place invariants in 7 ms
[2021-05-09 14:39:34] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 14:39:34] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 14:39:34] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 14:39:34] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 14:39:34] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 18/18 transitions.
[2021-05-09 14:39:34] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 14:39:34] [INFO ] Flatten gal took : 31 ms
FORMULA ClientsAndServers-PT-N1000P0-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:39:34] [INFO ] Flatten gal took : 10 ms
[2021-05-09 14:39:34] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100043 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=1515 ) properties (out of 17) seen :11
Running SMT prover for 6 properties.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 14:39:34] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-09 14:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-09 14:39:35] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-09 14:39:35] [INFO ] Added : 11 causal constraints over 3 iterations in 32 ms. Result :sat
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-09 14:39:35] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 14:39:35] [INFO ] Added : 13 causal constraints over 3 iterations in 28 ms. Result :sat
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-09 14:39:35] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 14:39:35] [INFO ] Added : 15 causal constraints over 3 iterations in 25 ms. Result :sat
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-09 14:39:35] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 14:39:35] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 14:39:35] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-09 14:39:35] [INFO ] Added : 10 causal constraints over 2 iterations in 26 ms. Result :sat
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-09 14:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:39:35] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-09 14:39:35] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 14:39:35] [INFO ] Added : 14 causal constraints over 3 iterations in 13 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:39:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:39:35] [INFO ] Implicit Places using invariants in 22 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:39:35] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:39:35] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:39:35] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:39:35] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s10 1) (GEQ s16 1)), p1:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N1000P0-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-00 finished in 338 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((G(p0)||X(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:39:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:39:35] [INFO ] Implicit Places using invariants in 29 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:39:35] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:39:35] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:39:35] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:39:35] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(LT s19 1), p0:(AND (GEQ s0 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 227 ms.
Product exploration explored 100000 steps with 0 reset in 320 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 123 ms.
Stack based approach found an accepted trace after 59112 steps with 0 reset with depth 59113 and stack size 4931 in 124 ms.
FORMULA ClientsAndServers-PT-N1000P0-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-01 finished in 1368 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 14:39:37] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 14:39:37] [INFO ] Implicit Places using invariants in 17 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:39:37] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:39:37] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:39:37] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:39:37] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s11 1) (GEQ s16 1)), p1:(LT s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N1000P0-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-02 finished in 272 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 18 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 11 place count 18 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 15 transition count 11
Applied a total of 17 rules in 8 ms. Remains 15 /25 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2021-05-09 14:39:37] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 14:39:37] [INFO ] Implicit Places using invariants in 10 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 11 ms to find 1 implicit places.
[2021-05-09 14:39:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2021-05-09 14:39:37] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:39:37] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 14/25 places, 11/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 9
Applied a total of 4 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 14:39:37] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:39:37] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 14:39:37] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:39:37] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 12/25 places, 9/18 transitions.
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s11 1) (OR (LT s6 1) (AND (GEQ s2 1) (GEQ s10 1))) (OR (LT s2 1) (LT s10 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N1000P0-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-03 finished in 145 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 0 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:39:37] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:39:37] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:39:37] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:39:37] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:39:37] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:39:37] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s9 1), p0:(AND (GEQ s2 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1492 reset in 204 ms.
Product exploration explored 100000 steps with 1526 reset in 161 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1513 reset in 98 ms.
Product exploration explored 100000 steps with 1516 reset in 119 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 4 place count 21 transition count 18
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 21 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 19 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 19 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 14 rules in 7 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 14:39:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-09 14:39:38] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:39:38] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 4181 reset in 192 ms.
Product exploration explored 100000 steps with 4134 reset in 139 ms.
[2021-05-09 14:39:39] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:39:39] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:39:39] [INFO ] Time to serialize gal into /tmp/LTL4673254694661906880.gal : 1 ms
[2021-05-09 14:39:39] [INFO ] Time to serialize properties into /tmp/LTL3961438708204913625.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4673254694661906880.gal, -t, CGAL, -LTL, /tmp/LTL3961438708204913625.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4673254694661906880.gal -t CGAL -LTL /tmp/LTL3961438708204913625.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((SF>=1)&&(Mi>=1))"))&&(F("(MpA>=1)")))))
Formula 0 simplified : !X(F"((SF>=1)&&(Mi>=1))" & F"(MpA>=1)")
Detected timeout of ITS tools.
[2021-05-09 14:39:54] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:39:54] [INFO ] Applying decomposition
[2021-05-09 14:39:54] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13936993328632063309.txt, -o, /tmp/graph13936993328632063309.bin, -w, /tmp/graph13936993328632063309.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13936993328632063309.bin, -l, -1, -v, -w, /tmp/graph13936993328632063309.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:39:54] [INFO ] Decomposing Gal with order
[2021-05-09 14:39:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:39:54] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 14:39:54] [INFO ] Flatten gal took : 31 ms
[2021-05-09 14:39:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 14:39:54] [INFO ] Time to serialize gal into /tmp/LTL12158544547923610278.gal : 2 ms
[2021-05-09 14:39:54] [INFO ] Time to serialize properties into /tmp/LTL17906009912865084229.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12158544547923610278.gal, -t, CGAL, -LTL, /tmp/LTL17906009912865084229.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12158544547923610278.gal -t CGAL -LTL /tmp/LTL17906009912865084229.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("((u2.SF>=1)&&(i0.u4.Mi>=1))"))&&(F("(i0.u0.MpA>=1)")))))
Formula 0 simplified : !X(F"((u2.SF>=1)&&(i0.u4.Mi>=1))" & F"(i0.u0.MpA>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9551836899631796455
[2021-05-09 14:40:09] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9551836899631796455
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9551836899631796455]
Compilation finished in 215 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9551836899631796455]
Link finished in 45 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9551836899631796455]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N1000P0-04 finished in 47023 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 0 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:40:24] [INFO ] Computed 4 place invariants in 6 ms
[2021-05-09 14:40:24] [INFO ] Implicit Places using invariants in 36 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:40:24] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:40:24] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:40:24] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:40:24] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10169 reset in 60 ms.
Product exploration explored 100000 steps with 10223 reset in 63 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10216 reset in 55 ms.
Product exploration explored 100000 steps with 10282 reset in 94 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 20 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 17 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 17 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 17 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 23 rules in 5 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2021-05-09 14:40:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-09 14:40:25] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:40:25] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/20 places, 13/18 transitions.
Product exploration explored 100000 steps with 19056 reset in 73 ms.
Product exploration explored 100000 steps with 19077 reset in 76 ms.
[2021-05-09 14:40:25] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:40:25] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:40:25] [INFO ] Time to serialize gal into /tmp/LTL5106789274740726416.gal : 1 ms
[2021-05-09 14:40:25] [INFO ] Time to serialize properties into /tmp/LTL14532141006986320087.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5106789274740726416.gal, -t, CGAL, -LTL, /tmp/LTL14532141006986320087.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5106789274740726416.gal -t CGAL -LTL /tmp/LTL14532141006986320087.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((Uf>=1)&&(MwU>=1))"))))
Formula 0 simplified : !XF"((Uf>=1)&&(MwU>=1))"
Detected timeout of ITS tools.
[2021-05-09 14:40:40] [INFO ] Flatten gal took : 4 ms
[2021-05-09 14:40:40] [INFO ] Applying decomposition
[2021-05-09 14:40:40] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph672433825290336735.txt, -o, /tmp/graph672433825290336735.bin, -w, /tmp/graph672433825290336735.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph672433825290336735.bin, -l, -1, -v, -w, /tmp/graph672433825290336735.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:40:40] [INFO ] Decomposing Gal with order
[2021-05-09 14:40:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:40:40] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 14:40:40] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:40:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 14:40:40] [INFO ] Time to serialize gal into /tmp/LTL7437610494838773765.gal : 1 ms
[2021-05-09 14:40:40] [INFO ] Time to serialize properties into /tmp/LTL5656761582954457692.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7437610494838773765.gal, -t, CGAL, -LTL, /tmp/LTL5656761582954457692.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7437610494838773765.gal -t CGAL -LTL /tmp/LTL5656761582954457692.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((u0.Uf>=1)&&(u4.MwU>=1))"))))
Formula 0 simplified : !XF"((u0.Uf>=1)&&(u4.MwU>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11566392790802411210
[2021-05-09 14:40:55] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11566392790802411210
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11566392790802411210]
Compilation finished in 132 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11566392790802411210]
Link finished in 35 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11566392790802411210]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N1000P0-05 finished in 45945 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 18 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 17 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 17 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 14 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 12 transition count 9
Applied a total of 22 rules in 2 ms. Remains 12 /25 variables (removed 13) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 14:41:10] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:41:10] [INFO ] Implicit Places using invariants in 17 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
[2021-05-09 14:41:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 14:41:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:41:10] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 11/25 places, 9/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 8 transition count 6
Applied a total of 6 rules in 1 ms. Remains 8 /11 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 14:41:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:41:10] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 14:41:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:41:10] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 8/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s5 1)), p1:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 14 reset in 50 ms.
Stack based approach found an accepted trace after 37 steps with 1 reset with depth 35 and stack size 35 in 0 ms.
FORMULA ClientsAndServers-PT-N1000P0-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-07 finished in 217 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||(X(F(p1))&&(G(!p1)||p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 0 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 14:41:10] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 14:41:10] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 14:41:10] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 14:41:10] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 14:41:10] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 14:41:10] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-09 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s6 1) (GEQ s19 1)), p1:(AND (GEQ s11 1) (GEQ s17 1)), p2:(OR (LT s2 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5700 reset in 80 ms.
Product exploration explored 100000 steps with 5704 reset in 85 ms.
Knowledge obtained : [(NOT p0), (NOT p1), p2]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 5710 reset in 76 ms.
Product exploration explored 100000 steps with 5651 reset in 76 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 6 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 22 transition count 18
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 22 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 22 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 7 rules in 3 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2021-05-09 14:41:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 14:41:11] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 14:41:11] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 18/18 transitions.
Product exploration explored 100000 steps with 8778 reset in 116 ms.
Product exploration explored 100000 steps with 8884 reset in 87 ms.
[2021-05-09 14:41:11] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:41:11] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:41:11] [INFO ] Time to serialize gal into /tmp/LTL4917257810901913797.gal : 7 ms
[2021-05-09 14:41:11] [INFO ] Time to serialize properties into /tmp/LTL381462429274462728.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4917257810901913797.gal, -t, CGAL, -LTL, /tmp/LTL381462429274462728.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4917257810901913797.gal -t CGAL -LTL /tmp/LTL381462429274462728.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("((StF>=1)&&(SpA>=1))")||((X(F("((SG>=1)&&(SwG>=1))")))&&(("((SF<1)||(Mi<1))")||(G("((SG<1)||(SwG<1))")))))))
Formula 0 simplified : !F("((StF>=1)&&(SpA>=1))" | (XF"((SG>=1)&&(SwG>=1))" & ("((SF<1)||(Mi<1))" | G"((SG<1)||(SwG<1))")))
Detected timeout of ITS tools.
[2021-05-09 14:41:26] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:41:26] [INFO ] Applying decomposition
[2021-05-09 14:41:26] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9095677453668614189.txt, -o, /tmp/graph9095677453668614189.bin, -w, /tmp/graph9095677453668614189.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9095677453668614189.bin, -l, -1, -v, -w, /tmp/graph9095677453668614189.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:41:27] [INFO ] Decomposing Gal with order
[2021-05-09 14:41:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:41:27] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 14:41:27] [INFO ] Flatten gal took : 4 ms
[2021-05-09 14:41:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 14:41:27] [INFO ] Time to serialize gal into /tmp/LTL17451957664157260103.gal : 1 ms
[2021-05-09 14:41:27] [INFO ] Time to serialize properties into /tmp/LTL6469377739167361000.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17451957664157260103.gal, -t, CGAL, -LTL, /tmp/LTL6469377739167361000.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17451957664157260103.gal -t CGAL -LTL /tmp/LTL6469377739167361000.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(("((i3.u1.StF>=1)&&(i0.u0.SpA>=1))")||((X(F("((i2.u6.SG>=1)&&(i1.u8.SwG>=1))")))&&(("((i3.u1.SF<1)||(i2.u5.Mi<1))")||(G("((i2.u6.SG<1)||(i1.u8.SwG<1))")))))))
Formula 0 simplified : !F("((i3.u1.StF>=1)&&(i0.u0.SpA>=1))" | (XF"((i2.u6.SG>=1)&&(i1.u8.SwG>=1))" & ("((i3.u1.SF<1)||(i2.u5.Mi<1))" | G"((i2.u6.SG<1)||(i1.u8.SwG<1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10114887562915632998
[2021-05-09 14:41:42] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10114887562915632998
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10114887562915632998]
Compilation finished in 109 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10114887562915632998]
Link finished in 38 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(((LTLAPp0==true)||(X(<>((LTLAPp1==true)))&&([](!(LTLAPp1==true))||(LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10114887562915632998]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N1000P0-09 finished in 46383 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)&&(p1||X((X(p0)&&F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:41:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:41:57] [INFO ] Implicit Places using invariants in 53 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:41:57] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:41:57] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Starting structural reductions, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:41:57] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:41:58] [INFO ] Dead Transitions using invariants and state equation in 932 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s6 1), p1:(AND (GEQ s5 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 482 reset in 94 ms.
Product exploration explored 100000 steps with 496 reset in 105 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 449 reset in 90 ms.
Product exploration explored 100000 steps with 516 reset in 107 ms.
Applying partial POR strategy [true, true, true, true, true, true]
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 20 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 16 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 16 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 16 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 15 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 15 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 22 rules in 3 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2021-05-09 14:41:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-09 14:41:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:41:59] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/20 places, 13/18 transitions.
Product exploration explored 100000 steps with 4 reset in 76 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 0 ms.
FORMULA ClientsAndServers-PT-N1000P0-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-11 finished in 2317 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 15 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 2 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-09 14:41:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 14:41:59] [INFO ] Implicit Places using invariants in 16 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
[2021-05-09 14:41:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 11 cols
[2021-05-09 14:41:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:41:59] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 11/25 places, 8/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 9 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 8 transition count 5
Applied a total of 6 rules in 1 ms. Remains 8 /11 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 8 cols
[2021-05-09 14:41:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:41:59] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 5 rows 8 cols
[2021-05-09 14:41:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:41:59] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 8/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA ClientsAndServers-PT-N1000P0-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-12 finished in 308 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0||(F(p0)&&F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 14:41:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 14:41:59] [INFO ] Implicit Places using invariants in 15 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:41:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:41:59] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:41:59] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:41:59] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s13 1)), p1:(OR (LT s1 1) (LT s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9365 reset in 54 ms.
Product exploration explored 100000 steps with 9366 reset in 62 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 9407 reset in 57 ms.
Product exploration explored 100000 steps with 9270 reset in 73 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Support contains 4 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 20 transition count 17
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 20 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 20 transition count 17
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 19 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 19 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 14 rules in 8 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 14:42:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-09 14:42:00] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:42:00] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 7141 reset in 85 ms.
Stack based approach found an accepted trace after 15445 steps with 1490 reset with depth 111 and stack size 109 in 14 ms.
FORMULA ClientsAndServers-PT-N1000P0-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-13 finished in 1178 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(!p0) U G(!p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:42:00] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:42:00] [INFO ] Implicit Places using invariants in 24 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:42:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:42:00] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:42:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:42:00] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 96 ms :[p1, p1, p0]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s12 1), p0:(OR (LT s8 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14 reset in 109 ms.
Product exploration explored 100000 steps with 10 reset in 190 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 126 ms :[p1, p1, p0]
Product exploration explored 100000 steps with 82 reset in 107 ms.
Product exploration explored 100000 steps with 34 reset in 127 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 107 ms :[p1, p1, p0]
Support contains 3 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 20 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 17 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 17 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 17 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 19 rules in 2 ms. Remains 16 /20 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2021-05-09 14:42:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2021-05-09 14:42:02] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:42:02] [INFO ] Dead Transitions using invariants and state equation in 776 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/20 places, 14/18 transitions.
Product exploration explored 100000 steps with 36 reset in 80 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 37 in 0 ms.
FORMULA ClientsAndServers-PT-N1000P0-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-14 finished in 2028 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(F(!p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 14 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 12 transition count 9
Applied a total of 22 rules in 2 ms. Remains 12 /25 variables (removed 13) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 14:42:02] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:42:03] [INFO ] Implicit Places using invariants in 347 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 14:42:03] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:42:03] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
[2021-05-09 14:42:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 14:42:03] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:42:04] [INFO ] Dead Transitions using invariants and state equation in 390 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/25 places, 9/18 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s8 1)), p1:(LT s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 69 ms.
Product exploration explored 100000 steps with 0 reset in 98 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 123 ms.
Product exploration explored 100000 steps with 0 reset in 88 ms.
[2021-05-09 14:42:04] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:42:04] [INFO ] Flatten gal took : 0 ms
[2021-05-09 14:42:04] [INFO ] Time to serialize gal into /tmp/LTL15821178879377855525.gal : 0 ms
[2021-05-09 14:42:04] [INFO ] Time to serialize properties into /tmp/LTL4965578242225422301.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15821178879377855525.gal, -t, CGAL, -LTL, /tmp/LTL4965578242225422301.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15821178879377855525.gal -t CGAL -LTL /tmp/LTL4965578242225422301.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((X(F("(Ci>=1)")))||("((SR>=1)&&(Mi>=1))")))))
Formula 0 simplified : !FG("((SR>=1)&&(Mi>=1))" | XF"(Ci>=1)")
Detected timeout of ITS tools.
[2021-05-09 14:42:19] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:42:19] [INFO ] Applying decomposition
[2021-05-09 14:42:19] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14415306305035859543.txt, -o, /tmp/graph14415306305035859543.bin, -w, /tmp/graph14415306305035859543.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14415306305035859543.bin, -l, -1, -v, -w, /tmp/graph14415306305035859543.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:42:19] [INFO ] Decomposing Gal with order
[2021-05-09 14:42:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:42:19] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:42:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 14:42:19] [INFO ] Time to serialize gal into /tmp/LTL13283135972563515846.gal : 0 ms
[2021-05-09 14:42:19] [INFO ] Time to serialize properties into /tmp/LTL13787244309138082660.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13283135972563515846.gal, -t, CGAL, -LTL, /tmp/LTL13787244309138082660.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13283135972563515846.gal -t CGAL -LTL /tmp/LTL13787244309138082660.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G((X(F("(u3.Ci>=1)")))||("((u2.SR>=1)&&(i0.u1.Mi>=1))")))))
Formula 0 simplified : !FG("((u2.SR>=1)&&(i0.u1.Mi>=1))" | XF"(u3.Ci>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3031692790016833570
[2021-05-09 14:42:35] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3031692790016833570
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3031692790016833570]
Compilation finished in 105 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3031692790016833570]
Link finished in 50 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([]((X(<>((LTLAPp0==true)))||(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3031692790016833570]
LTSmin run took 895 ms.
FORMULA ClientsAndServers-PT-N1000P0-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N1000P0-15 finished in 33162 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-09 14:42:36] [INFO ] Applying decomposition
[2021-05-09 14:42:36] [INFO ] Flatten gal took : 1 ms
Built C files in :
/tmp/ltsmin418484421156738746
[2021-05-09 14:42:36] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-09 14:42:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 14:42:36] [INFO ] Computing symmetric may enable matrix : 18 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12322209639967340862.txt, -o, /tmp/graph12322209639967340862.bin, -w, /tmp/graph12322209639967340862.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12322209639967340862.bin, -l, -1, -v, -w, /tmp/graph12322209639967340862.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:42:36] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 14:42:36] [INFO ] Decomposing Gal with order
[2021-05-09 14:42:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:42:36] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 14:42:36] [INFO ] Flatten gal took : 3 ms
[2021-05-09 14:42:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 14:42:36] [INFO ] Time to serialize gal into /tmp/LTLFireability13794681489041695952.gal : 1 ms
[2021-05-09 14:42:36] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-09 14:42:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 14:42:36] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin418484421156738746
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin418484421156738746]
[2021-05-09 14:42:36] [INFO ] Time to serialize properties into /tmp/LTLFireability6097100093225167963.ltl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability13794681489041695952.gal, -t, CGAL, -LTL, /tmp/LTLFireability6097100093225167963.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability13794681489041695952.gal -t CGAL -LTL /tmp/LTLFireability6097100093225167963.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X((F("((i0.u1.SF>=1)&&(i1.u0.Mi>=1))"))&&(F("(i1.u0.MpA>=1)")))))
Formula 0 simplified : !X(F"((i0.u1.SF>=1)&&(i1.u0.Mi>=1))" & F"(i1.u0.MpA>=1)")
Compilation finished in 137 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin418484421156738746]
Link finished in 59 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin418484421156738746]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: LTL layer: formula: X((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: "X((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.032: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.152: DFS-FIFO for weak LTL, using special progress label 25
pins2lts-mc-linux64( 0/ 8), 0.152: There are 26 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.152: State length is 26, there are 24 groups
pins2lts-mc-linux64( 0/ 8), 0.152: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.152: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.152: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.152: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.393: ~109 levels ~960 states ~5944 transitions
pins2lts-mc-linux64( 0/ 8), 0.396: ~217 levels ~1920 states ~13840 transitions
pins2lts-mc-linux64( 0/ 8), 0.398: ~438 levels ~3840 states ~30944 transitions
pins2lts-mc-linux64( 5/ 8), 0.393: ~887 levels ~7680 states ~76720 transitions
pins2lts-mc-linux64( 0/ 8), 0.426: ~1777 levels ~15360 states ~163104 transitions
pins2lts-mc-linux64( 0/ 8), 0.472: ~3539 levels ~30720 states ~345616 transitions
pins2lts-mc-linux64( 0/ 8), 0.564: ~7099 levels ~61440 states ~713408 transitions
pins2lts-mc-linux64( 0/ 8), 0.780: ~14287 levels ~122880 states ~1480800 transitions
pins2lts-mc-linux64( 0/ 8), 1.144: ~28501 levels ~245760 states ~2967696 transitions
pins2lts-mc-linux64( 0/ 8), 1.283: ~34171 levels ~491520 states ~3328360 transitions
pins2lts-mc-linux64( 0/ 8), 1.572: ~34171 levels ~983040 states ~4045560 transitions
pins2lts-mc-linux64( 7/ 8), 2.511: ~33343 levels ~1966080 states ~5621896 transitions
pins2lts-mc-linux64( 7/ 8), 4.434: ~33388 levels ~3932160 states ~8814712 transitions
pins2lts-mc-linux64( 1/ 8), 9.412: ~33514 levels ~7864320 states ~15623976 transitions
pins2lts-mc-linux64( 3/ 8), 12.622: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 12.740:
pins2lts-mc-linux64( 0/ 8), 12.740: mean standard work distribution: 17.0% (states) 12.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 12.740:
pins2lts-mc-linux64( 0/ 8), 12.740: Explored 6625782 states 14189043 transitions, fanout: 2.141
pins2lts-mc-linux64( 0/ 8), 12.740: Total exploration time 12.570 sec (12.450 sec minimum, 12.522 sec on average)
pins2lts-mc-linux64( 0/ 8), 12.740: States per second: 527111, Transitions per second: 1128802
pins2lts-mc-linux64( 0/ 8), 12.740:
pins2lts-mc-linux64( 0/ 8), 12.740: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 12.740: Redundant explorations: -28.3783
pins2lts-mc-linux64( 0/ 8), 12.740:
pins2lts-mc-linux64( 0/ 8), 12.740: Queue width: 8B, total height: 269623, memory: 2.06MB
pins2lts-mc-linux64( 0/ 8), 12.740: Tree memory: 326.6MB, 37.0 B/state, compr.: 34.9%
pins2lts-mc-linux64( 0/ 8), 12.740: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 12.740: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 12.740: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 12.740: Est. total memory use: 328.6MB (~1026.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin418484421156738746]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin418484421156738746]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-09 15:03:36] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:03:36] [INFO ] Time to serialize gal into /tmp/LTLFireability170751465715541459.gal : 16 ms
[2021-05-09 15:03:36] [INFO ] Time to serialize properties into /tmp/LTLFireability9218649819856302880.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability170751465715541459.gal, -t, CGAL, -LTL, /tmp/LTLFireability9218649819856302880.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability170751465715541459.gal -t CGAL -LTL /tmp/LTLFireability9218649819856302880.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((X((F("((SF>=1)&&(Mi>=1))"))&&(F("(MpA>=1)")))))
Formula 0 simplified : !X(F"((SF>=1)&&(Mi>=1))" & F"(MpA>=1)")
Detected timeout of ITS tools.
[2021-05-09 15:24:36] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:24:36] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-09 15:24:36] [INFO ] Transformed 25 places.
[2021-05-09 15:24:36] [INFO ] Transformed 18 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 15:24:36] [INFO ] Time to serialize gal into /tmp/LTLFireability15279664990770495720.gal : 0 ms
[2021-05-09 15:24:36] [INFO ] Time to serialize properties into /tmp/LTLFireability7997981431706202794.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability15279664990770495720.gal, -t, CGAL, -LTL, /tmp/LTLFireability7997981431706202794.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability15279664990770495720.gal -t CGAL -LTL /tmp/LTLFireability7997981431706202794.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F("((SF>=1)&&(Mi>=1))"))&&(F("(MpA>=1)")))))
Formula 0 simplified : !X(F"((SF>=1)&&(Mi>=1))" & F"(MpA>=1)")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N1000P0"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N1000P0, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r045-oct2-162038291700245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N1000P0.tgz
mv ClientsAndServers-PT-N1000P0 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;