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-162038291700253.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-N2000P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291700253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K 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.4K 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.0K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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.2K 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-N2000P0-00
FORMULA_NAME ClientsAndServers-PT-N2000P0-01
FORMULA_NAME ClientsAndServers-PT-N2000P0-02
FORMULA_NAME ClientsAndServers-PT-N2000P0-03
FORMULA_NAME ClientsAndServers-PT-N2000P0-04
FORMULA_NAME ClientsAndServers-PT-N2000P0-05
FORMULA_NAME ClientsAndServers-PT-N2000P0-06
FORMULA_NAME ClientsAndServers-PT-N2000P0-07
FORMULA_NAME ClientsAndServers-PT-N2000P0-08
FORMULA_NAME ClientsAndServers-PT-N2000P0-09
FORMULA_NAME ClientsAndServers-PT-N2000P0-10
FORMULA_NAME ClientsAndServers-PT-N2000P0-11
FORMULA_NAME ClientsAndServers-PT-N2000P0-12
FORMULA_NAME ClientsAndServers-PT-N2000P0-13
FORMULA_NAME ClientsAndServers-PT-N2000P0-14
FORMULA_NAME ClientsAndServers-PT-N2000P0-15

=== Now, execution of the tool begins

BK_START 1620573357779

Running Version 0
[2021-05-09 15:15:59] [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 15:15:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:15:59] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-09 15:15:59] [INFO ] Transformed 25 places.
[2021-05-09 15:15:59] [INFO ] Transformed 18 transitions.
[2021-05-09 15:15:59] [INFO ] Parsed PT model containing 25 places and 18 transitions in 50 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 15:15:59] [INFO ] Initial state test concluded for 1 properties.
Support contains 21 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 8 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 15:15:59] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-09 15:15:59] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 15:15:59] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 15:15:59] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 15:15:59] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 15:15:59] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/25 places, 18/18 transitions.
[2021-05-09 15:15:59] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 15:15:59] [INFO ] Flatten gal took : 16 ms
FORMULA ClientsAndServers-PT-N2000P0-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:15:59] [INFO ] Flatten gal took : 5 ms
[2021-05-09 15:15:59] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100025 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=3226 ) properties (out of 20) seen :11
Running SMT prover for 9 properties.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 15:16:00] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-09 15:16:00] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 15:16:00] [INFO ] Added : 12 causal constraints over 3 iterations in 20 ms. Result :sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-09 15:16:00] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:16:00] [INFO ] Added : 16 causal constraints over 4 iterations in 14 ms. Result :sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-09 15:16:00] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:16:00] [INFO ] Added : 13 causal constraints over 3 iterations in 16 ms. Result :sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 15:16:00] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 15:16:00] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:16:00] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:16:00] [INFO ] Added : 14 causal constraints over 3 iterations in 13 ms. Result :sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-09 15:16:00] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 15:16:00] [INFO ] Added : 10 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:16:00] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:16:00] [INFO ] Added : 12 causal constraints over 3 iterations in 9 ms. Result :sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-09 15:16:00] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 15:16:00] [INFO ] Added : 14 causal constraints over 3 iterations in 12 ms. Result :sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-09 15:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:16:00] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-09 15:16:00] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-09 15:16:00] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 7 rules applied. Total rules applied 7 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 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 2 with 4 rules applied. Total rules applied 16 place count 14 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 2 with 6 rules applied. Total rules applied 22 place count 11 transition count 8
Applied a total of 22 rules in 6 ms. Remains 11 /23 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2021-05-09 15:16:00] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:16:00] [INFO ] Implicit Places using invariants in 16 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
[2021-05-09 15:16:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-09 15:16:00] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:16:00] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 9/23 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 9 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 7 transition count 6
Applied a total of 4 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 15:16:00] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:16:00] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 15:16:00] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 15:16:00] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LT s3 1), p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8956 reset in 228 ms.
Product exploration explored 100000 steps with 8832 reset in 147 ms.
Knowledge obtained : [p2, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 8976 reset in 100 ms.
Product exploration explored 100000 steps with 8984 reset in 106 ms.
Starting structural reductions, iteration 0 : 7/7 places, 6/6 transitions.
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 3 rules applied. Total rules applied 3 place count 7 transition count 3
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4 transition count 3
Applied a total of 6 rules in 1 ms. Remains 4 /7 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 4 cols
[2021-05-09 15:16:01] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:16:01] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2021-05-09 15:16:01] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:16:01] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2021-05-09 15:16:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2021-05-09 15:16:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:16:01] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/7 places, 3/6 transitions.
[2021-05-09 15:16:01] [INFO ] Flatten gal took : 3 ms
[2021-05-09 15:16:01] [INFO ] Flatten gal took : 3 ms
[2021-05-09 15:16:01] [INFO ] Time to serialize gal into /tmp/LTL12119788793212777332.gal : 2 ms
[2021-05-09 15:16:01] [INFO ] Time to serialize properties into /tmp/LTL3863892911568429020.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/LTL12119788793212777332.gal, -t, CGAL, -LTL, /tmp/LTL3863892911568429020.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/LTL12119788793212777332.gal -t CGAL -LTL /tmp/LTL3863892911568429020.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 15 LTL properties
Checking formula 0 : !((G(F(("(SpG>=1)")||(("((MtF>=1)&&(SpG>=1))")U("(MpG<1)"))))))
Formula 0 simplified : !GF("(SpG>=1)" | ("((MtF>=1)&&(SpG>=1))" U "(MpG<1)"))
Detected timeout of ITS tools.
[2021-05-09 15:16:16] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:16:16] [INFO ] Applying decomposition
[2021-05-09 15:16:16] [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/graph14744448975574258488.txt, -o, /tmp/graph14744448975574258488.bin, -w, /tmp/graph14744448975574258488.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/graph14744448975574258488.bin, -l, -1, -v, -w, /tmp/graph14744448975574258488.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:16:16] [INFO ] Decomposing Gal with order
[2021-05-09 15:16:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:16:16] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:16:16] [INFO ] Flatten gal took : 22 ms
[2021-05-09 15:16:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 15:16:16] [INFO ] Time to serialize gal into /tmp/LTL6567601701175125339.gal : 2 ms
[2021-05-09 15:16:16] [INFO ] Time to serialize properties into /tmp/LTL1912873465404680033.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/LTL6567601701175125339.gal, -t, CGAL, -LTL, /tmp/LTL1912873465404680033.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/LTL6567601701175125339.gal -t CGAL -LTL /tmp/LTL1912873465404680033.ltl -c -stutter-deadlock
Read 15 LTL properties
Checking formula 0 : !((G(F(("(i3.u7.SpG>=1)")||(("((i2.u5.MtF>=1)&&(i3.u7.SpG>=1))")U("(i2.u6.MpG<1)"))))))
Formula 0 simplified : !GF("(i3.u7.SpG>=1)" | ("((i2.u5.MtF>=1)&&(i3.u7.SpG>=1))" U "(i2.u6.MpG<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10248094113348574894
[2021-05-09 15:16:31] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10248094113348574894
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/ltsmin10248094113348574894]
Compilation finished in 243 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10248094113348574894]
Link finished in 54 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)||((LTLAPp1==true) U (LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10248094113348574894]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N2000P0-00 finished in 46483 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((X(X(G(!p1))) U (p2&&X(X(G(!p1))))))||p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 15:16:46] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 15:16:46] [INFO ] Implicit Places using invariants in 32 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:16:46] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 15:16:46] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 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 15:16:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:16:46] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), p1, p1, true]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s16 1) (AND (GEQ s4 1) (GEQ s18 1))), p2:(OR (GEQ s16 1) (AND (GEQ s4 1) (GEQ s18 1))), p1:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-01 finished in 278 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||X(X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 0 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:16:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:16:47] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:16:47] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 15:16:47] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:16:47] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:16:47] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(GEQ s16 1), p1:(AND (GEQ s3 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24935 reset in 90 ms.
Product exploration explored 100000 steps with 24956 reset in 89 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25028 reset in 74 ms.
Product exploration explored 100000 steps with 24997 reset in 111 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (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 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 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 21 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 19 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 19 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 15 rules in 9 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 15:16:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-09 15:16:48] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:16:48] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 26628 reset in 336 ms.
Product exploration explored 100000 steps with 26703 reset in 219 ms.
[2021-05-09 15:16:49] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:16:49] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:16:49] [INFO ] Time to serialize gal into /tmp/LTL14127175555188766358.gal : 1 ms
[2021-05-09 15:16:49] [INFO ] Time to serialize properties into /tmp/LTL239306298674061093.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/LTL14127175555188766358.gal, -t, CGAL, -LTL, /tmp/LTL239306298674061093.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/LTL14127175555188766358.gal -t CGAL -LTL /tmp/LTL239306298674061093.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(StR>=1)"))||(X(X(G("((SR>=1)&&(Mi>=1))")))))))
Formula 0 simplified : !X(F"(StR>=1)" | XXG"((SR>=1)&&(Mi>=1))")
Detected timeout of ITS tools.
[2021-05-09 15:17:04] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:17:04] [INFO ] Applying decomposition
[2021-05-09 15:17:04] [INFO ] Flatten gal took : 2 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/graph14848263273174081645.txt, -o, /tmp/graph14848263273174081645.bin, -w, /tmp/graph14848263273174081645.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/graph14848263273174081645.bin, -l, -1, -v, -w, /tmp/graph14848263273174081645.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:17:04] [INFO ] Decomposing Gal with order
[2021-05-09 15:17:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:17:04] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:17:04] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:17:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 15:17:04] [INFO ] Time to serialize gal into /tmp/LTL10364370515449829090.gal : 1 ms
[2021-05-09 15:17:04] [INFO ] Time to serialize properties into /tmp/LTL16551366980812512655.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/LTL10364370515449829090.gal, -t, CGAL, -LTL, /tmp/LTL16551366980812512655.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/LTL10364370515449829090.gal -t CGAL -LTL /tmp/LTL16551366980812512655.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(i3.u3.StR>=1)"))||(X(X(G("((i3.u3.SR>=1)&&(i0.u5.Mi>=1))")))))))
Formula 0 simplified : !X(F"(i3.u3.StR>=1)" | XXG"((i3.u3.SR>=1)&&(i0.u5.Mi>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin835708586368007586
[2021-05-09 15:17:19] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin835708586368007586
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/ltsmin835708586368007586]
Compilation finished in 127 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin835708586368007586]
Link finished in 37 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))||X(X([]((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin835708586368007586]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N2000P0-02 finished in 46936 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 6 rules applied. Total rules applied 6 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 11 place count 17 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 14 transition count 10
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 2 with 4 rules applied. Total rules applied 21 place count 12 transition count 8
Applied a total of 21 rules in 3 ms. Remains 12 /23 variables (removed 11) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-09 15:17:34] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 15:17:34] [INFO ] Implicit Places using invariants in 30 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
[2021-05-09 15:17:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 11 cols
[2021-05-09 15:17:34] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:17:34] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 11/23 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
Applied a total of 4 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 9 cols
[2021-05-09 15:17:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:17:34] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2021-05-09 15:17:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:17:34] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-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:(OR (LT s2 1) (LT s7 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 7 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-03 finished in 188 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 15 transition count 10
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 18 place count 13 transition count 10
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 2 with 6 rules applied. Total rules applied 24 place count 10 transition count 7
Applied a total of 24 rules in 6 ms. Remains 10 /23 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2021-05-09 15:17:34] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:17:34] [INFO ] Implicit Places using invariants in 12 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
[2021-05-09 15:17:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-09 15:17:34] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:17:34] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 8/23 places, 7/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 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Applied a total of 4 rules in 1 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 15:17:34] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:17:34] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 15:17:34] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:17:34] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10296 reset in 53 ms.
Product exploration explored 100000 steps with 10314 reset in 56 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10233 reset in 49 ms.
Product exploration explored 100000 steps with 10252 reset in 67 ms.
[2021-05-09 15:17:34] [INFO ] Flatten gal took : 4 ms
[2021-05-09 15:17:34] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:17:34] [INFO ] Time to serialize gal into /tmp/LTL12894618430216601040.gal : 8 ms
[2021-05-09 15:17:34] [INFO ] Time to serialize properties into /tmp/LTL4194901914808917900.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/LTL12894618430216601040.gal, -t, CGAL, -LTL, /tmp/LTL4194901914808917900.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/LTL12894618430216601040.gal -t CGAL -LTL /tmp/LTL4194901914808917900.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(MpA>=1)")))
Formula 0 simplified : !F"(MpA>=1)"
Detected timeout of ITS tools.
[2021-05-09 15:17:49] [INFO ] Flatten gal took : 0 ms
[2021-05-09 15:17:49] [INFO ] Applying decomposition
[2021-05-09 15:17:49] [INFO ] Flatten gal took : 0 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/graph16285915576498292722.txt, -o, /tmp/graph16285915576498292722.bin, -w, /tmp/graph16285915576498292722.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/graph16285915576498292722.bin, -l, -1, -v, -w, /tmp/graph16285915576498292722.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:17:49] [INFO ] Decomposing Gal with order
[2021-05-09 15:17:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:17:49] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:17:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 15:17:49] [INFO ] Time to serialize gal into /tmp/LTL1351950943415504723.gal : 5 ms
[2021-05-09 15:17:49] [INFO ] Time to serialize properties into /tmp/LTL2803127003335022292.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/LTL1351950943415504723.gal, -t, CGAL, -LTL, /tmp/LTL2803127003335022292.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/LTL1351950943415504723.gal -t CGAL -LTL /tmp/LTL2803127003335022292.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F("(u1.MpA>=1)")))
Formula 0 simplified : !F"(u1.MpA>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3759832260271513470
[2021-05-09 15:18:04] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3759832260271513470
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/ltsmin3759832260271513470]
Compilation finished in 112 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3759832260271513470]
Link finished in 58 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)), --buchi-type=spotba], workingDir=/tmp/ltsmin3759832260271513470]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N2000P0-04 finished in 45506 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 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 0 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:18:19] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:18:19] [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 20 cols
[2021-05-09 15:18:19] [INFO ] Computed 3 place invariants in 13 ms
[2021-05-09 15:18:19] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Starting structural reductions, iteration 1 : 20/23 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 15:18:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:18:19] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s15 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][false, false, false, false]]
Product exploration explored 100000 steps with 10206 reset in 60 ms.
Product exploration explored 100000 steps with 10236 reset in 60 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 10274 reset in 56 ms.
Product exploration explored 100000 steps with 10241 reset in 68 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) 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 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 6 place count 20 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 3 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 3 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 3 rules applied. Total rules applied 18 place count 17 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 15 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 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 2 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2021-05-09 15:18:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-09 15:18:20] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:18:20] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/20 places, 13/18 transitions.
Product exploration explored 100000 steps with 12382 reset in 164 ms.
Product exploration explored 100000 steps with 12339 reset in 127 ms.
[2021-05-09 15:18:21] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:18:21] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:18:21] [INFO ] Time to serialize gal into /tmp/LTL2904749193690079360.gal : 1 ms
[2021-05-09 15:18:21] [INFO ] Time to serialize properties into /tmp/LTL18240326236796785693.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/LTL2904749193690079360.gal, -t, CGAL, -LTL, /tmp/LTL18240326236796785693.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/LTL2904749193690079360.gal -t CGAL -LTL /tmp/LTL18240326236796785693.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((Uf>=1)&&(MwU>=1))"))&&(F("(StR<1)")))))
Formula 0 simplified : !X(F"((Uf>=1)&&(MwU>=1))" & F"(StR<1)")
Detected timeout of ITS tools.
[2021-05-09 15:18:36] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:18:36] [INFO ] Applying decomposition
[2021-05-09 15:18:36] [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/graph5697006921435234521.txt, -o, /tmp/graph5697006921435234521.bin, -w, /tmp/graph5697006921435234521.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/graph5697006921435234521.bin, -l, -1, -v, -w, /tmp/graph5697006921435234521.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:18:36] [INFO ] Decomposing Gal with order
[2021-05-09 15:18:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:18:36] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:18:36] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:18:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 15:18:36] [INFO ] Time to serialize gal into /tmp/LTL5900046827223168726.gal : 6 ms
[2021-05-09 15:18:36] [INFO ] Time to serialize properties into /tmp/LTL8238105780531225661.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/LTL5900046827223168726.gal, -t, CGAL, -LTL, /tmp/LTL8238105780531225661.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/LTL5900046827223168726.gal -t CGAL -LTL /tmp/LTL8238105780531225661.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("((u0.Uf>=1)&&(u3.MwU>=1))"))&&(F("(u3.StR<1)")))))
Formula 0 simplified : !X(F"((u0.Uf>=1)&&(u3.MwU>=1))" & F"(u3.StR<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10027586535160068907
[2021-05-09 15:18:51] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10027586535160068907
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/ltsmin10027586535160068907]
Compilation finished in 128 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10027586535160068907]
Link finished in 51 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/ltsmin10027586535160068907]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N2000P0-05 finished in 46626 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||G(!p1)||(X(p0)&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 0 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:19:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:19:06] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:19:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:19:06] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:19:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:19:06] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (NOT p2), (AND p1 (NOT p0)), (AND (NOT p2) p1), true, p1]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p1, acceptance={} source=8 dest: 7}, { cond=(NOT p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s14 1)), p1:(LT s12 1), p2:(GEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-06 finished in 471 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&(G(F(p1)) U G(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 0 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:19:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:19:06] [INFO ] Implicit Places using invariants in 21 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 15:19:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:19:06] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 20/23 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 15:19:07] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:19:07] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) p2), (NOT p2), true]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s8 1) (GEQ s14 1)), p1:(GEQ s18 1), p0:(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]]
Entered a terminal (fully accepting) state of product in 3704 steps with 5 reset in 5 ms.
FORMULA ClientsAndServers-PT-N2000P0-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-07 finished in 330 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (G(p1)||G(p0)||(X(G(!p3))&&p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 15:19:07] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 15:19:07] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 15:19:07] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 15:19:07] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 15:19:07] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 15:19:07] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 281 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (NOT p1), p3, (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) p3)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p2 p0), acceptance={} source=2 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p3, acceptance={} source=4 dest: 0}, { cond=(NOT p3), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0) p3), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p0 p3), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0) p3), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 p0) (AND p0 (NOT p3))), acceptance={} source=5 dest: 5}, { cond=(OR (AND p1 p2 (NOT p0)) (AND p1 (NOT p0) (NOT p3))), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 0}, { cond=(AND p1 p3), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=1, aps=[p1:(LT s21 1), p2:(AND (GEQ s4 1) (GEQ s19 1)), p0:(LT s12 1), p3:(AND (GEQ s2 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-08 finished in 407 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 15:19:07] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 15:19:07] [INFO ] Implicit Places using invariants in 22 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 21 cols
[2021-05-09 15:19:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:19:07] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 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 15:19:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:19:07] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-10 finished in 240 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 15 transition count 10
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 18 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 9 transition count 6
Applied a total of 26 rules in 2 ms. Remains 9 /23 variables (removed 14) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2021-05-09 15:19:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:19:07] [INFO ] Implicit Places using invariants in 41 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
[2021-05-09 15:19:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 15:19:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:19:07] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 7/23 places, 6/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 1 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2021-05-09 15:19:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:19:08] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-09 15:19:08] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:19:08] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/23 places, 4/18 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 45 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 19 in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-11 finished in 268 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 15 transition count 10
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 18 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 9 transition count 6
Applied a total of 26 rules in 1 ms. Remains 9 /23 variables (removed 14) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2021-05-09 15:19:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:19:08] [INFO ] Implicit Places using invariants in 13 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
[2021-05-09 15:19:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 15:19:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:19:08] [INFO ] Dead Transitions using invariants and state equation in 340 ms returned []
Starting structural reductions, iteration 1 : 7/23 places, 6/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 5
Applied a total of 2 rules in 0 ms. Remains 6 /7 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 15:19:08] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:19:08] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 15:19:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:19:08] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s3 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 86 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-12 finished in 767 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(!p0) U (F(p2)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 15:19:08] [INFO ] Computed 5 place invariants in 10 ms
[2021-05-09 15:19:09] [INFO ] Implicit Places using invariants in 55 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:19:09] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:19:09] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 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 15:19:09] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:19:09] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s17 1)), p0:(GEQ s15 1), p2:(GEQ s9 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 828 reset in 117 ms.
Product exploration explored 100000 steps with 454 reset in 239 ms.
Knowledge obtained : [(NOT p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (OR (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 1149 reset in 114 ms.
Product exploration explored 100000 steps with 937 reset in 162 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (OR (NOT p1) (NOT p2)), (NOT p2)]
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 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 19 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 19 transition count 16
Performed 1 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 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 2 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 15:19:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-09 15:19:11] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:19:11] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 73 reset in 92 ms.
Stack based approach found an accepted trace after 214 steps with 2 reset with depth 202 and stack size 201 in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-13 finished in 2274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 15 transition count 10
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 18 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 9 transition count 6
Applied a total of 26 rules in 1 ms. Remains 9 /23 variables (removed 14) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2021-05-09 15:19:11] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:19:11] [INFO ] Implicit Places using invariants in 17 ms returned [5, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
[2021-05-09 15:19:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 15:19:11] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:19:11] [INFO ] Dead Transitions using invariants and state equation in 342 ms returned []
Starting structural reductions, iteration 1 : 7/23 places, 6/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 2 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2021-05-09 15:19:11] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:19:11] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-09 15:19:11] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:19:11] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/23 places, 4/18 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4 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 62 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-14 finished in 604 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 5 rules applied. Total rules applied 5 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 18 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 18 transition count 13
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 12 place count 16 transition count 13
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 2 with 6 rules applied. Total rules applied 18 place count 13 transition count 10
Applied a total of 18 rules in 3 ms. Remains 13 /23 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2021-05-09 15:19:11] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:19:11] [INFO ] Implicit Places using invariants in 15 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
[2021-05-09 15:19:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 15:19:11] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:19:11] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 12/23 places, 10/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2021-05-09 15:19:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 15:19:11] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:19:12] [INFO ] Dead Transitions using invariants and state equation in 208 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/23 places, 10/18 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s9 1) (LT s1 1) (LT s9 1)), p1:(AND (GEQ s0 1) (GEQ s8 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 1149 reset in 94 ms.
Product exploration explored 100000 steps with 1013 reset in 97 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1163 reset in 105 ms.
Product exploration explored 100000 steps with 1171 reset in 154 ms.
[2021-05-09 15:19:12] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:19:12] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:19:12] [INFO ] Time to serialize gal into /tmp/LTL12576363569989087986.gal : 3 ms
[2021-05-09 15:19:12] [INFO ] Time to serialize properties into /tmp/LTL1240081444059222502.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/LTL12576363569989087986.gal, -t, CGAL, -LTL, /tmp/LTL1240081444059222502.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/LTL12576363569989087986.gal -t CGAL -LTL /tmp/LTL1240081444059222502.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((((SR<1)||(Mi<1))||(SF<1))||(Mi<1))"))||(G(F("((Uf>=1)&&(MwU>=1))"))))))
Formula 0 simplified : !F(G"((((SR<1)||(Mi<1))||(SF<1))||(Mi<1))" | GF"((Uf>=1)&&(MwU>=1))")
Detected timeout of ITS tools.
[2021-05-09 15:19:28] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:19:28] [INFO ] Applying decomposition
[2021-05-09 15:19:28] [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/graph6376250796851448080.txt, -o, /tmp/graph6376250796851448080.bin, -w, /tmp/graph6376250796851448080.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/graph6376250796851448080.bin, -l, -1, -v, -w, /tmp/graph6376250796851448080.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:19:28] [INFO ] Decomposing Gal with order
[2021-05-09 15:19:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:19:28] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:19:28] [INFO ] Flatten gal took : 4 ms
[2021-05-09 15:19:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 15:19:28] [INFO ] Time to serialize gal into /tmp/LTL1868079516272318044.gal : 1 ms
[2021-05-09 15:19:28] [INFO ] Time to serialize properties into /tmp/LTL1590996298257928979.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/LTL1868079516272318044.gal, -t, CGAL, -LTL, /tmp/LTL1590996298257928979.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/LTL1868079516272318044.gal -t CGAL -LTL /tmp/LTL1590996298257928979.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("((((u0.SR<1)||(i2.u2.Mi<1))||(u1.SF<1))||(i2.u2.Mi<1))"))||(G(F("((i2.u3.Uf>=1)&&(i2.u3.MwU>=1))"))))))
Formula 0 simplified : !F(G"((((u0.SR<1)||(i2.u2.Mi<1))||(u1.SF<1))||(i2.u2.Mi<1))" | GF"((i2.u3.Uf>=1)&&(i2.u3.MwU>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10638613948810023940
[2021-05-09 15:19:43] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10638613948810023940
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/ltsmin10638613948810023940]
Compilation finished in 124 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10638613948810023940]
Link finished in 68 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))||[](<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10638613948810023940]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N2000P0-15 finished in 46343 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7192199858755339946
[2021-05-09 15:19:58] [INFO ] Applying decomposition
[2021-05-09 15:19:58] [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/graph5782449612487863138.txt, -o, /tmp/graph5782449612487863138.bin, -w, /tmp/graph5782449612487863138.weights], workingDir=null]
[2021-05-09 15:19:58] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-09 15:19:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 15:19:58] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-09 15:19:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 15:19:58] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-09 15:19:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 15:19:58] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7192199858755339946
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/ltsmin7192199858755339946]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5782449612487863138.bin, -l, -1, -v, -w, /tmp/graph5782449612487863138.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:19:58] [INFO ] Decomposing Gal with order
[2021-05-09 15:19:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:19:58] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:19:58] [INFO ] Flatten gal took : 3 ms
[2021-05-09 15:19:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 15:19:58] [INFO ] Time to serialize gal into /tmp/LTLFireability13939529544619708292.gal : 0 ms
[2021-05-09 15:19:58] [INFO ] Time to serialize properties into /tmp/LTLFireability16380652359233608734.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/LTLFireability13939529544619708292.gal, -t, CGAL, -LTL, /tmp/LTLFireability16380652359233608734.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/LTLFireability13939529544619708292.gal -t CGAL -LTL /tmp/LTLFireability16380652359233608734.ltl -c -stutter-deadlock
Read 5 LTL properties
Checking formula 0 : !((G(F(("(i2.u7.SpG>=1)")||(("((i1.u5.MtF>=1)&&(i2.u7.SpG>=1))")U("(i1.u1.MpG<1)"))))))
Formula 0 simplified : !GF("(i2.u7.SpG>=1)" | ("((i1.u5.MtF>=1)&&(i2.u7.SpG>=1))" U "(i1.u1.MpG<1)"))
Compilation finished in 135 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7192199858755339946]
Link finished in 41 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, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true)||((LTLAPp1==true) U (LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7192199858755339946]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: LTL layer: formula: [](<>(((LTLAPp0==true)||((LTLAPp1==true) U (LTLAPp2==true)))))
pins2lts-mc-linux64( 4/ 8), 0.004: "[](<>(((LTLAPp0==true)||((LTLAPp1==true) U (LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.012: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Initializing POR dependencies: labels 26, guards 18
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.014: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.026: There are 28 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.026: State length is 24, there are 21 groups
pins2lts-mc-linux64( 0/ 8), 0.026: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.026: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.026: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.026: Visible groups: 4 / 21, labels: 2 / 28
pins2lts-mc-linux64( 0/ 8), 0.026: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.026: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.193: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 2/ 8), 0.246: [Blue] ~240 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 5/ 8), 0.385: [Blue] ~480 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 5/ 8), 0.459: [Blue] ~960 levels ~7680 states ~7680 transitions
pins2lts-mc-linux64( 1/ 8), 0.510: [Blue] ~1920 levels ~15360 states ~15360 transitions
pins2lts-mc-linux64( 5/ 8), 0.531: [Blue] ~3840 levels ~30720 states ~30720 transitions
pins2lts-mc-linux64( 1/ 8), 0.560: [Blue] ~7680 levels ~61440 states ~61440 transitions
pins2lts-mc-linux64( 1/ 8), 0.682: [Blue] ~15360 levels ~122880 states ~122880 transitions
pins2lts-mc-linux64( 1/ 8), 0.949: [Blue] ~27070 levels ~245760 states ~350952 transitions
pins2lts-mc-linux64( 1/ 8), 1.614: [Blue] ~35998 levels ~491520 states ~831696 transitions
pins2lts-mc-linux64( 3/ 8), 2.634: [Blue] ~35995 levels ~983040 states ~1460088 transitions
pins2lts-mc-linux64( 5/ 8), 4.294: [Blue] ~35952 levels ~1966080 states ~3586248 transitions
pins2lts-mc-linux64( 5/ 8), 7.397: [Blue] ~35952 levels ~3932160 states ~7245600 transitions
pins2lts-mc-linux64( 5/ 8), 15.770: [Blue] ~35952 levels ~7864320 states ~15265512 transitions
pins2lts-mc-linux64( 3/ 8), 29.468: [Blue] ~35995 levels ~15728640 states ~23585928 transitions
pins2lts-mc-linux64( 1/ 8), 40.289: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 40.475:
pins2lts-mc-linux64( 0/ 8), 40.475: Explored 14866554 states 29517339 transitions, fanout: 1.985
pins2lts-mc-linux64( 0/ 8), 40.475: Total exploration time 40.320 sec (40.210 sec minimum, 40.267 sec on average)
pins2lts-mc-linux64( 0/ 8), 40.475: States per second: 368714, Transitions per second: 732077
pins2lts-mc-linux64( 0/ 8), 40.475:
pins2lts-mc-linux64( 0/ 8), 40.475: State space has 11897215 states, 11572524 are accepting
pins2lts-mc-linux64( 0/ 8), 40.475: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 40.475: blue states: 14866554 (124.96%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 40.475: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 40.475: all-red states: 11572524 (97.27%), bogus 2935392 (24.67%)
pins2lts-mc-linux64( 0/ 8), 40.475:
pins2lts-mc-linux64( 0/ 8), 40.475: Total memory used for local state coloring: 5.7MB
pins2lts-mc-linux64( 0/ 8), 40.475:
pins2lts-mc-linux64( 0/ 8), 40.475: Queue width: 8B, total height: 372647, memory: 2.84MB
pins2lts-mc-linux64( 0/ 8), 40.475: Tree memory: 346.8MB, 30.6 B/state, compr.: 31.2%
pins2lts-mc-linux64( 0/ 8), 40.475: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 40.475: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 40.475: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 40.475: Est. total memory use: 349.6MB (~1026.8MB 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, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true)||((LTLAPp1==true) U (LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7192199858755339946]
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, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true)||((LTLAPp1==true) U (LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7192199858755339946]
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:41:17] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:41:17] [INFO ] Time to serialize gal into /tmp/LTLFireability14052426476238006194.gal : 6 ms
[2021-05-09 15:41:17] [INFO ] Time to serialize properties into /tmp/LTLFireability10896942210112641954.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/LTLFireability14052426476238006194.gal, -t, CGAL, -LTL, /tmp/LTLFireability10896942210112641954.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/LTLFireability14052426476238006194.gal -t CGAL -LTL /tmp/LTLFireability10896942210112641954.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 5 LTL properties
Checking formula 0 : !((G(F(("(SpG>=1)")||(("((MtF>=1)&&(SpG>=1))")U("(MpG<1)"))))))
Formula 0 simplified : !GF("(SpG>=1)" | ("((MtF>=1)&&(SpG>=1))" U "(MpG<1)"))
Detected timeout of ITS tools.
[2021-05-09 16:02:36] [INFO ] Flatten gal took : 4 ms
[2021-05-09 16:02:36] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-09 16:02:36] [INFO ] Transformed 23 places.
[2021-05-09 16:02: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 16:02:36] [INFO ] Time to serialize gal into /tmp/LTLFireability1117375253433765938.gal : 1 ms
[2021-05-09 16:02:36] [INFO ] Time to serialize properties into /tmp/LTLFireability4966144674994551847.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/LTLFireability1117375253433765938.gal, -t, CGAL, -LTL, /tmp/LTLFireability4966144674994551847.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/LTLFireability1117375253433765938.gal -t CGAL -LTL /tmp/LTLFireability4966144674994551847.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 5 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(SpG>=1)")||(("((MtF>=1)&&(SpG>=1))")U("(MpG<1)"))))))
Formula 0 simplified : !GF("(SpG>=1)" | ("((MtF>=1)&&(SpG>=1))" U "(MpG<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-N2000P0"
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-N2000P0, 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-162038291700253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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