fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r069-smll-167814396200268
Last Updated
May 14, 2023

About the Execution of ITS-Tools for ClientsAndServers-PT-N0020P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4629.535 3600000.00 10430773.00 4095.30 FFFTFFFFTFFF?FFF normal

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-167814396200268.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-N0020P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-167814396200268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.7K Feb 26 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:20 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:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 13:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 13:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 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-N0020P0-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678348801452

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-N0020P0
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 08:00:04] [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-09 08:00:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:00:04] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-09 08:00:04] [INFO ] Transformed 25 places.
[2023-03-09 08:00:04] [INFO ] Transformed 18 transitions.
[2023-03-09 08:00:04] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 17 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-09 08:00:04] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-09 08:00:04] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-09 08:00:04] [INFO ] Invariant cache hit.
[2023-03-09 08:00:05] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-09 08:00:05] [INFO ] Invariant cache hit.
[2023-03-09 08:00:05] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 381 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 24 out of 25 places after structural reductions.
[2023-03-09 08:00:05] [INFO ] Flatten gal took : 25 ms
[2023-03-09 08:00:05] [INFO ] Flatten gal took : 8 ms
[2023-03-09 08:00:05] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 9954 steps, including 7 resets, run visited all 18 properties in 86 ms. (steps per millisecond=115 )
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(X((X(((X(p0) U X(X(p1)))&&!F(p2))) U p3))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 08:00:06] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 08:00:06] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-09 08:00:06] [INFO ] Invariant cache hit.
[2023-03-09 08:00:06] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-09 08:00:06] [INFO ] Invariant cache hit.
[2023-03-09 08:00:06] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 785 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (NOT p3) (NOT p1) p2), true, p2, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={0} source=3 dest: 5}, { cond=(NOT p2), acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}, { cond=p0, acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p3:(AND (GEQ s11 1) (GEQ s17 1)), p2:(AND (GEQ s3 1) (GEQ s14 1)), p0:(GEQ s6 1), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-00 finished in 1015 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)&&F(p1)&&F(G(p2)))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 17 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 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 2 with 4 rules applied. Total rules applied 16 place count 15 transition count 12
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 24 place count 11 transition count 8
Applied a total of 24 rules in 20 ms. Remains 11 /25 variables (removed 14) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-09 08:00:07] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 08:00:07] [INFO ] Implicit Places using invariants in 45 ms returned [8, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/25 places, 8/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2023-03-09 08:00:07] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 08:00:07] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 08:00:07] [INFO ] Invariant cache hit.
[2023-03-09 08:00:07] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 137 ms. Remains : 8/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s5 1), p1:(OR (LT s0 1) (LT s6 1)), p2:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 7456 steps with 0 reset in 63 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-01 finished in 404 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 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 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 10 rules applied. Total rules applied 10 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 16 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 16 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 20 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 26 place count 10 transition count 7
Applied a total of 26 rules in 3 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-09 08:00:07] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 08:00:07] [INFO ] Implicit Places using invariants in 53 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/25 places, 7/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-09 08:00:07] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 08:00:07] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 08:00:07] [INFO ] Invariant cache hit.
[2023-03-09 08:00:07] [INFO ] Implicit Places using invariants and state equation in 25 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 : 6/25 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 130 ms. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 54 ms :[p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 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 1 reset in 226 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-02 finished in 431 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(F((G(p0)||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 08:00:07] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:00:08] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-09 08:00:08] [INFO ] Invariant cache hit.
[2023-03-09 08:00:08] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-09 08:00:08] [INFO ] Invariant cache hit.
[2023-03-09 08:00:08] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 p2 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s7 1) (GEQ s20 1)), p2:(AND (GEQ s2 1) (GEQ s14 1)), p1:(GEQ s9 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 269 ms.
Product exploration explored 100000 steps with 33333 reset in 228 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 p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p2) (NOT p1))
Knowledge based reduction with 17 factoid took 522 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-03 finished in 1378 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(((p1 U p2)&&p0))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 17 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 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 2 with 4 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 12 transition count 9
Applied a total of 22 rules in 3 ms. Remains 12 /25 variables (removed 13) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-09 08:00:09] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 08:00:09] [INFO ] Implicit Places using invariants in 30 ms returned [7, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 9/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 7
Applied a total of 4 rules in 2 ms. Remains 8 /10 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 8 cols
[2023-03-09 08:00:09] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 08:00:09] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-09 08:00:09] [INFO ] Invariant cache hit.
[2023-03-09 08:00:09] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 8/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(GEQ s2 1), p0:(AND (GEQ s7 1) (GEQ s6 1)), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1207 reset in 173 ms.
Stack based approach found an accepted trace after 152 steps with 0 reset with depth 153 and stack size 153 in 0 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-04 finished in 377 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 ((!p0&&G(!p1)) U (G((!p0&&G(!p1)))||(!p0&&G(!p1)&&X(F(p2))))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 08:00:09] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 08:00:09] [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/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR p0 p1), true, (OR p1 p0), (OR (NOT p2) p1), (OR p1 (AND p0 (NOT p2))), p1]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(GEQ s6 1), p1:(AND (GEQ s5 1) (GEQ s14 1)), p2:(LT s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 34 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-05 finished in 283 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)&&X((G(p1)&&X(X(G(!p0)))))))'
Support contains 4 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 2 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 08:00:09] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:00:10] [INFO ] Implicit Places using invariants in 56 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 265 ms :[true, true, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true, true]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 4}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(OR p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s19 1)), p1:(AND (GEQ s1 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-06 finished in 344 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(F(p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 08:00:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:00:10] [INFO ] Implicit Places using invariants in 84 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s18 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][false, false]]
Product exploration explored 100000 steps with 1109 reset in 116 ms.
Product exploration explored 100000 steps with 1117 reset in 117 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)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 3192 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=638 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 127 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 08:00:11] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 08:00:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 08:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:00:11] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-09 08:00:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 08:00:11] [INFO ] Added : 15 causal constraints over 3 iterations in 54 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 9
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 12 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 18 place count 12 transition count 6
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 9 transition count 6
Applied a total of 24 rules in 4 ms. Remains 9 /21 variables (removed 12) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-09 08:00:11] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 08:00:11] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 08:00:11] [INFO ] Invariant cache hit.
[2023-03-09 08:00:11] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-09 08:00:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 08:00:11] [INFO ] Invariant cache hit.
[2023-03-09 08:00:11] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/21 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 9/21 places, 6/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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 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 35 ms :[(NOT p0)]
Finished random walk after 287 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=143 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 129 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 36 ms :[(NOT p0)]
[2023-03-09 08:00:11] [INFO ] Invariant cache hit.
[2023-03-09 08:00:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 08:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:00:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-09 08:00:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:00:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-09 08:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:00:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-09 08:00:11] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 08:00:11] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7469 reset in 89 ms.
Product exploration explored 100000 steps with 7380 reset in 96 ms.
Built C files in :
/tmp/ltsmin5906439688854651070
[2023-03-09 08:00:12] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2023-03-09 08:00:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:00:12] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2023-03-09 08:00:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:00:12] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2023-03-09 08:00:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:00:12] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5906439688854651070
Running compilation step : cd /tmp/ltsmin5906439688854651070;'/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 363 ms.
Running link step : cd /tmp/ltsmin5906439688854651070;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin5906439688854651070;'/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/stateBased1414164284204535524.hoa' '--buchi-type=spotba'
LTSmin run took 1205 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-07 finished in 3518 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(F(!p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 08:00:13] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 08:00:13] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-09 08:00:13] [INFO ] Invariant cache hit.
[2023-03-09 08:00:13] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-09 08:00:13] [INFO ] Invariant cache hit.
[2023-03-09 08:00:13] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Product exploration explored 100000 steps with 50000 reset in 72 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)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-08 finished in 400 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 U p1)&&G(p0))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 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 6 rules applied. Total rules applied 6 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 10 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 12 place count 17 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 17 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 14 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 12 transition count 9
Applied a total of 22 rules in 6 ms. Remains 12 /25 variables (removed 13) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-09 08:00:14] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 08:00:14] [INFO ] Implicit Places using invariants in 42 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 9/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 6
Applied a total of 6 rules in 2 ms. Remains 7 /10 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-09 08:00:14] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 08:00:14] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-09 08:00:14] [INFO ] Invariant cache hit.
[2023-03-09 08:00:14] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 114 ms. Remains : 7/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s5 1)), p1:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 202 reset in 84 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 0 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-10 finished in 393 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)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 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 10 rules applied. Total rules applied 10 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 16 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 16 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 20 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 28 place count 9 transition count 6
Applied a total of 28 rules in 6 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-09 08:00:14] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 08:00:14] [INFO ] Implicit Places using invariants in 30 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/25 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-09 08:00:14] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 08:00:14] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 08:00:14] [INFO ] Invariant cache hit.
[2023-03-09 08:00:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87 ms. Remains : 5/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 94 ms :[p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12625 reset in 56 ms.
Product exploration explored 100000 steps with 12284 reset in 99 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[p0, p0]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 284 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[p0, p0]
Stuttering acceptance computed with spot in 92 ms :[p0, p0]
[2023-03-09 08:00:15] [INFO ] Invariant cache hit.
[2023-03-09 08:00:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:00:15] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-09 08:00:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:00:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:00:15] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-09 08:00:15] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 08:00:15] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG 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-09 08:00:15] [INFO ] Invariant cache hit.
[2023-03-09 08:00:15] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 08:00:15] [INFO ] Invariant cache hit.
[2023-03-09 08:00:15] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-09 08:00:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 08:00:15] [INFO ] Invariant cache hit.
[2023-03-09 08:00:15] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[p0, p0]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[p0, p0]
Stuttering acceptance computed with spot in 95 ms :[p0, p0]
[2023-03-09 08:00:16] [INFO ] Invariant cache hit.
[2023-03-09 08:00:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:00:16] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-09 08:00:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:00:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:00:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:00:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-09 08:00:16] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-09 08:00:16] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 94 ms :[p0, p0]
Product exploration explored 100000 steps with 13206 reset in 50 ms.
Product exploration explored 100000 steps with 13135 reset in 166 ms.
Built C files in :
/tmp/ltsmin11580538626090829301
[2023-03-09 08:00:16] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2023-03-09 08:00:16] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:00:16] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2023-03-09 08:00:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:00:16] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2023-03-09 08:00:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:00:16] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11580538626090829301
Running compilation step : cd /tmp/ltsmin11580538626090829301;'/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 88 ms.
Running link step : cd /tmp/ltsmin11580538626090829301;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11580538626090829301;'/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/stateBased6119783988808558251.hoa' '--buchi-type=spotba'
LTSmin run took 281 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-11 finished in 2722 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(F((F(p1)&&(p0||X(p1)))))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 08:00:17] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 08:00:17] [INFO ] Implicit Places using invariants in 31 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(GEQ s9 1), p1:(GEQ s10 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 1734 reset in 90 ms.
Product exploration explored 100000 steps with 1713 reset in 175 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 (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 403 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 613 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=306 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 312 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 08:00:19] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-09 08:00:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 08:00:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:00:19] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-09 08:00:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:00:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 08:00:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:00:19] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-09 08:00:19] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 08:00:19] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 08:00:19] [INFO ] Invariant cache hit.
[2023-03-09 08:00:19] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 08:00:19] [INFO ] Invariant cache hit.
[2023-03-09 08:00:19] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-09 08:00:19] [INFO ] Invariant cache hit.
[2023-03-09 08:00:19] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 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 : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1636 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=545 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-09 08:00:19] [INFO ] Invariant cache hit.
[2023-03-09 08:00:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 08:00:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:00:19] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-09 08:00:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:00:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 08:00:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:00:19] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-09 08:00:19] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 08:00:19] [INFO ] Added : 11 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1684 reset in 88 ms.
Product exploration explored 100000 steps with 1728 reset in 103 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 16 transition count 14
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 21 place count 16 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 23 rules in 8 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2023-03-09 08:00:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2023-03-09 08:00:20] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-09 08:00:20] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/20 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50 ms. Remains : 15/20 places, 13/18 transitions.
Built C files in :
/tmp/ltsmin17085505968021982280
[2023-03-09 08:00:20] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17085505968021982280
Running compilation step : cd /tmp/ltsmin17085505968021982280;'/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 151 ms.
Running link step : cd /tmp/ltsmin17085505968021982280;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17085505968021982280;'/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/stateBased5699179697377027432.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 08:00:35] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 08:00:35] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-09 08:00:35] [INFO ] Invariant cache hit.
[2023-03-09 08:00:35] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-09 08:00:35] [INFO ] Invariant cache hit.
[2023-03-09 08:00:35] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 20/20 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin17609342204216649240
[2023-03-09 08:00:35] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17609342204216649240
Running compilation step : cd /tmp/ltsmin17609342204216649240;'/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 101 ms.
Running link step : cd /tmp/ltsmin17609342204216649240;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17609342204216649240;'/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/stateBased6427800690336206145.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 08:00:51] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:00:51] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:00:51] [INFO ] Time to serialize gal into /tmp/LTL12791931112181049045.gal : 2 ms
[2023-03-09 08:00:51] [INFO ] Time to serialize properties into /tmp/LTL13183712173811214510.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/LTL12791931112181049045.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3309367838480310720.hoa' '-atoms' '/tmp/LTL13183712173811214510.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...319
Loading property file /tmp/LTL13183712173811214510.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3309367838480310720.hoa
Detected timeout of ITS tools.
[2023-03-09 08:01:06] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:01:06] [INFO ] Flatten gal took : 2 ms
[2023-03-09 08:01:06] [INFO ] Time to serialize gal into /tmp/LTL9190802181667540834.gal : 1 ms
[2023-03-09 08:01:06] [INFO ] Time to serialize properties into /tmp/LTL16920141026517401572.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/LTL9190802181667540834.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16920141026517401572.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 : !(((G("(MpA>=1)"))||(X(F((F("(MtF>=1)"))&&(("(MpA>=1)")||(X("(MtF>=1)"))))))))
Formula 0 simplified : F!"(MpA>=1)" & XG(G!"(MtF>=1)" | (!"(MpA>=1)" & X!"(MtF>=1)"))
Detected timeout of ITS tools.
[2023-03-09 08:01:21] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:01:21] [INFO ] Applying decomposition
[2023-03-09 08:01:21] [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/graph8862543631906644264.txt' '-o' '/tmp/graph8862543631906644264.bin' '-w' '/tmp/graph8862543631906644264.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8862543631906644264.bin' '-l' '-1' '-v' '-w' '/tmp/graph8862543631906644264.weights' '-q' '0' '-e' '0.001'
[2023-03-09 08:01:21] [INFO ] Decomposing Gal with order
[2023-03-09 08:01:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 08:01:21] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-09 08:01:21] [INFO ] Flatten gal took : 38 ms
[2023-03-09 08:01:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-09 08:01:21] [INFO ] Time to serialize gal into /tmp/LTL9047008856814922432.gal : 2 ms
[2023-03-09 08:01:21] [INFO ] Time to serialize properties into /tmp/LTL16115052429035017604.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/LTL9047008856814922432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16115052429035017604.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 : !(((G("(u0.MpA>=1)"))||(X(F((F("(u1.MtF>=1)"))&&(("(u0.MpA>=1)")||(X("(u1.MtF>=1)"))))))))
Formula 0 simplified : F!"(u0.MpA>=1)" & XG(G!"(u1.MtF>=1)" | (!"(u0.MpA>=1)" & X!"(u1.MtF>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13741964282219275728
[2023-03-09 08:01:36] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13741964282219275728
Running compilation step : cd /tmp/ltsmin13741964282219275728;'/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/ltsmin13741964282219275728;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13741964282219275728;'/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))||X(<>((<>((LTLAPp1==true))&&((LTLAPp0==true)||X((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-12 finished in 94136 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((G(p1)||p0))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 08:01:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 08:01:51] [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/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s17 1), p0:(OR (GEQ s17 1) (AND (GEQ s8 1) (GEQ s14 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-14 finished in 191 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)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 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 11 rules applied. Total rules applied 11 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 18 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 18 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 20 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 26 place count 10 transition count 7
Applied a total of 26 rules in 5 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-09 08:01:51] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 08:01:51] [INFO ] Implicit Places using invariants in 30 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/25 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-09 08:01:51] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 08:01:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 08:01:51] [INFO ] Invariant cache hit.
[2023-03-09 08:01:51] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/25 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89 ms. Remains : 7/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8 reset in 96 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-15 finished in 273 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(F((F(p1)&&(p0||X(p1)))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P0-LTLFireability-12
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 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 10 rules applied. Total rules applied 10 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 16 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 16 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 20 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 26 place count 10 transition count 7
Applied a total of 26 rules in 4 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-09 08:01:52] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 08:01:52] [INFO ] Implicit Places using invariants in 38 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 8/25 places, 7/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 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 6
Applied a total of 2 rules in 0 ms. Remains 7 /8 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-09 08:01:52] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 08:01:52] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-09 08:01:52] [INFO ] Invariant cache hit.
[2023-03-09 08:01:52] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 7/25 places, 6/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 96 ms. Remains : 7/25 places, 6/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(GEQ s3 1), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 10238 reset in 66 ms.
Product exploration explored 100000 steps with 10212 reset in 137 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 (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 305 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 316 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-09 08:01:53] [INFO ] Invariant cache hit.
[2023-03-09 08:01:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:53] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-09 08:01:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:01:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:01:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:53] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-09 08:01:53] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 08:01:53] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-09 08:01:53] [INFO ] Invariant cache hit.
[2023-03-09 08:01:53] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 08:01:53] [INFO ] Invariant cache hit.
[2023-03-09 08:01:53] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-09 08:01:53] [INFO ] Invariant cache hit.
[2023-03-09 08:01:53] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 7/7 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=124 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-09 08:01:54] [INFO ] Invariant cache hit.
[2023-03-09 08:01:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:54] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-09 08:01:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:01:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:01:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:54] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-09 08:01:54] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 08:01:54] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 10288 reset in 104 ms.
Product exploration explored 100000 steps with 10140 reset in 144 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-09 08:01:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2023-03-09 08:01:55] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 08:01:55] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/7 places, 6/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36 ms. Remains : 7/7 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin6061826970387329915
[2023-03-09 08:01:55] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6061826970387329915
Running compilation step : cd /tmp/ltsmin6061826970387329915;'/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 131 ms.
Running link step : cd /tmp/ltsmin6061826970387329915;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6061826970387329915;'/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/stateBased8190518467563899153.hoa' '--buchi-type=spotba'
LTSmin run took 4052 ms.
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-12 finished in 7674 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-09 08:01:59] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3936119542044623990
[2023-03-09 08:01:59] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2023-03-09 08:01:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:01:59] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2023-03-09 08:01:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:01:59] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2023-03-09 08:01:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:01:59] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3936119542044623990
Running compilation step : cd /tmp/ltsmin3936119542044623990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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-09 08:01:59] [INFO ] Applying decomposition
[2023-03-09 08:01:59] [INFO ] Flatten gal took : 3 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/graph9935124951482025431.txt' '-o' '/tmp/graph9935124951482025431.bin' '-w' '/tmp/graph9935124951482025431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9935124951482025431.bin' '-l' '-1' '-v' '-w' '/tmp/graph9935124951482025431.weights' '-q' '0' '-e' '0.001'
[2023-03-09 08:01:59] [INFO ] Decomposing Gal with order
[2023-03-09 08:01:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 08:01:59] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-09 08:01:59] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:01:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-09 08:01:59] [INFO ] Time to serialize gal into /tmp/LTLFireability12047098861639369011.gal : 1 ms
[2023-03-09 08:01:59] [INFO ] Time to serialize properties into /tmp/LTLFireability1360647803939641135.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/LTLFireability12047098861639369011.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1360647803939641135.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...277
Read 1 LTL properties
Checking formula 0 : !(((G("(i1.u3.MpA>=1)"))||(X(F((F("(i1.u4.MtF>=1)"))&&(("(i1.u3.MpA>=1)")||(X("(i1.u4.MtF>=1)"))))))))
Formula 0 simplified : F!"(i1.u3.MpA>=1)" & XG(G!"(i1.u4.MtF>=1)" | (!"(i1.u3.MpA>=1)" & X!"(i1.u4.MtF>=1)"))
Compilation finished in 116 ms.
Running link step : cd /tmp/ltsmin3936119542044623990;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3936119542044623990;'/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))||X(<>((<>((LTLAPp1==true))&&((LTLAPp0==true)||X((LTLAPp1==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 08:22:37] [INFO ] Flatten gal took : 9 ms
[2023-03-09 08:22:37] [INFO ] Time to serialize gal into /tmp/LTLFireability9318577414893035938.gal : 8 ms
[2023-03-09 08:22:37] [INFO ] Time to serialize properties into /tmp/LTLFireability994942567146511495.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/LTLFireability9318577414893035938.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability994942567146511495.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...296
Read 1 LTL properties
Checking formula 0 : !(((G("(MpA>=1)"))||(X(F((F("(MtF>=1)"))&&(("(MpA>=1)")||(X("(MtF>=1)"))))))))
Formula 0 simplified : F!"(MpA>=1)" & XG(G!"(MtF>=1)" | (!"(MpA>=1)" & X!"(MtF>=1)"))
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( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: LTL layer: formula: ([]((LTLAPp0==true))||X(<>((<>((LTLAPp1==true))&&((LTLAPp0==true)||X((LTLAPp1==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: "([]((LTLAPp0==true))||X(<>((<>((LTLAPp1==true))&&((LTLAPp0==true)||X((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.054: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.054: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.054: State length is 26, there are 27 groups
pins2lts-mc-linux64( 0/ 8), 0.054: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.054: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.054: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.054: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.242: ~114 levels ~960 states ~6960 transitions
pins2lts-mc-linux64( 0/ 8), 0.428: ~222 levels ~1920 states ~15096 transitions
pins2lts-mc-linux64( 0/ 8), 0.716: ~437 levels ~3840 states ~31080 transitions
pins2lts-mc-linux64( 0/ 8), 1.056: ~855 levels ~7680 states ~55328 transitions
pins2lts-mc-linux64( 0/ 8), 1.153: ~962 levels ~15360 states ~68528 transitions
pins2lts-mc-linux64( 0/ 8), 1.321: ~962 levels ~30720 states ~95016 transitions
pins2lts-mc-linux64( 0/ 8), 1.585: ~962 levels ~61440 states ~158080 transitions
pins2lts-mc-linux64( 0/ 8), 2.064: ~962 levels ~122880 states ~295200 transitions
pins2lts-mc-linux64( 0/ 8), 2.979: ~962 levels ~245760 states ~569568 transitions
pins2lts-mc-linux64( 0/ 8), 4.594: ~962 levels ~491520 states ~1122272 transitions
pins2lts-mc-linux64( 0/ 8), 7.817: ~962 levels ~983040 states ~2246240 transitions
pins2lts-mc-linux64( 0/ 8), 12.293: ~962 levels ~1966080 states ~4523736 transitions
pins2lts-mc-linux64( 0/ 8), 18.196: ~962 levels ~3932160 states ~9872872 transitions
pins2lts-mc-linux64( 0/ 8), 25.661: ~963 levels ~7864320 states ~20707664 transitions
pins2lts-mc-linux64( 0/ 8), 37.317: ~963 levels ~15728640 states ~42611488 transitions
pins2lts-mc-linux64( 0/ 8), 59.434: ~963 levels ~31457280 states ~88428456 transitions
pins2lts-mc-linux64( 0/ 8), 107.082: ~964 levels ~62914560 states ~186715680 transitions
pins2lts-mc-linux64( 0/ 8), 203.329: ~964 levels ~125829120 states ~387524440 transitions
pins2lts-mc-linux64( 0/ 8), 407.964: ~965 levels ~251658240 states ~824888224 transitions
pins2lts-mc-linux64( 0/ 8), 846.379: ~965 levels ~503316480 states ~1752886248 transitions
pins2lts-mc-linux64( 0/ 8), 1807.366: ~966 levels ~1006632960 states ~3570974808 transitions
pins2lts-mc-linux64( 0/ 8), 2217.480: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2217.493:
pins2lts-mc-linux64( 0/ 8), 2217.493: mean standard work distribution: 264.6% (states) 264.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 2217.493:
pins2lts-mc-linux64( 0/ 8), 2217.493: Explored 134211073 states 476931083 transitions, fanout: 3.554
pins2lts-mc-linux64( 0/ 8), 2217.493: Total exploration time 2217.430 sec (2217.400 sec minimum, 2217.414 sec on average)
pins2lts-mc-linux64( 0/ 8), 2217.493: States per second: 60526, Transitions per second: 215083
pins2lts-mc-linux64( 0/ 8), 2217.493:
pins2lts-mc-linux64( 0/ 8), 2217.493: Progress states detected: 1
pins2lts-mc-linux64( 0/ 8), 2217.493: Redundant explorations: -0.0046
pins2lts-mc-linux64( 0/ 8), 2217.493:
pins2lts-mc-linux64( 0/ 8), 2217.493: Queue width: 8B, total height: 975, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 2217.493: Tree memory: 1219.9MB, 9.5 B/state, compr.: 9.0%
pins2lts-mc-linux64( 0/ 8), 2217.493: Tree fill ratio (roots/leafs): 99.0%/76.0%
pins2lts-mc-linux64( 0/ 8), 2217.493: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2217.493: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2217.493: Est. total memory use: 1219.9MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3936119542044623990;'/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))||X(<>((<>((LTLAPp1==true))&&((LTLAPp0==true)||X((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3936119542044623990;'/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))||X(<>((<>((LTLAPp1==true))&&((LTLAPp0==true)||X((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-09 08:43:16] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:43:16] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-09 08:43:16] [INFO ] Transformed 25 places.
[2023-03-09 08:43:16] [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-09 08:43:16] [INFO ] Time to serialize gal into /tmp/LTLFireability1336042904229936820.gal : 1 ms
[2023-03-09 08:43:16] [INFO ] Time to serialize properties into /tmp/LTLFireability8064853754711471868.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/LTLFireability1336042904229936820.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8064853754711471868.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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("(MpA>=1)"))||(X(F((F("(MtF>=1)"))&&(("(MpA>=1)")||(X("(MtF>=1)"))))))))
Formula 0 simplified : F!"(MpA>=1)" & XG(G!"(MtF>=1)" | (!"(MpA>=1)" & X!"(MtF>=1)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11560772 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16036904 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-N0020P0"
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-N0020P0, 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-167814396200268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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