Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 13:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 13:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 13:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 26 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.1K Mar 5 18:22 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-N0500P0-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678407579746

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0500P0
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 00:19:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 00:19:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 00:19:42] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-10 00:19:42] [INFO ] Transformed 25 places.
[2023-03-10 00:19:42] [INFO ] Transformed 18 transitions.
[2023-03-10 00:19:42] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ClientsAndServers-PT-N0500P0-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0500P0-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 16 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-10 00:19:43] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-10 00:19:43] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-10 00:19:43] [INFO ] Invariant cache hit.
[2023-03-10 00:19:43] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-10 00:19:43] [INFO ] Invariant cache hit.
[2023-03-10 00:19:43] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 23/25 places, 18/18 transitions.
Support contains 20 out of 23 places after structural reductions.
[2023-03-10 00:19:43] [INFO ] Flatten gal took : 23 ms
[2023-03-10 00:19:43] [INFO ] Flatten gal took : 7 ms
[2023-03-10 00:19:43] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 12005 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=292 ) properties (out of 19) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 15) seen :8
Finished Best-First random walk after 627 steps, including 1 resets, run visited all 7 properties in 16 ms. (steps per millisecond=39 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(p1))))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-10 00:19:44] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 00:19:44] [INFO ] Implicit Places using invariants in 61 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 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 LTL mode , in 2 iterations and 68 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s19 1), p1:(OR (LT s11 1) (LT s16 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 309 ms.
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0500P0-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0500P0-LTLFireability-00 finished in 1062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 9 transition count 6
Applied a total of 26 rules in 16 ms. Remains 9 /23 variables (removed 14) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-10 00:19:45] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-10 00:19:45] [INFO ] Implicit Places using invariants in 50 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/23 places, 6/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 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 2 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-10 00:19:45] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 00:19:45] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-10 00:19:45] [INFO ] Invariant cache hit.
[2023-03-10 00:19:45] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/23 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 5/23 places, 4/18 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 25053 reset in 246 ms.
Product exploration explored 100000 steps with 24973 reset in 438 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 209 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Finished random walk after 1002 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=334 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
[2023-03-10 00:19:46] [INFO ] Invariant cache hit.
[2023-03-10 00:19:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 00:19:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:19:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 00:19:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:19:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 00:19:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:19:46] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-10 00:19:46] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 00:19:46] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 2 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-10 00:19:46] [INFO ] Invariant cache hit.
[2023-03-10 00:19:46] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-10 00:19:46] [INFO ] Invariant cache hit.
[2023-03-10 00:19:46] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-10 00:19:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 00:19:46] [INFO ] Invariant cache hit.
[2023-03-10 00:19:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 5/5 places, 4/4 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Finished random walk after 1002 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=501 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
[2023-03-10 00:19:47] [INFO ] Invariant cache hit.
[2023-03-10 00:19:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 00:19:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:19:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 00:19:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:19:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 00:19:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:19:47] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-10 00:19:47] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 00:19:47] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24992 reset in 246 ms.
Product exploration explored 100000 steps with 24986 reset in 262 ms.
Built C files in :
/tmp/ltsmin9256290355077999377
[2023-03-10 00:19:48] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2023-03-10 00:19:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 00:19:48] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2023-03-10 00:19:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 00:19:48] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2023-03-10 00:19:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 00:19:48] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9256290355077999377
Running compilation step : cd /tmp/ltsmin9256290355077999377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 354 ms.
Running link step : cd /tmp/ltsmin9256290355077999377;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9256290355077999377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16324477557498272990.hoa' '--buchi-type=spotba'
LTSmin run took 262 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0500P0-LTLFireability-01 finished in 3586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U p1))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 2 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 00:19:48] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-10 00:19:48] [INFO ] Implicit Places using invariants in 56 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s15 1), p0:(GEQ s16 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLFireability-02 finished in 226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 9 transition count 6
Applied a total of 26 rules in 9 ms. Remains 9 /23 variables (removed 14) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-10 00:19:49] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 00:19:49] [INFO ] Implicit Places using invariants in 45 ms returned [5, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/23 places, 6/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 4 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-10 00:19:49] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-10 00:19:49] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-10 00:19:49] [INFO ] Invariant cache hit.
[2023-03-10 00:19:49] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/23 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 130 ms. Remains : 5/23 places, 4/18 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLFireability-03 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 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 361 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLFireability-03 finished in 556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&X(G((G(F(p0))||p1))))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 2 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 00:19:49] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-10 00:19:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-10 00:19:49] [INFO ] Invariant cache hit.
[2023-03-10 00:19:49] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-10 00:19:49] [INFO ] Invariant cache hit.
[2023-03-10 00:19:49] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s14 1)), p1:(GEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2119 reset in 162 ms.
Product exploration explored 100000 steps with 1450 reset in 197 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 554 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2401 ) properties (out of 6) seen :0
Finished Best-First random walk after 1367 steps, including 0 resets, run visited all 6 properties in 12 ms. (steps per millisecond=113 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 729 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2023-03-10 00:19:52] [INFO ] Invariant cache hit.
[2023-03-10 00:19:52] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 00:19:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:19:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-10 00:19:52] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-10 00:19:52] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-10 00:19:52] [INFO ] Invariant cache hit.
[2023-03-10 00:19:52] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-10 00:19:52] [INFO ] Invariant cache hit.
[2023-03-10 00:19:52] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-10 00:19:52] [INFO ] Invariant cache hit.
[2023-03-10 00:19:52] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 21/21 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 (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 701 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1500 ) properties (out of 6) seen :0
Finished Best-First random walk after 404 steps, including 0 resets, run visited all 6 properties in 7 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 864 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 294 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2023-03-10 00:19:55] [INFO ] Invariant cache hit.
[2023-03-10 00:19:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 00:19:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:19:55] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-10 00:19:55] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-10 00:19:55] [INFO ] Added : 1 causal constraints over 1 iterations in 50 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 2745 reset in 130 ms.
Product exploration explored 100000 steps with 1476 reset in 194 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 4 place count 21 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 21 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 20 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 20 transition count 17
Deduced a syphon composed of 8 places in 1 ms
Applied a total of 11 rules in 15 ms. Remains 20 /21 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2023-03-10 00:19:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 20 cols
[2023-03-10 00:19:56] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-10 00:19:56] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/21 places, 17/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 20/21 places, 17/18 transitions.
Built C files in :
/tmp/ltsmin4779713646972680821
[2023-03-10 00:19:56] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4779713646972680821
Running compilation step : cd /tmp/ltsmin4779713646972680821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 114 ms.
Running link step : cd /tmp/ltsmin4779713646972680821;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4779713646972680821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13529943146676208962.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 00:20:11] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-10 00:20:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-10 00:20:11] [INFO ] Invariant cache hit.
[2023-03-10 00:20:11] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-10 00:20:11] [INFO ] Invariant cache hit.
[2023-03-10 00:20:11] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin8030038779766634213
[2023-03-10 00:20:11] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8030038779766634213
Running compilation step : cd /tmp/ltsmin8030038779766634213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 124 ms.
Running link step : cd /tmp/ltsmin8030038779766634213;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8030038779766634213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9174745890918066449.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 00:20:27] [INFO ] Flatten gal took : 11 ms
[2023-03-10 00:20:27] [INFO ] Flatten gal took : 2 ms
[2023-03-10 00:20:27] [INFO ] Time to serialize gal into /tmp/LTL11444894686640287329.gal : 2 ms
[2023-03-10 00:20:27] [INFO ] Time to serialize properties into /tmp/LTL5611147307597874898.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11444894686640287329.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4263116821288499528.hoa' '-atoms' '/tmp/LTL5611147307597874898.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5611147307597874898.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4263116821288499528.hoa
Detected timeout of ITS tools.
[2023-03-10 00:20:42] [INFO ] Flatten gal took : 3 ms
[2023-03-10 00:20:42] [INFO ] Flatten gal took : 3 ms
[2023-03-10 00:20:42] [INFO ] Time to serialize gal into /tmp/LTL2079939760661941447.gal : 1 ms
[2023-03-10 00:20:42] [INFO ] Time to serialize properties into /tmp/LTL15609939891754357873.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2079939760661941447.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15609939891754357873.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X("((SR>=1)&&(Mi>=1))"))&&(X(G((G(F("((SR>=1)&&(Mi>=1))")))||("(SpA>=1)")))))))
Formula 0 simplified : XG(!"((SR>=1)&&(Mi>=1))" | F(!"(SpA>=1)" & FG!"((SR>=1)&&(Mi>=1))"))
Detected timeout of ITS tools.
[2023-03-10 00:20:57] [INFO ] Flatten gal took : 3 ms
[2023-03-10 00:20:57] [INFO ] Applying decomposition
[2023-03-10 00:20:57] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7911320484876299337.txt' '-o' '/tmp/graph7911320484876299337.bin' '-w' '/tmp/graph7911320484876299337.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7911320484876299337.bin' '-l' '-1' '-v' '-w' '/tmp/graph7911320484876299337.weights' '-q' '0' '-e' '0.001'
[2023-03-10 00:20:57] [INFO ] Decomposing Gal with order
[2023-03-10 00:20:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 00:20:57] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-10 00:20:57] [INFO ] Flatten gal took : 40 ms
[2023-03-10 00:20:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-10 00:20:57] [INFO ] Time to serialize gal into /tmp/LTL13860236032593426095.gal : 2 ms
[2023-03-10 00:20:57] [INFO ] Time to serialize properties into /tmp/LTL13282214095588633993.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13860236032593426095.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13282214095588633993.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((X("((u5.SR>=1)&&(i2.u4.Mi>=1))"))&&(X(G((G(F("((u5.SR>=1)&&(i2.u4.Mi>=1))")))||("(i1.u1.SpA>=1)")))))))
Formula 0 simplified : XG(!"((u5.SR>=1)&&(i2.u4.Mi>=1))" | F(!"(i1.u1.SpA>=1)" & FG!"((u5.SR>=1)&&(i2.u4.Mi>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17296274652761649082
[2023-03-10 00:21:12] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17296274652761649082
Running compilation step : cd /tmp/ltsmin17296274652761649082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 102 ms.
Running link step : cd /tmp/ltsmin17296274652761649082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17296274652761649082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&X([](([](<>((LTLAPp0==true)))||(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0500P0-LTLFireability-04 finished in 97818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 9 rules applied. Total rules applied 9 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 16 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 16 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 18 place count 13 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 10 transition count 7
Applied a total of 24 rules in 4 ms. Remains 10 /23 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-10 00:21:27] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 00:21:27] [INFO ] Implicit Places using invariants in 35 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/23 places, 7/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 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
[2023-03-10 00:21:27] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-10 00:21:27] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-10 00:21:27] [INFO ] Invariant cache hit.
[2023-03-10 00:21:27] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/23 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 7/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLFireability-05 finished in 240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0&&X(!p1)))&&X((X(p2)&&F(p3))))))'
Support contains 7 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-10 00:21:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 00:21:27] [INFO ] Implicit Places using invariants in 30 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) (NOT p3) (NOT p2) p1), (OR (NOT p0) (NOT p3) (NOT p2) p1), true, (OR (NOT p0) p1), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}, { cond=(NOT p3), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (GEQ s6 1) (AND (GEQ s8 1) (GEQ s14 1))), p1:(OR (LT s11 1) (LT s16 1)), p3:(GEQ s18 1), p2:(AND (GEQ s5 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][false, false, 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-N0500P0-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLFireability-06 finished in 412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((F(G(!p0))||G(p1)))))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-10 00:21:28] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-10 00:21:28] [INFO ] Implicit Places using invariants in 38 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 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 LTL mode , in 2 iterations and 43 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(AND (OR (LT s1 1) (LT s17 1)) (LT s18 1)), p0:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 336 ms.
Product exploration explored 100000 steps with 0 reset in 570 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 12006 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2401 ) properties (out of 2) seen :1
Finished Best-First random walk after 1576 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=315 )
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 00:21:30] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 00:21:30] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-10 00:21:30] [INFO ] Invariant cache hit.
[2023-03-10 00:21:30] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-10 00:21:30] [INFO ] Invariant cache hit.
[2023-03-10 00:21:30] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 21/21 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 p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2401 ) properties (out of 2) seen :0
Finished Best-First random walk after 245 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=122 )
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 0 reset in 160 ms.
Product exploration explored 100000 steps with 0 reset in 292 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 19 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 19 transition count 16
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 14 place count 19 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 18 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 18 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 16 rules in 34 ms. Remains 18 /21 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2023-03-10 00:21:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 18 cols
[2023-03-10 00:21:32] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 00:21:32] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/21 places, 15/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 18/21 places, 15/18 transitions.
Built C files in :
/tmp/ltsmin13202496861631289091
[2023-03-10 00:21:32] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13202496861631289091
Running compilation step : cd /tmp/ltsmin13202496861631289091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 109 ms.
Running link step : cd /tmp/ltsmin13202496861631289091;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13202496861631289091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12105224555759659041.hoa' '--buchi-type=spotba'
LTSmin run took 168 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0500P0-LTLFireability-07 finished in 4944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0||G(p1)||G(!p2)))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 4 rules applied. Total rules applied 4 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 8 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 10 place count 17 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 17 transition count 12
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 14 place count 15 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 14 transition count 11
Applied a total of 16 rules in 3 ms. Remains 14 /23 variables (removed 9) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-10 00:21:33] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 00:21:33] [INFO ] Implicit Places using invariants in 34 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/23 places, 11/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 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 11 transition count 9
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 11 transition count 8
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 10 transition count 8
Applied a total of 6 rules in 2 ms. Remains 10 /13 variables (removed 3) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-10 00:21:33] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-10 00:21:33] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 00:21:33] [INFO ] Invariant cache hit.
[2023-03-10 00:21:33] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/23 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 107 ms. Remains : 10/23 places, 8/18 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) p0 p2), (AND (NOT p1) p0 p2)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND p0 p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 p2), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s7 1)), p0:(LT s9 1), p2:(LT s8 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 0 reset in 153 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) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 444 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2)]
Incomplete random walk after 12007 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2401 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 00:21:34] [INFO ] Invariant cache hit.
[2023-03-10 00:21:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 00:21:34] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 00:21:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 00:21:34] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 00:21:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 4 ms to minimize.
[2023-03-10 00:21:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-10 00:21:34] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-10 00:21:34] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 18948 steps, including 0 resets, run visited all 3 properties in 683 ms. (steps per millisecond=27 )
Parikh walk visited 3 properties in 686 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (AND p0 p1 p2)), (F (OR (AND p0 (NOT p1)) (AND p0 p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 9 factoid took 797 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2)]
Stuttering acceptance computed with spot in 93 ms :[(AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2)]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-10 00:21:36] [INFO ] Invariant cache hit.
[2023-03-10 00:21:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 00:21:36] [INFO ] Invariant cache hit.
[2023-03-10 00:21:36] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-10 00:21:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 00:21:36] [INFO ] Invariant cache hit.
[2023-03-10 00:21:36] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 10/10 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 571 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2401 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 00:21:37] [INFO ] Invariant cache hit.
[2023-03-10 00:21:37] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 00:21:37] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 00:21:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 00:21:37] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 00:21:37] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 4 ms to minimize.
[2023-03-10 00:21:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-10 00:21:37] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-10 00:21:37] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 19161 steps, including 0 resets, run visited all 3 properties in 427 ms. (steps per millisecond=44 )
Parikh walk visited 3 properties in 430 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (AND p0 p1 p2)), (F (OR (AND p0 (NOT p1)) (AND p0 p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 9 factoid took 641 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2)]
Stuttering acceptance computed with spot in 92 ms :[(AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2)]
Stuttering acceptance computed with spot in 110 ms :[(AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2)]
Product exploration explored 100000 steps with 0 reset in 90 ms.
Product exploration explored 100000 steps with 0 reset in 173 ms.
Built C files in :
/tmp/ltsmin344025020631677071
[2023-03-10 00:21:39] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2023-03-10 00:21:39] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 00:21:39] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2023-03-10 00:21:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 00:21:39] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2023-03-10 00:21:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 00:21:39] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin344025020631677071
Running compilation step : cd /tmp/ltsmin344025020631677071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 87 ms.
Running link step : cd /tmp/ltsmin344025020631677071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin344025020631677071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6799865506681247593.hoa' '--buchi-type=spotba'
LTSmin run took 3018 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0500P0-LTLFireability-08 finished in 9228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((p1&&X(F(!p1)))))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 00:21:42] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 00:21:42] [INFO ] Implicit Places using invariants in 39 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, p1, (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LT s19 1), p0:(AND (GEQ s8 1) (GEQ 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 193 ms.
Product exploration explored 100000 steps with 0 reset in 365 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 (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 8 factoid took 547 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[true, p1, (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2401 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 20 cols
[2023-03-10 00:21:43] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-10 00:21:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 00:21:44] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 00:21:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 00:21:44] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 00:21:44] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 00:21:44] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 38915 steps, including 0 resets, run visited all 1 properties in 126 ms. (steps per millisecond=308 )
Parikh walk visited 1 properties in 126 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 556 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, p1, (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 184 ms :[true, p1, (NOT p0), (NOT p0), (AND p1 (NOT p0))]
[2023-03-10 00:21:45] [INFO ] Invariant cache hit.
[2023-03-10 00:21:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 00:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:21:45] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-10 00:21:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:21:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 00:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:21:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-10 00:21:45] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 00:21:45] [INFO ] Added : 15 causal constraints over 3 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 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 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-10 00:21:45] [INFO ] Invariant cache hit.
[2023-03-10 00:21:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 00:21:45] [INFO ] Invariant cache hit.
[2023-03-10 00:21:45] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-10 00:21:45] [INFO ] Invariant cache hit.
[2023-03-10 00:21:45] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. 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 : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 8 factoid took 452 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[true, p1, (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=3001 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 00:21:46] [INFO ] Invariant cache hit.
[2023-03-10 00:21:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 00:21:46] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 00:21:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 00:21:46] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 00:21:46] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-10 00:21:46] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 38884 steps, including 0 resets, run visited all 1 properties in 68 ms. (steps per millisecond=571 )
Parikh walk visited 1 properties in 73 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 761 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, p1, (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 216 ms :[true, p1, (NOT p0), (NOT p0), (AND p1 (NOT p0))]
[2023-03-10 00:21:47] [INFO ] Invariant cache hit.
[2023-03-10 00:21:47] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 00:21:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:21:47] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-10 00:21:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:21:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 00:21:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:21:47] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-10 00:21:47] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 00:21:47] [INFO ] Added : 15 causal constraints over 3 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 212 ms :[true, p1, (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 261 ms.
Product exploration explored 100000 steps with 0 reset in 360 ms.
Applying partial POR strategy [true, true, false, true, true]
Stuttering acceptance computed with spot in 177 ms :[true, p1, (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Support contains 3 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 0 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 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 15 transition count 13
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 14 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 14 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 24 rules in 6 ms. Remains 14 /20 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2023-03-10 00:21:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 14 cols
[2023-03-10 00:21:48] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-10 00:21:48] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/20 places, 12/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42 ms. Remains : 14/20 places, 12/18 transitions.
Built C files in :
/tmp/ltsmin15923488614750448767
[2023-03-10 00:21:48] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15923488614750448767
Running compilation step : cd /tmp/ltsmin15923488614750448767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 100 ms.
Running link step : cd /tmp/ltsmin15923488614750448767;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin15923488614750448767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15258970554226636675.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 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 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-10 00:22:03] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-10 00:22:03] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-10 00:22:03] [INFO ] Invariant cache hit.
[2023-03-10 00:22:03] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-10 00:22:03] [INFO ] Invariant cache hit.
[2023-03-10 00:22:03] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 20/20 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin4521588192555393961
[2023-03-10 00:22:03] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4521588192555393961
Running compilation step : cd /tmp/ltsmin4521588192555393961;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 105 ms.
Running link step : cd /tmp/ltsmin4521588192555393961;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4521588192555393961;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17380442390509122847.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 00:22:19] [INFO ] Flatten gal took : 9 ms
[2023-03-10 00:22:19] [INFO ] Flatten gal took : 4 ms
[2023-03-10 00:22:19] [INFO ] Time to serialize gal into /tmp/LTL17248110223348593781.gal : 3 ms
[2023-03-10 00:22:19] [INFO ] Time to serialize properties into /tmp/LTL5569784609306236465.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17248110223348593781.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5010444878700551456.hoa' '-atoms' '/tmp/LTL5569784609306236465.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5569784609306236465.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5010444878700551456.hoa
Detected timeout of ITS tools.
[2023-03-10 00:22:34] [INFO ] Flatten gal took : 2 ms
[2023-03-10 00:22:34] [INFO ] Flatten gal took : 1 ms
[2023-03-10 00:22:34] [INFO ] Time to serialize gal into /tmp/LTL16775447265525780064.gal : 1 ms
[2023-03-10 00:22:34] [INFO ] Time to serialize properties into /tmp/LTL10121711209914399567.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16775447265525780064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10121711209914399567.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G("((CR>=1)&&(Si>=1))"))||(F(("(Ci<1)")&&(X(F("(Ci>=1)"))))))))
Formula 0 simplified : X(F!"((CR>=1)&&(Si>=1))" & G(!"(Ci<1)" | XG!"(Ci>=1)"))
Detected timeout of ITS tools.
[2023-03-10 00:22:49] [INFO ] Flatten gal took : 2 ms
[2023-03-10 00:22:49] [INFO ] Applying decomposition
[2023-03-10 00:22:49] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4637521621747276977.txt' '-o' '/tmp/graph4637521621747276977.bin' '-w' '/tmp/graph4637521621747276977.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4637521621747276977.bin' '-l' '-1' '-v' '-w' '/tmp/graph4637521621747276977.weights' '-q' '0' '-e' '0.001'
[2023-03-10 00:22:49] [INFO ] Decomposing Gal with order
[2023-03-10 00:22:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 00:22:49] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-10 00:22:49] [INFO ] Flatten gal took : 3 ms
[2023-03-10 00:22:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-10 00:22:49] [INFO ] Time to serialize gal into /tmp/LTL3483854930835900938.gal : 1 ms
[2023-03-10 00:22:49] [INFO ] Time to serialize properties into /tmp/LTL16787067420398948507.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3483854930835900938.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16787067420398948507.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G("((u5.CR>=1)&&(u4.Si>=1))"))||(F(("(u5.Ci<1)")&&(X(F("(u5.Ci>=1)"))))))))
Formula 0 simplified : X(F!"((u5.CR>=1)&&(u4.Si>=1))" & G(!"(u5.Ci<1)" | XG!"(u5.Ci>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1654373972879080678
[2023-03-10 00:23:04] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1654373972879080678
Running compilation step : cd /tmp/ltsmin1654373972879080678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 119 ms.
Running link step : cd /tmp/ltsmin1654373972879080678;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1654373972879080678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||<>(((LTLAPp1==true)&&X(<>(!(LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0500P0-LTLFireability-10 finished in 97010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U ((G(p0)&&p2) U p3)))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 3 rules applied. Total rules applied 3 place count 21 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 20 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 19 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 6 place count 19 transition count 12
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 14 place count 15 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 14 transition count 11
Applied a total of 16 rules in 3 ms. Remains 14 /23 variables (removed 9) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-10 00:23:19] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 00:23:19] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-10 00:23:19] [INFO ] Invariant cache hit.
[2023-03-10 00:23:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-10 00:23:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 00:23:19] [INFO ] Invariant cache hit.
[2023-03-10 00:23:19] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/23 places, 11/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 14/23 places, 11/18 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p3), true, (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s2 1) (GEQ s11 1)), p0:(LT s7 1), p1:(OR (GEQ s7 1) (AND (GEQ s2 1) (GEQ s11 1))), p2:(AND (GEQ s6 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 4500 reset in 139 ms.
Product exploration explored 100000 steps with 4500 reset in 163 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 p3) p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1))), (X (AND p0 (NOT p1))), (X (AND (NOT p3) p2 p0 (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2 p0 (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1)))))]
Knowledge based reduction with 12 factoid took 867 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p3), true, (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2401 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 00:23:21] [INFO ] Invariant cache hit.
[2023-03-10 00:23:21] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1))), (X (AND p0 (NOT p1))), (X (AND (NOT p3) p2 p0 (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (X (X (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p3) (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2 p0 (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (F (AND (NOT p3) p2 p0 (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (F (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 941 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p3), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p3), (NOT p1)]
[2023-03-10 00:23:22] [INFO ] Invariant cache hit.
[2023-03-10 00:23:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 00:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:23:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-10 00:23:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:23:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 00:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:23:22] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-10 00:23:22] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 00:23:22] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-10 00:23:22] [INFO ] Invariant cache hit.
[2023-03-10 00:23:22] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 00:23:22] [INFO ] Invariant cache hit.
[2023-03-10 00:23:22] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-10 00:23:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 00:23:22] [INFO ] Invariant cache hit.
[2023-03-10 00:23:22] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 14/14 places, 11/11 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 p3) (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT p3)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 281 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p3), (NOT p1)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=3001 ) properties (out of 3) seen :1
Finished Best-First random walk after 128 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT p3)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (F p3), (F p1), (F (NOT (AND (NOT p2) (NOT p1) (NOT p3))))]
Knowledge based reduction with 6 factoid took 339 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p3), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p3), (NOT p1)]
[2023-03-10 00:23:23] [INFO ] Invariant cache hit.
[2023-03-10 00:23:23] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 00:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:23:23] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-10 00:23:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:23:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 00:23:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:23:23] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-10 00:23:23] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 00:23:23] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 97 ms :[(NOT p3), (NOT p1)]
Product exploration explored 100000 steps with 4522 reset in 135 ms.
Product exploration explored 100000 steps with 4515 reset in 179 ms.
Built C files in :
/tmp/ltsmin12911834969977721913
[2023-03-10 00:23:23] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2023-03-10 00:23:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 00:23:23] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2023-03-10 00:23:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 00:23:23] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2023-03-10 00:23:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 00:23:23] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12911834969977721913
Running compilation step : cd /tmp/ltsmin12911834969977721913;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 155 ms.
Running link step : cd /tmp/ltsmin12911834969977721913;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12911834969977721913;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9420055751734323819.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-10 00:23:39] [INFO ] Invariant cache hit.
[2023-03-10 00:23:39] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-10 00:23:39] [INFO ] Invariant cache hit.
[2023-03-10 00:23:39] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-10 00:23:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 00:23:39] [INFO ] Invariant cache hit.
[2023-03-10 00:23:39] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 14/14 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin5234860454129732140
[2023-03-10 00:23:39] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2023-03-10 00:23:39] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 00:23:39] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2023-03-10 00:23:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 00:23:39] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2023-03-10 00:23:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 00:23:39] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5234860454129732140
Running compilation step : cd /tmp/ltsmin5234860454129732140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 106 ms.
Running link step : cd /tmp/ltsmin5234860454129732140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin5234860454129732140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5781928830022758026.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 00:23:54] [INFO ] Flatten gal took : 2 ms
[2023-03-10 00:23:54] [INFO ] Flatten gal took : 1 ms
[2023-03-10 00:23:54] [INFO ] Time to serialize gal into /tmp/LTL5153245042257695045.gal : 5 ms
[2023-03-10 00:23:54] [INFO ] Time to serialize properties into /tmp/LTL96530976695342050.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5153245042257695045.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8994541042816442168.hoa' '-atoms' '/tmp/LTL96530976695342050.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL96530976695342050.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8994541042816442168.hoa
Detected timeout of ITS tools.
[2023-03-10 00:24:09] [INFO ] Flatten gal took : 1 ms
[2023-03-10 00:24:09] [INFO ] Flatten gal took : 1 ms
[2023-03-10 00:24:09] [INFO ] Time to serialize gal into /tmp/LTL5036100871406344141.gal : 0 ms
[2023-03-10 00:24:09] [INFO ] Time to serialize properties into /tmp/LTL13929169725262380588.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5036100871406344141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13929169725262380588.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(MpA<1)")U("((MpA>=1)||((SF>=1)&&(Mi>=1)))"))U((("((CR>=1)&&(Si>=1))")&&(G("(MpA<1)")))U("((SF>=1)&&(Mi>=1))"))))
Formula 0 simplified : (!"(MpA<1)" R !"((MpA>=1)||((SF>=1)&&(Mi>=1)))") R ((!"((CR>=1)&&(Si>=1))" | F!"(MpA<1)") R !"((SF>=1)&&(Mi>=1))")
Detected timeout of ITS tools.
[2023-03-10 00:24:24] [INFO ] Flatten gal took : 2 ms
[2023-03-10 00:24:24] [INFO ] Applying decomposition
[2023-03-10 00:24:24] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15222345441599827749.txt' '-o' '/tmp/graph15222345441599827749.bin' '-w' '/tmp/graph15222345441599827749.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15222345441599827749.bin' '-l' '-1' '-v' '-w' '/tmp/graph15222345441599827749.weights' '-q' '0' '-e' '0.001'
[2023-03-10 00:24:24] [INFO ] Decomposing Gal with order
[2023-03-10 00:24:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 00:24:24] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-10 00:24:24] [INFO ] Flatten gal took : 4 ms
[2023-03-10 00:24:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-10 00:24:24] [INFO ] Time to serialize gal into /tmp/LTL5700390768648545632.gal : 7 ms
[2023-03-10 00:24:24] [INFO ] Time to serialize properties into /tmp/LTL11346233412908950131.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5700390768648545632.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11346233412908950131.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((("(i1.u1.MpA<1)")U("((i1.u1.MpA>=1)||((i2.u2.SF>=1)&&(i0.u5.Mi>=1)))"))U((("((i1.u6.CR>=1)&&(i1.u4.Si>=1))")&&(G("(i1.u1.MpA<1)"))...194
Formula 0 simplified : (!"(i1.u1.MpA<1)" R !"((i1.u1.MpA>=1)||((i2.u2.SF>=1)&&(i0.u5.Mi>=1)))") R ((!"((i1.u6.CR>=1)&&(i1.u4.Si>=1))" | F!"(i1.u1.MpA<1)") ...191
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9915426918582075824
[2023-03-10 00:24:39] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9915426918582075824
Running compilation step : cd /tmp/ltsmin9915426918582075824;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 94 ms.
Running link step : cd /tmp/ltsmin9915426918582075824;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin9915426918582075824;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U (LTLAPp1==true)) U (([]((LTLAPp0==true))&&(LTLAPp2==true)) U (LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0500P0-LTLFireability-12 finished in 95261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 2 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 00:24:54] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 00:24:54] [INFO ] Implicit Places using invariants in 33 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 352 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=4, aps=[p1:(AND (GEQ s8 1) (GEQ s14 1)), p0:(GEQ s6 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, null, null, null, null][false, false, 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-N0500P0-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLFireability-13 finished in 407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X(p1)))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2023-03-10 00:24:55] [INFO ] Invariant cache hit.
[2023-03-10 00:24:55] [INFO ] Implicit Places using invariants in 38 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s9 1), p1:(AND (GEQ s0 1) (GEQ s13 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 827 reset in 145 ms.
Product exploration explored 100000 steps with 837 reset in 198 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 464 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=4001 ) properties (out of 3) seen :0
Finished Best-First random walk after 354 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=177 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 401 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1)]
// Phase 1: matrix 18 rows 20 cols
[2023-03-10 00:24:56] [INFO ] Computed 3 place invariants in 0 ms
Proved EG (NOT p1)
[2023-03-10 00:24:56] [INFO ] Invariant cache hit.
[2023-03-10 00:24:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 00:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:24:56] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-10 00:24:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:24:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 00:24:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:24:57] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-10 00:24:57] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 00:24:57] [INFO ] Added : 12 causal constraints over 3 iterations in 28 ms. Result :sat
Could not prove EG p0
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0500P0-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0500P0-LTLFireability-14 finished in 2329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-10 00:24:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 00:24:57] [INFO ] Implicit Places using invariants in 44 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 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 LTL mode , in 2 iterations and 50 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s17 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 76 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLFireability-15 finished in 223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&X(G((G(F(p0))||p1))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0500P0-LTLFireability-04
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 18 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 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 10 place count 17 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 14 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 12 transition count 9
Applied a total of 20 rules in 11 ms. Remains 12 /23 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-10 00:24:58] [INFO ] Computed 4 place invariants in 9 ms
[2023-03-10 00:24:58] [INFO ] Implicit Places using invariants in 45 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 11/23 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 62 ms. Remains : 11/23 places, 9/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s7 1)), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 522 reset in 188 ms.
Product exploration explored 100000 steps with 486 reset in 219 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 652 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2503 ) properties (out of 6) seen :3
Finished Best-First random walk after 85 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 851 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 9 rows 11 cols
[2023-03-10 00:25:00] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-10 00:25:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 00:25:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:25:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 00:25:00] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 00:25:00] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-10 00:25:00] [INFO ] Invariant cache hit.
[2023-03-10 00:25:00] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 00:25:00] [INFO ] Invariant cache hit.
[2023-03-10 00:25:00] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-10 00:25:00] [INFO ] Invariant cache hit.
[2023-03-10 00:25:00] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 11/11 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 610 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3337 ) properties (out of 6) seen :3
Finished Best-First random walk after 97 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=97 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 644 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2023-03-10 00:25:02] [INFO ] Invariant cache hit.
[2023-03-10 00:25:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 00:25:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:25:02] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-10 00:25:02] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-10 00:25:02] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 401 reset in 109 ms.
Product exploration explored 100000 steps with 254 reset in 153 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-10 00:25:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 00:25:03] [INFO ] Invariant cache hit.
[2023-03-10 00:25:03] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29 ms. Remains : 11/11 places, 9/9 transitions.
Built C files in :
/tmp/ltsmin1667518393088439240
[2023-03-10 00:25:03] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1667518393088439240
Running compilation step : cd /tmp/ltsmin1667518393088439240;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 86 ms.
Running link step : cd /tmp/ltsmin1667518393088439240;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin1667518393088439240;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18058917436031567629.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-10 00:25:18] [INFO ] Invariant cache hit.
[2023-03-10 00:25:18] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 00:25:18] [INFO ] Invariant cache hit.
[2023-03-10 00:25:18] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-10 00:25:18] [INFO ] Invariant cache hit.
[2023-03-10 00:25:18] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 11/11 places, 9/9 transitions.
Built C files in :
/tmp/ltsmin18129108634550397708
[2023-03-10 00:25:18] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18129108634550397708
Running compilation step : cd /tmp/ltsmin18129108634550397708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 83 ms.
Running link step : cd /tmp/ltsmin18129108634550397708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin18129108634550397708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7659099762792544972.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 00:25:34] [INFO ] Flatten gal took : 2 ms
[2023-03-10 00:25:34] [INFO ] Flatten gal took : 1 ms
[2023-03-10 00:25:34] [INFO ] Time to serialize gal into /tmp/LTL9938727757817718666.gal : 1 ms
[2023-03-10 00:25:34] [INFO ] Time to serialize properties into /tmp/LTL8466771625075505644.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9938727757817718666.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6113408779083301851.hoa' '-atoms' '/tmp/LTL8466771625075505644.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8466771625075505644.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6113408779083301851.hoa
Detected timeout of ITS tools.
[2023-03-10 00:25:49] [INFO ] Flatten gal took : 1 ms
[2023-03-10 00:25:49] [INFO ] Flatten gal took : 1 ms
[2023-03-10 00:25:49] [INFO ] Time to serialize gal into /tmp/LTL12204370361304866477.gal : 0 ms
[2023-03-10 00:25:49] [INFO ] Time to serialize properties into /tmp/LTL1192871315811276879.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12204370361304866477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1192871315811276879.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X("((SR>=1)&&(Mi>=1))"))&&(X(G((G(F("((SR>=1)&&(Mi>=1))")))||("(SpA>=1)")))))))
Formula 0 simplified : XG(!"((SR>=1)&&(Mi>=1))" | F(!"(SpA>=1)" & FG!"((SR>=1)&&(Mi>=1))"))
Detected timeout of ITS tools.
[2023-03-10 00:26:04] [INFO ] Flatten gal took : 1 ms
[2023-03-10 00:26:04] [INFO ] Applying decomposition
[2023-03-10 00:26:04] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12052352340363341001.txt' '-o' '/tmp/graph12052352340363341001.bin' '-w' '/tmp/graph12052352340363341001.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12052352340363341001.bin' '-l' '-1' '-v' '-w' '/tmp/graph12052352340363341001.weights' '-q' '0' '-e' '0.001'
[2023-03-10 00:26:04] [INFO ] Decomposing Gal with order
[2023-03-10 00:26:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 00:26:04] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-10 00:26:04] [INFO ] Flatten gal took : 2 ms
[2023-03-10 00:26:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-10 00:26:04] [INFO ] Time to serialize gal into /tmp/LTL1505192222795973307.gal : 1 ms
[2023-03-10 00:26:04] [INFO ] Time to serialize properties into /tmp/LTL3685460918666940428.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1505192222795973307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3685460918666940428.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((X("((u3.SR>=1)&&(u2.Mi>=1))"))&&(X(G((G(F("((u3.SR>=1)&&(u2.Mi>=1))")))||("(u0.SpA>=1)")))))))
Formula 0 simplified : XG(!"((u3.SR>=1)&&(u2.Mi>=1))" | F(!"(u0.SpA>=1)" & FG!"((u3.SR>=1)&&(u2.Mi>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12702502001136470491
[2023-03-10 00:26:19] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12702502001136470491
Running compilation step : cd /tmp/ltsmin12702502001136470491;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 87 ms.
Running link step : cd /tmp/ltsmin12702502001136470491;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin12702502001136470491;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&X([](([](<>((LTLAPp0==true)))||(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0500P0-LTLFireability-04 finished in 96738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((p1&&X(F(!p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U ((G(p0)&&p2) U p3)))'
[2023-03-10 00:26:34] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1452153112309515659
[2023-03-10 00:26:34] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2023-03-10 00:26:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 00:26:34] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2023-03-10 00:26:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 00:26:34] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2023-03-10 00:26:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 00:26:34] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1452153112309515659
Running compilation step : cd /tmp/ltsmin1452153112309515659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-10 00:26:34] [INFO ] Applying decomposition
[2023-03-10 00:26:34] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph78924846636649801.txt' '-o' '/tmp/graph78924846636649801.bin' '-w' '/tmp/graph78924846636649801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph78924846636649801.bin' '-l' '-1' '-v' '-w' '/tmp/graph78924846636649801.weights' '-q' '0' '-e' '0.001'
[2023-03-10 00:26:34] [INFO ] Decomposing Gal with order
[2023-03-10 00:26:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 00:26:34] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-10 00:26:34] [INFO ] Flatten gal took : 5 ms
[2023-03-10 00:26:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-10 00:26:34] [INFO ] Time to serialize gal into /tmp/LTLFireability12275464704439367317.gal : 1 ms
[2023-03-10 00:26:34] [INFO ] Time to serialize properties into /tmp/LTLFireability13261460694704424413.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12275464704439367317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13261460694704424413.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((F((X("((i2.u5.SR>=1)&&(i2.u3.Mi>=1))"))&&(X(G((G(F("((i2.u5.SR>=1)&&(i2.u3.Mi>=1))")))||("(i1.u0.SpA>=1)")))))))
Formula 0 simplified : XG(!"((i2.u5.SR>=1)&&(i2.u3.Mi>=1))" | F(!"(i1.u0.SpA>=1)" & FG!"((i2.u5.SR>=1)&&(i2.u3.Mi>=1))"))
Compilation finished in 178 ms.
Running link step : cd /tmp/ltsmin1452153112309515659;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin1452153112309515659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&X([](([](<>((LTLAPp0==true)))||(LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: LTL layer: formula: <>((X((LTLAPp0==true))&&X([](([](<>((LTLAPp0==true)))||(LTLAPp1==true))))))
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: "<>((X((LTLAPp0==true))&&X([](([](<>((LTLAPp0==true)))||(LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.061: DFS-FIFO for weak LTL, using special progress label 27
pins2lts-mc-linux64( 0/ 8), 0.061: There are 28 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.061: State length is 24, there are 30 groups
pins2lts-mc-linux64( 0/ 8), 0.061: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.061: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.061: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.061: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.102: ~96 levels ~960 states ~2936 transitions
pins2lts-mc-linux64( 6/ 8), 0.142: ~187 levels ~1920 states ~5976 transitions
pins2lts-mc-linux64( 2/ 8), 0.228: ~367 levels ~3840 states ~12072 transitions
pins2lts-mc-linux64( 2/ 8), 0.379: ~722 levels ~7680 states ~24368 transitions
pins2lts-mc-linux64( 2/ 8), 0.663: ~1443 levels ~15360 states ~49208 transitions
pins2lts-mc-linux64( 6/ 8), 0.934: ~2984 levels ~30720 states ~88976 transitions
pins2lts-mc-linux64( 2/ 8), 1.152: ~4974 levels ~61440 states ~167312 transitions
pins2lts-mc-linux64( 6/ 8), 1.477: ~5000 levels ~122880 states ~367392 transitions
pins2lts-mc-linux64( 6/ 8), 2.143: ~5000 levels ~245760 states ~756224 transitions
pins2lts-mc-linux64( 6/ 8), 3.177: ~5000 levels ~491520 states ~1531176 transitions
pins2lts-mc-linux64( 6/ 8), 4.691: ~5000 levels ~983040 states ~3074480 transitions
pins2lts-mc-linux64( 7/ 8), 6.576: ~4998 levels ~1966080 states ~6180400 transitions
pins2lts-mc-linux64( 6/ 8), 9.644: ~5000 levels ~3932160 states ~12349112 transitions
pins2lts-mc-linux64( 6/ 8), 15.668: ~5000 levels ~7864320 states ~24731952 transitions
pins2lts-mc-linux64( 3/ 8), 27.944: ~4998 levels ~15728640 states ~49506320 transitions
pins2lts-mc-linux64( 2/ 8), 51.649: ~4997 levels ~31457280 states ~93519584 transitions
pins2lts-mc-linux64( 7/ 8), 72.529: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 72.592:
pins2lts-mc-linux64( 0/ 8), 72.592: mean standard work distribution: 7.9% (states) 2.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 72.592:
pins2lts-mc-linux64( 0/ 8), 72.592: Explored 42480640 states 114710748 transitions, fanout: 2.700
pins2lts-mc-linux64( 0/ 8), 72.592: Total exploration time 72.510 sec (72.450 sec minimum, 72.485 sec on average)
pins2lts-mc-linux64( 0/ 8), 72.592: States per second: 585859, Transitions per second: 1581999
pins2lts-mc-linux64( 0/ 8), 72.592:
pins2lts-mc-linux64( 0/ 8), 72.592: Progress states detected: 10103301
pins2lts-mc-linux64( 0/ 8), 72.592: Redundant explorations: 35.8957
pins2lts-mc-linux64( 0/ 8), 72.592:
pins2lts-mc-linux64( 0/ 8), 72.592: Queue width: 8B, total height: 21034994, memory: 160.48MB
pins2lts-mc-linux64( 0/ 8), 72.592: Tree memory: 494.5MB, 16.6 B/state, compr.: 16.9%
pins2lts-mc-linux64( 0/ 8), 72.592: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 72.593: Stored 20 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 72.593: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 72.593: Est. total memory use: 655.0MB (~1184.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1452153112309515659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&X([](([](<>((LTLAPp0==true)))||(LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1452153112309515659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&X([](([](<>((LTLAPp0==true)))||(LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-10 00:48:51] [INFO ] Flatten gal took : 3 ms
[2023-03-10 00:48:51] [INFO ] Time to serialize gal into /tmp/LTLFireability11531870452735838289.gal : 1 ms
[2023-03-10 00:48:51] [INFO ] Time to serialize properties into /tmp/LTLFireability2862256377265250689.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11531870452735838289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2862256377265250689.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((F((X("((SR>=1)&&(Mi>=1))"))&&(X(G((G(F("((SR>=1)&&(Mi>=1))")))||("(SpA>=1)")))))))
Formula 0 simplified : XG(!"((SR>=1)&&(Mi>=1))" | F(!"(SpA>=1)" & FG!"((SR>=1)&&(Mi>=1))"))
Detected timeout of ITS tools.
[2023-03-10 01:11:09] [INFO ] Flatten gal took : 2 ms
[2023-03-10 01:11:09] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-10 01:11:09] [INFO ] Transformed 23 places.
[2023-03-10 01:11:09] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2023-03-10 01:11:09] [INFO ] Time to serialize gal into /tmp/LTLFireability5255567097704290174.gal : 0 ms
[2023-03-10 01:11:09] [INFO ] Time to serialize properties into /tmp/LTLFireability18123259342574973117.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5255567097704290174.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18123259342574973117.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((X("((SR>=1)&&(Mi>=1))"))&&(X(G((G(F("((SR>=1)&&(Mi>=1))")))||("(SpA>=1)")))))))
Formula 0 simplified : XG(!"((SR>=1)&&(Mi>=1))" | F(!"(SpA>=1)" & FG!"((SR>=1)&&(Mi>=1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 12303308 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16033800 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-N0500P0"
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-5348"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N0500P0, 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 r069-smll-167814396300332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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