Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 5.8K Apr 29 12:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 29 12:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 9.2K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652709334604

Running Version 202205111006
[2022-05-16 13:55:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 13:55:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 13:55:35] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2022-05-16 13:55:35] [INFO ] Transformed 25 places.
[2022-05-16 13:55:35] [INFO ] Transformed 18 transitions.
[2022-05-16 13:55:35] [INFO ] Parsed PT model containing 25 places and 18 transitions in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 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 24 transition count 18
Applied a total of 1 rules in 8 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 13:55:35] [INFO ] Computed 7 place invariants in 7 ms
[2022-05-16 13:55:36] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 13:55:36] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-16 13:55:36] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 13:55:36] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 13:55:36] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/25 places, 18/18 transitions.
Support contains 21 out of 24 places after structural reductions.
[2022-05-16 13:55:36] [INFO ] Flatten gal took : 15 ms
[2022-05-16 13:55:36] [INFO ] Flatten gal took : 4 ms
[2022-05-16 13:55:36] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10043 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=401 ) properties (out of 19) seen :17
Finished Best-First random walk after 642 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=128 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!(X(F(p0)) U p1))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 13:55:36] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-16 13:55:36] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 13:55:36] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 13:55:36] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 13:55:36] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 13:55:36] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, p1, p1]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s3 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-01 finished in 311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!(X(p0) U p1))||X(!(F(p1) U p2)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2022-05-16 13:55:37] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 13:55:37] [INFO ] Implicit Places using invariants in 23 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, p2, (AND p2 p1), (AND p1 p2), (AND p2 p1), p1]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(GEQ s12 1), p1:(AND (GEQ s11 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 14 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-02 finished in 237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F(G((X(F(p0))||F(p1))))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 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 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 13 transition count 9
Applied a total of 20 rules in 7 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2022-05-16 13:55:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 13:55:37] [INFO ] Implicit Places using invariants in 20 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/24 places, 9/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 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 9 transition count 6
Applied a total of 6 rules in 1 ms. Remains 9 /12 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 13:55:37] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-16 13:55:37] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 13:55:37] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 13:55:37] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/24 places, 6/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 9/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s7 1)), p0:(LT s8 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 13572 reset in 175 ms.
Product exploration explored 100000 steps with 13798 reset in 130 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1003 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=501 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 13:55:38] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 13:55:38] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 13:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:55:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 13:55:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:55:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:55:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:55:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 13:55:38] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 13:55:38] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 13:55:38] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 13:55:38] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 13:55:38] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 13:55:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-16 13:55:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 13:55:38] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 13:55:38] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1003 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=501 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 13:55:38] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 13:55:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 13:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:55:38] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 13:55:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:55:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 13:55:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:55:39] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 13:55:39] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 13:55:39] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 13797 reset in 95 ms.
Product exploration explored 100000 steps with 13653 reset in 148 ms.
Built C files in :
/tmp/ltsmin706143130714172697
[2022-05-16 13:55:39] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-16 13:55:39] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:55:39] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-16 13:55:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:55:39] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-16 13:55:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:55:39] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin706143130714172697
Running compilation step : cd /tmp/ltsmin706143130714172697;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 149 ms.
Running link step : cd /tmp/ltsmin706143130714172697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin706143130714172697;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16354660005385193644.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 13:55:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 13:55:54] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 13:55:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 13:55:54] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-16 13:55:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 13:55:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 13:55:54] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin16242902773007258989
[2022-05-16 13:55:54] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-16 13:55:54] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:55:54] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-16 13:55:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:55:54] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-16 13:55:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:55:54] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16242902773007258989
Running compilation step : cd /tmp/ltsmin16242902773007258989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 62 ms.
Running link step : cd /tmp/ltsmin16242902773007258989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin16242902773007258989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16394741427262878797.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 13:56:09] [INFO ] Flatten gal took : 2 ms
[2022-05-16 13:56:09] [INFO ] Flatten gal took : 1 ms
[2022-05-16 13:56:09] [INFO ] Time to serialize gal into /tmp/LTL6111466098297456157.gal : 1 ms
[2022-05-16 13:56:09] [INFO ] Time to serialize properties into /tmp/LTL804843445058745504.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6111466098297456157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL804843445058745504.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6111466...265
Read 1 LTL properties
Checking formula 0 : !((F(X(X(F(G((X(F("(Ci<1)")))||(F("((CG>=1)&&(CwG>=1))")))))))))
Formula 0 simplified : !FXXFG(XF"(Ci<1)" | F"((CG>=1)&&(CwG>=1))")
Detected timeout of ITS tools.
[2022-05-16 13:56:24] [INFO ] Flatten gal took : 4 ms
[2022-05-16 13:56:24] [INFO ] Applying decomposition
[2022-05-16 13:56:24] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5244767510635391937.txt' '-o' '/tmp/graph5244767510635391937.bin' '-w' '/tmp/graph5244767510635391937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5244767510635391937.bin' '-l' '-1' '-v' '-w' '/tmp/graph5244767510635391937.weights' '-q' '0' '-e' '0.001'
[2022-05-16 13:56:24] [INFO ] Decomposing Gal with order
[2022-05-16 13:56:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 13:56:24] [INFO ] Flatten gal took : 36 ms
[2022-05-16 13:56:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 13:56:24] [INFO ] Time to serialize gal into /tmp/LTL13144846824473262036.gal : 1 ms
[2022-05-16 13:56:24] [INFO ] Time to serialize properties into /tmp/LTL93108028692208769.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13144846824473262036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL93108028692208769.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1314484...244
Read 1 LTL properties
Checking formula 0 : !((F(X(X(F(G((X(F("(u0.Ci<1)")))||(F("((u1.CG>=1)&&(u0.CwG>=1))")))))))))
Formula 0 simplified : !FXXFG(XF"(u0.Ci<1)" | F"((u1.CG>=1)&&(u0.CwG>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12515083516633873811
[2022-05-16 13:56:39] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12515083516633873811
Running compilation step : cd /tmp/ltsmin12515083516633873811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 72 ms.
Running link step : cd /tmp/ltsmin12515083516633873811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12515083516633873811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X(<>([]((X(<>((LTLAPp0==true)))||<>((LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-03 finished in 77647 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(F(p0))))))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 13:56:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 13:56:54] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 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.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(OR (LT s8 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 103 reset in 128 ms.
Product exploration explored 100000 steps with 101 reset in 146 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 7 states, 7 edges and 1 AP to 7 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 7 states, 7 edges and 1 AP to 7 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 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
[2022-05-16 13:56:56] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 13:56:56] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 13:56:56] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 13:56:56] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 13:56:56] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 13:56:56] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 7 states, 7 edges and 1 AP to 7 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 318 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 7 states, 7 edges and 1 AP to 7 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 78 reset in 123 ms.
Product exploration explored 100000 steps with 106 reset in 148 ms.
Applying partial POR strategy [true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 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 8 place count 20 transition count 18
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 20 transition count 18
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 15 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 15 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 15 transition count 13
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 14 transition count 12
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 14 transition count 12
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 25 rules in 15 ms. Remains 14 /20 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2022-05-16 13:56:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 14 cols
[2022-05-16 13:56:58] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 13:56:58] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/20 places, 12/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/20 places, 12/18 transitions.
Product exploration explored 100000 steps with 171 reset in 92 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 15 in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-05 finished in 3452 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0) U F(p1))||X(p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 13:56:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 13:56:58] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 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.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), p1]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s9 1), p1:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-06 finished in 188 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||(p1 U p0)))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 13:56:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 13:56:58] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s15 1), p1:(AND (GEQ s7 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-07 finished in 142 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(p1))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 13:56:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 13:56:58] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s13 1)), p1:(AND (GEQ s11 1) (GEQ s16 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-08 finished in 187 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p1))||p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 16 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 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 3 with 4 rules applied. Total rules applied 19 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 3 with 8 rules applied. Total rules applied 27 place count 9 transition count 6
Applied a total of 27 rules in 2 ms. Remains 9 /24 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 13:56:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 13:56:58] [INFO ] Implicit Places using invariants in 17 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 18 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/24 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 1 ms. Remains 6 /7 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-16 13:56:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 13:56:58] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-16 13:56:58] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 13:56:58] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/24 places, 5/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s4 1)), p1:(OR (LT s0 1) (LT s4 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 2129 reset in 64 ms.
Stack based approach found an accepted trace after 68 steps with 6 reset with depth 20 and stack size 20 in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-09 finished in 188 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(X(p0))&&(p1 U p2)))&&p3)))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 13:56:59] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 13:56:59] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 13:56:59] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 13:56:59] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 13:56:59] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 13:56:59] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p3) (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p3) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p3 (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p3) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 4}, { cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={0} source=1 dest: 5}, { cond=(AND p3 (NOT p2) p1), acceptance={0} source=1 dest: 6}, { cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(OR p2 p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p0))), acceptance={0} source=4 dest: 0}, { cond=(OR (AND p3 p2 (NOT p0)) (AND p3 p1 (NOT p0))), acceptance={0} source=4 dest: 1}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(OR (AND p3 p2 (NOT p0)) (AND p3 p1 (NOT p0))), acceptance={} source=4 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p0))), acceptance={0} source=5 dest: 4}, { cond=(OR (AND p3 p2 (NOT p0)) (AND p3 p1 (NOT p0))), acceptance={0} source=5 dest: 5}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={0} source=5 dest: 6}, { cond=(OR (AND p3 p2 (NOT p0)) (AND p3 p1 (NOT p0))), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=6 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=7 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=7 dest: 3}]], initial=0, aps=[p3:(OR (LT s2 1) (LT s14 1)), p2:(AND (GEQ s3 1) (GEQ s14 1)), p1:(GEQ s17 1), p0:(AND (GEQ s7 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2843 reset in 168 ms.
Product exploration explored 100000 steps with 2794 reset in 154 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR p2 p1))), (X (OR (NOT p3) (AND (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p2) p1))), (X (NOT (OR (AND p3 p2) (AND p3 p1)))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR p2 p1)))), (X (X (OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (OR (NOT p3) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (OR (AND p3 p2 (NOT p0)) (AND p3 p1 (NOT p0)))))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR (AND p3 p2) (AND p3 p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1221 ms. Reduced automaton from 8 states, 28 edges and 4 AP to 8 states, 28 edges and 4 AP.
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p3) (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Finished random walk after 1807 steps, including 0 resets, run visited all 12 properties in 5 ms. (steps per millisecond=361 )
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR p2 p1))), (X (OR (NOT p3) (AND (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p2) p1))), (X (NOT (OR (AND p3 p2) (AND p3 p1)))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR p2 p1)))), (X (X (OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (OR (NOT p3) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (OR (AND p3 p2 (NOT p0)) (AND p3 p1 (NOT p0)))))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR (AND p3 p2) (AND p3 p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND p3 (NOT p0) p1 (NOT p2))), (F (OR (AND p3 (NOT p0) p1) (AND p3 (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR p1 p2)), (F (NOT (OR (NOT p3) (AND (NOT p1) (NOT p2))))), (F (AND p3 p1 (NOT p2))), (F (OR (AND p3 p1) (AND p3 p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 19 factoid took 1523 ms. Reduced automaton from 8 states, 28 edges and 4 AP to 8 states, 28 edges and 4 AP.
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p3) (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p3) (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 13:57:03] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 13:57:03] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 13:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:57:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 13:57:03] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 13:57:03] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p2)
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 13:57:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 13:57:03] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 13:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:57:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 13:57:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:57:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 13:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:57:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 13:57:03] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 13:57:03] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 13:57:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 13:57:03] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 13:57:03] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 13:57:03] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 13:57:03] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 13:57:03] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p3) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p3 p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p3 p1) (AND p3 p2)))), (X (NOT (OR p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p3) (NOT p0)) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p3 (NOT p0) p1) (AND p3 (NOT p0) p2))))), (X (X (OR (NOT p3) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND p3 p1) (AND p3 p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (OR p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1202 ms. Reduced automaton from 8 states, 28 edges and 4 AP to 8 states, 28 edges and 4 AP.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p3) (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Finished random walk after 1807 steps, including 0 resets, run visited all 12 properties in 15 ms. (steps per millisecond=120 )
Knowledge obtained : [(AND p3 (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p3) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p3 p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p3 p1) (AND p3 p2)))), (X (NOT (OR p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p3) (NOT p0)) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p3 (NOT p0) p1) (AND p3 (NOT p0) p2))))), (X (X (OR (NOT p3) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND p3 p1) (AND p3 p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (OR p1 p2))))]
False Knowledge obtained : [(F (AND p3 (NOT p0) p1 (NOT p2))), (F (OR (AND p3 (NOT p0) p1) (AND p3 (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR p1 p2)), (F (NOT (OR (NOT p3) (AND (NOT p1) (NOT p2))))), (F (AND p3 p1 (NOT p2))), (F (OR (AND p3 p1) (AND p3 p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 19 factoid took 1536 ms. Reduced automaton from 8 states, 28 edges and 4 AP to 8 states, 28 edges and 4 AP.
Stuttering acceptance computed with spot in 376 ms :[(OR (NOT p3) (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p3) (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 13:57:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 13:57:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 13:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:57:07] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 13:57:07] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 13:57:07] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p2)
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 13:57:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 13:57:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 13:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:57:07] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 13:57:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:57:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 13:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:57:07] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 13:57:07] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 13:57:07] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p3) (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 2830 reset in 149 ms.
Product exploration explored 100000 steps with 2748 reset in 155 ms.
Built C files in :
/tmp/ltsmin2884948611370869587
[2022-05-16 13:57:08] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2884948611370869587
Running compilation step : cd /tmp/ltsmin2884948611370869587;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin2884948611370869587;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2884948611370869587;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10036346129411460651.hoa' '--buchi-type=spotba'
LTSmin run took 65 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-10 finished in 9839 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(p0))))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 11
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 17 place count 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 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 25 place count 10 transition count 7
Applied a total of 25 rules in 3 ms. Remains 10 /24 variables (removed 14) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2022-05-16 13:57:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 13:57:08] [INFO ] Implicit Places using invariants in 26 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/24 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 9 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 7 transition count 5
Applied a total of 4 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-16 13:57:08] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 13:57:08] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-16 13:57:08] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 13:57:09] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/24 places, 5/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 7/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 60 ms.
Product exploration explored 100000 steps with 0 reset in 107 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 801 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=801 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-16 13:57:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 13:57:09] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-16 13:57:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 13:57:09] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-16 13:57:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-16 13:57:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 13:57:09] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 801 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=400 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 103 ms.
Built C files in :
/tmp/ltsmin12101527948267760187
[2022-05-16 13:57:10] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-16 13:57:10] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:57:10] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-16 13:57:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:57:10] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-16 13:57:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:57:10] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12101527948267760187
Running compilation step : cd /tmp/ltsmin12101527948267760187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 66 ms.
Running link step : cd /tmp/ltsmin12101527948267760187;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin12101527948267760187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17029342898197737846.hoa' '--buchi-type=spotba'
LTSmin run took 143 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-11 finished in 1450 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!X(p0))||(X(X(p2))&&p1)) U X(p3)))'
Support contains 7 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 13:57:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 13:57:10] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 13:57:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 13:57:10] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 13:57:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 13:57:10] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p3), (AND p0 (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3) p0), true, p0, (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s14 1)), p3:(AND (GEQ s8 1) (GEQ s15 1)), p0:(AND (GEQ s11 1) (GEQ s17 1)), p2:(OR (GEQ s21 1) (AND (GEQ s2 1) (GEQ s14 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) p2), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X p3), (X (NOT (AND p1 (NOT p3)))), (X (X (NOT (AND (NOT p3) p0)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p3))), (X (X p3))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p3) (NOT p0))))
Knowledge based reduction with 13 factoid took 402 ms. Reduced automaton from 8 states, 16 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-12 finished in 904 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((G(p1)&&p0)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
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 5 rules applied. Total rules applied 5 place count 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 19 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 17 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 11 place count 17 transition count 11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 13 transition count 10
Applied a total of 19 rules in 9 ms. Remains 13 /24 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2022-05-16 13:57:11] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 13:57:11] [INFO ] Implicit Places using invariants in 22 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/24 places, 10/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 9 transition count 7
Applied a total of 6 rules in 2 ms. Remains 9 /12 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-16 13:57:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 13:57:11] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-16 13:57:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 13:57:11] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/24 places, 7/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 9/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 33 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s7 1)), p1:(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 88 ms.
Stack based approach found an accepted trace after 2771 steps with 0 reset with depth 2772 and stack size 2753 in 3 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-13 finished in 215 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F((G(G(F(p0)))||G(X(p1))))))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 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 13 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 17 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 23 place count 11 transition count 8
Applied a total of 23 rules in 6 ms. Remains 11 /24 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2022-05-16 13:57:11] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 13:57:11] [INFO ] Implicit Places using invariants in 21 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/24 places, 8/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 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 13:57:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 13:57:11] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 13:57:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 13:57:11] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/24 places, 7/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s4 1), p0:(LT s7 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 2089 reset in 92 ms.
Stack based approach found an accepted trace after 141 steps with 1 reset with depth 80 and stack size 80 in 1 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-14 finished in 318 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(p0) U !X(F(p1))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 13:57:11] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 13:57:11] [INFO ] Implicit Places using invariants in 23 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 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.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 98 ms :[p1, (AND p0 p1), p0]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s6 1), p0:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1306 reset in 109 ms.
Stack based approach found an accepted trace after 18071 steps with 234 reset with depth 74 and stack size 74 in 22 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-15 finished in 274 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F(G((X(F(p0))||F(p1))))))))'
[2022-05-16 13:57:12] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
[2022-05-16 13:57:12] [INFO ] Applying decomposition
[2022-05-16 13:57:12] [INFO ] Flatten gal took : 2 ms
Built C files in :
/tmp/ltsmin11190270331199026323
[2022-05-16 13:57:12] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2022-05-16 13:57:12] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:57:12] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2022-05-16 13:57:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:57:12] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2022-05-16 13:57:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:57:12] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11190270331199026323
Running compilation step : cd /tmp/ltsmin11190270331199026323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13305759331082575782.txt' '-o' '/tmp/graph13305759331082575782.bin' '-w' '/tmp/graph13305759331082575782.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13305759331082575782.bin' '-l' '-1' '-v' '-w' '/tmp/graph13305759331082575782.weights' '-q' '0' '-e' '0.001'
[2022-05-16 13:57:12] [INFO ] Decomposing Gal with order
[2022-05-16 13:57:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 13:57:12] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 13:57:12] [INFO ] Flatten gal took : 4 ms
[2022-05-16 13:57:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 13:57:12] [INFO ] Time to serialize gal into /tmp/LTLFireability17559662886363258280.gal : 1 ms
[2022-05-16 13:57:12] [INFO ] Time to serialize properties into /tmp/LTLFireability146490858263406477.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17559662886363258280.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability146490858263406477.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((F(X(X(F(G((X(F("(i3.u8.Ci<1)")))||(F("((i1.u3.CG>=1)&&(i1.u2.CwG>=1))")))))))))
Formula 0 simplified : !FXXFG(XF"(i3.u8.Ci<1)" | F"((i1.u3.CG>=1)&&(i1.u2.CwG>=1))")
Compilation finished in 93 ms.
Running link step : cd /tmp/ltsmin11190270331199026323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 20 ms.
Running LTSmin : cd /tmp/ltsmin11190270331199026323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X(<>([]((X(<>((LTLAPp0==true)))||<>((LTLAPp1==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: LTL layer: formula: <>(X(X(<>([]((X(<>((LTLAPp0==true)))||<>((LTLAPp1==true))))))))
pins2lts-mc-linux64( 1/ 8), 0.001: "<>(X(X(<>([]((X(<>((LTLAPp0==true)))||<>((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.051: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.051: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.051: State length is 25, there are 21 groups
pins2lts-mc-linux64( 0/ 8), 0.051: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.051: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.051: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.051: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.098: ~109 levels ~960 states ~5136 transitions
pins2lts-mc-linux64( 6/ 8), 0.132: ~210 levels ~1920 states ~9680 transitions
pins2lts-mc-linux64( 7/ 8), 0.205: ~412 levels ~3840 states ~19936 transitions
pins2lts-mc-linux64( 7/ 8), 0.330: ~827 levels ~7680 states ~43568 transitions
pins2lts-mc-linux64( 7/ 8), 0.461: ~1616 levels ~15360 states ~81176 transitions
pins2lts-mc-linux64( 6/ 8), 0.489: ~2001 levels ~30720 states ~110448 transitions
pins2lts-mc-linux64( 6/ 8), 0.577: ~2001 levels ~61440 states ~178176 transitions
pins2lts-mc-linux64( 6/ 8), 0.744: ~2001 levels ~122880 states ~338088 transitions
pins2lts-mc-linux64( 6/ 8), 1.042: ~2001 levels ~245760 states ~615480 transitions
pins2lts-mc-linux64( 3/ 8), 1.520: ~2000 levels ~491520 states ~1136072 transitions
pins2lts-mc-linux64( 3/ 8), 2.129: ~2000 levels ~983040 states ~2320416 transitions
pins2lts-mc-linux64( 2/ 8), 3.013: ~1999 levels ~1966080 states ~4734400 transitions
pins2lts-mc-linux64( 5/ 8), 4.665: ~1992 levels ~3932160 states ~9305424 transitions
pins2lts-mc-linux64( 5/ 8), 8.027: ~1992 levels ~7864320 states ~18744056 transitions
pins2lts-mc-linux64( 5/ 8), 15.389: ~1992 levels ~15728640 states ~40140544 transitions
pins2lts-mc-linux64( 6/ 8), 33.094: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 33.135:
pins2lts-mc-linux64( 0/ 8), 33.135: mean standard work distribution: 2.0% (states) 2.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 33.135:
pins2lts-mc-linux64( 0/ 8), 33.135: Explored 29375783 states 84515192 transitions, fanout: 2.877
pins2lts-mc-linux64( 0/ 8), 33.135: Total exploration time 33.060 sec (33.030 sec minimum, 33.044 sec on average)
pins2lts-mc-linux64( 0/ 8), 33.135: States per second: 888560, Transitions per second: 2556418
pins2lts-mc-linux64( 0/ 8), 33.135:
pins2lts-mc-linux64( 0/ 8), 33.135: Progress states detected: 1
pins2lts-mc-linux64( 0/ 8), 33.135: Redundant explorations: 0.2743
pins2lts-mc-linux64( 0/ 8), 33.135:
pins2lts-mc-linux64( 0/ 8), 33.135: Queue width: 8B, total height: 15999, memory: 0.12MB
pins2lts-mc-linux64( 0/ 8), 33.135: Tree memory: 479.5MB, 17.2 B/state, compr.: 16.8%
pins2lts-mc-linux64( 0/ 8), 33.135: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 33.135: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 33.135: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 33.135: Est. total memory use: 479.6MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11190270331199026323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X(<>([]((X(<>((LTLAPp0==true)))||<>((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11190270331199026323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X(<>([]((X(<>((LTLAPp0==true)))||<>((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 14:17:44] [INFO ] Flatten gal took : 4 ms
[2022-05-16 14:17:44] [INFO ] Time to serialize gal into /tmp/LTLFireability10866034779055761154.gal : 0 ms
[2022-05-16 14:17:44] [INFO ] Time to serialize properties into /tmp/LTLFireability4623572114834896616.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10866034779055761154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4623572114834896616.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((F(X(X(F(G((X(F("(Ci<1)")))||(F("((CG>=1)&&(CwG>=1))")))))))))
Formula 0 simplified : !FXXFG(XF"(Ci<1)" | F"((CG>=1)&&(CwG>=1))")
Detected timeout of ITS tools.
[2022-05-16 14:38:16] [INFO ] Flatten gal took : 4 ms
[2022-05-16 14:38:16] [INFO ] Input system was already deterministic with 18 transitions.
[2022-05-16 14:38:16] [INFO ] Transformed 24 places.
[2022-05-16 14:38:16] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 14:38:16] [INFO ] Time to serialize gal into /tmp/LTLFireability1546403126049694803.gal : 1 ms
[2022-05-16 14:38:16] [INFO ] Time to serialize properties into /tmp/LTLFireability2082610314711723960.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1546403126049694803.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2082610314711723960.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(X(X(F(G((X(F("(Ci<1)")))||(F("((CG>=1)&&(CwG>=1))")))))))))
Formula 0 simplified : !FXXFG(XF"(Ci<1)" | F"((CG>=1)&&(CwG>=1))")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

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